./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 54858612 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive-simple/fibo_7-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b2c28e4a28eb31322d66c263b5716511ec5353f2 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.2.0-5485861 [2020-10-25 23:11:32,334 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-25 23:11:32,338 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-25 23:11:32,399 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-25 23:11:32,400 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-25 23:11:32,406 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-25 23:11:32,410 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-25 23:11:32,418 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-25 23:11:32,422 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-25 23:11:32,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-25 23:11:32,432 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-25 23:11:32,438 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-25 23:11:32,439 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-25 23:11:32,443 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-25 23:11:32,446 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-25 23:11:32,448 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-25 23:11:32,450 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-25 23:11:32,453 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-25 23:11:32,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-25 23:11:32,476 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-25 23:11:32,478 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-25 23:11:32,480 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-25 23:11:32,482 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-25 23:11:32,485 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-25 23:11:32,495 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-25 23:11:32,495 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-25 23:11:32,496 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-25 23:11:32,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-25 23:11:32,499 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-25 23:11:32,500 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-25 23:11:32,500 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-25 23:11:32,501 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-25 23:11:32,503 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-25 23:11:32,504 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-25 23:11:32,505 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-25 23:11:32,506 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-25 23:11:32,507 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-25 23:11:32,507 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-25 23:11:32,508 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-25 23:11:32,510 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-25 23:11:32,511 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-25 23:11:32,513 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-25 23:11:32,570 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-25 23:11:32,571 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-25 23:11:32,574 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-25 23:11:32,575 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-25 23:11:32,575 INFO L138 SettingsManager]: * Use SBE=true [2020-10-25 23:11:32,576 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-25 23:11:32,576 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-25 23:11:32,576 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-25 23:11:32,577 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-25 23:11:32,577 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-25 23:11:32,578 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-25 23:11:32,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-25 23:11:32,579 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-25 23:11:32,580 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-25 23:11:32,580 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-25 23:11:32,580 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-25 23:11:32,581 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-25 23:11:32,581 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-25 23:11:32,581 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-25 23:11:32,582 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-25 23:11:32,582 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-25 23:11:32,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-25 23:11:32,583 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-25 23:11:32,583 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-25 23:11:32,584 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-25 23:11:32,584 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-25 23:11:32,584 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-25 23:11:32,585 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-25 23:11:32,585 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-25 23:11:32,585 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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(reach_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 -> b2c28e4a28eb31322d66c263b5716511ec5353f2 [2020-10-25 23:11:33,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-25 23:11:33,044 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-25 23:11:33,047 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-25 23:11:33,049 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-25 23:11:33,050 INFO L275 PluginConnector]: CDTParser initialized [2020-10-25 23:11:33,051 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/fibo_7-2.c [2020-10-25 23:11:33,132 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54ea3750d/3ca24841a39449dcafdde3546587c793/FLAGe5d5fa93c [2020-10-25 23:11:33,723 INFO L306 CDTParser]: Found 1 translation units. [2020-10-25 23:11:33,724 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/fibo_7-2.c [2020-10-25 23:11:33,732 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54ea3750d/3ca24841a39449dcafdde3546587c793/FLAGe5d5fa93c [2020-10-25 23:11:34,104 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54ea3750d/3ca24841a39449dcafdde3546587c793 [2020-10-25 23:11:34,107 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-25 23:11:34,113 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-25 23:11:34,117 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-25 23:11:34,117 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-25 23:11:34,121 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-25 23:11:34,122 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 11:11:34" (1/1) ... [2020-10-25 23:11:34,126 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13886dc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:11:34, skipping insertion in model container [2020-10-25 23:11:34,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.10 11:11:34" (1/1) ... [2020-10-25 23:11:34,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-25 23:11:34,159 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-25 23:11:34,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 23:11:34,324 INFO L203 MainTranslator]: Completed pre-run [2020-10-25 23:11:34,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-25 23:11:34,356 INFO L208 MainTranslator]: Completed translation [2020-10-25 23:11:34,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:11:34 WrapperNode [2020-10-25 23:11:34,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-25 23:11:34,358 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-25 23:11:34,358 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-25 23:11:34,359 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-25 23:11:34,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:11:34" (1/1) ... [2020-10-25 23:11:34,375 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:11:34" (1/1) ... [2020-10-25 23:11:34,393 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-25 23:11:34,395 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-25 23:11:34,395 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-25 23:11:34,395 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-25 23:11:34,409 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:11:34" (1/1) ... [2020-10-25 23:11:34,409 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:11:34" (1/1) ... [2020-10-25 23:11:34,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:11:34" (1/1) ... [2020-10-25 23:11:34,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:11:34" (1/1) ... [2020-10-25 23:11:34,415 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:11:34" (1/1) ... [2020-10-25 23:11:34,417 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:11:34" (1/1) ... [2020-10-25 23:11:34,418 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:11:34" (1/1) ... [2020-10-25 23:11:34,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-25 23:11:34,421 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-25 23:11:34,421 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-25 23:11:34,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-25 23:11:34,422 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:11:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-25 23:11:34,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-25 23:11:34,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-25 23:11:34,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-25 23:11:34,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-25 23:11:34,499 INFO L130 BoogieDeclarations]: Found specification of procedure fibo [2020-10-25 23:11:34,499 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo [2020-10-25 23:11:34,756 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-25 23:11:34,757 INFO L298 CfgBuilder]: Removed 6 assume(true) statements. [2020-10-25 23:11:34,759 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:11:34 BoogieIcfgContainer [2020-10-25 23:11:34,759 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-25 23:11:34,762 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-25 23:11:34,762 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-25 23:11:34,767 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-25 23:11:34,767 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.10 11:11:34" (1/3) ... [2020-10-25 23:11:34,769 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775b78bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 11:11:34, skipping insertion in model container [2020-10-25 23:11:34,769 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.10 11:11:34" (2/3) ... [2020-10-25 23:11:34,770 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@775b78bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.10 11:11:34, skipping insertion in model container [2020-10-25 23:11:34,770 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:11:34" (3/3) ... [2020-10-25 23:11:34,772 INFO L111 eAbstractionObserver]: Analyzing ICFG fibo_7-2.c [2020-10-25 23:11:34,811 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-25 23:11:34,819 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-10-25 23:11:34,860 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-10-25 23:11:34,904 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-25 23:11:34,905 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-25 23:11:34,905 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-25 23:11:34,906 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-25 23:11:34,906 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-25 23:11:34,906 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-25 23:11:34,907 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-25 23:11:34,907 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-25 23:11:34,930 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-10-25 23:11:34,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-25 23:11:34,937 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:11:34,938 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:11:34,939 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:11:34,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:11:34,948 INFO L82 PathProgramCache]: Analyzing trace with hash -730685886, now seen corresponding path program 1 times [2020-10-25 23:11:34,961 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:11:34,962 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189753382] [2020-10-25 23:11:34,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:11:35,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:35,353 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:11:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:35,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:11:35,441 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189753382] [2020-10-25 23:11:35,442 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:11:35,443 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 23:11:35,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594373144] [2020-10-25 23:11:35,450 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:11:35,451 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:11:35,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:11:35,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:11:35,478 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2020-10-25 23:11:35,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:11:35,568 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-10-25 23:11:35,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:11:35,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-10-25 23:11:35,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:11:35,584 INFO L225 Difference]: With dead ends: 35 [2020-10-25 23:11:35,585 INFO L226 Difference]: Without dead ends: 18 [2020-10-25 23:11:35,589 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:11:35,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-10-25 23:11:35,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-10-25 23:11:35,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-25 23:11:35,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-10-25 23:11:35,642 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2020-10-25 23:11:35,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:11:35,643 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-10-25 23:11:35,643 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:11:35,643 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-10-25 23:11:35,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-25 23:11:35,645 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:11:35,645 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:11:35,645 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-25 23:11:35,646 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:11:35,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:11:35,647 INFO L82 PathProgramCache]: Analyzing trace with hash -461623668, now seen corresponding path program 1 times [2020-10-25 23:11:35,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:11:35,647 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992473816] [2020-10-25 23:11:35,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:11:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:35,696 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:11:35,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:35,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-25 23:11:35,722 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992473816] [2020-10-25 23:11:35,723 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-25 23:11:35,723 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-25 23:11:35,723 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24341046] [2020-10-25 23:11:35,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-25 23:11:35,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:11:35,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-25 23:11:35,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:11:35,726 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 5 states. [2020-10-25 23:11:35,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:11:35,748 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-10-25 23:11:35,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-25 23:11:35,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2020-10-25 23:11:35,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:11:35,750 INFO L225 Difference]: With dead ends: 24 [2020-10-25 23:11:35,750 INFO L226 Difference]: Without dead ends: 20 [2020-10-25 23:11:35,751 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-25 23:11:35,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-10-25 23:11:35,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2020-10-25 23:11:35,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-10-25 23:11:35,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2020-10-25 23:11:35,759 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2020-10-25 23:11:35,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:11:35,759 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-10-25 23:11:35,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-25 23:11:35,760 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2020-10-25 23:11:35,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-25 23:11:35,761 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:11:35,761 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:11:35,761 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-25 23:11:35,762 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:11:35,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:11:35,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1253239047, now seen corresponding path program 1 times [2020-10-25 23:11:35,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:11:35,763 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658661813] [2020-10-25 23:11:35,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:11:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:35,816 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:11:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:35,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:35,927 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2020-10-25 23:11:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:35,948 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-25 23:11:35,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658661813] [2020-10-25 23:11:35,949 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937440438] [2020-10-25 23:11:35,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-25 23:11:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:36,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-25 23:11:36,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:11:36,156 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-25 23:11:36,157 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:11:36,157 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2020-10-25 23:11:36,158 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608965674] [2020-10-25 23:11:36,158 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-10-25 23:11:36,159 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:11:36,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-25 23:11:36,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-10-25 23:11:36,160 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand 9 states. [2020-10-25 23:11:36,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:11:36,296 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2020-10-25 23:11:36,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-25 23:11:36,297 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2020-10-25 23:11:36,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:11:36,299 INFO L225 Difference]: With dead ends: 35 [2020-10-25 23:11:36,299 INFO L226 Difference]: Without dead ends: 20 [2020-10-25 23:11:36,300 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2020-10-25 23:11:36,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2020-10-25 23:11:36,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2020-10-25 23:11:36,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-10-25 23:11:36,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2020-10-25 23:11:36,309 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2020-10-25 23:11:36,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:11:36,309 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2020-10-25 23:11:36,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-10-25 23:11:36,310 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2020-10-25 23:11:36,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-10-25 23:11:36,311 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:11:36,312 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:11:36,525 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-10-25 23:11:36,526 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:11:36,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:11:36,528 INFO L82 PathProgramCache]: Analyzing trace with hash 1685451365, now seen corresponding path program 1 times [2020-10-25 23:11:36,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:11:36,529 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949801884] [2020-10-25 23:11:36,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:11:36,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:36,588 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:11:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:36,702 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:36,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:36,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:36,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:36,754 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-25 23:11:36,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949801884] [2020-10-25 23:11:36,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604376214] [2020-10-25 23:11:36,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-25 23:11:36,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:36,804 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-25 23:11:36,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:11:36,873 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-10-25 23:11:36,873 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:11:36,874 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-25 23:11:36,874 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570429449] [2020-10-25 23:11:36,875 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-25 23:11:36,875 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:11:36,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-25 23:11:36,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-25 23:11:36,876 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand 7 states. [2020-10-25 23:11:36,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:11:36,975 INFO L93 Difference]: Finished difference Result 38 states and 52 transitions. [2020-10-25 23:11:36,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-25 23:11:36,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2020-10-25 23:11:36,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:11:36,979 INFO L225 Difference]: With dead ends: 38 [2020-10-25 23:11:36,979 INFO L226 Difference]: Without dead ends: 34 [2020-10-25 23:11:36,980 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-10-25 23:11:36,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-10-25 23:11:36,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2020-10-25 23:11:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-10-25 23:11:36,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2020-10-25 23:11:36,994 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 48 transitions. Word has length 24 [2020-10-25 23:11:36,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:11:36,995 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 48 transitions. [2020-10-25 23:11:36,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-25 23:11:36,995 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 48 transitions. [2020-10-25 23:11:37,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-10-25 23:11:37,001 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:11:37,001 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:11:37,202 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:11:37,203 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:11:37,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:11:37,204 INFO L82 PathProgramCache]: Analyzing trace with hash 228714308, now seen corresponding path program 2 times [2020-10-25 23:11:37,205 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:11:37,205 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597863790] [2020-10-25 23:11:37,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:11:37,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,244 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:11:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,295 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,363 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:37,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:37,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,396 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:37,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:37,431 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-10-25 23:11:37,432 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597863790] [2020-10-25 23:11:37,433 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052971106] [2020-10-25 23:11:37,433 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-25 23:11:37,498 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-25 23:11:37,498 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 23:11:37,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-25 23:11:37,503 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:11:37,648 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2020-10-25 23:11:37,649 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:11:37,649 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-10-25 23:11:37,649 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053904936] [2020-10-25 23:11:37,650 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-10-25 23:11:37,650 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:11:37,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-25 23:11:37,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-10-25 23:11:37,659 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. Second operand 12 states. [2020-10-25 23:11:37,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:11:37,913 INFO L93 Difference]: Finished difference Result 69 states and 106 transitions. [2020-10-25 23:11:37,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-10-25 23:11:37,914 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2020-10-25 23:11:37,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:11:37,916 INFO L225 Difference]: With dead ends: 69 [2020-10-25 23:11:37,916 INFO L226 Difference]: Without dead ends: 38 [2020-10-25 23:11:37,918 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2020-10-25 23:11:37,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-10-25 23:11:37,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2020-10-25 23:11:37,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2020-10-25 23:11:37,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2020-10-25 23:11:37,928 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 37 [2020-10-25 23:11:37,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:11:37,928 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2020-10-25 23:11:37,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-10-25 23:11:37,929 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2020-10-25 23:11:37,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-10-25 23:11:37,932 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:11:37,932 INFO L422 BasicCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:11:38,147 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:11:38,148 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:11:38,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:11:38,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1825869943, now seen corresponding path program 3 times [2020-10-25 23:11:38,150 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:11:38,151 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494952134] [2020-10-25 23:11:38,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:11:38,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:11:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,296 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:38,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:38,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,357 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,372 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:38,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,377 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:38,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,383 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:11:38,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,394 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,399 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:38,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:38,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,406 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:38,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:38,427 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 22 proven. 127 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2020-10-25 23:11:38,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494952134] [2020-10-25 23:11:38,428 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1131928467] [2020-10-25 23:11:38,428 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-25 23:11:38,482 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-10-25 23:11:38,482 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 23:11:38,483 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-25 23:11:38,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:11:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 89 proven. 32 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2020-10-25 23:11:38,552 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:11:38,552 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2020-10-25 23:11:38,553 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839982743] [2020-10-25 23:11:38,553 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-10-25 23:11:38,554 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:11:38,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-25 23:11:38,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2020-10-25 23:11:38,555 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 10 states. [2020-10-25 23:11:38,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:11:38,775 INFO L93 Difference]: Finished difference Result 94 states and 140 transitions. [2020-10-25 23:11:38,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-25 23:11:38,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2020-10-25 23:11:38,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:11:38,779 INFO L225 Difference]: With dead ends: 94 [2020-10-25 23:11:38,779 INFO L226 Difference]: Without dead ends: 90 [2020-10-25 23:11:38,781 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-10-25 23:11:38,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2020-10-25 23:11:38,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2020-10-25 23:11:38,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-10-25 23:11:38,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 124 transitions. [2020-10-25 23:11:38,804 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 124 transitions. Word has length 79 [2020-10-25 23:11:38,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:11:38,805 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 124 transitions. [2020-10-25 23:11:38,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-10-25 23:11:38,805 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 124 transitions. [2020-10-25 23:11:38,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2020-10-25 23:11:38,815 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:11:38,815 INFO L422 BasicCegarLoop]: trace histogram [29, 29, 23, 14, 14, 14, 14, 14, 14, 14, 9, 6, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:11:39,028 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:11:39,029 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:11:39,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:11:39,030 INFO L82 PathProgramCache]: Analyzing trace with hash -793137460, now seen corresponding path program 4 times [2020-10-25 23:11:39,031 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:11:39,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601447969] [2020-10-25 23:11:39,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:11:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,146 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:11:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,252 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:39,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,321 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,362 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:39,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,403 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:39,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,436 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,461 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,466 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,472 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:11:39,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,487 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,491 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,501 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:11:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,513 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,521 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,524 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,530 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,550 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-25 23:11:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,604 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,640 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,670 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:39,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,722 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,727 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:11:39,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,733 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:39,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,736 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:39,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,744 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:11:39,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,756 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:39,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:39,855 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 422 proven. 660 refuted. 0 times theorem prover too weak. 1159 trivial. 0 not checked. [2020-10-25 23:11:39,855 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601447969] [2020-10-25 23:11:39,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553999402] [2020-10-25 23:11:39,856 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-25 23:11:39,960 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-10-25 23:11:39,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 23:11:39,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-25 23:11:39,973 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:11:40,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2241 backedges. 103 proven. 653 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2020-10-25 23:11:40,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:11:40,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10] total 17 [2020-10-25 23:11:40,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528706794] [2020-10-25 23:11:40,109 INFO L461 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-10-25 23:11:40,109 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:11:40,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-10-25 23:11:40,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2020-10-25 23:11:40,110 INFO L87 Difference]: Start difference. First operand 84 states and 124 transitions. Second operand 17 states. [2020-10-25 23:11:40,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:11:40,811 INFO L93 Difference]: Finished difference Result 169 states and 322 transitions. [2020-10-25 23:11:40,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2020-10-25 23:11:40,812 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 201 [2020-10-25 23:11:40,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:11:40,816 INFO L225 Difference]: With dead ends: 169 [2020-10-25 23:11:40,816 INFO L226 Difference]: Without dead ends: 91 [2020-10-25 23:11:40,820 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=286, Invalid=974, Unknown=0, NotChecked=0, Total=1260 [2020-10-25 23:11:40,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2020-10-25 23:11:40,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 84. [2020-10-25 23:11:40,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2020-10-25 23:11:40,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 116 transitions. [2020-10-25 23:11:40,853 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 116 transitions. Word has length 201 [2020-10-25 23:11:40,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:11:40,856 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 116 transitions. [2020-10-25 23:11:40,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-10-25 23:11:40,856 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 116 transitions. [2020-10-25 23:11:40,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2020-10-25 23:11:40,871 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:11:40,872 INFO L422 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:11:41,074 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-10-25 23:11:41,075 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:11:41,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:11:41,076 INFO L82 PathProgramCache]: Analyzing trace with hash 207835975, now seen corresponding path program 5 times [2020-10-25 23:11:41,076 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:11:41,077 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930537888] [2020-10-25 23:11:41,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:11:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-10-25 23:11:41,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,543 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,579 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,605 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,626 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:41,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:11:41,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,700 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:41,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,712 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:11:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,721 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,732 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,738 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,757 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-25 23:11:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,776 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,781 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,785 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,794 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,797 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:41,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,800 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:11:41,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,807 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,811 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:41,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,834 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2020-10-25 23:11:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,949 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:41,979 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:42,006 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:42,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:42,114 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:42,119 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:42,124 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:42,129 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:11:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:42,142 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:42,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:42,145 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:42,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2020-10-25 23:11:42,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:42,159 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:42,165 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:42,168 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:42,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:42,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:42,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:42,183 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2020-10-25 23:11:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:42,196 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:42,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:42,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:42,212 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:42,216 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:42,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2020-10-25 23:11:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:42,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2020-10-25 23:11:42,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:42,226 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2020-10-25 23:11:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:42,230 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-10-25 23:11:42,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-25 23:11:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 921 proven. 1713 refuted. 0 times theorem prover too weak. 4486 trivial. 0 not checked. [2020-10-25 23:11:42,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930537888] [2020-10-25 23:11:42,485 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266851387] [2020-10-25 23:11:42,485 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2020-10-25 23:11:42,661 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 37 check-sat command(s) [2020-10-25 23:11:42,661 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-25 23:11:42,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 24 conjunts are in the unsatisfiable core [2020-10-25 23:11:42,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-25 23:11:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 1321 proven. 1303 refuted. 0 times theorem prover too weak. 4496 trivial. 0 not checked. [2020-10-25 23:11:42,924 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-25 23:11:42,924 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 21 [2020-10-25 23:11:42,924 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887255578] [2020-10-25 23:11:42,925 INFO L461 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-10-25 23:11:42,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-25 23:11:42,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-25 23:11:42,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2020-10-25 23:11:42,926 INFO L87 Difference]: Start difference. First operand 84 states and 116 transitions. Second operand 21 states. [2020-10-25 23:11:43,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-25 23:11:43,770 INFO L93 Difference]: Finished difference Result 192 states and 332 transitions. [2020-10-25 23:11:43,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2020-10-25 23:11:43,771 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 351 [2020-10-25 23:11:43,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-25 23:11:43,778 INFO L225 Difference]: With dead ends: 192 [2020-10-25 23:11:43,778 INFO L226 Difference]: Without dead ends: 119 [2020-10-25 23:11:43,781 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 493 GetRequests, 449 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=411, Invalid=1569, Unknown=0, NotChecked=0, Total=1980 [2020-10-25 23:11:43,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2020-10-25 23:11:43,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 102. [2020-10-25 23:11:43,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-10-25 23:11:43,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 143 transitions. [2020-10-25 23:11:43,804 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 143 transitions. Word has length 351 [2020-10-25 23:11:43,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-25 23:11:43,805 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 143 transitions. [2020-10-25 23:11:43,805 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-10-25 23:11:43,805 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 143 transitions. [2020-10-25 23:11:43,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2020-10-25 23:11:43,811 INFO L414 BasicCegarLoop]: Found error trace [2020-10-25 23:11:43,811 INFO L422 BasicCegarLoop]: trace histogram [41, 41, 33, 20, 20, 20, 20, 20, 20, 20, 13, 8, 1, 1, 1, 1, 1, 1, 1] [2020-10-25 23:11:44,025 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-25 23:11:44,026 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-25 23:11:44,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-25 23:11:44,027 INFO L82 PathProgramCache]: Analyzing trace with hash 196240028, now seen corresponding path program 6 times [2020-10-25 23:11:44,028 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-25 23:11:44,028 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774439630] [2020-10-25 23:11:44,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-25 23:11:44,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 23:11:44,083 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 23:11:44,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-25 23:11:44,134 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-25 23:11:44,217 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-25 23:11:44,218 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-25 23:11:44,218 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-25 23:11:44,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.10 11:11:44 BoogieIcfgContainer [2020-10-25 23:11:44,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-25 23:11:44,378 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-25 23:11:44,381 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-25 23:11:44,381 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-25 23:11:44,382 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.10 11:11:34" (3/4) ... [2020-10-25 23:11:44,386 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-10-25 23:11:44,573 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-10-25 23:11:44,574 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-25 23:11:44,576 INFO L168 Benchmark]: Toolchain (without parser) took 10466.44 ms. Allocated memory was 44.0 MB in the beginning and 241.2 MB in the end (delta: 197.1 MB). Free memory was 22.1 MB in the beginning and 131.9 MB in the end (delta: -109.8 MB). Peak memory consumption was 89.5 MB. Max. memory is 16.1 GB. [2020-10-25 23:11:44,577 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 44.0 MB. Free memory was 31.4 MB in the beginning and 31.3 MB in the end (delta: 45.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 23:11:44,578 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.79 ms. Allocated memory is still 44.0 MB. Free memory was 21.4 MB in the beginning and 21.6 MB in the end (delta: -152.6 kB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. [2020-10-25 23:11:44,578 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.44 ms. Allocated memory is still 44.0 MB. Free memory was 21.4 MB in the beginning and 20.1 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-10-25 23:11:44,579 INFO L168 Benchmark]: Boogie Preprocessor took 25.36 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 20.1 MB in the beginning and 39.9 MB in the end (delta: -19.8 MB). Peak memory consumption was 4.5 MB. Max. memory is 16.1 GB. [2020-10-25 23:11:44,579 INFO L168 Benchmark]: RCFGBuilder took 338.69 ms. Allocated memory is still 54.5 MB. Free memory was 39.7 MB in the beginning and 28.7 MB in the end (delta: 11.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-10-25 23:11:44,580 INFO L168 Benchmark]: TraceAbstraction took 9615.57 ms. Allocated memory was 54.5 MB in the beginning and 241.2 MB in the end (delta: 186.6 MB). Free memory was 28.3 MB in the beginning and 144.5 MB in the end (delta: -116.2 MB). Peak memory consumption was 71.1 MB. Max. memory is 16.1 GB. [2020-10-25 23:11:44,580 INFO L168 Benchmark]: Witness Printer took 196.11 ms. Allocated memory is still 241.2 MB. Free memory was 144.5 MB in the beginning and 131.9 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-10-25 23:11:44,583 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 44.0 MB. Free memory was 31.4 MB in the beginning and 31.3 MB in the end (delta: 45.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 240.79 ms. Allocated memory is still 44.0 MB. Free memory was 21.4 MB in the beginning and 21.6 MB in the end (delta: -152.6 kB). Peak memory consumption was 5.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 35.44 ms. Allocated memory is still 44.0 MB. Free memory was 21.4 MB in the beginning and 20.1 MB in the end (delta: 1.3 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 25.36 ms. Allocated memory was 44.0 MB in the beginning and 54.5 MB in the end (delta: 10.5 MB). Free memory was 20.1 MB in the beginning and 39.9 MB in the end (delta: -19.8 MB). Peak memory consumption was 4.5 MB. Max. memory is 16.1 GB. * RCFGBuilder took 338.69 ms. Allocated memory is still 54.5 MB. Free memory was 39.7 MB in the beginning and 28.7 MB in the end (delta: 11.1 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9615.57 ms. Allocated memory was 54.5 MB in the beginning and 241.2 MB in the end (delta: 186.6 MB). Free memory was 28.3 MB in the beginning and 144.5 MB in the end (delta: -116.2 MB). Peak memory consumption was 71.1 MB. Max. memory is 16.1 GB. * Witness Printer took 196.11 ms. Allocated memory is still 241.2 MB. Free memory was 144.5 MB in the beginning and 131.9 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = 7; [L27] CALL, EXPR fibo(x) VAL [\old(n)=7] [L8] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L10] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=6] [L8] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L10] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=6, fibo(n-1)=5, n=6] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=6, fibo(n-1)=5, fibo(n-2)=3, n=6] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=7, fibo(n-1)=8, n=7] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=4] [L8] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L10] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=4, fibo(n-1)=2, n=4] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=4, fibo(n-1)=2, fibo(n-2)=1, n=4] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=5, fibo(n-1)=3, n=5] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-1) VAL [\old(n)=2, fibo(n-1)=1, n=2] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=2, fibo(n-1)=1, fibo(n-2)=0, n=2] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-1) VAL [\old(n)=3, fibo(n-1)=1, n=3] [L13] CALL, EXPR fibo(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo(n-2) VAL [\old(n)=3, fibo(n-1)=1, fibo(n-2)=1, n=3] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=5, fibo(n-1)=3, fibo(n-2)=2, n=5] [L13] return fibo(n-1) + fibo(n-2); [L13] RET, EXPR fibo(n-2) VAL [\old(n)=7, fibo(n-1)=8, fibo(n-2)=5, n=7] [L13] return fibo(n-1) + fibo(n-2); [L27] RET, EXPR fibo(x) [L27] int result = fibo(x); [L28] COND TRUE result == 13 [L4] __assert_fail("0", "fibo_7-2.c", 4, "reach_error") - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.3s, OverallIterations: 9, TraceHistogramMax: 51, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 166 SDtfs, 458 SDslu, 528 SDs, 0 SdLazy, 1090 SolverSat, 426 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1052 GetRequests, 919 SyntacticMatches, 2 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=102occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 32 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1734 NumberOfCodeBlocks, 1642 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 1437 ConstructedInterpolants, 0 QuantifiedInterpolants, 520807 SizeOfPredicates, 33 NumberOfNonLiveVariables, 1484 ConjunctsInSsa, 66 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 14921/19458 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...