java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_5-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 03:05:01,566 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 03:05:01,569 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 03:05:01,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 03:05:01,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 03:05:01,589 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 03:05:01,591 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 03:05:01,604 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 03:05:01,606 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 03:05:01,607 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 03:05:01,610 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 03:05:01,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 03:05:01,612 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 03:05:01,613 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 03:05:01,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 03:05:01,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 03:05:01,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 03:05:01,619 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 03:05:01,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 03:05:01,623 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 03:05:01,624 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 03:05:01,625 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 03:05:01,626 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 03:05:01,627 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 03:05:01,629 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 03:05:01,629 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 03:05:01,629 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 03:05:01,630 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 03:05:01,630 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 03:05:01,631 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 03:05:01,631 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 03:05:01,632 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 03:05:01,633 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 03:05:01,634 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 03:05:01,634 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 03:05:01,635 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 03:05:01,635 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 03:05:01,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 03:05:01,636 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 03:05:01,637 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 03:05:01,637 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 03:05:01,638 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 03:05:01,652 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 03:05:01,652 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 03:05:01,653 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 03:05:01,653 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 03:05:01,653 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 03:05:01,654 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 03:05:01,654 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 03:05:01,654 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 03:05:01,654 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 03:05:01,654 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 03:05:01,655 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 03:05:01,655 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 03:05:01,655 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 03:05:01,656 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 03:05:01,656 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 03:05:01,656 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 03:05:01,656 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 03:05:01,656 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 03:05:01,657 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 03:05:01,657 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 03:05:01,657 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 03:05:01,657 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 03:05:01,657 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 03:05:01,658 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 03:05:01,658 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 03:05:01,658 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 03:05:01,658 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 03:05:01,658 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 03:05:01,659 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 03:05:01,659 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 03:05:01,687 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 03:05:01,699 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 03:05:01,703 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 03:05:01,704 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 03:05:01,705 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 03:05:01,705 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/fibo_2calls_5-2.c [2019-09-10 03:05:01,764 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/909a590bf/e12e72e18b354479ada503a353f135f7/FLAG341be2956 [2019-09-10 03:05:02,194 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 03:05:02,195 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/fibo_2calls_5-2.c [2019-09-10 03:05:02,204 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/909a590bf/e12e72e18b354479ada503a353f135f7/FLAG341be2956 [2019-09-10 03:05:02,590 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/909a590bf/e12e72e18b354479ada503a353f135f7 [2019-09-10 03:05:02,598 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 03:05:02,600 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 03:05:02,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 03:05:02,601 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 03:05:02,604 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 03:05:02,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:05:02" (1/1) ... [2019-09-10 03:05:02,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57728f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:02, skipping insertion in model container [2019-09-10 03:05:02,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 03:05:02" (1/1) ... [2019-09-10 03:05:02,615 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 03:05:02,634 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 03:05:02,791 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:05:02,795 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 03:05:02,810 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 03:05:02,821 INFO L192 MainTranslator]: Completed translation [2019-09-10 03:05:02,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:02 WrapperNode [2019-09-10 03:05:02,822 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 03:05:02,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 03:05:02,822 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 03:05:02,822 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 03:05:02,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:02" (1/1) ... [2019-09-10 03:05:02,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:02" (1/1) ... [2019-09-10 03:05:02,918 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:02" (1/1) ... [2019-09-10 03:05:02,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:02" (1/1) ... [2019-09-10 03:05:02,922 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:02" (1/1) ... [2019-09-10 03:05:02,924 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:02" (1/1) ... [2019-09-10 03:05:02,925 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:02" (1/1) ... [2019-09-10 03:05:02,926 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 03:05:02,927 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 03:05:02,927 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 03:05:02,927 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 03:05:02,928 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:02" (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 [2019-09-10 03:05:02,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 03:05:02,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 03:05:02,982 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo1 [2019-09-10 03:05:02,982 INFO L138 BoogieDeclarations]: Found implementation of procedure fibo2 [2019-09-10 03:05:02,983 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 03:05:02,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 03:05:02,983 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 03:05:02,983 INFO L130 BoogieDeclarations]: Found specification of procedure fibo1 [2019-09-10 03:05:02,983 INFO L130 BoogieDeclarations]: Found specification of procedure fibo2 [2019-09-10 03:05:02,983 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 03:05:02,983 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 03:05:02,984 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 03:05:03,167 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 03:05:03,168 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 03:05:03,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:05:03 BoogieIcfgContainer [2019-09-10 03:05:03,170 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 03:05:03,170 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 03:05:03,171 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 03:05:03,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 03:05:03,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 03:05:02" (1/3) ... [2019-09-10 03:05:03,181 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6246e764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:05:03, skipping insertion in model container [2019-09-10 03:05:03,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 03:05:02" (2/3) ... [2019-09-10 03:05:03,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6246e764 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 03:05:03, skipping insertion in model container [2019-09-10 03:05:03,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 03:05:03" (3/3) ... [2019-09-10 03:05:03,198 INFO L109 eAbstractionObserver]: Analyzing ICFG fibo_2calls_5-2.c [2019-09-10 03:05:03,229 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 03:05:03,245 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 03:05:03,285 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 03:05:03,317 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 03:05:03,318 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 03:05:03,318 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 03:05:03,318 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 03:05:03,318 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 03:05:03,318 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 03:05:03,319 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 03:05:03,319 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 03:05:03,334 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-09-10 03:05:03,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 03:05:03,345 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:03,346 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:03,348 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:03,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:03,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1464461757, now seen corresponding path program 1 times [2019-09-10 03:05:03,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:03,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:03,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:03,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:03,392 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:03,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:03,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:05:03,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:05:03,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:05:03,507 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:05:03,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:05:03,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:05:03,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:05:03,524 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 5 states. [2019-09-10 03:05:03,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:03,642 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2019-09-10 03:05:03,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:05:03,644 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-10 03:05:03,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:03,655 INFO L225 Difference]: With dead ends: 35 [2019-09-10 03:05:03,655 INFO L226 Difference]: Without dead ends: 30 [2019-09-10 03:05:03,657 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:05:03,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-09-10 03:05:03,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-09-10 03:05:03,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 03:05:03,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-09-10 03:05:03,718 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 13 [2019-09-10 03:05:03,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:03,718 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-09-10 03:05:03,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:05:03,718 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-09-10 03:05:03,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 03:05:03,720 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:03,721 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:03,721 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:03,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:03,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1134800479, now seen corresponding path program 1 times [2019-09-10 03:05:03,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:03,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:03,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:03,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:03,723 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:03,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:03,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 03:05:03,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 03:05:03,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 03:05:03,777 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:05:03,779 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 03:05:03,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 03:05:03,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 03:05:03,780 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2019-09-10 03:05:03,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:03,873 INFO L93 Difference]: Finished difference Result 32 states and 40 transitions. [2019-09-10 03:05:03,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 03:05:03,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-10 03:05:03,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:03,876 INFO L225 Difference]: With dead ends: 32 [2019-09-10 03:05:03,876 INFO L226 Difference]: Without dead ends: 32 [2019-09-10 03:05:03,879 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 03:05:03,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-10 03:05:03,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-09-10 03:05:03,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-09-10 03:05:03,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-09-10 03:05:03,893 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 14 [2019-09-10 03:05:03,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:03,894 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-09-10 03:05:03,894 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 03:05:03,894 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-09-10 03:05:03,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-10 03:05:03,896 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:03,896 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:03,896 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:03,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:03,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1592795560, now seen corresponding path program 1 times [2019-09-10 03:05:03,897 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:03,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:03,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:03,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:03,899 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:03,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:03,994 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 03:05:03,995 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:03,995 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:03,996 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2019-09-10 03:05:03,998 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [31], [32], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [56], [57], [58], [59] [2019-09-10 03:05:04,034 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:05:04,034 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:05:04,113 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:05:04,114 INFO L272 AbstractInterpreter]: Visited 12 different actions 12 times. Never merged. Never widened. Performed 8 root evaluator evaluations with a maximum evaluation depth of 3. Performed 8 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2019-09-10 03:05:04,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:04,119 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:05:04,163 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 50% of their original sizes. [2019-09-10 03:05:04,164 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:05:04,201 INFO L420 sIntCurrentIteration]: We unified 25 AI predicates to 25 [2019-09-10 03:05:04,201 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:05:04,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:05:04,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2019-09-10 03:05:04,203 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:05:04,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 03:05:04,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 03:05:04,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-10 03:05:04,204 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 7 states. [2019-09-10 03:05:04,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:04,452 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2019-09-10 03:05:04,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 03:05:04,452 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-09-10 03:05:04,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:04,454 INFO L225 Difference]: With dead ends: 48 [2019-09-10 03:05:04,454 INFO L226 Difference]: Without dead ends: 48 [2019-09-10 03:05:04,455 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:05:04,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-09-10 03:05:04,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-09-10 03:05:04,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-10 03:05:04,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2019-09-10 03:05:04,464 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 26 [2019-09-10 03:05:04,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:04,465 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2019-09-10 03:05:04,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 03:05:04,465 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2019-09-10 03:05:04,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-09-10 03:05:04,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:04,467 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:04,468 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:04,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:04,468 INFO L82 PathProgramCache]: Analyzing trace with hash 986908919, now seen corresponding path program 1 times [2019-09-10 03:05:04,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:04,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:04,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:04,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:04,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:04,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:04,575 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 03:05:04,575 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:04,575 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:04,576 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 40 with the following transitions: [2019-09-10 03:05:04,576 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [26], [28], [30], [31], [32], [35], [36], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2019-09-10 03:05:04,580 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:05:04,580 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:05:04,603 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:05:04,604 INFO L272 AbstractInterpreter]: Visited 16 different actions 30 times. Never merged. Never widened. Performed 26 root evaluator evaluations with a maximum evaluation depth of 3. Performed 26 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2019-09-10 03:05:04,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:04,604 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:05:04,640 INFO L227 lantSequenceWeakener]: Weakened 7 states. On average, predicates are now at 50% of their original sizes. [2019-09-10 03:05:04,641 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:05:04,715 INFO L420 sIntCurrentIteration]: We unified 38 AI predicates to 38 [2019-09-10 03:05:04,715 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:05:04,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:05:04,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [6] total 13 [2019-09-10 03:05:04,715 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:05:04,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:05:04,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:05:04,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 03:05:04,718 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand 9 states. [2019-09-10 03:05:04,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:04,973 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2019-09-10 03:05:04,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 03:05:04,974 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2019-09-10 03:05:04,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:04,975 INFO L225 Difference]: With dead ends: 55 [2019-09-10 03:05:04,975 INFO L226 Difference]: Without dead ends: 55 [2019-09-10 03:05:04,976 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 03:05:04,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-09-10 03:05:04,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2019-09-10 03:05:04,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-09-10 03:05:04,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 64 transitions. [2019-09-10 03:05:04,984 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 64 transitions. Word has length 39 [2019-09-10 03:05:04,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:04,984 INFO L475 AbstractCegarLoop]: Abstraction has 55 states and 64 transitions. [2019-09-10 03:05:04,985 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:05:04,985 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 64 transitions. [2019-09-10 03:05:04,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-09-10 03:05:04,987 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:04,987 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:04,987 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:04,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:04,988 INFO L82 PathProgramCache]: Analyzing trace with hash -209212298, now seen corresponding path program 2 times [2019-09-10 03:05:04,988 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:04,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:04,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:04,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:04,989 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:05,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-09-10 03:05:05,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:05,055 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:05,056 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:05:05,057 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:05:05,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:05,058 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:05:05,076 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:05:05,077 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:05:05,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 03:05:05,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:05:05,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 03:05:05,129 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:05:05,255 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 03:05:05,256 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:05:05,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:05,599 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:05,676 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-10 03:05:05,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:05:05,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 15 [2019-09-10 03:05:05,682 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:05:05,683 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 03:05:05,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 03:05:05,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-09-10 03:05:05,684 INFO L87 Difference]: Start difference. First operand 55 states and 64 transitions. Second operand 11 states. [2019-09-10 03:05:05,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:05,999 INFO L93 Difference]: Finished difference Result 84 states and 117 transitions. [2019-09-10 03:05:06,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-10 03:05:06,002 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-09-10 03:05:06,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:06,004 INFO L225 Difference]: With dead ends: 84 [2019-09-10 03:05:06,004 INFO L226 Difference]: Without dead ends: 76 [2019-09-10 03:05:06,005 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 92 SyntacticMatches, 7 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2019-09-10 03:05:06,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-09-10 03:05:06,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 59. [2019-09-10 03:05:06,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2019-09-10 03:05:06,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 70 transitions. [2019-09-10 03:05:06,027 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 70 transitions. Word has length 52 [2019-09-10 03:05:06,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:06,028 INFO L475 AbstractCegarLoop]: Abstraction has 59 states and 70 transitions. [2019-09-10 03:05:06,028 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 03:05:06,028 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2019-09-10 03:05:06,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-10 03:05:06,036 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:06,036 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:06,037 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:06,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:06,038 INFO L82 PathProgramCache]: Analyzing trace with hash -242988780, now seen corresponding path program 1 times [2019-09-10 03:05:06,038 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:06,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:06,042 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:05:06,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:06,042 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:06,166 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 12 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-10 03:05:06,167 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:06,167 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:06,167 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 56 with the following transitions: [2019-09-10 03:05:06,168 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2019-09-10 03:05:06,170 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:05:06,170 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:05:06,187 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 03:05:06,188 INFO L272 AbstractInterpreter]: Visited 21 different actions 38 times. Never merged. Never widened. Performed 34 root evaluator evaluations with a maximum evaluation depth of 3. Performed 34 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2019-09-10 03:05:06,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:06,188 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 03:05:06,214 INFO L227 lantSequenceWeakener]: Weakened 11 states. On average, predicates are now at 50% of their original sizes. [2019-09-10 03:05:06,215 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 03:05:06,264 INFO L420 sIntCurrentIteration]: We unified 54 AI predicates to 54 [2019-09-10 03:05:06,264 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 03:05:06,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 03:05:06,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [8] total 17 [2019-09-10 03:05:06,265 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:05:06,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 03:05:06,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 03:05:06,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-09-10 03:05:06,266 INFO L87 Difference]: Start difference. First operand 59 states and 70 transitions. Second operand 11 states. [2019-09-10 03:05:06,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:06,641 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2019-09-10 03:05:06,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 03:05:06,641 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 55 [2019-09-10 03:05:06,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:06,643 INFO L225 Difference]: With dead ends: 68 [2019-09-10 03:05:06,643 INFO L226 Difference]: Without dead ends: 68 [2019-09-10 03:05:06,644 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 03:05:06,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-10 03:05:06,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-09-10 03:05:06,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-10 03:05:06,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 82 transitions. [2019-09-10 03:05:06,652 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 82 transitions. Word has length 55 [2019-09-10 03:05:06,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:06,653 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 82 transitions. [2019-09-10 03:05:06,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 03:05:06,653 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 82 transitions. [2019-09-10 03:05:06,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-10 03:05:06,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:06,662 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:06,662 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:06,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:06,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1768644787, now seen corresponding path program 1 times [2019-09-10 03:05:06,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:06,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:06,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:06,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:06,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:06,763 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 26 proven. 15 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-10 03:05:06,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:06,764 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:06,764 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 68 with the following transitions: [2019-09-10 03:05:06,764 INFO L207 CegarAbsIntRunner]: [0], [4], [6], [9], [11], [18], [21], [22], [25], [26], [28], [30], [31], [32], [35], [36], [39], [40], [42], [44], [45], [46], [47], [48], [50], [51], [52], [53], [54], [55], [56], [57], [58], [59] [2019-09-10 03:05:06,766 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 03:05:06,766 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 03:05:06,790 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 03:05:06,790 INFO L272 AbstractInterpreter]: Visited 34 different actions 136 times. Never merged. Never widened. Performed 133 root evaluator evaluations with a maximum evaluation depth of 3. Performed 133 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 5 variables. [2019-09-10 03:05:06,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:06,791 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 03:05:06,791 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:06,791 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:05:06,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:06,806 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:05:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:06,836 INFO L256 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-10 03:05:06,840 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:05:06,883 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-10 03:05:06,884 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:05:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 16 proven. 15 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-09-10 03:05:07,155 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 03:05:07,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [8, 6] total 12 [2019-09-10 03:05:07,156 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 03:05:07,156 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 03:05:07,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 03:05:07,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-09-10 03:05:07,157 INFO L87 Difference]: Start difference. First operand 68 states and 82 transitions. Second operand 6 states. [2019-09-10 03:05:07,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:07,219 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2019-09-10 03:05:07,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 03:05:07,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-09-10 03:05:07,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:07,221 INFO L225 Difference]: With dead ends: 70 [2019-09-10 03:05:07,221 INFO L226 Difference]: Without dead ends: 70 [2019-09-10 03:05:07,221 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 128 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-09-10 03:05:07,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-09-10 03:05:07,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2019-09-10 03:05:07,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-10 03:05:07,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 80 transitions. [2019-09-10 03:05:07,241 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 80 transitions. Word has length 67 [2019-09-10 03:05:07,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:07,244 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 80 transitions. [2019-09-10 03:05:07,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 03:05:07,245 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 80 transitions. [2019-09-10 03:05:07,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 03:05:07,249 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:07,250 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:07,250 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:07,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:07,250 INFO L82 PathProgramCache]: Analyzing trace with hash -306833031, now seen corresponding path program 2 times [2019-09-10 03:05:07,251 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:07,252 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:07,252 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:07,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:07,253 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:07,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:07,366 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 27 proven. 16 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-09-10 03:05:07,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:07,369 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:07,369 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:05:07,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:05:07,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:07,370 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:05:07,396 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:05:07,396 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 03:05:07,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-09-10 03:05:07,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:05:07,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 03:05:07,422 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:05:07,473 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-10 03:05:07,473 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:05:07,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:07,646 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 8 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2019-09-10 03:05:07,649 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:05:07,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 13 [2019-09-10 03:05:07,650 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:05:07,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 03:05:07,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 03:05:07,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-09-10 03:05:07,651 INFO L87 Difference]: Start difference. First operand 68 states and 80 transitions. Second operand 10 states. [2019-09-10 03:05:07,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:07,833 INFO L93 Difference]: Finished difference Result 111 states and 164 transitions. [2019-09-10 03:05:07,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 03:05:07,839 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2019-09-10 03:05:07,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:07,841 INFO L225 Difference]: With dead ends: 111 [2019-09-10 03:05:07,841 INFO L226 Difference]: Without dead ends: 100 [2019-09-10 03:05:07,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 129 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-09-10 03:05:07,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-09-10 03:05:07,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 72. [2019-09-10 03:05:07,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-10 03:05:07,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2019-09-10 03:05:07,859 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 68 [2019-09-10 03:05:07,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:07,860 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2019-09-10 03:05:07,860 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 03:05:07,860 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2019-09-10 03:05:07,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 03:05:07,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:07,864 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:07,864 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:07,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:07,864 INFO L82 PathProgramCache]: Analyzing trace with hash -8150203, now seen corresponding path program 3 times [2019-09-10 03:05:07,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:07,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:07,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:05:07,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:07,866 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:08,005 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 29 proven. 57 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-10 03:05:08,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:08,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:08,006 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:05:08,006 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:05:08,006 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:08,006 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:05:08,019 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:05:08,019 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:05:08,044 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:05:08,044 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:05:08,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 03:05:08,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:05:08,068 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 29 proven. 57 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-10 03:05:08,068 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:05:08,406 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:08,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:08,526 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:08,585 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 29 proven. 61 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-09-10 03:05:08,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:05:08,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 13 [2019-09-10 03:05:08,595 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:05:08,596 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 03:05:08,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 03:05:08,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-09-10 03:05:08,596 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand 9 states. [2019-09-10 03:05:08,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:08,752 INFO L93 Difference]: Finished difference Result 108 states and 158 transitions. [2019-09-10 03:05:08,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 03:05:08,753 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2019-09-10 03:05:08,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:08,755 INFO L225 Difference]: With dead ends: 108 [2019-09-10 03:05:08,755 INFO L226 Difference]: Without dead ends: 95 [2019-09-10 03:05:08,756 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 178 SyntacticMatches, 9 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-09-10 03:05:08,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-09-10 03:05:08,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 72. [2019-09-10 03:05:08,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-10 03:05:08,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 88 transitions. [2019-09-10 03:05:08,767 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 88 transitions. Word has length 94 [2019-09-10 03:05:08,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:08,768 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 88 transitions. [2019-09-10 03:05:08,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 03:05:08,768 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2019-09-10 03:05:08,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 03:05:08,770 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:08,770 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:08,770 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:08,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:08,771 INFO L82 PathProgramCache]: Analyzing trace with hash -46122593, now seen corresponding path program 4 times [2019-09-10 03:05:08,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:08,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:08,772 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:05:08,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:08,772 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:08,941 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 57 proven. 59 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-09-10 03:05:08,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:08,941 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:08,942 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:05:08,942 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:05:08,942 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:08,942 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:05:08,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:08,953 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 03:05:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:08,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 03:05:08,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:05:09,045 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 15 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-10 03:05:09,045 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:05:09,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:09,330 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:09,420 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 58 proven. 17 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-09-10 03:05:09,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:05:09,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 9] total 20 [2019-09-10 03:05:09,424 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:05:09,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 03:05:09,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 03:05:09,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-09-10 03:05:09,426 INFO L87 Difference]: Start difference. First operand 72 states and 88 transitions. Second operand 17 states. [2019-09-10 03:05:10,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:10,093 INFO L93 Difference]: Finished difference Result 128 states and 190 transitions. [2019-09-10 03:05:10,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-10 03:05:10,094 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 95 [2019-09-10 03:05:10,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:10,096 INFO L225 Difference]: With dead ends: 128 [2019-09-10 03:05:10,096 INFO L226 Difference]: Without dead ends: 127 [2019-09-10 03:05:10,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 179 SyntacticMatches, 7 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=877, Unknown=0, NotChecked=0, Total=1056 [2019-09-10 03:05:10,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-09-10 03:05:10,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-09-10 03:05:10,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-09-10 03:05:10,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 164 transitions. [2019-09-10 03:05:10,109 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 164 transitions. Word has length 95 [2019-09-10 03:05:10,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:10,110 INFO L475 AbstractCegarLoop]: Abstraction has 115 states and 164 transitions. [2019-09-10 03:05:10,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-10 03:05:10,110 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 164 transitions. [2019-09-10 03:05:10,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-10 03:05:10,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:10,113 INFO L399 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 7, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:10,113 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:10,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:10,113 INFO L82 PathProgramCache]: Analyzing trace with hash -805378184, now seen corresponding path program 5 times [2019-09-10 03:05:10,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:10,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:10,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 03:05:10,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:10,115 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:10,261 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 104 proven. 27 refuted. 0 times theorem prover too weak. 314 trivial. 0 not checked. [2019-09-10 03:05:10,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:10,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:10,262 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:05:10,262 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:05:10,262 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:10,262 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 03:05:10,285 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 03:05:10,286 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:05:10,309 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-10 03:05:10,309 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:05:10,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 03:05:10,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:05:10,381 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 121 proven. 4 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-09-10 03:05:10,382 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:05:10,722 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 121 proven. 4 refuted. 0 times theorem prover too weak. 320 trivial. 0 not checked. [2019-09-10 03:05:10,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:05:10,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 7, 7] total 17 [2019-09-10 03:05:10,726 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:05:10,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 03:05:10,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 03:05:10,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-09-10 03:05:10,728 INFO L87 Difference]: Start difference. First operand 115 states and 164 transitions. Second operand 15 states. [2019-09-10 03:05:11,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:11,124 INFO L93 Difference]: Finished difference Result 144 states and 211 transitions. [2019-09-10 03:05:11,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-10 03:05:11,125 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 137 [2019-09-10 03:05:11,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:11,127 INFO L225 Difference]: With dead ends: 144 [2019-09-10 03:05:11,127 INFO L226 Difference]: Without dead ends: 140 [2019-09-10 03:05:11,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 264 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=126, Invalid=576, Unknown=0, NotChecked=0, Total=702 [2019-09-10 03:05:11,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-10 03:05:11,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 137. [2019-09-10 03:05:11,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-09-10 03:05:11,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 202 transitions. [2019-09-10 03:05:11,140 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 202 transitions. Word has length 137 [2019-09-10 03:05:11,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:11,140 INFO L475 AbstractCegarLoop]: Abstraction has 137 states and 202 transitions. [2019-09-10 03:05:11,140 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 03:05:11,141 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 202 transitions. [2019-09-10 03:05:11,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 03:05:11,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:11,143 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:11,143 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:11,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:11,144 INFO L82 PathProgramCache]: Analyzing trace with hash 235412830, now seen corresponding path program 6 times [2019-09-10 03:05:11,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:11,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:11,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:05:11,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:11,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 03:05:11,210 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 63 proven. 19 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2019-09-10 03:05:11,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:11,211 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 03:05:11,211 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 03:05:11,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 03:05:11,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 03:05:11,212 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 03:05:11,226 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 03:05:11,226 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 03:05:11,259 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 03:05:11,260 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 03:05:11,260 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 03:05:11,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 03:05:11,277 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 63 proven. 19 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2019-09-10 03:05:11,277 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 03:05:11,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:11,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 03:05:11,613 INFO L134 CoverageAnalysis]: Checked inductivity of 257 backedges. 63 proven. 20 refuted. 0 times theorem prover too weak. 174 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (8)] Exception during sending of exit command (exit): Stream Closed [2019-09-10 03:05:11,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 03:05:11,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 11 [2019-09-10 03:05:11,617 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 03:05:11,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 03:05:11,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 03:05:11,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-09-10 03:05:11,618 INFO L87 Difference]: Start difference. First operand 137 states and 202 transitions. Second operand 8 states. [2019-09-10 03:05:11,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 03:05:11,729 INFO L93 Difference]: Finished difference Result 172 states and 285 transitions. [2019-09-10 03:05:11,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 03:05:11,729 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 108 [2019-09-10 03:05:11,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 03:05:11,732 INFO L225 Difference]: With dead ends: 172 [2019-09-10 03:05:11,732 INFO L226 Difference]: Without dead ends: 169 [2019-09-10 03:05:11,732 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 208 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-09-10 03:05:11,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2019-09-10 03:05:11,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 140. [2019-09-10 03:05:11,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-10 03:05:11,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 209 transitions. [2019-09-10 03:05:11,745 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 209 transitions. Word has length 108 [2019-09-10 03:05:11,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 03:05:11,745 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 209 transitions. [2019-09-10 03:05:11,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 03:05:11,746 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 209 transitions. [2019-09-10 03:05:11,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 03:05:11,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 03:05:11,748 INFO L399 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 6, 6, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 03:05:11,748 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 03:05:11,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 03:05:11,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1540036056, now seen corresponding path program 7 times [2019-09-10 03:05:11,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 03:05:11,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:11,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 03:05:11,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 03:05:11,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 03:05:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 03:05:11,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 03:05:11,798 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-10 03:05:11,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 03:05:11 BoogieIcfgContainer [2019-09-10 03:05:11,832 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 03:05:11,834 INFO L168 Benchmark]: Toolchain (without parser) took 9233.82 ms. Allocated memory was 134.2 MB in the beginning and 335.0 MB in the end (delta: 200.8 MB). Free memory was 90.1 MB in the beginning and 87.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 203.4 MB. Max. memory is 7.1 GB. [2019-09-10 03:05:11,835 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 134.2 MB. Free memory was 108.6 MB in the beginning and 108.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 03:05:11,836 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.41 ms. Allocated memory is still 134.2 MB. Free memory was 89.8 MB in the beginning and 80.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2019-09-10 03:05:11,837 INFO L168 Benchmark]: Boogie Preprocessor took 104.38 ms. Allocated memory was 134.2 MB in the beginning and 200.8 MB in the end (delta: 66.6 MB). Free memory was 80.4 MB in the beginning and 177.7 MB in the end (delta: -97.3 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. [2019-09-10 03:05:11,838 INFO L168 Benchmark]: RCFGBuilder took 242.66 ms. Allocated memory is still 200.8 MB. Free memory was 177.7 MB in the beginning and 165.3 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2019-09-10 03:05:11,839 INFO L168 Benchmark]: TraceAbstraction took 8661.58 ms. Allocated memory was 200.8 MB in the beginning and 335.0 MB in the end (delta: 134.2 MB). Free memory was 164.7 MB in the beginning and 87.5 MB in the end (delta: 77.2 MB). Peak memory consumption was 211.4 MB. Max. memory is 7.1 GB. [2019-09-10 03:05:11,842 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 134.2 MB. Free memory was 108.6 MB in the beginning and 108.4 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 221.41 ms. Allocated memory is still 134.2 MB. Free memory was 89.8 MB in the beginning and 80.4 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 104.38 ms. Allocated memory was 134.2 MB in the beginning and 200.8 MB in the end (delta: 66.6 MB). Free memory was 80.4 MB in the beginning and 177.7 MB in the end (delta: -97.3 MB). Peak memory consumption was 16.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 242.66 ms. Allocated memory is still 200.8 MB. Free memory was 177.7 MB in the beginning and 165.3 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8661.58 ms. Allocated memory was 200.8 MB in the beginning and 335.0 MB in the end (delta: 134.2 MB). Free memory was 164.7 MB in the beginning and 87.5 MB in the end (delta: 77.2 MB). Peak memory consumption was 211.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 39]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L36] int x = 5; VAL [x=5] [L37] CALL, EXPR fibo1(x) VAL [\old(n)=5] [L8] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L10] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=4] [L18] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L20] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=3] [L8] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L10] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=2] [L18] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L20] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=2, fibo1(n-1)=1, n=2] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=0] [L8] COND TRUE n < 1 [L9] return 0; VAL [\old(n)=0, \result=0, n=0] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=2, fibo1(n-1)=1, fibo1(n-2)=0, n=2] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=3, fibo2(n-1)=1, n=3] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=3, fibo2(n-1)=1, fibo2(n-2)=1, n=3] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=4, fibo1(n-1)=2, n=4] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=4, fibo1(n-1)=2, fibo1(n-2)=1, n=4] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=5, fibo2(n-1)=3, n=5] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=3] [L18] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L20] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L23] CALL, EXPR fibo1(n-1) VAL [\old(n)=2] [L8] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L10] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L13] CALL, EXPR fibo2(n-1) VAL [\old(n)=1] [L18] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L20] COND TRUE n == 1 [L21] return 1; VAL [\old(n)=1, \result=1, n=1] [L13] RET, EXPR fibo2(n-1) VAL [\old(n)=2, fibo2(n-1)=1, n=2] [L13] CALL, EXPR fibo2(n-2) VAL [\old(n)=0] [L18] COND TRUE n < 1 [L19] return 0; VAL [\old(n)=0, \result=0, n=0] [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=2, fibo2(n-1)=1, fibo2(n-2)=0, n=2] [L13] return fibo2(n-1) + fibo2(n-2); [L23] RET, EXPR fibo1(n-1) VAL [\old(n)=3, fibo1(n-1)=1, n=3] [L23] CALL, EXPR fibo1(n-2) VAL [\old(n)=1] [L8] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L10] COND TRUE n == 1 [L11] return 1; VAL [\old(n)=1, \result=1, n=1] [L23] RET, EXPR fibo1(n-2) VAL [\old(n)=3, fibo1(n-1)=1, fibo1(n-2)=1, n=3] [L23] return fibo1(n-1) + fibo1(n-2); [L13] RET, EXPR fibo2(n-2) VAL [\old(n)=5, fibo2(n-1)=3, fibo2(n-2)=2, n=5] [L13] return fibo2(n-1) + fibo2(n-2); [L37] RET, EXPR fibo1(x) VAL [fibo1(x)=5, x=5] [L37] int result = fibo1(x); [L38] COND TRUE result == 5 VAL [result=5, x=5] [L39] __VERIFIER_error() VAL [result=5, x=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. UNSAFE Result, 8.5s OverallTime, 13 OverallIterations, 10 TraceHistogramMax, 3.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 361 SDtfs, 347 SDslu, 1966 SDs, 0 SdLazy, 1487 SolverSat, 267 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1489 GetRequests, 1278 SyntacticMatches, 43 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 470 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=140occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 4 AbstIntIterations, 3 AbstIntStrong, 0.8589743589743589 AbsIntWeakeningRatio, 0.5641025641025641 AbsIntAvgWeakeningVarsNumRemoved, 0.18803418803418803 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 118 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1498 NumberOfCodeBlocks, 1359 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1984 ConstructedInterpolants, 0 QuantifiedInterpolants, 280494 SizeOfPredicates, 27 NumberOfNonLiveVariables, 1065 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 26 InterpolantComputations, 3 PerfectInterpolantSequences, 3416/3888 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...