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/Fibonacci05.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 02:51:32,366 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 02:51:32,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 02:51:32,381 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 02:51:32,381 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 02:51:32,382 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 02:51:32,384 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 02:51:32,386 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 02:51:32,387 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 02:51:32,388 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 02:51:32,389 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 02:51:32,390 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 02:51:32,391 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 02:51:32,392 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 02:51:32,393 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 02:51:32,394 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 02:51:32,395 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 02:51:32,395 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 02:51:32,397 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 02:51:32,399 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 02:51:32,400 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 02:51:32,401 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 02:51:32,402 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 02:51:32,403 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 02:51:32,405 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 02:51:32,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 02:51:32,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 02:51:32,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 02:51:32,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 02:51:32,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 02:51:32,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 02:51:32,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 02:51:32,410 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 02:51:32,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 02:51:32,412 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 02:51:32,412 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 02:51:32,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 02:51:32,413 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 02:51:32,413 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 02:51:32,414 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 02:51:32,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 02:51:32,416 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 02:51:32,431 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 02:51:32,431 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 02:51:32,431 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 02:51:32,432 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 02:51:32,432 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 02:51:32,433 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 02:51:32,433 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 02:51:32,433 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 02:51:32,433 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 02:51:32,433 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 02:51:32,434 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 02:51:32,434 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 02:51:32,434 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 02:51:32,435 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 02:51:32,435 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 02:51:32,435 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 02:51:32,435 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 02:51:32,435 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 02:51:32,436 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 02:51:32,436 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 02:51:32,436 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 02:51:32,436 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 02:51:32,437 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 02:51:32,437 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 02:51:32,437 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 02:51:32,437 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 02:51:32,437 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 02:51:32,438 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 02:51:32,438 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 02:51:32,438 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 02:51:32,468 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 02:51:32,481 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 02:51:32,484 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 02:51:32,486 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 02:51:32,486 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 02:51:32,487 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive/Fibonacci05.c [2019-09-10 02:51:32,569 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5952c2df1/276efe0e9d834c3d9678314c622bb743/FLAG02789effa [2019-09-10 02:51:33,049 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 02:51:33,049 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive/Fibonacci05.c [2019-09-10 02:51:33,055 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5952c2df1/276efe0e9d834c3d9678314c622bb743/FLAG02789effa [2019-09-10 02:51:33,408 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5952c2df1/276efe0e9d834c3d9678314c622bb743 [2019-09-10 02:51:33,419 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 02:51:33,421 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 02:51:33,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 02:51:33,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 02:51:33,426 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 02:51:33,427 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:51:33" (1/1) ... [2019-09-10 02:51:33,431 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cceac13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:33, skipping insertion in model container [2019-09-10 02:51:33,431 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 02:51:33" (1/1) ... [2019-09-10 02:51:33,439 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 02:51:33,456 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 02:51:33,697 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:51:33,702 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 02:51:33,725 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 02:51:33,744 INFO L192 MainTranslator]: Completed translation [2019-09-10 02:51:33,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:33 WrapperNode [2019-09-10 02:51:33,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 02:51:33,747 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 02:51:33,747 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 02:51:33,747 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 02:51:33,763 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:33" (1/1) ... [2019-09-10 02:51:33,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:33" (1/1) ... [2019-09-10 02:51:33,879 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:33" (1/1) ... [2019-09-10 02:51:33,879 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:33" (1/1) ... [2019-09-10 02:51:33,884 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:33" (1/1) ... [2019-09-10 02:51:33,887 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:33" (1/1) ... [2019-09-10 02:51:33,888 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:33" (1/1) ... [2019-09-10 02:51:33,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 02:51:33,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 02:51:33,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 02:51:33,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 02:51:33,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:33" (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 02:51:33,949 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 02:51:33,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 02:51:33,950 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2019-09-10 02:51:33,950 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 02:51:33,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 02:51:33,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 02:51:33,951 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2019-09-10 02:51:33,951 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 02:51:33,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 02:51:33,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 02:51:34,116 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 02:51:34,117 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 02:51:34,118 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:51:34 BoogieIcfgContainer [2019-09-10 02:51:34,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 02:51:34,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 02:51:34,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 02:51:34,137 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 02:51:34,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 02:51:33" (1/3) ... [2019-09-10 02:51:34,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dabea99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:51:34, skipping insertion in model container [2019-09-10 02:51:34,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 02:51:33" (2/3) ... [2019-09-10 02:51:34,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dabea99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 02:51:34, skipping insertion in model container [2019-09-10 02:51:34,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 02:51:34" (3/3) ... [2019-09-10 02:51:34,141 INFO L109 eAbstractionObserver]: Analyzing ICFG Fibonacci05.c [2019-09-10 02:51:34,153 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 02:51:34,164 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 02:51:34,185 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 02:51:34,226 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 02:51:34,226 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 02:51:34,227 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 02:51:34,227 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 02:51:34,227 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 02:51:34,227 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 02:51:34,230 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 02:51:34,230 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 02:51:34,264 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-09-10 02:51:34,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-09-10 02:51:34,274 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:34,275 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:34,277 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:34,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:34,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1356498376, now seen corresponding path program 1 times [2019-09-10 02:51:34,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:34,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:34,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:34,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:34,338 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:34,465 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 02:51:34,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:51:34,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:51:34,468 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:51:34,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:51:34,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:51:34,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:51:34,487 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 5 states. [2019-09-10 02:51:34,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:34,591 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2019-09-10 02:51:34,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:51:34,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-09-10 02:51:34,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:34,602 INFO L225 Difference]: With dead ends: 29 [2019-09-10 02:51:34,602 INFO L226 Difference]: Without dead ends: 21 [2019-09-10 02:51:34,604 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 02:51:34,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-09-10 02:51:34,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-09-10 02:51:34,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-10 02:51:34,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-09-10 02:51:34,650 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2019-09-10 02:51:34,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:34,651 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-09-10 02:51:34,651 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:51:34,651 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-09-10 02:51:34,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-10 02:51:34,653 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:34,653 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:34,654 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:34,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:34,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1591396412, now seen corresponding path program 1 times [2019-09-10 02:51:34,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:34,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:34,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:34,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:34,656 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:34,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:34,715 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 02:51:34,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 02:51:34,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 02:51:34,719 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 02:51:34,721 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 02:51:34,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 02:51:34,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 02:51:34,723 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 5 states. [2019-09-10 02:51:34,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:34,820 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2019-09-10 02:51:34,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 02:51:34,821 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-10 02:51:34,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:34,823 INFO L225 Difference]: With dead ends: 25 [2019-09-10 02:51:34,823 INFO L226 Difference]: Without dead ends: 23 [2019-09-10 02:51:34,824 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 02:51:34,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-10 02:51:34,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2019-09-10 02:51:34,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-09-10 02:51:34,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-09-10 02:51:34,834 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2019-09-10 02:51:34,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:34,835 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-09-10 02:51:34,836 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 02:51:34,836 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-09-10 02:51:34,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-10 02:51:34,839 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:34,839 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:34,839 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:34,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:34,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1761048597, now seen corresponding path program 1 times [2019-09-10 02:51:34,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:34,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:34,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:34,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:34,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:34,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:34,972 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:51:34,972 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:34,972 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:34,973 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 27 with the following transitions: [2019-09-10 02:51:34,977 INFO L207 CegarAbsIntRunner]: [0], [3], [4], [8], [10], [12], [13], [14], [18], [20], [24], [26], [29], [30], [31], [32], [33], [34], [35], [37], [38] [2019-09-10 02:51:35,021 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:51:35,022 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:51:35,121 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:51:35,122 INFO L272 AbstractInterpreter]: Visited 16 different actions 31 times. Never merged. Never widened. Performed 29 root evaluator evaluations with a maximum evaluation depth of 4. Performed 29 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 1 fixpoints after 1 different actions. Largest state had 5 variables. [2019-09-10 02:51:35,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:35,126 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:51:35,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:35,127 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 02:51:35,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:35,140 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:51:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:35,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 02:51:35,174 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:35,250 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 02:51:35,251 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:35,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:35,504 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:51:35,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:35,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 12 [2019-09-10 02:51:35,512 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:35,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:51:35,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:51:35,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:51:35,513 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 8 states. [2019-09-10 02:51:35,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:35,662 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2019-09-10 02:51:35,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:51:35,663 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-09-10 02:51:35,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:35,665 INFO L225 Difference]: With dead ends: 23 [2019-09-10 02:51:35,665 INFO L226 Difference]: Without dead ends: 23 [2019-09-10 02:51:35,665 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:51:35,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-09-10 02:51:35,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-09-10 02:51:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-09-10 02:51:35,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-09-10 02:51:35,671 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 26 [2019-09-10 02:51:35,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:35,671 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-09-10 02:51:35,672 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:51:35,672 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2019-09-10 02:51:35,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-09-10 02:51:35,673 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:35,673 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:35,674 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:35,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:35,674 INFO L82 PathProgramCache]: Analyzing trace with hash -624449707, now seen corresponding path program 1 times [2019-09-10 02:51:35,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:35,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:35,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:35,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:35,676 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:35,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:35,743 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 02:51:35,744 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:35,744 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:35,744 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2019-09-10 02:51:35,745 INFO L207 CegarAbsIntRunner]: [0], [3], [4], [7], [8], [10], [12], [13], [14], [18], [20], [24], [26], [29], [30], [31], [32], [33], [34], [35], [37], [38] [2019-09-10 02:51:35,748 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 02:51:35,748 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 02:51:37,244 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 02:51:37,245 INFO L272 AbstractInterpreter]: Visited 22 different actions 6887 times. Merged at 10 different actions 1759 times. Never widened. Performed 8480 root evaluator evaluations with a maximum evaluation depth of 4. Performed 8480 inverse root evaluator evaluations with a maximum inverse evaluation depth of 4. Found 743 fixpoints after 5 different actions. Largest state had 5 variables. [2019-09-10 02:51:37,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:37,246 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 02:51:37,246 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:37,246 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 02:51:37,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:37,274 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:51:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:37,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 02:51:37,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:37,321 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-10 02:51:37,322 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:37,499 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:37,541 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-10 02:51:37,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:37,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 10 [2019-09-10 02:51:37,547 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:37,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 02:51:37,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 02:51:37,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-09-10 02:51:37,549 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand 6 states. [2019-09-10 02:51:37,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:37,633 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2019-09-10 02:51:37,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 02:51:37,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-09-10 02:51:37,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:37,636 INFO L225 Difference]: With dead ends: 30 [2019-09-10 02:51:37,636 INFO L226 Difference]: Without dead ends: 28 [2019-09-10 02:51:37,637 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 51 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:51:37,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-10 02:51:37,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-09-10 02:51:37,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-10 02:51:37,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-09-10 02:51:37,654 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 37 transitions. Word has length 27 [2019-09-10 02:51:37,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:37,654 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-09-10 02:51:37,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 02:51:37,655 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 37 transitions. [2019-09-10 02:51:37,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-10 02:51:37,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:37,660 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:37,660 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:37,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:37,661 INFO L82 PathProgramCache]: Analyzing trace with hash -111055954, now seen corresponding path program 2 times [2019-09-10 02:51:37,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:37,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:37,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:37,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:37,665 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:37,859 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-10 02:51:37,860 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:37,860 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:37,860 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:37,861 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:51:37,861 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:37,861 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) [2019-09-10 02:51:37,878 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:51:37,879 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:37,894 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-09-10 02:51:37,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:51:37,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-10 02:51:37,899 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:37,936 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 8 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-09-10 02:51:37,936 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:38,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:38,139 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 18 proven. 9 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 02:51:38,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:38,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6, 7] total 15 [2019-09-10 02:51:38,143 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:38,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:51:38,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:51:38,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:51:38,145 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. Second operand 11 states. [2019-09-10 02:51:38,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:38,443 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2019-09-10 02:51:38,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 02:51:38,444 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 40 [2019-09-10 02:51:38,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:38,446 INFO L225 Difference]: With dead ends: 34 [2019-09-10 02:51:38,449 INFO L226 Difference]: Without dead ends: 34 [2019-09-10 02:51:38,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 72 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=119, Invalid=343, Unknown=0, NotChecked=0, Total=462 [2019-09-10 02:51:38,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-09-10 02:51:38,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2019-09-10 02:51:38,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-09-10 02:51:38,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-09-10 02:51:38,461 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 40 [2019-09-10 02:51:38,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:38,462 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-09-10 02:51:38,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:51:38,464 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2019-09-10 02:51:38,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-10 02:51:38,469 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:38,471 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:38,471 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:38,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:38,472 INFO L82 PathProgramCache]: Analyzing trace with hash 380905728, now seen corresponding path program 3 times [2019-09-10 02:51:38,472 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:38,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:38,477 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:51:38,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:38,477 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:38,578 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 02:51:38,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:38,579 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:38,579 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:38,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:51:38,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:38,580 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) [2019-09-10 02:51:38,593 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:51:38,593 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:38,621 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:51:38,621 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:51:38,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 02:51:38,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:38,646 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-10 02:51:38,646 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:38,857 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:38,904 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:38,934 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 31 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 02:51:38,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:38,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 12 [2019-09-10 02:51:38,938 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:38,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-10 02:51:38,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-10 02:51:38,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-09-10 02:51:38,940 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand 7 states. [2019-09-10 02:51:39,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:39,043 INFO L93 Difference]: Finished difference Result 35 states and 49 transitions. [2019-09-10 02:51:39,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 02:51:39,044 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-09-10 02:51:39,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:39,045 INFO L225 Difference]: With dead ends: 35 [2019-09-10 02:51:39,045 INFO L226 Difference]: Without dead ends: 33 [2019-09-10 02:51:39,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 77 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2019-09-10 02:51:39,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-09-10 02:51:39,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-09-10 02:51:39,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-10 02:51:39,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 47 transitions. [2019-09-10 02:51:39,056 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 47 transitions. Word has length 41 [2019-09-10 02:51:39,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:39,057 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 47 transitions. [2019-09-10 02:51:39,057 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-10 02:51:39,057 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 47 transitions. [2019-09-10 02:51:39,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 02:51:39,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:39,061 INFO L399 BasicCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:39,061 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:39,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:39,062 INFO L82 PathProgramCache]: Analyzing trace with hash -383842586, now seen corresponding path program 4 times [2019-09-10 02:51:39,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:39,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:39,066 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:51:39,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:39,066 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:39,174 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 25 refuted. 0 times theorem prover too weak. 98 trivial. 0 not checked. [2019-09-10 02:51:39,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:39,175 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:39,175 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:39,175 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:51:39,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:39,176 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) [2019-09-10 02:51:39,193 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:39,194 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:39,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-10 02:51:39,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:39,263 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 88 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-10 02:51:39,264 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:39,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:39,819 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:39,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:39,923 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 17 proven. 103 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-09-10 02:51:39,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:39,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 11] total 14 [2019-09-10 02:51:39,929 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:39,929 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 02:51:39,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 02:51:39,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-09-10 02:51:39,930 INFO L87 Difference]: Start difference. First operand 33 states and 47 transitions. Second operand 8 states. [2019-09-10 02:51:40,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:40,064 INFO L93 Difference]: Finished difference Result 40 states and 62 transitions. [2019-09-10 02:51:40,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 02:51:40,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-09-10 02:51:40,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:40,067 INFO L225 Difference]: With dead ends: 40 [2019-09-10 02:51:40,067 INFO L226 Difference]: Without dead ends: 38 [2019-09-10 02:51:40,068 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 125 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:51:40,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-10 02:51:40,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-09-10 02:51:40,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-09-10 02:51:40,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 60 transitions. [2019-09-10 02:51:40,077 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 60 transitions. Word has length 68 [2019-09-10 02:51:40,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:40,078 INFO L475 AbstractCegarLoop]: Abstraction has 38 states and 60 transitions. [2019-09-10 02:51:40,078 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 02:51:40,078 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 60 transitions. [2019-09-10 02:51:40,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-10 02:51:40,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:40,080 INFO L399 BasicCegarLoop]: trace histogram [21, 21, 18, 10, 10, 10, 10, 10, 10, 10, 8, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:40,081 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:40,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:40,081 INFO L82 PathProgramCache]: Analyzing trace with hash -596522450, now seen corresponding path program 5 times [2019-09-10 02:51:40,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:40,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:40,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:40,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:40,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:40,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 71 proven. 368 refuted. 0 times theorem prover too weak. 734 trivial. 0 not checked. [2019-09-10 02:51:40,226 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:40,226 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:40,226 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:40,227 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:51:40,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:40,227 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) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:40,248 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:51:40,248 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-09-10 02:51:40,279 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-09-10 02:51:40,279 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:51:40,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 02:51:40,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:40,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 331 proven. 17 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2019-09-10 02:51:40,352 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:40,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:40,877 INFO L134 CoverageAnalysis]: Checked inductivity of 1173 backedges. 331 proven. 18 refuted. 0 times theorem prover too weak. 824 trivial. 0 not checked. [2019-09-10 02:51:40,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:40,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 16 [2019-09-10 02:51:40,882 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:40,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-10 02:51:40,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-10 02:51:40,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2019-09-10 02:51:40,888 INFO L87 Difference]: Start difference. First operand 38 states and 60 transitions. Second operand 13 states. [2019-09-10 02:51:41,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:41,271 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2019-09-10 02:51:41,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-10 02:51:41,272 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 151 [2019-09-10 02:51:41,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:41,275 INFO L225 Difference]: With dead ends: 60 [2019-09-10 02:51:41,275 INFO L226 Difference]: Without dead ends: 58 [2019-09-10 02:51:41,276 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 293 SyntacticMatches, 7 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=595, Unknown=0, NotChecked=0, Total=812 [2019-09-10 02:51:41,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2019-09-10 02:51:41,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2019-09-10 02:51:41,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2019-09-10 02:51:41,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 76 transitions. [2019-09-10 02:51:41,285 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 76 transitions. Word has length 151 [2019-09-10 02:51:41,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:41,286 INFO L475 AbstractCegarLoop]: Abstraction has 58 states and 76 transitions. [2019-09-10 02:51:41,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-10 02:51:41,286 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 76 transitions. [2019-09-10 02:51:41,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2019-09-10 02:51:41,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:41,288 INFO L399 BasicCegarLoop]: trace histogram [25, 25, 20, 12, 12, 12, 12, 12, 12, 12, 8, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:41,288 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:41,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:41,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1442326180, now seen corresponding path program 6 times [2019-09-10 02:51:41,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:41,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:41,289 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:51:41,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:41,290 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:41,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:41,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 152 proven. 389 refuted. 0 times theorem prover too weak. 1113 trivial. 0 not checked. [2019-09-10 02:51:41,405 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:41,405 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:41,405 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:41,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:51:41,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:41,406 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 02:51:41,425 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:51:41,426 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2019-09-10 02:51:41,481 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:51:41,481 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:51:41,483 INFO L256 TraceCheckSpWp]: Trace formula consists of 397 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-10 02:51:41,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:41,535 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 533 refuted. 0 times theorem prover too weak. 1028 trivial. 0 not checked. [2019-09-10 02:51:41,535 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:42,370 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:42,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:42,760 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:42,838 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:42,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:42,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1654 backedges. 93 proven. 573 refuted. 0 times theorem prover too weak. 988 trivial. 0 not checked. [2019-09-10 02:51:42,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:42,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 15] total 18 [2019-09-10 02:51:42,937 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:42,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-10 02:51:42,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-10 02:51:42,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:51:42,939 INFO L87 Difference]: Start difference. First operand 58 states and 76 transitions. Second operand 10 states. [2019-09-10 02:51:43,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:43,109 INFO L93 Difference]: Finished difference Result 65 states and 90 transitions. [2019-09-10 02:51:43,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 02:51:43,110 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 177 [2019-09-10 02:51:43,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:43,112 INFO L225 Difference]: With dead ends: 65 [2019-09-10 02:51:43,113 INFO L226 Difference]: Without dead ends: 63 [2019-09-10 02:51:43,114 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 339 SyntacticMatches, 11 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2019-09-10 02:51:43,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-09-10 02:51:43,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-09-10 02:51:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-09-10 02:51:43,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2019-09-10 02:51:43,122 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 177 [2019-09-10 02:51:43,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:43,123 INFO L475 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2019-09-10 02:51:43,123 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-10 02:51:43,123 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2019-09-10 02:51:43,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2019-09-10 02:51:43,127 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:43,127 INFO L399 BasicCegarLoop]: trace histogram [51, 51, 41, 25, 25, 25, 25, 25, 25, 25, 16, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:43,128 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:43,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:43,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1242507885, now seen corresponding path program 7 times [2019-09-10 02:51:43,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:43,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:43,129 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:51:43,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:43,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:43,374 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1491 refuted. 0 times theorem prover too weak. 5415 trivial. 0 not checked. [2019-09-10 02:51:43,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:43,374 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:43,374 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:43,375 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:51:43,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:43,375 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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:43,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:43,386 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:51:43,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:43,496 INFO L256 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 02:51:43,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:43,592 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1491 refuted. 0 times theorem prover too weak. 5415 trivial. 0 not checked. [2019-09-10 02:51:43,593 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:44,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:45,360 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:45,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:45,739 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:45,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:45,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:45,926 INFO L134 CoverageAnalysis]: Checked inductivity of 7120 backedges. 214 proven. 1548 refuted. 0 times theorem prover too weak. 5358 trivial. 0 not checked. [2019-09-10 02:51:45,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:45,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 18 [2019-09-10 02:51:45,931 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:45,932 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-10 02:51:45,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-10 02:51:45,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2019-09-10 02:51:45,933 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand 11 states. [2019-09-10 02:51:46,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:46,183 INFO L93 Difference]: Finished difference Result 70 states and 104 transitions. [2019-09-10 02:51:46,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 02:51:46,184 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 354 [2019-09-10 02:51:46,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:46,187 INFO L225 Difference]: With dead ends: 70 [2019-09-10 02:51:46,187 INFO L226 Difference]: Without dead ends: 68 [2019-09-10 02:51:46,188 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 731 GetRequests, 693 SyntacticMatches, 15 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=208, Invalid=392, Unknown=0, NotChecked=0, Total=600 [2019-09-10 02:51:46,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-09-10 02:51:46,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-09-10 02:51:46,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-09-10 02:51:46,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 102 transitions. [2019-09-10 02:51:46,197 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 102 transitions. Word has length 354 [2019-09-10 02:51:46,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:46,199 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 102 transitions. [2019-09-10 02:51:46,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-10 02:51:46,199 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 102 transitions. [2019-09-10 02:51:46,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2019-09-10 02:51:46,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:46,213 INFO L399 BasicCegarLoop]: trace histogram [89, 89, 71, 44, 44, 44, 44, 44, 44, 44, 27, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:46,213 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:46,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:46,214 INFO L82 PathProgramCache]: Analyzing trace with hash -648303480, now seen corresponding path program 8 times [2019-09-10 02:51:46,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:46,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:46,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:46,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:46,215 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:46,813 INFO L134 CoverageAnalysis]: Checked inductivity of 21933 backedges. 903 proven. 3098 refuted. 0 times theorem prover too weak. 17932 trivial. 0 not checked. [2019-09-10 02:51:46,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:46,814 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:46,814 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:46,814 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:51:46,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:46,815 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:51:46,833 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-10 02:51:46,834 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:46,904 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2019-09-10 02:51:46,905 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:51:46,906 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-10 02:51:46,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:47,108 INFO L134 CoverageAnalysis]: Checked inductivity of 21933 backedges. 2734 proven. 73 refuted. 0 times theorem prover too weak. 19126 trivial. 0 not checked. [2019-09-10 02:51:47,108 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:47,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:48,127 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:48,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:49,029 INFO L134 CoverageAnalysis]: Checked inductivity of 21933 backedges. 2734 proven. 80 refuted. 0 times theorem prover too weak. 19119 trivial. 0 not checked. [2019-09-10 02:51:49,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:49,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 10, 13] total 23 [2019-09-10 02:51:49,040 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:49,041 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-10 02:51:49,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-10 02:51:49,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2019-09-10 02:51:49,042 INFO L87 Difference]: Start difference. First operand 68 states and 102 transitions. Second operand 18 states. [2019-09-10 02:51:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:49,716 INFO L93 Difference]: Finished difference Result 88 states and 120 transitions. [2019-09-10 02:51:49,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-10 02:51:49,716 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 612 [2019-09-10 02:51:49,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:49,719 INFO L225 Difference]: With dead ends: 88 [2019-09-10 02:51:49,719 INFO L226 Difference]: Without dead ends: 88 [2019-09-10 02:51:49,720 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1262 GetRequests, 1210 SyntacticMatches, 11 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=451, Invalid=1355, Unknown=0, NotChecked=0, Total=1806 [2019-09-10 02:51:49,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2019-09-10 02:51:49,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 79. [2019-09-10 02:51:49,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2019-09-10 02:51:49,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 107 transitions. [2019-09-10 02:51:49,732 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 107 transitions. Word has length 612 [2019-09-10 02:51:49,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:49,733 INFO L475 AbstractCegarLoop]: Abstraction has 79 states and 107 transitions. [2019-09-10 02:51:49,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-10 02:51:49,733 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 107 transitions. [2019-09-10 02:51:49,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2019-09-10 02:51:49,747 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:49,747 INFO L399 BasicCegarLoop]: trace histogram [77, 77, 62, 38, 38, 38, 38, 38, 38, 38, 24, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:49,747 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:49,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:49,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1942503438, now seen corresponding path program 9 times [2019-09-10 02:51:49,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:49,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:49,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:51:49,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:49,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:50,224 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1144 proven. 2784 refuted. 0 times theorem prover too weak. 12479 trivial. 0 not checked. [2019-09-10 02:51:50,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:50,225 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:50,225 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:50,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:51:50,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:50,225 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 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 02:51:50,241 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-10 02:51:50,241 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:50,349 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-10 02:51:50,349 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-10 02:51:50,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 945 conjuncts, 25 conjunts are in the unsatisfiable core [2019-09-10 02:51:50,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:50,552 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 8261 proven. 1793 refuted. 0 times theorem prover too weak. 6353 trivial. 0 not checked. [2019-09-10 02:51:50,553 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:53,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:53,306 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:53,418 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:53,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:54,343 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:54,577 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:54,708 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:54,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:54,837 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:54,974 INFO L134 CoverageAnalysis]: Checked inductivity of 16407 backedges. 1179 proven. 3494 refuted. 0 times theorem prover too weak. 11734 trivial. 0 not checked. [2019-09-10 02:51:54,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:51:54,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 26] total 32 [2019-09-10 02:51:54,979 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:51:54,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-10 02:51:54,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-10 02:51:54,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=819, Unknown=0, NotChecked=0, Total=992 [2019-09-10 02:51:54,980 INFO L87 Difference]: Start difference. First operand 79 states and 107 transitions. Second operand 20 states. [2019-09-10 02:51:55,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:51:55,910 INFO L93 Difference]: Finished difference Result 106 states and 145 transitions. [2019-09-10 02:51:55,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-10 02:51:55,911 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 531 [2019-09-10 02:51:55,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:51:55,914 INFO L225 Difference]: With dead ends: 106 [2019-09-10 02:51:55,914 INFO L226 Difference]: Without dead ends: 106 [2019-09-10 02:51:55,915 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1109 GetRequests, 1030 SyntacticMatches, 24 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 856 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=811, Invalid=2381, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 02:51:55,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2019-09-10 02:51:55,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 98. [2019-09-10 02:51:55,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-09-10 02:51:55,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 135 transitions. [2019-09-10 02:51:55,953 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 135 transitions. Word has length 531 [2019-09-10 02:51:55,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:51:55,954 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 135 transitions. [2019-09-10 02:51:55,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-10 02:51:55,957 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 135 transitions. [2019-09-10 02:51:55,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2019-09-10 02:51:55,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:51:55,962 INFO L399 BasicCegarLoop]: trace histogram [83, 83, 67, 41, 41, 41, 41, 41, 41, 41, 26, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:51:55,962 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:51:55,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:51:55,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1052494023, now seen corresponding path program 10 times [2019-09-10 02:51:55,963 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:51:55,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:55,964 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-10 02:51:55,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:51:55,964 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:51:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:56,394 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1735 proven. 3071 refuted. 0 times theorem prover too weak. 14297 trivial. 0 not checked. [2019-09-10 02:51:56,394 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:56,395 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 02:51:56,395 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-09-10 02:51:56,395 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-09-10 02:51:56,395 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 02:51:56,395 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 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 02:51:56,408 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:51:56,408 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 02:51:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 02:51:56,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 1274 conjuncts, 29 conjunts are in the unsatisfiable core [2019-09-10 02:51:56,566 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 02:51:56,778 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1844 proven. 3686 refuted. 0 times theorem prover too weak. 13573 trivial. 0 not checked. [2019-09-10 02:51:56,778 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 02:51:59,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:59,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:59,584 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:59,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:51:59,755 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:01,035 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:01,414 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:01,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:01,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:01,886 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:01,940 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 02:52:02,142 INFO L134 CoverageAnalysis]: Checked inductivity of 19103 backedges. 1839 proven. 3783 refuted. 0 times theorem prover too weak. 13481 trivial. 0 not checked. [2019-09-10 02:52:02,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 02:52:02,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 30] total 36 [2019-09-10 02:52:02,147 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 02:52:02,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-10 02:52:02,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-10 02:52:02,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=1048, Unknown=0, NotChecked=0, Total=1260 [2019-09-10 02:52:02,149 INFO L87 Difference]: Start difference. First operand 98 states and 135 transitions. Second operand 22 states. [2019-09-10 02:52:03,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 02:52:03,239 INFO L93 Difference]: Finished difference Result 130 states and 183 transitions. [2019-09-10 02:52:03,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-09-10 02:52:03,241 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 572 [2019-09-10 02:52:03,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 02:52:03,245 INFO L225 Difference]: With dead ends: 130 [2019-09-10 02:52:03,245 INFO L226 Difference]: Without dead ends: 130 [2019-09-10 02:52:03,247 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1200 GetRequests, 1108 SyntacticMatches, 28 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1183 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1060, Invalid=3230, Unknown=0, NotChecked=0, Total=4290 [2019-09-10 02:52:03,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-09-10 02:52:03,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 112. [2019-09-10 02:52:03,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2019-09-10 02:52:03,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 157 transitions. [2019-09-10 02:52:03,259 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 157 transitions. Word has length 572 [2019-09-10 02:52:03,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 02:52:03,260 INFO L475 AbstractCegarLoop]: Abstraction has 112 states and 157 transitions. [2019-09-10 02:52:03,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-10 02:52:03,261 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 157 transitions. [2019-09-10 02:52:03,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2019-09-10 02:52:03,264 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 02:52:03,264 INFO L399 BasicCegarLoop]: trace histogram [67, 67, 54, 33, 33, 33, 33, 33, 33, 33, 21, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 02:52:03,265 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 02:52:03,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 02:52:03,265 INFO L82 PathProgramCache]: Analyzing trace with hash -768599631, now seen corresponding path program 11 times [2019-09-10 02:52:03,265 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 02:52:03,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:52:03,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 02:52:03,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 02:52:03,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 02:52:03,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 02:52:03,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-09-10 02:52:03,456 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-09-10 02:52:03,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 02:52:03 BoogieIcfgContainer [2019-09-10 02:52:03,584 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 02:52:03,590 INFO L168 Benchmark]: Toolchain (without parser) took 30165.78 ms. Allocated memory was 134.7 MB in the beginning and 863.0 MB in the end (delta: 728.2 MB). Free memory was 90.4 MB in the beginning and 372.0 MB in the end (delta: -281.6 MB). Peak memory consumption was 446.6 MB. Max. memory is 7.1 GB. [2019-09-10 02:52:03,595 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 134.7 MB. Free memory was 109.2 MB in the beginning and 109.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-10 02:52:03,596 INFO L168 Benchmark]: CACSL2BoogieTranslator took 324.20 ms. Allocated memory is still 134.7 MB. Free memory was 90.2 MB in the beginning and 81.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. [2019-09-10 02:52:03,597 INFO L168 Benchmark]: Boogie Preprocessor took 142.46 ms. Allocated memory was 134.7 MB in the beginning and 202.4 MB in the end (delta: 67.6 MB). Free memory was 81.2 MB in the beginning and 180.1 MB in the end (delta: -98.9 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. [2019-09-10 02:52:03,600 INFO L168 Benchmark]: RCFGBuilder took 229.18 ms. Allocated memory is still 202.4 MB. Free memory was 179.1 MB in the beginning and 168.2 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2019-09-10 02:52:03,601 INFO L168 Benchmark]: TraceAbstraction took 29458.12 ms. Allocated memory was 202.4 MB in the beginning and 863.0 MB in the end (delta: 660.6 MB). Free memory was 167.6 MB in the beginning and 372.0 MB in the end (delta: -204.3 MB). Peak memory consumption was 456.3 MB. Max. memory is 7.1 GB. [2019-09-10 02:52:03,610 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.22 ms. Allocated memory is still 134.7 MB. Free memory was 109.2 MB in the beginning and 109.0 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 324.20 ms. Allocated memory is still 134.7 MB. Free memory was 90.2 MB in the beginning and 81.2 MB in the end (delta: 9.0 MB). Peak memory consumption was 9.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 142.46 ms. Allocated memory was 134.7 MB in the beginning and 202.4 MB in the end (delta: 67.6 MB). Free memory was 81.2 MB in the beginning and 180.1 MB in the end (delta: -98.9 MB). Peak memory consumption was 16.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 229.18 ms. Allocated memory is still 202.4 MB. Free memory was 179.1 MB in the beginning and 168.2 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 29458.12 ms. Allocated memory was 202.4 MB in the beginning and 863.0 MB in the end (delta: 660.6 MB). Free memory was 167.6 MB in the beginning and 372.0 MB in the end (delta: -204.3 MB). Peak memory consumption was 456.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 31]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L26] int x = __VERIFIER_nondet_int(); [L27] CALL, EXPR fibonacci(x) VAL [\old(n)=8] [L15] COND FALSE !(n < 1) VAL [\old(n)=8, n=8] [L17] COND FALSE !(n == 1) VAL [\old(n)=8, n=8] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=7] [L15] COND FALSE !(n < 1) VAL [\old(n)=7, n=7] [L17] COND FALSE !(n == 1) VAL [\old(n)=7, n=7] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=7, fibonacci(n-1)=8, n=7] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=7, fibonacci(n-1)=8, fibonacci(n-2)=5, n=7] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=8, fibonacci(n-1)=13, n=8] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=6] [L15] COND FALSE !(n < 1) VAL [\old(n)=6, n=6] [L17] COND FALSE !(n == 1) VAL [\old(n)=6, n=6] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=5] [L15] COND FALSE !(n < 1) VAL [\old(n)=5, n=5] [L17] COND FALSE !(n == 1) VAL [\old(n)=5, n=5] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=5, fibonacci(n-1)=3, n=5] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=5, fibonacci(n-1)=3, fibonacci(n-2)=2, n=5] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=6, fibonacci(n-1)=5, n=6] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=4] [L15] COND FALSE !(n < 1) VAL [\old(n)=4, n=4] [L17] COND FALSE !(n == 1) VAL [\old(n)=4, n=4] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=3] [L15] COND FALSE !(n < 1) VAL [\old(n)=3, n=3] [L17] COND FALSE !(n == 1) VAL [\old(n)=3, n=3] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=3, fibonacci(n-1)=1, n=3] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=3, fibonacci(n-1)=1, fibonacci(n-2)=1, n=3] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=4, fibonacci(n-1)=2, n=4] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=2] [L15] COND FALSE !(n < 1) VAL [\old(n)=2, n=2] [L17] COND FALSE !(n == 1) VAL [\old(n)=2, n=2] [L20] CALL, EXPR fibonacci(n-1) VAL [\old(n)=1] [L15] COND FALSE !(n < 1) VAL [\old(n)=1, n=1] [L17] COND TRUE n == 1 [L18] return 1; VAL [\old(n)=1, \result=1, n=1] [L20] RET, EXPR fibonacci(n-1) VAL [\old(n)=2, fibonacci(n-1)=1, n=2] [L20] CALL, EXPR fibonacci(n-2) VAL [\old(n)=0] [L15] COND TRUE n < 1 [L16] return 0; VAL [\old(n)=0, \result=0, n=0] [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=2, fibonacci(n-1)=1, fibonacci(n-2)=0, n=2] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=4, fibonacci(n-1)=2, fibonacci(n-2)=1, n=4] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=6, fibonacci(n-1)=5, fibonacci(n-2)=3, n=6] [L20] return fibonacci(n-1) + fibonacci(n-2); [L20] RET, EXPR fibonacci(n-2) VAL [\old(n)=8, fibonacci(n-1)=13, fibonacci(n-2)=8, n=8] [L20] return fibonacci(n-1) + fibonacci(n-2); [L27] RET, EXPR fibonacci(x) VAL [fibonacci(x)=21, x=8] [L27] int result = fibonacci(x); [L28] COND FALSE !(x < 8 || result >= 34) VAL [result=21, x=8] [L31] __VERIFIER_error() VAL [result=21, x=8] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 23 locations, 1 error locations. UNSAFE Result, 29.3s OverallTime, 14 OverallIterations, 89 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 270 SDtfs, 695 SDslu, 1115 SDs, 0 SdLazy, 1933 SolverSat, 741 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5479 GetRequests, 5048 SyntacticMatches, 118 SemanticMatches, 313 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3016 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.6s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 43 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 20.2s InterpolantComputationTime, 5688 NumberOfCodeBlocks, 4999 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 7789 ConstructedInterpolants, 0 QuantifiedInterpolants, 4729790 SizeOfPredicates, 80 NumberOfNonLiveVariables, 4222 ConjunctsInSsa, 140 ConjunctsInUnsatCore, 35 InterpolantComputations, 2 PerfectInterpolantSequences, 174457/203103 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...