./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/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 e21c3699338992ddad7e6d15f4351c8cc3315b0b ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-cad4683 [2019-11-15 20:45:50,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:45:50,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:45:50,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:45:50,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:45:50,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:45:50,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:45:50,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:45:50,543 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:45:50,547 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:45:50,549 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:45:50,551 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:45:50,551 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:45:50,553 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:45:50,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:45:50,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:45:50,556 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:45:50,556 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:45:50,559 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:45:50,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:45:50,565 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:45:50,567 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:45:50,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:45:50,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:45:50,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:45:50,575 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:45:50,575 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:45:50,579 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:45:50,579 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:45:50,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:45:50,580 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:45:50,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:45:50,582 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:45:50,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:45:50,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:45:50,584 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:45:50,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:45:50,585 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:45:50,585 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:45:50,586 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:45:50,587 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:45:50,588 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 20:45:50,613 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:45:50,623 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:45:50,624 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:45:50,624 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:45:50,625 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:45:50,625 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:45:50,625 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:45:50,625 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:45:50,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:45:50,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:45:50,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 20:45:50,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 20:45:50,626 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 20:45:50,627 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:45:50,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:45:50,627 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:45:50,628 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 20:45:50,628 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:45:50,629 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:45:50,629 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 20:45:50,629 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 20:45:50,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 20:45:50,630 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:45:50,630 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 20:45:50,630 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 20:45:50,630 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:45:50,631 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 20:45:50,631 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 20:45:50,632 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_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/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 -> e21c3699338992ddad7e6d15f4351c8cc3315b0b [2019-11-15 20:45:50,668 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:45:50,682 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:45:50,687 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:45:50,688 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:45:50,689 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:45:50,690 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2019-11-15 20:45:50,744 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/bin/uautomizer/data/edfaf5901/929a916673334c05940b2cf28c762b73/FLAG2df98b479 [2019-11-15 20:45:51,120 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:45:51,121 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/sv-benchmarks/c/recursive-simple/fibo_2calls_8-2.c [2019-11-15 20:45:51,127 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/bin/uautomizer/data/edfaf5901/929a916673334c05940b2cf28c762b73/FLAG2df98b479 [2019-11-15 20:45:51,140 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/bin/uautomizer/data/edfaf5901/929a916673334c05940b2cf28c762b73 [2019-11-15 20:45:51,143 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:45:51,144 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:45:51,145 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:45:51,146 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:45:51,149 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:45:51,150 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:45:51" (1/1) ... [2019-11-15 20:45:51,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b2bc018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:45:51, skipping insertion in model container [2019-11-15 20:45:51,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:45:51" (1/1) ... [2019-11-15 20:45:51,160 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:45:51,175 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:45:51,446 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:45:51,449 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:45:51,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:45:51,486 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:45:51,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:45:51 WrapperNode [2019-11-15 20:45:51,486 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:45:51,487 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:45:51,487 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:45:51,487 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:45:51,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:45:51" (1/1) ... [2019-11-15 20:45:51,501 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:45:51" (1/1) ... [2019-11-15 20:45:51,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:45:51,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:45:51,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:45:51,520 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:45:51,529 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:45:51" (1/1) ... [2019-11-15 20:45:51,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:45:51" (1/1) ... [2019-11-15 20:45:51,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:45:51" (1/1) ... [2019-11-15 20:45:51,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:45:51" (1/1) ... [2019-11-15 20:45:51,534 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:45:51" (1/1) ... [2019-11-15 20:45:51,537 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:45:51" (1/1) ... [2019-11-15 20:45:51,541 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:45:51" (1/1) ... [2019-11-15 20:45:51,546 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:45:51,547 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:45:51,547 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:45:51,547 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:45:51,548 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:45:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/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-15 20:45:51,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:45:51,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:45:51,613 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-11-15 20:45:51,613 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-11-15 20:45:51,614 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-11-15 20:45:51,614 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-11-15 20:45:51,781 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:45:51,781 INFO L284 CfgBuilder]: Removed 4 assume(true) statements. [2019-11-15 20:45:51,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:45:51 BoogieIcfgContainer [2019-11-15 20:45:51,782 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:45:51,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 20:45:51,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 20:45:51,787 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 20:45:51,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 08:45:51" (1/3) ... [2019-11-15 20:45:51,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b126c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:45:51, skipping insertion in model container [2019-11-15 20:45:51,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:45:51" (2/3) ... [2019-11-15 20:45:51,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b126c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 08:45:51, skipping insertion in model container [2019-11-15 20:45:51,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:45:51" (3/3) ... [2019-11-15 20:45:51,790 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_8-2.c [2019-11-15 20:45:51,799 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 20:45:51,806 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 20:45:51,817 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 20:45:51,855 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 20:45:51,856 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 20:45:51,856 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 20:45:51,856 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:45:51,856 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:45:51,857 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 20:45:51,857 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:45:51,857 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 20:45:51,889 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-11-15 20:45:51,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-15 20:45:51,894 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:51,895 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:51,897 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:51,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:51,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1871295635, now seen corresponding path program 1 times [2019-11-15 20:45:51,922 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:51,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032008343] [2019-11-15 20:45:51,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:51,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:51,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:52,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:52,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:52,206 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-15 20:45:52,207 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032008343] [2019-11-15 20:45:52,208 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:52,208 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:45:52,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543874493] [2019-11-15 20:45:52,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:45:52,212 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:52,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:45:52,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:52,224 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 7 states. [2019-11-15 20:45:52,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:52,370 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2019-11-15 20:45:52,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:45:52,372 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-11-15 20:45:52,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:52,381 INFO L225 Difference]: With dead ends: 38 [2019-11-15 20:45:52,381 INFO L226 Difference]: Without dead ends: 26 [2019-11-15 20:45:52,384 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 20:45:52,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-11-15 20:45:52,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2019-11-15 20:45:52,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 20:45:52,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-15 20:45:52,425 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 9 [2019-11-15 20:45:52,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:52,425 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-15 20:45:52,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:45:52,425 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-15 20:45:52,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-15 20:45:52,427 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:52,427 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:52,427 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:52,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:52,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1404217650, now seen corresponding path program 1 times [2019-11-15 20:45:52,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:52,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688175841] [2019-11-15 20:45:52,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:52,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:52,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:52,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:52,499 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-15 20:45:52,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688175841] [2019-11-15 20:45:52,500 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:45:52,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 20:45:52,500 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201793413] [2019-11-15 20:45:52,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 20:45:52,502 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:52,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 20:45:52,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 20:45:52,503 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 7 states. [2019-11-15 20:45:52,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:52,592 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-11-15 20:45:52,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:45:52,592 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-11-15 20:45:52,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:52,594 INFO L225 Difference]: With dead ends: 32 [2019-11-15 20:45:52,594 INFO L226 Difference]: Without dead ends: 28 [2019-11-15 20:45:52,595 INFO L600 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-15 20:45:52,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-15 20:45:52,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2019-11-15 20:45:52,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 20:45:52,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2019-11-15 20:45:52,602 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 10 [2019-11-15 20:45:52,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:52,602 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2019-11-15 20:45:52,602 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 20:45:52,602 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2019-11-15 20:45:52,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 20:45:52,604 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:52,604 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:52,604 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:52,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:52,605 INFO L82 PathProgramCache]: Analyzing trace with hash -1629927371, now seen corresponding path program 1 times [2019-11-15 20:45:52,605 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:52,605 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978357430] [2019-11-15 20:45:52,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:52,605 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:52,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:52,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:52,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:52,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:52,784 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-15 20:45:52,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978357430] [2019-11-15 20:45:52,785 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296959385] [2019-11-15 20:45:52,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/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-15 20:45:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:52,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:45:52,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:52,925 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-15 20:45:52,927 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:45:52,927 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-11-15 20:45:52,927 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020837802] [2019-11-15 20:45:52,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 20:45:52,930 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:52,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 20:45:52,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:45:52,931 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand 12 states. [2019-11-15 20:45:53,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:53,142 INFO L93 Difference]: Finished difference Result 59 states and 83 transitions. [2019-11-15 20:45:53,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:45:53,143 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-11-15 20:45:53,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:53,144 INFO L225 Difference]: With dead ends: 59 [2019-11-15 20:45:53,145 INFO L226 Difference]: Without dead ends: 35 [2019-11-15 20:45:53,146 INFO L600 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-15 20:45:53,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-11-15 20:45:53,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 33. [2019-11-15 20:45:53,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-15 20:45:53,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2019-11-15 20:45:53,162 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 22 [2019-11-15 20:45:53,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:53,163 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2019-11-15 20:45:53,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 20:45:53,164 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2019-11-15 20:45:53,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 20:45:53,166 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:53,166 INFO L380 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-15 20:45:53,371 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:53,372 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:53,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:53,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1285987244, now seen corresponding path program 1 times [2019-11-15 20:45:53,373 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:53,373 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567540454] [2019-11-15 20:45:53,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:53,374 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:53,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:53,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:53,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:53,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:53,527 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-15 20:45:53,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567540454] [2019-11-15 20:45:53,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1262921586] [2019-11-15 20:45:53,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/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-15 20:45:53,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:53,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:45:53,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:53,609 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-15 20:45:53,609 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:45:53,609 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-11-15 20:45:53,609 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013682247] [2019-11-15 20:45:53,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 20:45:53,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:53,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 20:45:53,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-11-15 20:45:53,611 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand 12 states. [2019-11-15 20:45:53,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:53,868 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2019-11-15 20:45:53,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 20:45:53,868 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 23 [2019-11-15 20:45:53,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:53,871 INFO L225 Difference]: With dead ends: 55 [2019-11-15 20:45:53,871 INFO L226 Difference]: Without dead ends: 51 [2019-11-15 20:45:53,871 INFO L600 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-15 20:45:53,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-15 20:45:53,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-11-15 20:45:53,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-15 20:45:53,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 68 transitions. [2019-11-15 20:45:53,883 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 68 transitions. Word has length 23 [2019-11-15 20:45:53,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:53,884 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 68 transitions. [2019-11-15 20:45:53,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 20:45:53,884 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 68 transitions. [2019-11-15 20:45:53,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 20:45:53,886 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:53,887 INFO L380 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-15 20:45:54,093 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:54,094 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:54,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:54,094 INFO L82 PathProgramCache]: Analyzing trace with hash -649262923, now seen corresponding path program 1 times [2019-11-15 20:45:54,094 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:54,095 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367305510] [2019-11-15 20:45:54,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:54,095 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:54,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:54,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:54,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:54,274 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-15 20:45:54,275 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367305510] [2019-11-15 20:45:54,275 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710840056] [2019-11-15 20:45:54,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/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-15 20:45:54,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:54,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 20:45:54,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:54,397 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-15 20:45:54,397 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:45:54,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 14 [2019-11-15 20:45:54,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760730143] [2019-11-15 20:45:54,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 20:45:54,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:54,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 20:45:54,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:45:54,399 INFO L87 Difference]: Start difference. First operand 48 states and 68 transitions. Second operand 14 states. [2019-11-15 20:45:54,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:54,864 INFO L93 Difference]: Finished difference Result 114 states and 187 transitions. [2019-11-15 20:45:54,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 20:45:54,865 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 35 [2019-11-15 20:45:54,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:54,868 INFO L225 Difference]: With dead ends: 114 [2019-11-15 20:45:54,868 INFO L226 Difference]: Without dead ends: 68 [2019-11-15 20:45:54,870 INFO L600 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-15 20:45:54,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-11-15 20:45:54,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-11-15 20:45:54,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-15 20:45:54,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 98 transitions. [2019-11-15 20:45:54,891 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 98 transitions. Word has length 35 [2019-11-15 20:45:54,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:54,891 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 98 transitions. [2019-11-15 20:45:54,892 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 20:45:54,892 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 98 transitions. [2019-11-15 20:45:54,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-15 20:45:54,894 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:54,895 INFO L380 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-15 20:45:55,095 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:55,103 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:55,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:55,104 INFO L82 PathProgramCache]: Analyzing trace with hash 2000747716, now seen corresponding path program 1 times [2019-11-15 20:45:55,104 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:55,104 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102108942] [2019-11-15 20:45:55,104 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:55,105 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:55,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:55,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:55,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:55,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:55,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:55,247 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-15 20:45:55,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102108942] [2019-11-15 20:45:55,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965732623] [2019-11-15 20:45:55,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/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-15 20:45:55,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:55,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 20:45:55,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:55,369 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-15 20:45:55,369 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:45:55,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2019-11-15 20:45:55,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160469442] [2019-11-15 20:45:55,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 20:45:55,370 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:55,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 20:45:55,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-15 20:45:55,371 INFO L87 Difference]: Start difference. First operand 66 states and 98 transitions. Second operand 14 states. [2019-11-15 20:45:55,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:55,613 INFO L93 Difference]: Finished difference Result 147 states and 239 transitions. [2019-11-15 20:45:55,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 20:45:55,614 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 36 [2019-11-15 20:45:55,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:55,617 INFO L225 Difference]: With dead ends: 147 [2019-11-15 20:45:55,617 INFO L226 Difference]: Without dead ends: 83 [2019-11-15 20:45:55,619 INFO L600 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-15 20:45:55,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-15 20:45:55,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 66. [2019-11-15 20:45:55,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-15 20:45:55,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 96 transitions. [2019-11-15 20:45:55,653 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 96 transitions. Word has length 36 [2019-11-15 20:45:55,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:55,654 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 96 transitions. [2019-11-15 20:45:55,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 20:45:55,654 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 96 transitions. [2019-11-15 20:45:55,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 20:45:55,660 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:55,661 INFO L380 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-15 20:45:55,862 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:55,862 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:55,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:55,862 INFO L82 PathProgramCache]: Analyzing trace with hash -434541687, now seen corresponding path program 1 times [2019-11-15 20:45:55,863 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:55,863 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365483459] [2019-11-15 20:45:55,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:55,863 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:55,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:55,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:56,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:56,095 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-15 20:45:56,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365483459] [2019-11-15 20:45:56,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1772300151] [2019-11-15 20:45:56,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/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-15 20:45:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:56,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:45:56,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:56,228 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-15 20:45:56,228 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:45:56,229 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 18 [2019-11-15 20:45:56,229 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732136112] [2019-11-15 20:45:56,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-15 20:45:56,230 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:56,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 20:45:56,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-11-15 20:45:56,230 INFO L87 Difference]: Start difference. First operand 66 states and 96 transitions. Second operand 18 states. [2019-11-15 20:45:56,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:56,713 INFO L93 Difference]: Finished difference Result 164 states and 279 transitions. [2019-11-15 20:45:56,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 20:45:56,714 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 50 [2019-11-15 20:45:56,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:56,716 INFO L225 Difference]: With dead ends: 164 [2019-11-15 20:45:56,717 INFO L226 Difference]: Without dead ends: 100 [2019-11-15 20:45:56,721 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=587, Unknown=0, NotChecked=0, Total=702 [2019-11-15 20:45:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-11-15 20:45:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 89. [2019-11-15 20:45:56,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-15 20:45:56,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 145 transitions. [2019-11-15 20:45:56,751 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 145 transitions. Word has length 50 [2019-11-15 20:45:56,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:56,753 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 145 transitions. [2019-11-15 20:45:56,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-15 20:45:56,753 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 145 transitions. [2019-11-15 20:45:56,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-15 20:45:56,762 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:56,762 INFO L380 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-15 20:45:56,965 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:56,966 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:56,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:56,966 INFO L82 PathProgramCache]: Analyzing trace with hash -1917551255, now seen corresponding path program 1 times [2019-11-15 20:45:56,966 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:56,967 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119940938] [2019-11-15 20:45:56,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:56,967 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:56,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:57,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:57,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:57,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:57,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:57,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:57,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:57,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:57,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:57,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:57,401 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-15 20:45:57,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119940938] [2019-11-15 20:45:57,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216483912] [2019-11-15 20:45:57,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/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-15 20:45:57,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:57,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:45:57,476 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:57,604 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-15 20:45:57,604 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:45:57,605 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 20 [2019-11-15 20:45:57,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202712117] [2019-11-15 20:45:57,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-15 20:45:57,606 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:57,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-15 20:45:57,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2019-11-15 20:45:57,607 INFO L87 Difference]: Start difference. First operand 89 states and 145 transitions. Second operand 20 states. [2019-11-15 20:45:58,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:58,285 INFO L93 Difference]: Finished difference Result 207 states and 388 transitions. [2019-11-15 20:45:58,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-15 20:45:58,286 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 91 [2019-11-15 20:45:58,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:58,288 INFO L225 Difference]: With dead ends: 207 [2019-11-15 20:45:58,288 INFO L226 Difference]: Without dead ends: 114 [2019-11-15 20:45:58,290 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2019-11-15 20:45:58,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-15 20:45:58,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 88. [2019-11-15 20:45:58,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2019-11-15 20:45:58,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 135 transitions. [2019-11-15 20:45:58,307 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 135 transitions. Word has length 91 [2019-11-15 20:45:58,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:58,308 INFO L462 AbstractCegarLoop]: Abstraction has 88 states and 135 transitions. [2019-11-15 20:45:58,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-15 20:45:58,308 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 135 transitions. [2019-11-15 20:45:58,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-15 20:45:58,310 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:58,311 INFO L380 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-15 20:45:58,513 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:45:58,513 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:45:58,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:58,514 INFO L82 PathProgramCache]: Analyzing trace with hash -463941571, now seen corresponding path program 1 times [2019-11-15 20:45:58,514 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:58,514 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904017901] [2019-11-15 20:45:58,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:58,514 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:58,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:58,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:58,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:58,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:58,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:58,873 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-15 20:45:58,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904017901] [2019-11-15 20:45:58,873 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072763789] [2019-11-15 20:45:58,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/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-15 20:45:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:58,936 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 20:45:58,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:59,103 INFO L134 CoverageAnalysis]: Checked inductivity of 358 backedges. 24 proven. 155 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2019-11-15 20:45:59,104 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:45:59,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 23 [2019-11-15 20:45:59,104 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455511084] [2019-11-15 20:45:59,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-11-15 20:45:59,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:45:59,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-11-15 20:45:59,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=438, Unknown=0, NotChecked=0, Total=506 [2019-11-15 20:45:59,105 INFO L87 Difference]: Start difference. First operand 88 states and 135 transitions. Second operand 23 states. [2019-11-15 20:45:59,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:45:59,854 INFO L93 Difference]: Finished difference Result 244 states and 473 transitions. [2019-11-15 20:45:59,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-11-15 20:45:59,855 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 119 [2019-11-15 20:45:59,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:45:59,858 INFO L225 Difference]: With dead ends: 244 [2019-11-15 20:45:59,858 INFO L226 Difference]: Without dead ends: 152 [2019-11-15 20:45:59,860 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=236, Invalid=1246, Unknown=0, NotChecked=0, Total=1482 [2019-11-15 20:45:59,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-15 20:45:59,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 134. [2019-11-15 20:45:59,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-11-15 20:45:59,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 224 transitions. [2019-11-15 20:45:59,884 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 224 transitions. Word has length 119 [2019-11-15 20:45:59,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:45:59,889 INFO L462 AbstractCegarLoop]: Abstraction has 134 states and 224 transitions. [2019-11-15 20:45:59,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-11-15 20:45:59,889 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 224 transitions. [2019-11-15 20:45:59,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2019-11-15 20:45:59,902 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:45:59,902 INFO L380 BasicCegarLoop]: trace histogram [19, 19, 14, 12, 12, 12, 9, 9, 9, 9, 9, 9, 9, 8, 6, 6, 6, 6, 6, 6, 6, 5, 3, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:00,105 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:00,105 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:00,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:00,106 INFO L82 PathProgramCache]: Analyzing trace with hash -576405000, now seen corresponding path program 1 times [2019-11-15 20:46:00,106 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:00,106 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964925286] [2019-11-15 20:46:00,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:00,106 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:00,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:00,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1309 backedges. 210 proven. 388 refuted. 0 times theorem prover too weak. 711 trivial. 0 not checked. [2019-11-15 20:46:00,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964925286] [2019-11-15 20:46:00,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [301405262] [2019-11-15 20:46:00,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/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-15 20:46:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:00,933 INFO L256 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 20:46:00,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:01,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1309 backedges. 67 proven. 405 refuted. 0 times theorem prover too weak. 837 trivial. 0 not checked. [2019-11-15 20:46:01,201 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:46:01,202 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 12] total 26 [2019-11-15 20:46:01,202 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301475407] [2019-11-15 20:46:01,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-11-15 20:46:01,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:01,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-11-15 20:46:01,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=571, Unknown=0, NotChecked=0, Total=650 [2019-11-15 20:46:01,206 INFO L87 Difference]: Start difference. First operand 134 states and 224 transitions. Second operand 26 states. [2019-11-15 20:46:02,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:02,657 INFO L93 Difference]: Finished difference Result 356 states and 737 transitions. [2019-11-15 20:46:02,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-11-15 20:46:02,657 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 215 [2019-11-15 20:46:02,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:02,662 INFO L225 Difference]: With dead ends: 356 [2019-11-15 20:46:02,662 INFO L226 Difference]: Without dead ends: 201 [2019-11-15 20:46:02,665 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=291, Invalid=1779, Unknown=0, NotChecked=0, Total=2070 [2019-11-15 20:46:02,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-11-15 20:46:02,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 178. [2019-11-15 20:46:02,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-11-15 20:46:02,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 319 transitions. [2019-11-15 20:46:02,691 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 319 transitions. Word has length 215 [2019-11-15 20:46:02,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:02,692 INFO L462 AbstractCegarLoop]: Abstraction has 178 states and 319 transitions. [2019-11-15 20:46:02,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-11-15 20:46:02,692 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 319 transitions. [2019-11-15 20:46:02,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-11-15 20:46:02,701 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:02,702 INFO L380 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 22, 18, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 10, 8, 5, 5, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:02,906 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:02,907 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:02,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:02,907 INFO L82 PathProgramCache]: Analyzing trace with hash -324727060, now seen corresponding path program 2 times [2019-11-15 20:46:02,907 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:02,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297865227] [2019-11-15 20:46:02,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:02,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:02,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:02,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:03,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:04,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:04,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:04,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:04,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:04,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:04,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:04,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:04,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 671 proven. 1170 refuted. 0 times theorem prover too weak. 2135 trivial. 0 not checked. [2019-11-15 20:46:04,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297865227] [2019-11-15 20:46:04,472 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990985753] [2019-11-15 20:46:04,472 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/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-15 20:46:04,637 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 20:46:04,637 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:46:04,639 INFO L256 TraceCheckSpWp]: Trace formula consists of 832 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 20:46:04,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 3976 backedges. 194 proven. 580 refuted. 0 times theorem prover too weak. 3202 trivial. 0 not checked. [2019-11-15 20:46:04,954 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:46:04,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 11] total 37 [2019-11-15 20:46:04,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821107267] [2019-11-15 20:46:04,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 37 states [2019-11-15 20:46:04,955 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:04,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2019-11-15 20:46:04,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1180, Unknown=0, NotChecked=0, Total=1332 [2019-11-15 20:46:04,956 INFO L87 Difference]: Start difference. First operand 178 states and 319 transitions. Second operand 37 states. [2019-11-15 20:46:06,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:06,225 INFO L93 Difference]: Finished difference Result 371 states and 722 transitions. [2019-11-15 20:46:06,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-11-15 20:46:06,226 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 373 [2019-11-15 20:46:06,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:06,228 INFO L225 Difference]: With dead ends: 371 [2019-11-15 20:46:06,229 INFO L226 Difference]: Without dead ends: 194 [2019-11-15 20:46:06,232 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 547 GetRequests, 488 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=433, Invalid=3227, Unknown=0, NotChecked=0, Total=3660 [2019-11-15 20:46:06,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2019-11-15 20:46:06,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 149. [2019-11-15 20:46:06,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2019-11-15 20:46:06,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 219 transitions. [2019-11-15 20:46:06,256 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 219 transitions. Word has length 373 [2019-11-15 20:46:06,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:06,257 INFO L462 AbstractCegarLoop]: Abstraction has 149 states and 219 transitions. [2019-11-15 20:46:06,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 37 states. [2019-11-15 20:46:06,257 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 219 transitions. [2019-11-15 20:46:06,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2019-11-15 20:46:06,263 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:06,264 INFO L380 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 22, 21, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 9, 8, 5, 5, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:06,475 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:06,476 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:06,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:06,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1814760222, now seen corresponding path program 3 times [2019-11-15 20:46:06,476 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:06,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009754824] [2019-11-15 20:46:06,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:06,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:06,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:06,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:06,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:06,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:07,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:08,008 INFO L134 CoverageAnalysis]: Checked inductivity of 3769 backedges. 651 proven. 951 refuted. 0 times theorem prover too weak. 2167 trivial. 0 not checked. [2019-11-15 20:46:08,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009754824] [2019-11-15 20:46:08,009 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1675975325] [2019-11-15 20:46:08,009 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/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-15 20:46:08,120 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2019-11-15 20:46:08,120 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:46:08,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:46:08,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:08,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3769 backedges. 542 proven. 103 refuted. 0 times theorem prover too weak. 3124 trivial. 0 not checked. [2019-11-15 20:46:08,411 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:46:08,412 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 10] total 42 [2019-11-15 20:46:08,412 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413715312] [2019-11-15 20:46:08,413 INFO L442 AbstractCegarLoop]: Interpolant automaton has 42 states [2019-11-15 20:46:08,413 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:08,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2019-11-15 20:46:08,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=1522, Unknown=0, NotChecked=0, Total=1722 [2019-11-15 20:46:08,414 INFO L87 Difference]: Start difference. First operand 149 states and 219 transitions. Second operand 42 states. [2019-11-15 20:46:09,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:09,918 INFO L93 Difference]: Finished difference Result 349 states and 597 transitions. [2019-11-15 20:46:09,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-11-15 20:46:09,918 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 364 [2019-11-15 20:46:09,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:09,921 INFO L225 Difference]: With dead ends: 349 [2019-11-15 20:46:09,921 INFO L226 Difference]: Without dead ends: 210 [2019-11-15 20:46:09,925 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 533 GetRequests, 463 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1533 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=586, Invalid=4526, Unknown=0, NotChecked=0, Total=5112 [2019-11-15 20:46:09,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-15 20:46:09,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 174. [2019-11-15 20:46:09,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-11-15 20:46:09,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 251 transitions. [2019-11-15 20:46:09,940 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 251 transitions. Word has length 364 [2019-11-15 20:46:09,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:09,941 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 251 transitions. [2019-11-15 20:46:09,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 42 states. [2019-11-15 20:46:09,941 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 251 transitions. [2019-11-15 20:46:09,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 555 [2019-11-15 20:46:09,954 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:09,955 INFO L380 BasicCegarLoop]: trace histogram [41, 41, 40, 40, 33, 32, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 13, 12, 8, 8, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:10,158 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:10,158 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:10,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:10,158 INFO L82 PathProgramCache]: Analyzing trace with hash 833835434, now seen corresponding path program 4 times [2019-11-15 20:46:10,159 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:10,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075993102] [2019-11-15 20:46:10,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:10,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:10,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:10,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:10,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:10,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:10,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:12,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:12,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:12,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:12,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:12,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:12,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:12,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:12,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:12,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:12,980 INFO L134 CoverageAnalysis]: Checked inductivity of 8944 backedges. 2114 proven. 1943 refuted. 0 times theorem prover too weak. 4887 trivial. 0 not checked. [2019-11-15 20:46:12,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075993102] [2019-11-15 20:46:12,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [297344983] [2019-11-15 20:46:12,980 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/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-15 20:46:13,143 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-15 20:46:13,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:46:13,145 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-15 20:46:13,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:13,519 INFO L134 CoverageAnalysis]: Checked inductivity of 8944 backedges. 422 proven. 802 refuted. 0 times theorem prover too weak. 7720 trivial. 0 not checked. [2019-11-15 20:46:13,519 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:46:13,520 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 11] total 53 [2019-11-15 20:46:13,520 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795794973] [2019-11-15 20:46:13,521 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-11-15 20:46:13,521 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:13,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-11-15 20:46:13,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=2469, Unknown=0, NotChecked=0, Total=2756 [2019-11-15 20:46:13,523 INFO L87 Difference]: Start difference. First operand 174 states and 251 transitions. Second operand 53 states. [2019-11-15 20:46:17,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:17,020 INFO L93 Difference]: Finished difference Result 425 states and 673 transitions. [2019-11-15 20:46:17,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2019-11-15 20:46:17,021 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 554 [2019-11-15 20:46:17,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:17,025 INFO L225 Difference]: With dead ends: 425 [2019-11-15 20:46:17,025 INFO L226 Difference]: Without dead ends: 244 [2019-11-15 20:46:17,030 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 814 GetRequests, 719 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3139 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=924, Invalid=8388, Unknown=0, NotChecked=0, Total=9312 [2019-11-15 20:46:17,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2019-11-15 20:46:17,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 192. [2019-11-15 20:46:17,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2019-11-15 20:46:17,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 276 transitions. [2019-11-15 20:46:17,049 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 276 transitions. Word has length 554 [2019-11-15 20:46:17,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:17,050 INFO L462 AbstractCegarLoop]: Abstraction has 192 states and 276 transitions. [2019-11-15 20:46:17,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-11-15 20:46:17,051 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 276 transitions. [2019-11-15 20:46:17,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2019-11-15 20:46:17,075 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:17,076 INFO L380 BasicCegarLoop]: trace histogram [53, 53, 50, 50, 42, 41, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 16, 16, 12, 8, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:17,280 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:17,281 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:17,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:17,281 INFO L82 PathProgramCache]: Analyzing trace with hash 117210635, now seen corresponding path program 5 times [2019-11-15 20:46:17,281 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:17,281 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607028394] [2019-11-15 20:46:17,281 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:17,282 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:17,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:20,904 INFO L134 CoverageAnalysis]: Checked inductivity of 14593 backedges. 2329 proven. 3135 refuted. 0 times theorem prover too weak. 9129 trivial. 0 not checked. [2019-11-15 20:46:20,904 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607028394] [2019-11-15 20:46:20,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140779283] [2019-11-15 20:46:20,905 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:21,287 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2019-11-15 20:46:21,287 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:46:21,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 1258 conjuncts, 23 conjunts are in the unsatisfiable core [2019-11-15 20:46:21,312 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:21,825 INFO L134 CoverageAnalysis]: Checked inductivity of 14593 backedges. 2141 proven. 765 refuted. 0 times theorem prover too weak. 11687 trivial. 0 not checked. [2019-11-15 20:46:21,826 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:46:21,826 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 18] total 39 [2019-11-15 20:46:21,826 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402615314] [2019-11-15 20:46:21,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 39 states [2019-11-15 20:46:21,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:21,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2019-11-15 20:46:21,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1310, Unknown=0, NotChecked=0, Total=1482 [2019-11-15 20:46:21,829 INFO L87 Difference]: Start difference. First operand 192 states and 276 transitions. Second operand 39 states. [2019-11-15 20:46:23,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:23,027 INFO L93 Difference]: Finished difference Result 437 states and 697 transitions. [2019-11-15 20:46:23,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-11-15 20:46:23,027 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 704 [2019-11-15 20:46:23,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:23,032 INFO L225 Difference]: With dead ends: 437 [2019-11-15 20:46:23,032 INFO L226 Difference]: Without dead ends: 247 [2019-11-15 20:46:23,035 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 982 GetRequests, 925 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 944 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=435, Invalid=2871, Unknown=0, NotChecked=0, Total=3306 [2019-11-15 20:46:23,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2019-11-15 20:46:23,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 201. [2019-11-15 20:46:23,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2019-11-15 20:46:23,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 292 transitions. [2019-11-15 20:46:23,055 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 292 transitions. Word has length 704 [2019-11-15 20:46:23,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:23,056 INFO L462 AbstractCegarLoop]: Abstraction has 201 states and 292 transitions. [2019-11-15 20:46:23,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 39 states. [2019-11-15 20:46:23,056 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 292 transitions. [2019-11-15 20:46:23,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2019-11-15 20:46:23,062 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:23,062 INFO L380 BasicCegarLoop]: trace histogram [42, 42, 41, 41, 34, 33, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 14, 12, 8, 8, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:23,267 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:23,267 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:23,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:23,268 INFO L82 PathProgramCache]: Analyzing trace with hash 932975275, now seen corresponding path program 6 times [2019-11-15 20:46:23,268 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:23,268 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982084365] [2019-11-15 20:46:23,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:23,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:23,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:23,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:23,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:24,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:25,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:25,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:25,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:25,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:25,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:25,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:25,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:25,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:25,592 INFO L134 CoverageAnalysis]: Checked inductivity of 9413 backedges. 918 proven. 1776 refuted. 0 times theorem prover too weak. 6719 trivial. 0 not checked. [2019-11-15 20:46:25,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982084365] [2019-11-15 20:46:25,593 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460227091] [2019-11-15 20:46:25,593 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:25,874 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 36 check-sat command(s) [2019-11-15 20:46:25,874 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 20:46:25,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 1264 conjuncts, 168 conjunts are in the unsatisfiable core [2019-11-15 20:46:25,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:27,233 INFO L134 CoverageAnalysis]: Checked inductivity of 9413 backedges. 1711 proven. 1409 refuted. 0 times theorem prover too weak. 6293 trivial. 0 not checked. [2019-11-15 20:46:27,234 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 20:46:27,235 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 37] total 69 [2019-11-15 20:46:27,235 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523883362] [2019-11-15 20:46:27,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-11-15 20:46:27,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:46:27,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-11-15 20:46:27,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=4381, Unknown=0, NotChecked=0, Total=4692 [2019-11-15 20:46:27,240 INFO L87 Difference]: Start difference. First operand 201 states and 292 transitions. Second operand 69 states. [2019-11-15 20:46:30,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:46:30,650 INFO L93 Difference]: Finished difference Result 439 states and 719 transitions. [2019-11-15 20:46:30,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2019-11-15 20:46:30,651 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 568 [2019-11-15 20:46:30,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 20:46:30,656 INFO L225 Difference]: With dead ends: 439 [2019-11-15 20:46:30,656 INFO L226 Difference]: Without dead ends: 241 [2019-11-15 20:46:30,665 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 831 GetRequests, 698 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6613 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1415, Invalid=16675, Unknown=0, NotChecked=0, Total=18090 [2019-11-15 20:46:30,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2019-11-15 20:46:30,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 208. [2019-11-15 20:46:30,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-11-15 20:46:30,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 308 transitions. [2019-11-15 20:46:30,685 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 308 transitions. Word has length 568 [2019-11-15 20:46:30,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 20:46:30,686 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 308 transitions. [2019-11-15 20:46:30,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-11-15 20:46:30,686 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 308 transitions. [2019-11-15 20:46:30,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2019-11-15 20:46:30,691 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 20:46:30,691 INFO L380 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 27, 27, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 11, 10, 7, 6, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:30,897 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 20:46:30,897 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 20:46:30,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:30,898 INFO L82 PathProgramCache]: Analyzing trace with hash 706303904, now seen corresponding path program 7 times [2019-11-15 20:46:30,898 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:30,898 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090209593] [2019-11-15 20:46:30,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:30,898 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:30,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:30,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:46:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:46:31,122 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:46:31,122 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 20:46:31,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 08:46:31 BoogieIcfgContainer [2019-11-15 20:46:31,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 20:46:31,264 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:46:31,264 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:46:31,264 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:46:31,265 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:45:51" (3/4) ... [2019-11-15 20:46:31,268 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 20:46:31,450 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_dedbc4f5-e83b-41a0-b8b1-72fec4bbb46f/bin/uautomizer/witness.graphml [2019-11-15 20:46:31,454 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:46:31,456 INFO L168 Benchmark]: Toolchain (without parser) took 40311.55 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 945.3 MB). Free memory was 944.7 MB in the beginning and 1.5 GB in the end (delta: -506.0 MB). Peak memory consumption was 439.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:46:31,457 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:46:31,457 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:46:31,459 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:46:31,460 INFO L168 Benchmark]: Boogie Preprocessor took 27.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:46:31,460 INFO L168 Benchmark]: RCFGBuilder took 235.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:46:31,461 INFO L168 Benchmark]: TraceAbstraction took 39480.10 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 807.4 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -343.6 MB). Peak memory consumption was 463.8 MB. Max. memory is 11.5 GB. [2019-11-15 20:46:31,464 INFO L168 Benchmark]: Witness Printer took 190.35 ms. Allocated memory is still 2.0 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-11-15 20:46:31,466 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.53 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 341.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -188.0 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.94 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.63 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 235.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.3 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 39480.10 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 807.4 MB). Free memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: -343.6 MB). Peak memory consumption was 463.8 MB. Max. memory is 11.5 GB. * Witness Printer took 190.35 ms. Allocated memory is still 2.0 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 7.2 MB). Peak memory consumption was 7.2 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 = 8; [L37] CALL, EXPR fibo1(x) VAL [\old(n)=8] [L8] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L10] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=7] [L18] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L20] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L23] CALL, EXPR fibo1(n-1) 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); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=7, fibo1(n-1)=8, n=7] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) 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-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) 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-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=7, fibo1(n-1)=8, fibo1(n-2)=5, n=7] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=8, fibo2(n-1)=13, n=8] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=6] [L18] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L20] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) 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-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) 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-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=6, fibo1(n-1)=5, n=6] [L23] CALL, EXPR fibo1(n-2) 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-2) VAL [\old(n)=6, fibo1(n-1)=5, fibo1(n-2)=3, n=6] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=8, fibo2(n-1)=13, fibo2(n-2)=8, n=8] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) [L37] int result = fibo1(x); [L38] COND TRUE result == 21 [L39] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 1 error locations. Result: UNSAFE, OverallTime: 39.4s, OverallIterations: 16, TraceHistogramMax: 53, AutomataDifference: 15.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 489 SDtfs, 1449 SDslu, 5651 SDs, 0 SdLazy, 12714 SolverSat, 2194 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4666 GetRequests, 4046 SyntacticMatches, 1 SemanticMatches, 619 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14033 ImplicationChecksByTransitivity, 11.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=208occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 15 MinimizatonAttempts, 316 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 16.5s InterpolantComputationTime, 6786 NumberOfCodeBlocks, 6369 NumberOfCodeBlocksAsserted, 111 NumberOfCheckSat, 6299 ConstructedInterpolants, 0 QuantifiedInterpolants, 4807493 SizeOfPredicates, 72 NumberOfNonLiveVariables, 6050 ConjunctsInSsa, 311 ConjunctsInUnsatCore, 28 InterpolantComputations, 2 PerfectInterpolantSequences, 71350/85272 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...