./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/fibo_7-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3180c705-1a1d-4cfc-82f8-cce9ef0bf929/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3180c705-1a1d-4cfc-82f8-cce9ef0bf929/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3180c705-1a1d-4cfc-82f8-cce9ef0bf929/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3180c705-1a1d-4cfc-82f8-cce9ef0bf929/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/fibo_7-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_3180c705-1a1d-4cfc-82f8-cce9ef0bf929/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3180c705-1a1d-4cfc-82f8-cce9ef0bf929/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 16ceff9c26892934dc007d0ff3b64a1ad7cbb0e9 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 18:27:33,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:27:33,494 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:27:33,503 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:27:33,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:27:33,504 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:27:33,504 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:27:33,506 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:27:33,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:27:33,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:27:33,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:27:33,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:27:33,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:27:33,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:27:33,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:27:33,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:27:33,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:27:33,513 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:27:33,515 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:27:33,516 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:27:33,517 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:27:33,518 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:27:33,519 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:27:33,520 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:27:33,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:27:33,522 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:27:33,522 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:27:33,522 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:27:33,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:27:33,523 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:27:33,523 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:27:33,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:27:33,524 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:27:33,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:27:33,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:27:33,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:27:33,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:27:33,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:27:33,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:27:33,528 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:27:33,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:27:33,529 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3180c705-1a1d-4cfc-82f8-cce9ef0bf929/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:27:33,541 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:27:33,541 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:27:33,542 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:27:33,542 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:27:33,543 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:27:33,543 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:27:33,543 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:27:33,543 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:27:33,543 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:27:33,544 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:27:33,544 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:27:33,544 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:27:33,544 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:27:33,544 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:27:33,545 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:27:33,545 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:27:33,545 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:27:33,545 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:27:33,545 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:27:33,545 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:27:33,546 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:27:33,546 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:27:33,546 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:27:33,546 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:27:33,546 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:27:33,546 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:27:33,547 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:27:33,547 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:27:33,547 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:27:33,547 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_3180c705-1a1d-4cfc-82f8-cce9ef0bf929/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 -> 16ceff9c26892934dc007d0ff3b64a1ad7cbb0e9 [2019-12-07 18:27:33,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:27:33,665 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:27:33,668 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:27:33,669 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:27:33,670 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:27:33,670 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3180c705-1a1d-4cfc-82f8-cce9ef0bf929/bin/uautomizer/../../sv-benchmarks/c/recursive-simple/fibo_7-2.c [2019-12-07 18:27:33,712 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3180c705-1a1d-4cfc-82f8-cce9ef0bf929/bin/uautomizer/data/2a407151a/c41417fe19994795bce72ae3c2fdebee/FLAGd7ac36537 [2019-12-07 18:27:34,113 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:27:34,113 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3180c705-1a1d-4cfc-82f8-cce9ef0bf929/sv-benchmarks/c/recursive-simple/fibo_7-2.c [2019-12-07 18:27:34,117 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3180c705-1a1d-4cfc-82f8-cce9ef0bf929/bin/uautomizer/data/2a407151a/c41417fe19994795bce72ae3c2fdebee/FLAGd7ac36537 [2019-12-07 18:27:34,125 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3180c705-1a1d-4cfc-82f8-cce9ef0bf929/bin/uautomizer/data/2a407151a/c41417fe19994795bce72ae3c2fdebee [2019-12-07 18:27:34,127 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:27:34,128 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:27:34,129 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:27:34,129 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:27:34,132 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:27:34,132 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:27:34" (1/1) ... [2019-12-07 18:27:34,135 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a9c5e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:27:34, skipping insertion in model container [2019-12-07 18:27:34,135 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:27:34" (1/1) ... [2019-12-07 18:27:34,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:27:34,149 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:27:34,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:27:34,255 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:27:34,296 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:27:34,306 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:27:34,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:27:34 WrapperNode [2019-12-07 18:27:34,307 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:27:34,307 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:27:34,307 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:27:34,307 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:27:34,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:27:34" (1/1) ... [2019-12-07 18:27:34,316 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:27:34" (1/1) ... [2019-12-07 18:27:34,327 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:27:34,327 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:27:34,327 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:27:34,327 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:27:34,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:27:34" (1/1) ... [2019-12-07 18:27:34,333 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:27:34" (1/1) ... [2019-12-07 18:27:34,333 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:27:34" (1/1) ... [2019-12-07 18:27:34,334 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:27:34" (1/1) ... [2019-12-07 18:27:34,335 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:27:34" (1/1) ... [2019-12-07 18:27:34,336 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:27:34" (1/1) ... [2019-12-07 18:27:34,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:27:34" (1/1) ... [2019-12-07 18:27:34,337 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:27:34,338 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:27:34,338 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:27:34,338 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:27:34,338 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:27:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3180c705-1a1d-4cfc-82f8-cce9ef0bf929/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-12-07 18:27:34,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:27:34,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:27:34,376 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2019-12-07 18:27:34,376 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2019-12-07 18:27:34,474 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:27:34,475 INFO L287 CfgBuilder]: Removed 4 assume(true) statements. [2019-12-07 18:27:34,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:27:34 BoogieIcfgContainer [2019-12-07 18:27:34,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:27:34,477 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:27:34,477 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:27:34,479 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:27:34,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:27:34" (1/3) ... [2019-12-07 18:27:34,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700bf35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:27:34, skipping insertion in model container [2019-12-07 18:27:34,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:27:34" (2/3) ... [2019-12-07 18:27:34,481 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@700bf35e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:27:34, skipping insertion in model container [2019-12-07 18:27:34,481 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:27:34" (3/3) ... [2019-12-07 18:27:34,482 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2019-12-07 18:27:34,491 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:27:34,496 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 18:27:34,504 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 18:27:34,518 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:27:34,518 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:27:34,518 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:27:34,518 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:27:34,518 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:27:34,518 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:27:34,518 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:27:34,519 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:27:34,529 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-12-07 18:27:34,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 18:27:34,532 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:34,533 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:27:34,533 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:34,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:34,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1007516703, now seen corresponding path program 1 times [2019-12-07 18:27:34,542 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:34,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153210570] [2019-12-07 18:27:34,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:34,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:34,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:34,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:27:34,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153210570] [2019-12-07 18:27:34,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:27:34,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:27:34,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782398481] [2019-12-07 18:27:34,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:27:34,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:34,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:27:34,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:27:34,702 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 7 states. [2019-12-07 18:27:34,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:34,773 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2019-12-07 18:27:34,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:27:34,774 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2019-12-07 18:27:34,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:34,783 INFO L225 Difference]: With dead ends: 29 [2019-12-07 18:27:34,783 INFO L226 Difference]: Without dead ends: 17 [2019-12-07 18:27:34,786 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:27:34,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-12-07 18:27:34,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-12-07 18:27:34,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 18:27:34,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-12-07 18:27:34,817 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 9 [2019-12-07 18:27:34,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:34,817 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-12-07 18:27:34,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:27:34,818 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-12-07 18:27:34,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-07 18:27:34,819 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:34,819 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:27:34,820 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:34,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:34,820 INFO L82 PathProgramCache]: Analyzing trace with hash -453503986, now seen corresponding path program 1 times [2019-12-07 18:27:34,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:34,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571737624] [2019-12-07 18:27:34,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:34,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:34,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:27:34,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571737624] [2019-12-07 18:27:34,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:27:34,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 18:27:34,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612962584] [2019-12-07 18:27:34,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:27:34,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:34,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:27:34,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:27:34,874 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 7 states. [2019-12-07 18:27:34,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:34,921 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2019-12-07 18:27:34,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:27:34,922 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 10 [2019-12-07 18:27:34,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:34,923 INFO L225 Difference]: With dead ends: 23 [2019-12-07 18:27:34,923 INFO L226 Difference]: Without dead ends: 19 [2019-12-07 18:27:34,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:27:34,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-12-07 18:27:34,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-12-07 18:27:34,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-12-07 18:27:34,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2019-12-07 18:27:34,928 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 10 [2019-12-07 18:27:34,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:34,928 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2019-12-07 18:27:34,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:27:34,928 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2019-12-07 18:27:34,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:27:34,929 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:34,929 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:27:34,929 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:34,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:34,929 INFO L82 PathProgramCache]: Analyzing trace with hash 511906889, now seen corresponding path program 1 times [2019-12-07 18:27:34,929 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:34,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565823900] [2019-12-07 18:27:34,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:34,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:34,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:35,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:35,013 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 18:27:35,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565823900] [2019-12-07 18:27:35,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287692652] [2019-12-07 18:27:35,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3180c705-1a1d-4cfc-82f8-cce9ef0bf929/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-12-07 18:27:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:35,037 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 18:27:35,041 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:27:35,073 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-07 18:27:35,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:27:35,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 10 [2019-12-07 18:27:35,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592564489] [2019-12-07 18:27:35,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:27:35,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:35,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:27:35,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:27:35,075 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand 10 states. [2019-12-07 18:27:35,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:35,137 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2019-12-07 18:27:35,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:27:35,138 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-12-07 18:27:35,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:35,139 INFO L225 Difference]: With dead ends: 41 [2019-12-07 18:27:35,139 INFO L226 Difference]: Without dead ends: 26 [2019-12-07 18:27:35,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:27:35,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-12-07 18:27:35,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-12-07 18:27:35,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 18:27:35,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-12-07 18:27:35,144 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 30 transitions. Word has length 22 [2019-12-07 18:27:35,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:35,144 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-12-07 18:27:35,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:27:35,145 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 30 transitions. [2019-12-07 18:27:35,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 18:27:35,146 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:35,146 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:27:35,346 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:27:35,346 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:35,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:35,347 INFO L82 PathProgramCache]: Analyzing trace with hash 178931364, now seen corresponding path program 1 times [2019-12-07 18:27:35,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:35,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835765332] [2019-12-07 18:27:35,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:35,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:35,415 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 18:27:35,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835765332] [2019-12-07 18:27:35,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080068339] [2019-12-07 18:27:35,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3180c705-1a1d-4cfc-82f8-cce9ef0bf929/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-12-07 18:27:35,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:35,433 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 18:27:35,434 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:27:35,447 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-07 18:27:35,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:27:35,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 10 [2019-12-07 18:27:35,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801093711] [2019-12-07 18:27:35,448 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 18:27:35,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:35,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 18:27:35,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 18:27:35,448 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. Second operand 10 states. [2019-12-07 18:27:35,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:35,532 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2019-12-07 18:27:35,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:27:35,532 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 23 [2019-12-07 18:27:35,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:35,534 INFO L225 Difference]: With dead ends: 47 [2019-12-07 18:27:35,534 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 18:27:35,535 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:27:35,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 18:27:35,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-12-07 18:27:35,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-12-07 18:27:35,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 58 transitions. [2019-12-07 18:27:35,543 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 58 transitions. Word has length 23 [2019-12-07 18:27:35,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:35,543 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 58 transitions. [2019-12-07 18:27:35,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 18:27:35,543 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 58 transitions. [2019-12-07 18:27:35,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 18:27:35,544 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:35,544 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 18:27:35,745 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:27:35,746 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:35,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:35,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1840059703, now seen corresponding path program 2 times [2019-12-07 18:27:35,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:35,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342343806] [2019-12-07 18:27:35,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:35,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:35,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:35,875 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 9 proven. 18 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 18:27:35,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342343806] [2019-12-07 18:27:35,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1033170987] [2019-12-07 18:27:35,875 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3180c705-1a1d-4cfc-82f8-cce9ef0bf929/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-12-07 18:27:35,898 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:27:35,898 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:27:35,898 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 18:27:35,900 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:27:35,930 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-12-07 18:27:35,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:27:35,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7] total 12 [2019-12-07 18:27:35,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761722774] [2019-12-07 18:27:35,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:27:35,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:35,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:27:35,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:27:35,932 INFO L87 Difference]: Start difference. First operand 40 states and 58 transitions. Second operand 12 states. [2019-12-07 18:27:36,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:36,046 INFO L93 Difference]: Finished difference Result 67 states and 101 transitions. [2019-12-07 18:27:36,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 18:27:36,046 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-12-07 18:27:36,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:36,047 INFO L225 Difference]: With dead ends: 67 [2019-12-07 18:27:36,047 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 18:27:36,048 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2019-12-07 18:27:36,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 18:27:36,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2019-12-07 18:27:36,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 18:27:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 32 transitions. [2019-12-07 18:27:36,052 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 32 transitions. Word has length 35 [2019-12-07 18:27:36,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:36,053 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 32 transitions. [2019-12-07 18:27:36,053 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:27:36,053 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 32 transitions. [2019-12-07 18:27:36,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 18:27:36,054 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:36,054 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:27:36,254 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:27:36,255 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:36,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:36,256 INFO L82 PathProgramCache]: Analyzing trace with hash 624826665, now seen corresponding path program 2 times [2019-12-07 18:27:36,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:36,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008629265] [2019-12-07 18:27:36,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:36,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:36,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:36,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:36,494 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 18:27:36,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008629265] [2019-12-07 18:27:36,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902782927] [2019-12-07 18:27:36,495 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3180c705-1a1d-4cfc-82f8-cce9ef0bf929/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-12-07 18:27:36,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-12-07 18:27:36,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:27:36,519 INFO L264 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 18:27:36,521 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:27:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-12-07 18:27:36,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:27:36,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7] total 12 [2019-12-07 18:27:36,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49971637] [2019-12-07 18:27:36,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:27:36,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:36,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:27:36,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:27:36,540 INFO L87 Difference]: Start difference. First operand 26 states and 32 transitions. Second operand 12 states. [2019-12-07 18:27:36,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:36,635 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2019-12-07 18:27:36,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:27:36,636 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2019-12-07 18:27:36,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:36,637 INFO L225 Difference]: With dead ends: 52 [2019-12-07 18:27:36,637 INFO L226 Difference]: Without dead ends: 48 [2019-12-07 18:27:36,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:27:36,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-07 18:27:36,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2019-12-07 18:27:36,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-12-07 18:27:36,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 59 transitions. [2019-12-07 18:27:36,647 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 59 transitions. Word has length 37 [2019-12-07 18:27:36,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:36,648 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 59 transitions. [2019-12-07 18:27:36,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:27:36,648 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 59 transitions. [2019-12-07 18:27:36,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-12-07 18:27:36,651 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:36,651 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 8, 6, 6, 6, 6, 6, 6, 6, 5, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 18:27:36,851 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:27:36,852 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:36,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:36,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1133813247, now seen corresponding path program 3 times [2019-12-07 18:27:36,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:36,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685194543] [2019-12-07 18:27:36,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:36,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:36,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:37,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:37,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:37,066 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 73 proven. 128 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-12-07 18:27:37,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685194543] [2019-12-07 18:27:37,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280318570] [2019-12-07 18:27:37,066 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3180c705-1a1d-4cfc-82f8-cce9ef0bf929/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-12-07 18:27:37,091 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-12-07 18:27:37,091 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:27:37,091 INFO L264 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 18:27:37,095 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:27:37,134 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 207 proven. 12 refuted. 0 times theorem prover too weak. 181 trivial. 0 not checked. [2019-12-07 18:27:37,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:27:37,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8] total 16 [2019-12-07 18:27:37,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034816018] [2019-12-07 18:27:37,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 18:27:37,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:37,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 18:27:37,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:27:37,136 INFO L87 Difference]: Start difference. First operand 42 states and 59 transitions. Second operand 16 states. [2019-12-07 18:27:37,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:37,268 INFO L93 Difference]: Finished difference Result 94 states and 142 transitions. [2019-12-07 18:27:37,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:27:37,268 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 89 [2019-12-07 18:27:37,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:37,269 INFO L225 Difference]: With dead ends: 94 [2019-12-07 18:27:37,270 INFO L226 Difference]: Without dead ends: 54 [2019-12-07 18:27:37,270 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2019-12-07 18:27:37,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2019-12-07 18:27:37,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2019-12-07 18:27:37,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 18:27:37,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2019-12-07 18:27:37,277 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 57 transitions. Word has length 89 [2019-12-07 18:27:37,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:37,277 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 57 transitions. [2019-12-07 18:27:37,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 18:27:37,277 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2019-12-07 18:27:37,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-07 18:27:37,278 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:37,278 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1] [2019-12-07 18:27:37,479 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:27:37,479 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:37,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:37,479 INFO L82 PathProgramCache]: Analyzing trace with hash -91709127, now seen corresponding path program 4 times [2019-12-07 18:27:37,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:37,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596366145] [2019-12-07 18:27:37,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:37,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:37,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:37,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:37,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:37,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:37,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:37,675 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 57 proven. 117 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2019-12-07 18:27:37,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596366145] [2019-12-07 18:27:37,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [166393865] [2019-12-07 18:27:37,676 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3180c705-1a1d-4cfc-82f8-cce9ef0bf929/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-12-07 18:27:37,701 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-12-07 18:27:37,701 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:27:37,701 INFO L264 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 18:27:37,705 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:27:37,733 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2019-12-07 18:27:37,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:27:37,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8] total 19 [2019-12-07 18:27:37,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144426093] [2019-12-07 18:27:37,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 18:27:37,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:37,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 18:27:37,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:27:37,735 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. Second operand 19 states. [2019-12-07 18:27:37,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:37,922 INFO L93 Difference]: Finished difference Result 93 states and 137 transitions. [2019-12-07 18:27:37,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 18:27:37,922 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2019-12-07 18:27:37,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:37,924 INFO L225 Difference]: With dead ends: 93 [2019-12-07 18:27:37,924 INFO L226 Difference]: Without dead ends: 53 [2019-12-07 18:27:37,925 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-07 18:27:37,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-12-07 18:27:37,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2019-12-07 18:27:37,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-12-07 18:27:37,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 63 transitions. [2019-12-07 18:27:37,938 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 63 transitions. Word has length 78 [2019-12-07 18:27:37,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:37,938 INFO L462 AbstractCegarLoop]: Abstraction has 50 states and 63 transitions. [2019-12-07 18:27:37,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 18:27:37,939 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 63 transitions. [2019-12-07 18:27:37,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-12-07 18:27:37,940 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:37,940 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 15, 9, 9, 9, 9, 9, 9, 9, 6, 4, 1, 1, 1, 1, 1, 1] [2019-12-07 18:27:38,140 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:27:38,141 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:38,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:38,141 INFO L82 PathProgramCache]: Analyzing trace with hash -2413653, now seen corresponding path program 5 times [2019-12-07 18:27:38,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:38,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942353245] [2019-12-07 18:27:38,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:38,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:38,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:38,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:38,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:38,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:38,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:38,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:38,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:38,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:38,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:38,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:38,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:38,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:38,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:38,479 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 166 proven. 339 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2019-12-07 18:27:38,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942353245] [2019-12-07 18:27:38,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025855060] [2019-12-07 18:27:38,480 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3180c705-1a1d-4cfc-82f8-cce9ef0bf929/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-12-07 18:27:38,515 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-12-07 18:27:38,515 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:27:38,516 INFO L264 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 16 conjunts are in the unsatisfiable core [2019-12-07 18:27:38,519 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:27:38,589 INFO L134 CoverageAnalysis]: Checked inductivity of 933 backedges. 187 proven. 336 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2019-12-07 18:27:38,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:27:38,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 12] total 25 [2019-12-07 18:27:38,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740539922] [2019-12-07 18:27:38,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-07 18:27:38,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:38,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-07 18:27:38,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=483, Unknown=0, NotChecked=0, Total=600 [2019-12-07 18:27:38,590 INFO L87 Difference]: Start difference. First operand 50 states and 63 transitions. Second operand 25 states. [2019-12-07 18:27:38,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:38,864 INFO L93 Difference]: Finished difference Result 111 states and 175 transitions. [2019-12-07 18:27:38,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 18:27:38,864 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 132 [2019-12-07 18:27:38,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:38,865 INFO L225 Difference]: With dead ends: 111 [2019-12-07 18:27:38,866 INFO L226 Difference]: Without dead ends: 70 [2019-12-07 18:27:38,866 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=286, Invalid=1046, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 18:27:38,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-12-07 18:27:38,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 66. [2019-12-07 18:27:38,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-12-07 18:27:38,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 85 transitions. [2019-12-07 18:27:38,873 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 85 transitions. Word has length 132 [2019-12-07 18:27:38,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:38,873 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 85 transitions. [2019-12-07 18:27:38,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-07 18:27:38,873 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 85 transitions. [2019-12-07 18:27:38,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-12-07 18:27:38,875 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:38,875 INFO L410 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1] [2019-12-07 18:27:39,075 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:27:39,077 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:39,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:39,077 INFO L82 PathProgramCache]: Analyzing trace with hash -2009245247, now seen corresponding path program 6 times [2019-12-07 18:27:39,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:39,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915597056] [2019-12-07 18:27:39,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:39,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:39,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:39,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:39,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:39,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:39,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:39,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:39,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:39,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2019-12-07 18:27:39,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915597056] [2019-12-07 18:27:39,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371919704] [2019-12-07 18:27:39,436 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3180c705-1a1d-4cfc-82f8-cce9ef0bf929/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-12-07 18:27:39,488 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2019-12-07 18:27:39,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-12-07 18:27:39,489 INFO L264 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 18:27:39,494 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:27:39,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 202 proven. 241 refuted. 0 times theorem prover too weak. 1211 trivial. 0 not checked. [2019-12-07 18:27:39,526 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:27:39,526 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 8] total 18 [2019-12-07 18:27:39,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643114912] [2019-12-07 18:27:39,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 18:27:39,527 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:39,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 18:27:39,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-12-07 18:27:39,527 INFO L87 Difference]: Start difference. First operand 66 states and 85 transitions. Second operand 18 states. [2019-12-07 18:27:39,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:39,670 INFO L93 Difference]: Finished difference Result 182 states and 262 transitions. [2019-12-07 18:27:39,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:27:39,670 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 173 [2019-12-07 18:27:39,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:39,673 INFO L225 Difference]: With dead ends: 182 [2019-12-07 18:27:39,673 INFO L226 Difference]: Without dead ends: 178 [2019-12-07 18:27:39,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-12-07 18:27:39,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-12-07 18:27:39,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2019-12-07 18:27:39,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-12-07 18:27:39,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 239 transitions. [2019-12-07 18:27:39,694 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 239 transitions. Word has length 173 [2019-12-07 18:27:39,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:39,694 INFO L462 AbstractCegarLoop]: Abstraction has 166 states and 239 transitions. [2019-12-07 18:27:39,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 18:27:39,694 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 239 transitions. [2019-12-07 18:27:39,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-12-07 18:27:39,700 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:39,700 INFO L410 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1] [2019-12-07 18:27:39,900 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:27:39,901 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:39,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:39,902 INFO L82 PathProgramCache]: Analyzing trace with hash 503828745, now seen corresponding path program 7 times [2019-12-07 18:27:39,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:39,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617424114] [2019-12-07 18:27:39,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:39,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 930 proven. 1704 refuted. 0 times theorem prover too weak. 4486 trivial. 0 not checked. [2019-12-07 18:27:40,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617424114] [2019-12-07 18:27:40,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [872891244] [2019-12-07 18:27:40,688 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3180c705-1a1d-4cfc-82f8-cce9ef0bf929/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-12-07 18:27:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:27:40,765 INFO L264 TraceCheckSpWp]: Trace formula consists of 780 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 18:27:40,771 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 18:27:40,889 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 1021 proven. 540 refuted. 0 times theorem prover too weak. 5559 trivial. 0 not checked. [2019-12-07 18:27:40,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-12-07 18:27:40,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 11] total 32 [2019-12-07 18:27:40,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377591627] [2019-12-07 18:27:40,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-12-07 18:27:40,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:27:40,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-12-07 18:27:40,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=811, Unknown=0, NotChecked=0, Total=992 [2019-12-07 18:27:40,891 INFO L87 Difference]: Start difference. First operand 166 states and 239 transitions. Second operand 32 states. [2019-12-07 18:27:41,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:27:41,408 INFO L93 Difference]: Finished difference Result 290 states and 519 transitions. [2019-12-07 18:27:41,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-07 18:27:41,408 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 350 [2019-12-07 18:27:41,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:27:41,410 INFO L225 Difference]: With dead ends: 290 [2019-12-07 18:27:41,410 INFO L226 Difference]: Without dead ends: 118 [2019-12-07 18:27:41,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 498 GetRequests, 448 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=484, Invalid=2066, Unknown=0, NotChecked=0, Total=2550 [2019-12-07 18:27:41,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-12-07 18:27:41,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 97. [2019-12-07 18:27:41,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2019-12-07 18:27:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 125 transitions. [2019-12-07 18:27:41,419 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 125 transitions. Word has length 350 [2019-12-07 18:27:41,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:27:41,419 INFO L462 AbstractCegarLoop]: Abstraction has 97 states and 125 transitions. [2019-12-07 18:27:41,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-12-07 18:27:41,420 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 125 transitions. [2019-12-07 18:27:41,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-12-07 18:27:41,422 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:27:41,422 INFO L410 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1] [2019-12-07 18:27:41,622 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 18:27:41,623 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:27:41,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:27:41,624 INFO L82 PathProgramCache]: Analyzing trace with hash 960836894, now seen corresponding path program 8 times [2019-12-07 18:27:41,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:27:41,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816576451] [2019-12-07 18:27:41,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:27:41,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:27:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:27:41,698 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:27:41,698 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:27:41,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:27:41 BoogieIcfgContainer [2019-12-07 18:27:41,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:27:41,741 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:27:41,741 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:27:41,741 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:27:41,742 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:27:34" (3/4) ... [2019-12-07 18:27:41,743 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:27:41,802 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_3180c705-1a1d-4cfc-82f8-cce9ef0bf929/bin/uautomizer/witness.graphml [2019-12-07 18:27:41,802 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:27:41,804 INFO L168 Benchmark]: Toolchain (without parser) took 7675.83 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 276.8 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -177.2 MB). Peak memory consumption was 99.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:27:41,805 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:27:41,805 INFO L168 Benchmark]: CACSL2BoogieTranslator took 178.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -138.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:27:41,805 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.88 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:27:41,805 INFO L168 Benchmark]: Boogie Preprocessor took 10.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:27:41,806 INFO L168 Benchmark]: RCFGBuilder took 138.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:27:41,806 INFO L168 Benchmark]: TraceAbstraction took 7264.24 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -68.5 MB). Peak memory consumption was 118.7 MB. Max. memory is 11.5 GB. [2019-12-07 18:27:41,806 INFO L168 Benchmark]: Witness Printer took 61.39 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:27:41,807 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 178.34 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -138.2 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.88 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 10.17 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 138.40 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7264.24 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -68.5 MB). Peak memory consumption was 118.7 MB. Max. memory is 11.5 GB. * Witness Printer took 61.39 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 27]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L24] int x = 7; [L25] CALL, EXPR fibo(x) VAL [\old(n)=7] [L6] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L8] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L6] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L8] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L6] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L8] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L6] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L8] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L6] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L8] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L6] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L8] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L11] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L6] COND TRUE n < 1 [L7] return 0; VAL [\old(n)=0, \result=0, n=0] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L11] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L6] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L8] COND TRUE n == 1 [L9] return 1; VAL [\old(n)=1, \result=1, n=1] [L11] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L11] return fibo(n-1) + fibo(n-2); [L11] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L11] return fibo(n-1) + fibo(n-2); [L25] RET, EXPR fibo(x) [L25] int result = fibo(x); [L26] COND TRUE result == 13 [L27] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 19 locations, 1 error locations. Result: UNSAFE, OverallTime: 7.1s, OverallIterations: 12, TraceHistogramMax: 51, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 184 SDtfs, 591 SDslu, 819 SDs, 0 SdLazy, 2220 SolverSat, 657 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1401 GetRequests, 1200 SyntacticMatches, 1 SemanticMatches, 200 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1197 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=166occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 65 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2179 NumberOfCodeBlocks, 2097 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 1877 ConstructedInterpolants, 0 QuantifiedInterpolants, 608453 SizeOfPredicates, 43 NumberOfNonLiveVariables, 1920 ConjunctsInSsa, 87 ConjunctsInUnsatCore, 20 InterpolantComputations, 2 PerfectInterpolantSequences, 16858/21046 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...