./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.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_ee42c9b6-2e5c-4a4f-9f98-05f93f3f558b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ee42c9b6-2e5c-4a4f-9f98-05f93f3f558b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ee42c9b6-2e5c-4a4f-9f98-05f93f3f558b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ee42c9b6-2e5c-4a4f-9f98-05f93f3f558b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ee42c9b6-2e5c-4a4f-9f98-05f93f3f558b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ee42c9b6-2e5c-4a4f-9f98-05f93f3f558b/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 d98587a14b872cd91c7aef8f28f1f51cdacaf3d4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:55:50,796 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:55:50,798 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:55:50,812 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:55:50,812 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:55:50,813 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:55:50,815 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:55:50,823 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:55:50,827 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:55:50,832 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:55:50,833 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:55:50,834 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:55:50,834 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:55:50,836 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:55:50,837 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:55:50,838 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:55:50,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:55:50,840 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:55:50,842 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:55:50,846 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:55:50,850 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:55:50,853 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:55:50,855 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:55:50,855 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:55:50,859 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:55:50,859 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:55:50,859 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:55:50,861 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:55:50,861 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:55:50,862 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:55:50,862 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:55:50,863 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:55:50,863 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:55:50,865 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:55:50,865 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:55:50,866 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:55:50,866 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:55:50,866 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:55:50,866 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:55:50,867 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:55:50,868 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:55:50,869 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ee42c9b6-2e5c-4a4f-9f98-05f93f3f558b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:55:50,892 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:55:50,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:55:50,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:55:50,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:55:50,893 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:55:50,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:55:50,894 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:55:50,894 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:55:50,894 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:55:50,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:55:50,894 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:55:50,894 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:55:50,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:55:50,895 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:55:50,895 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:55:50,895 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:55:50,895 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:55:50,895 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:55:50,895 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:55:50,895 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:55:50,895 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:55:50,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:55:50,896 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:55:50,896 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:55:50,896 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:55:50,896 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:55:50,896 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:55:50,896 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:55:50,896 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_ee42c9b6-2e5c-4a4f-9f98-05f93f3f558b/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 -> d98587a14b872cd91c7aef8f28f1f51cdacaf3d4 [2019-11-25 08:55:51,050 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:55:51,063 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:55:51,066 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:55:51,067 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:55:51,067 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:55:51,069 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ee42c9b6-2e5c-4a4f-9f98-05f93f3f558b/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2019-11-25 08:55:51,119 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ee42c9b6-2e5c-4a4f-9f98-05f93f3f558b/bin/uautomizer/data/5cd262436/f086a9ba06bc49d89c13159ef262ad36/FLAG7b5000862 [2019-11-25 08:55:51,542 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:55:51,543 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ee42c9b6-2e5c-4a4f-9f98-05f93f3f558b/sv-benchmarks/c/recursive-simple/fibo_2calls_6-2.c [2019-11-25 08:55:51,549 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ee42c9b6-2e5c-4a4f-9f98-05f93f3f558b/bin/uautomizer/data/5cd262436/f086a9ba06bc49d89c13159ef262ad36/FLAG7b5000862 [2019-11-25 08:55:51,563 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ee42c9b6-2e5c-4a4f-9f98-05f93f3f558b/bin/uautomizer/data/5cd262436/f086a9ba06bc49d89c13159ef262ad36 [2019-11-25 08:55:51,566 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:55:51,567 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:55:51,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:55:51,570 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:55:51,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:55:51,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:55:51" (1/1) ... [2019-11-25 08:55:51,581 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@562a43b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:51, skipping insertion in model container [2019-11-25 08:55:51,581 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:55:51" (1/1) ... [2019-11-25 08:55:51,588 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:55:51,605 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:55:51,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:55:51,809 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:55:51,881 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:55:51,894 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:55:51,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:51 WrapperNode [2019-11-25 08:55:51,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:55:51,895 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:55:51,895 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:55:51,895 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:55:51,903 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:55:51" (1/1) ... [2019-11-25 08:55:51,907 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:55:51" (1/1) ... [2019-11-25 08:55:51,922 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:55:51,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:55:51,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:55:51,922 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:55:51,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:51" (1/1) ... [2019-11-25 08:55:51,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:51" (1/1) ... [2019-11-25 08:55:51,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:51" (1/1) ... [2019-11-25 08:55:51,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:51" (1/1) ... [2019-11-25 08:55:51,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:51" (1/1) ... [2019-11-25 08:55:51,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:51" (1/1) ... [2019-11-25 08:55:51,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:51" (1/1) ... [2019-11-25 08:55:51,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:55:51,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:55:51,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:55:51,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:55:51,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee42c9b6-2e5c-4a4f-9f98-05f93f3f558b/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:55:51,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:55:51,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:55:51,998 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-11-25 08:55:51,998 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-11-25 08:55:51,999 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-11-25 08:55:51,999 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-11-25 08:55:52,188 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:55:52,189 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-25 08:55:52,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:55:52 BoogieIcfgContainer [2019-11-25 08:55:52,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:55:52,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:55:52,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:55:52,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:55:52,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:55:51" (1/3) ... [2019-11-25 08:55:52,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4bcdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:55:52, skipping insertion in model container [2019-11-25 08:55:52,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:55:51" (2/3) ... [2019-11-25 08:55:52,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a4bcdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:55:52, skipping insertion in model container [2019-11-25 08:55:52,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:55:52" (3/3) ... [2019-11-25 08:55:52,196 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_6-2.c [2019-11-25 08:55:52,204 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:55:52,209 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:55:52,225 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:55:52,245 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:55:52,245 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:55:52,245 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:55:52,245 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:55:52,246 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:55:52,246 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:55:52,246 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:55:52,246 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:55:52,271 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-25 08:55:52,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-25 08:55:52,278 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:52,279 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:52,280 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:52,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:52,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2019-11-25 08:55:52,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:52,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49608462] [2019-11-25 08:55:52,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:52,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:52,487 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:55:52,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49608462] [2019-11-25 08:55:52,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:52,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:55:52,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116565571] [2019-11-25 08:55:52,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:55:52,493 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:52,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:55:52,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:55:52,504 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 7 states. [2019-11-25 08:55:52,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:52,627 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-11-25 08:55:52,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:55:52,629 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-25 08:55:52,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:52,637 INFO L225 Difference]: With dead ends: 38 [2019-11-25 08:55:52,638 INFO L226 Difference]: Without dead ends: 26 [2019-11-25 08:55:52,640 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:55:52,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-25 08:55:52,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-25 08:55:52,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-25 08:55:52,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-25 08:55:52,675 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2019-11-25 08:55:52,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:52,676 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-25 08:55:52,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:55:52,676 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-25 08:55:52,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-25 08:55:52,677 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:52,677 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:52,677 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:52,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:52,678 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2019-11-25 08:55:52,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:52,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535305263] [2019-11-25 08:55:52,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:52,775 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:55:52,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535305263] [2019-11-25 08:55:52,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:55:52,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-25 08:55:52,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833390061] [2019-11-25 08:55:52,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-25 08:55:52,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:52,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-25 08:55:52,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-25 08:55:52,778 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 7 states. [2019-11-25 08:55:52,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:52,854 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-11-25 08:55:52,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:55:52,855 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-11-25 08:55:52,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:52,856 INFO L225 Difference]: With dead ends: 32 [2019-11-25 08:55:52,856 INFO L226 Difference]: Without dead ends: 28 [2019-11-25 08:55:52,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-25 08:55:52,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-25 08:55:52,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-25 08:55:52,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-25 08:55:52,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-25 08:55:52,864 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2019-11-25 08:55:52,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:52,865 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-25 08:55:52,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-25 08:55:52,865 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-25 08:55:52,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-25 08:55:52,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:52,866 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:52,866 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:52,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:52,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2019-11-25 08:55:52,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:52,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217182825] [2019-11-25 08:55:52,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:52,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:52,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:53,057 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 08:55:53,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217182825] [2019-11-25 08:55:53,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [277996069] [2019-11-25 08:55:53,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee42c9b6-2e5c-4a4f-9f98-05f93f3f558b/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:55:53,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:53,122 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:55:53,128 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:53,204 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 08:55:53,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:55:53,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-11-25 08:55:53,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867624406] [2019-11-25 08:55:53,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 08:55:53,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:53,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 08:55:53,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:55:53,212 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 12 states. [2019-11-25 08:55:53,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:53,395 INFO L93 Difference]: Finished difference Result 59 states and 83 transitions. [2019-11-25 08:55:53,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-25 08:55:53,396 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-11-25 08:55:53,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:53,397 INFO L225 Difference]: With dead ends: 59 [2019-11-25 08:55:53,397 INFO L226 Difference]: Without dead ends: 35 [2019-11-25 08:55:53,398 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:55:53,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-25 08:55:53,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-11-25 08:55:53,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-25 08:55:53,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-11-25 08:55:53,406 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 22 [2019-11-25 08:55:53,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:53,406 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-11-25 08:55:53,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 08:55:53,407 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2019-11-25 08:55:53,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 08:55:53,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:53,409 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:53,609 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:53,610 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:53,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:53,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2019-11-25 08:55:53,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:53,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389665444] [2019-11-25 08:55:53,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:53,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:53,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:53,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:53,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:53,742 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 08:55:53,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389665444] [2019-11-25 08:55:53,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305151435] [2019-11-25 08:55:53,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee42c9b6-2e5c-4a4f-9f98-05f93f3f558b/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:55:53,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:53,784 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-25 08:55:53,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:53,827 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-25 08:55:53,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:55:53,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-11-25 08:55:53,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065383870] [2019-11-25 08:55:53,829 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-25 08:55:53,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:53,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-25 08:55:53,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-25 08:55:53,829 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 12 states. [2019-11-25 08:55:54,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:54,064 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2019-11-25 08:55:54,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-25 08:55:54,066 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-11-25 08:55:54,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:54,069 INFO L225 Difference]: With dead ends: 55 [2019-11-25 08:55:54,069 INFO L226 Difference]: Without dead ends: 51 [2019-11-25 08:55:54,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-11-25 08:55:54,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-25 08:55:54,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-11-25 08:55:54,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-25 08:55:54,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2019-11-25 08:55:54,090 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 23 [2019-11-25 08:55:54,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:54,090 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2019-11-25 08:55:54,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-25 08:55:54,091 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2019-11-25 08:55:54,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-25 08:55:54,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:54,102 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:54,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:54,305 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:54,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:54,306 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2019-11-25 08:55:54,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:54,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222408129] [2019-11-25 08:55:54,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:54,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:54,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:54,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:54,500 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-25 08:55:54,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222408129] [2019-11-25 08:55:54,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1030032519] [2019-11-25 08:55:54,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee42c9b6-2e5c-4a4f-9f98-05f93f3f558b/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:55:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:54,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:55:54,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:54,627 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-11-25 08:55:54,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:55:54,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2019-11-25 08:55:54,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862441644] [2019-11-25 08:55:54,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-25 08:55:54,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:54,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-25 08:55:54,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:55:54,629 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand 14 states. [2019-11-25 08:55:55,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:55,063 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2019-11-25 08:55:55,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-25 08:55:55,063 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2019-11-25 08:55:55,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:55,068 INFO L225 Difference]: With dead ends: 114 [2019-11-25 08:55:55,068 INFO L226 Difference]: Without dead ends: 68 [2019-11-25 08:55:55,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=380, Unknown=0, NotChecked=0, Total=462 [2019-11-25 08:55:55,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-25 08:55:55,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-25 08:55:55,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-25 08:55:55,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2019-11-25 08:55:55,084 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 35 [2019-11-25 08:55:55,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:55,085 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2019-11-25 08:55:55,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-25 08:55:55,085 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2019-11-25 08:55:55,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-25 08:55:55,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:55,087 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:55,292 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:55,293 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:55,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:55,293 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2019-11-25 08:55:55,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:55,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986831772] [2019-11-25 08:55:55,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:55,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:55,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:55,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:55,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:55,424 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-11-25 08:55:55,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986831772] [2019-11-25 08:55:55,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966941947] [2019-11-25 08:55:55,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee42c9b6-2e5c-4a4f-9f98-05f93f3f558b/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:55:55,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:55,476 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-25 08:55:55,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:55,552 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-25 08:55:55,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:55:55,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-11-25 08:55:55,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800069574] [2019-11-25 08:55:55,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-25 08:55:55,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:55,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-25 08:55:55,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-25 08:55:55,554 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand 14 states. [2019-11-25 08:55:55,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:55,861 INFO L93 Difference]: Finished difference Result 147 states and 239 transitions. [2019-11-25 08:55:55,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-25 08:55:55,861 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-11-25 08:55:55,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:55,863 INFO L225 Difference]: With dead ends: 147 [2019-11-25 08:55:55,863 INFO L226 Difference]: Without dead ends: 83 [2019-11-25 08:55:55,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2019-11-25 08:55:55,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-25 08:55:55,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2019-11-25 08:55:55,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-25 08:55:55,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 96 transitions. [2019-11-25 08:55:55,893 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 96 transitions. Word has length 36 [2019-11-25 08:55:55,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:55,893 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 96 transitions. [2019-11-25 08:55:55,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-25 08:55:55,893 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 96 transitions. [2019-11-25 08:55:55,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-25 08:55:55,898 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:55,898 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:56,101 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:56,101 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:56,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:56,102 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2019-11-25 08:55:56,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:56,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877024066] [2019-11-25 08:55:56,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:56,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:56,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:56,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:56,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:56,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:56,294 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-25 08:55:56,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877024066] [2019-11-25 08:55:56,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [331472874] [2019-11-25 08:55:56,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee42c9b6-2e5c-4a4f-9f98-05f93f3f558b/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:55:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:56,330 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:55:56,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:56,419 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 4 proven. 23 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-25 08:55:56,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:55:56,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 18 [2019-11-25 08:55:56,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809049550] [2019-11-25 08:55:56,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-25 08:55:56,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:56,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-25 08:55:56,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-11-25 08:55:56,421 INFO L87 Difference]: Start difference. First operand 66 states and 96 transitions. Second operand 18 states. [2019-11-25 08:55:56,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:56,885 INFO L93 Difference]: Finished difference Result 164 states and 279 transitions. [2019-11-25 08:55:56,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-25 08:55:56,886 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2019-11-25 08:55:56,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:56,888 INFO L225 Difference]: With dead ends: 164 [2019-11-25 08:55:56,888 INFO L226 Difference]: Without dead ends: 100 [2019-11-25 08:55:56,890 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-11-25 08:55:56,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-25 08:55:56,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2019-11-25 08:55:56,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-25 08:55:56,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 145 transitions. [2019-11-25 08:55:56,906 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 145 transitions. Word has length 50 [2019-11-25 08:55:56,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:56,906 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 145 transitions. [2019-11-25 08:55:56,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-25 08:55:56,906 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 145 transitions. [2019-11-25 08:55:56,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-25 08:55:56,909 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:56,909 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:57,115 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:57,115 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:57,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:57,115 INFO L82 PathProgramCache]: Analyzing trace with hash -1917551255, now seen corresponding path program 1 times [2019-11-25 08:55:57,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:57,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437645286] [2019-11-25 08:55:57,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:57,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:57,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:57,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:57,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:57,431 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 33 proven. 58 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-11-25 08:55:57,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437645286] [2019-11-25 08:55:57,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2082106980] [2019-11-25 08:55:57,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee42c9b6-2e5c-4a4f-9f98-05f93f3f558b/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:57,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:57,485 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 08:55:57,488 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:57,592 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 13 proven. 90 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-25 08:55:57,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:55:57,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 20 [2019-11-25 08:55:57,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721828833] [2019-11-25 08:55:57,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-25 08:55:57,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:57,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-25 08:55:57,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2019-11-25 08:55:57,594 INFO L87 Difference]: Start difference. First operand 89 states and 145 transitions. Second operand 20 states. [2019-11-25 08:55:58,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:58,179 INFO L93 Difference]: Finished difference Result 207 states and 388 transitions. [2019-11-25 08:55:58,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-25 08:55:58,180 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 91 [2019-11-25 08:55:58,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:58,182 INFO L225 Difference]: With dead ends: 207 [2019-11-25 08:55:58,182 INFO L226 Difference]: Without dead ends: 114 [2019-11-25 08:55:58,184 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2019-11-25 08:55:58,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-25 08:55:58,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 88. [2019-11-25 08:55:58,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-25 08:55:58,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 135 transitions. [2019-11-25 08:55:58,199 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 135 transitions. Word has length 91 [2019-11-25 08:55:58,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:58,200 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 135 transitions. [2019-11-25 08:55:58,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-25 08:55:58,200 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 135 transitions. [2019-11-25 08:55:58,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-25 08:55:58,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:58,204 INFO L410 BasicCegarLoop]: trace histogram [10, 10, 7, 7, 7, 7, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:58,414 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:58,415 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:58,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:58,415 INFO L82 PathProgramCache]: Analyzing trace with hash -463941571, now seen corresponding path program 1 times [2019-11-25 08:55:58,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:58,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108554463] [2019-11-25 08:55:58,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:58,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:58,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:58,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:58,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:58,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:58,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:58,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:58,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:58,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:58,797 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 53 proven. 117 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2019-11-25 08:55:58,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108554463] [2019-11-25 08:55:58,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1151557280] [2019-11-25 08:55:58,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee42c9b6-2e5c-4a4f-9f98-05f93f3f558b/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:58,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:55:58,868 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:55:59,031 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 48 proven. 89 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2019-11-25 08:55:59,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:55:59,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 9] total 20 [2019-11-25 08:55:59,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170297931] [2019-11-25 08:55:59,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-25 08:55:59,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:55:59,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-25 08:55:59,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-11-25 08:55:59,037 INFO L87 Difference]: Start difference. First operand 88 states and 135 transitions. Second operand 20 states. [2019-11-25 08:55:59,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:55:59,506 INFO L93 Difference]: Finished difference Result 209 states and 348 transitions. [2019-11-25 08:55:59,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-25 08:55:59,507 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 119 [2019-11-25 08:55:59,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:55:59,509 INFO L225 Difference]: With dead ends: 209 [2019-11-25 08:55:59,509 INFO L226 Difference]: Without dead ends: 121 [2019-11-25 08:55:59,510 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=121, Invalid=635, Unknown=0, NotChecked=0, Total=756 [2019-11-25 08:55:59,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2019-11-25 08:55:59,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 111. [2019-11-25 08:55:59,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-25 08:55:59,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 175 transitions. [2019-11-25 08:55:59,523 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 175 transitions. Word has length 119 [2019-11-25 08:55:59,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:55:59,524 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 175 transitions. [2019-11-25 08:55:59,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-25 08:55:59,524 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 175 transitions. [2019-11-25 08:55:59,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-25 08:55:59,527 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:55:59,527 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 11, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-25 08:55:59,730 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:55:59,733 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:55:59,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:55:59,733 INFO L82 PathProgramCache]: Analyzing trace with hash 332281067, now seen corresponding path program 2 times [2019-11-25 08:55:59,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:55:59,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715049748] [2019-11-25 08:55:59,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:55:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:55:59,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:00,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:00,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:00,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:00,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:00,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:00,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:00,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:00,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:00,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:00,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:00,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:00,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:00,379 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 311 proven. 245 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2019-11-25 08:56:00,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715049748] [2019-11-25 08:56:00,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106817072] [2019-11-25 08:56:00,380 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee42c9b6-2e5c-4a4f-9f98-05f93f3f558b/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:00,467 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:56:00,467 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:56:00,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:56:00,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:00,668 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 89 proven. 154 refuted. 0 times theorem prover too weak. 698 trivial. 0 not checked. [2019-11-25 08:56:00,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:56:00,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 9] total 29 [2019-11-25 08:56:00,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090619990] [2019-11-25 08:56:00,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-11-25 08:56:00,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:00,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-11-25 08:56:00,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=715, Unknown=0, NotChecked=0, Total=812 [2019-11-25 08:56:00,670 INFO L87 Difference]: Start difference. First operand 111 states and 175 transitions. Second operand 29 states. [2019-11-25 08:56:01,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:01,513 INFO L93 Difference]: Finished difference Result 233 states and 404 transitions. [2019-11-25 08:56:01,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-25 08:56:01,514 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 188 [2019-11-25 08:56:01,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:01,516 INFO L225 Difference]: With dead ends: 233 [2019-11-25 08:56:01,516 INFO L226 Difference]: Without dead ends: 113 [2019-11-25 08:56:01,519 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 403 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=247, Invalid=1733, Unknown=0, NotChecked=0, Total=1980 [2019-11-25 08:56:01,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-11-25 08:56:01,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 97. [2019-11-25 08:56:01,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-11-25 08:56:01,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 131 transitions. [2019-11-25 08:56:01,534 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 131 transitions. Word has length 188 [2019-11-25 08:56:01,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:01,535 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 131 transitions. [2019-11-25 08:56:01,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-11-25 08:56:01,535 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 131 transitions. [2019-11-25 08:56:01,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-25 08:56:01,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:01,538 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 14, 14, 13, 12, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 6, 4, 4, 2, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:01,738 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:01,739 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:01,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:01,739 INFO L82 PathProgramCache]: Analyzing trace with hash 245292255, now seen corresponding path program 3 times [2019-11-25 08:56:01,739 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:01,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785030536] [2019-11-25 08:56:01,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:01,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:01,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:01,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:02,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 210 proven. 368 refuted. 0 times theorem prover too weak. 670 trivial. 0 not checked. [2019-11-25 08:56:02,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785030536] [2019-11-25 08:56:02,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909686641] [2019-11-25 08:56:02,460 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee42c9b6-2e5c-4a4f-9f98-05f93f3f558b/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:02,556 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-11-25 08:56:02,556 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:56:02,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-25 08:56:02,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:02,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 294 proven. 58 refuted. 0 times theorem prover too weak. 896 trivial. 0 not checked. [2019-11-25 08:56:02,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:56:02,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 10] total 32 [2019-11-25 08:56:02,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8334292] [2019-11-25 08:56:02,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-11-25 08:56:02,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:02,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-11-25 08:56:02,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=868, Unknown=0, NotChecked=0, Total=992 [2019-11-25 08:56:02,775 INFO L87 Difference]: Start difference. First operand 97 states and 131 transitions. Second operand 32 states. [2019-11-25 08:56:04,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:04,061 INFO L93 Difference]: Finished difference Result 266 states and 449 transitions. [2019-11-25 08:56:04,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-25 08:56:04,062 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 214 [2019-11-25 08:56:04,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:04,065 INFO L225 Difference]: With dead ends: 266 [2019-11-25 08:56:04,065 INFO L226 Difference]: Without dead ends: 165 [2019-11-25 08:56:04,069 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 716 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=362, Invalid=2394, Unknown=0, NotChecked=0, Total=2756 [2019-11-25 08:56:04,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-25 08:56:04,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 134. [2019-11-25 08:56:04,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-25 08:56:04,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 191 transitions. [2019-11-25 08:56:04,097 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 191 transitions. Word has length 214 [2019-11-25 08:56:04,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:04,099 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 191 transitions. [2019-11-25 08:56:04,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-11-25 08:56:04,099 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 191 transitions. [2019-11-25 08:56:04,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-25 08:56:04,102 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:04,102 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 8, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:04,306 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:04,306 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:04,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:04,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1745059098, now seen corresponding path program 4 times [2019-11-25 08:56:04,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:04,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174327800] [2019-11-25 08:56:04,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:04,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:04,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:04,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:04,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:04,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:04,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:04,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:04,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:04,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:04,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:04,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:04,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:04,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:04,751 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 145 proven. 138 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2019-11-25 08:56:04,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174327800] [2019-11-25 08:56:04,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879774081] [2019-11-25 08:56:04,752 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee42c9b6-2e5c-4a4f-9f98-05f93f3f558b/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:04,813 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-25 08:56:04,813 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:56:04,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-25 08:56:04,817 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:04,886 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 141 proven. 34 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2019-11-25 08:56:04,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:56:04,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 9] total 25 [2019-11-25 08:56:04,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472838841] [2019-11-25 08:56:04,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-25 08:56:04,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:04,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-25 08:56:04,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2019-11-25 08:56:04,888 INFO L87 Difference]: Start difference. First operand 134 states and 191 transitions. Second operand 25 states. [2019-11-25 08:56:05,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:05,393 INFO L93 Difference]: Finished difference Result 285 states and 429 transitions. [2019-11-25 08:56:05,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-25 08:56:05,399 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 146 [2019-11-25 08:56:05,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:05,401 INFO L225 Difference]: With dead ends: 285 [2019-11-25 08:56:05,401 INFO L226 Difference]: Without dead ends: 164 [2019-11-25 08:56:05,403 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 199 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=848, Unknown=0, NotChecked=0, Total=992 [2019-11-25 08:56:05,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-25 08:56:05,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 145. [2019-11-25 08:56:05,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-11-25 08:56:05,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 201 transitions. [2019-11-25 08:56:05,418 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 201 transitions. Word has length 146 [2019-11-25 08:56:05,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:05,418 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 201 transitions. [2019-11-25 08:56:05,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-25 08:56:05,419 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 201 transitions. [2019-11-25 08:56:05,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-11-25 08:56:05,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:05,422 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 10, 10, 10, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:05,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:05,629 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:05,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:05,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1338982035, now seen corresponding path program 5 times [2019-11-25 08:56:05,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:05,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549184036] [2019-11-25 08:56:05,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:05,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:05,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:05,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:05,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:05,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:05,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:05,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:05,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:05,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:05,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:05,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:05,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:05,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:05,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:06,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:06,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:06,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:56:06,080 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 202 proven. 153 refuted. 0 times theorem prover too weak. 318 trivial. 0 not checked. [2019-11-25 08:56:06,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549184036] [2019-11-25 08:56:06,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128912466] [2019-11-25 08:56:06,081 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ee42c9b6-2e5c-4a4f-9f98-05f93f3f558b/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:06,149 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2019-11-25 08:56:06,149 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:56:06,150 INFO L255 TraceCheckSpWp]: Trace formula consists of 358 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-25 08:56:06,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:56:06,278 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 135 proven. 196 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-11-25 08:56:06,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:56:06,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 14] total 28 [2019-11-25 08:56:06,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722925389] [2019-11-25 08:56:06,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-25 08:56:06,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:56:06,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-25 08:56:06,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2019-11-25 08:56:06,280 INFO L87 Difference]: Start difference. First operand 145 states and 201 transitions. Second operand 28 states. [2019-11-25 08:56:06,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:56:06,828 INFO L93 Difference]: Finished difference Result 286 states and 417 transitions. [2019-11-25 08:56:06,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-25 08:56:06,828 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 160 [2019-11-25 08:56:06,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:56:06,830 INFO L225 Difference]: With dead ends: 286 [2019-11-25 08:56:06,830 INFO L226 Difference]: Without dead ends: 151 [2019-11-25 08:56:06,832 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=1059, Unknown=0, NotChecked=0, Total=1260 [2019-11-25 08:56:06,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-25 08:56:06,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 143. [2019-11-25 08:56:06,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-25 08:56:06,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 196 transitions. [2019-11-25 08:56:06,842 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 196 transitions. Word has length 160 [2019-11-25 08:56:06,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:56:06,843 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 196 transitions. [2019-11-25 08:56:06,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-25 08:56:06,843 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 196 transitions. [2019-11-25 08:56:06,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-11-25 08:56:06,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:56:06,845 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1] [2019-11-25 08:56:07,057 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:56:07,058 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:56:07,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:56:07,058 INFO L82 PathProgramCache]: Analyzing trace with hash 1112792143, now seen corresponding path program 6 times [2019-11-25 08:56:07,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:56:07,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478358226] [2019-11-25 08:56:07,059 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:56:07,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:07,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:56:07,111 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:56:07,112 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:56:07,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:56:07 BoogieIcfgContainer [2019-11-25 08:56:07,181 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:56:07,181 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:56:07,181 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:56:07,182 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:56:07,182 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:55:52" (3/4) ... [2019-11-25 08:56:07,184 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-25 08:56:07,279 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ee42c9b6-2e5c-4a4f-9f98-05f93f3f558b/bin/uautomizer/witness.graphml [2019-11-25 08:56:07,279 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:56:07,281 INFO L168 Benchmark]: Toolchain (without parser) took 15713.41 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 385.9 MB). Free memory was 944.7 MB in the beginning and 966.6 MB in the end (delta: -21.8 MB). Peak memory consumption was 364.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:07,281 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:56:07,282 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -209.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:07,282 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:56:07,283 INFO L168 Benchmark]: Boogie Preprocessor took 15.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:07,283 INFO L168 Benchmark]: RCFGBuilder took 252.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:07,283 INFO L168 Benchmark]: TraceAbstraction took 14990.26 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 226.5 MB). Free memory was 1.1 GB in the beginning and 970.2 MB in the end (delta: 157.1 MB). Peak memory consumption was 383.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:07,284 INFO L168 Benchmark]: Witness Printer took 97.93 ms. Allocated memory is still 1.4 GB. Free memory was 970.2 MB in the beginning and 966.6 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:56:07,285 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 159.4 MB). Free memory was 944.7 MB in the beginning and 1.2 GB in the end (delta: -209.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 26.79 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 252.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 23.3 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14990.26 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 226.5 MB). Free memory was 1.1 GB in the beginning and 970.2 MB in the end (delta: 157.1 MB). Peak memory consumption was 383.6 MB. Max. memory is 11.5 GB. * Witness Printer took 97.93 ms. Allocated memory is still 1.4 GB. Free memory was 970.2 MB in the beginning and 966.6 MB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 6; [L37] CALL, EXPR fibo1(x) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=5] [L18] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L20] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=4, fibo2(n-1)=2, n=4] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=4, fibo2(n-1)=2, fibo2(n-2)=1, n=4] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=5, fibo1(n-1)=3, n=5] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=5, fibo1(n-1)=3, fibo1(n-2)=2, n=5] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=6, fibo2(n-1)=5, n=6] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=6, fibo2(n-1)=5, fibo2(n-2)=3, n=6] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) [L37] int result = fibo1(x); [L38] COND TRUE result == 8 [L39] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Result: UNSAFE, OverallTime: 14.9s, OverallIterations: 14, TraceHistogramMax: 17, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 374 SDtfs, 807 SDslu, 3204 SDs, 0 SdLazy, 5731 SolverSat, 858 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1685 GetRequests, 1376 SyntacticMatches, 0 SemanticMatches, 309 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2065 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=145occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 147 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 2360 NumberOfCodeBlocks, 2244 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 2163 ConstructedInterpolants, 0 QuantifiedInterpolants, 562203 SizeOfPredicates, 54 NumberOfNonLiveVariables, 2164 ConjunctsInSsa, 108 ConjunctsInUnsatCore, 24 InterpolantComputations, 2 PerfectInterpolantSequences, 6301/8076 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...