java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf -i ../../../trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 09:02:40,658 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 09:02:40,660 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 09:02:40,673 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 09:02:40,674 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 09:02:40,675 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 09:02:40,676 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 09:02:40,677 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 09:02:40,680 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 09:02:40,680 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 09:02:40,681 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 09:02:40,682 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 09:02:40,687 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 09:02:40,688 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 09:02:40,689 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 09:02:40,690 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 09:02:40,690 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 09:02:40,694 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 09:02:40,697 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 09:02:40,700 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 09:02:40,702 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 09:02:40,703 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 09:02:40,706 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 09:02:40,706 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 09:02:40,706 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 09:02:40,709 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 09:02:40,710 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 09:02:40,711 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 09:02:40,711 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 09:02:40,714 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 09:02:40,715 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 09:02:40,715 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 09:02:40,715 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 09:02:40,716 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 09:02:40,717 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 09:02:40,718 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 09:02:40,718 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-EXP.epf [2018-10-27 09:02:40,747 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 09:02:40,747 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 09:02:40,752 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 09:02:40,752 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 09:02:40,752 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 09:02:40,752 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 09:02:40,752 INFO L133 SettingsManager]: * Explicit value domain=true [2018-10-27 09:02:40,753 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 09:02:40,753 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 09:02:40,753 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 09:02:40,753 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 09:02:40,753 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 09:02:40,754 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 09:02:40,754 INFO L133 SettingsManager]: * Interval Domain=false [2018-10-27 09:02:40,755 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 09:02:40,755 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 09:02:40,755 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 09:02:40,755 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 09:02:40,756 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 09:02:40,758 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 09:02:40,758 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 09:02:40,758 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 09:02:40,758 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 09:02:40,758 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 09:02:40,759 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 09:02:40,759 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 09:02:40,759 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 09:02:40,759 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 09:02:40,760 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 09:02:40,760 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 09:02:40,760 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 09:02:40,760 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 09:02:40,760 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 09:02:40,760 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 09:02:40,761 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 09:02:40,761 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 09:02:40,829 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 09:02:40,840 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 09:02:40,844 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 09:02:40,846 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 09:02:40,846 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 09:02:40,847 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i [2018-10-27 09:02:40,907 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4c162de23/e5d7dbc558d74220bff734ea61a2af5a/FLAGb1fda45d6 [2018-10-27 09:02:41,402 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 09:02:41,403 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_01_true-unreach-call.i [2018-10-27 09:02:41,418 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4c162de23/e5d7dbc558d74220bff734ea61a2af5a/FLAGb1fda45d6 [2018-10-27 09:02:41,434 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/4c162de23/e5d7dbc558d74220bff734ea61a2af5a [2018-10-27 09:02:41,445 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 09:02:41,447 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 09:02:41,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 09:02:41,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 09:02:41,450 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 09:02:41,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 09:02:41" (1/1) ... [2018-10-27 09:02:41,454 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b86567d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:02:41, skipping insertion in model container [2018-10-27 09:02:41,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 09:02:41" (1/1) ... [2018-10-27 09:02:41,463 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 09:02:41,486 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 09:02:41,672 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 09:02:41,676 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 09:02:41,717 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 09:02:41,738 INFO L193 MainTranslator]: Completed translation [2018-10-27 09:02:41,739 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:02:41 WrapperNode [2018-10-27 09:02:41,739 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 09:02:41,742 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 09:02:41,742 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 09:02:41,742 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 09:02:41,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:02:41" (1/1) ... [2018-10-27 09:02:41,770 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:02:41" (1/1) ... [2018-10-27 09:02:41,827 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 09:02:41,827 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 09:02:41,827 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 09:02:41,828 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 09:02:41,841 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:02:41" (1/1) ... [2018-10-27 09:02:41,841 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:02:41" (1/1) ... [2018-10-27 09:02:41,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:02:41" (1/1) ... [2018-10-27 09:02:41,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:02:41" (1/1) ... [2018-10-27 09:02:41,895 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:02:41" (1/1) ... [2018-10-27 09:02:41,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:02:41" (1/1) ... [2018-10-27 09:02:41,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:02:41" (1/1) ... [2018-10-27 09:02:41,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 09:02:41,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 09:02:41,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 09:02:41,921 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 09:02:41,922 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:02:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-27 09:02:42,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 09:02:42,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 09:02:42,061 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 09:02:42,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 09:02:42,061 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 09:02:42,061 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 09:02:42,061 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-27 09:02:42,061 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-27 09:02:43,366 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 09:02:43,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 09:02:43 BoogieIcfgContainer [2018-10-27 09:02:43,367 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 09:02:43,368 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 09:02:43,368 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 09:02:43,371 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 09:02:43,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 09:02:41" (1/3) ... [2018-10-27 09:02:43,372 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e265bb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 09:02:43, skipping insertion in model container [2018-10-27 09:02:43,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 09:02:41" (2/3) ... [2018-10-27 09:02:43,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e265bb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 09:02:43, skipping insertion in model container [2018-10-27 09:02:43,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 09:02:43" (3/3) ... [2018-10-27 09:02:43,375 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_01_true-unreach-call.i [2018-10-27 09:02:43,385 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 09:02:43,394 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 09:02:43,413 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 09:02:43,448 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 09:02:43,448 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 09:02:43,449 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 09:02:43,449 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 09:02:43,449 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 09:02:43,449 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 09:02:43,450 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 09:02:43,450 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 09:02:43,468 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2018-10-27 09:02:43,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-27 09:02:43,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:02:43,476 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:02:43,479 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:02:43,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:02:43,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1090382313, now seen corresponding path program 1 times [2018-10-27 09:02:43,488 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:02:43,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:43,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:02:43,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:43,539 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:02:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:02:43,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:02:43,749 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:02:43,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 09:02:43,750 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:02:43,756 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 09:02:43,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 09:02:43,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 09:02:43,775 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 2 states. [2018-10-27 09:02:43,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:02:43,802 INFO L93 Difference]: Finished difference Result 70 states and 94 transitions. [2018-10-27 09:02:43,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 09:02:43,805 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-10-27 09:02:43,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:02:43,815 INFO L225 Difference]: With dead ends: 70 [2018-10-27 09:02:43,815 INFO L226 Difference]: Without dead ends: 35 [2018-10-27 09:02:43,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 09:02:43,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-27 09:02:43,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-10-27 09:02:43,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-27 09:02:43,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-10-27 09:02:43,870 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 18 [2018-10-27 09:02:43,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:02:43,870 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-10-27 09:02:43,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 09:02:43,871 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-10-27 09:02:43,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-27 09:02:43,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:02:43,873 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:02:43,874 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:02:43,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:02:43,874 INFO L82 PathProgramCache]: Analyzing trace with hash -448793496, now seen corresponding path program 1 times [2018-10-27 09:02:43,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:02:43,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:43,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:02:43,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:43,878 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:02:43,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:02:44,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:02:44,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 09:02:44,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 09:02:44,098 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:02:44,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 09:02:44,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 09:02:44,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 09:02:44,104 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 3 states. [2018-10-27 09:02:44,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:02:44,420 INFO L93 Difference]: Finished difference Result 64 states and 76 transitions. [2018-10-27 09:02:44,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 09:02:44,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-27 09:02:44,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:02:44,423 INFO L225 Difference]: With dead ends: 64 [2018-10-27 09:02:44,423 INFO L226 Difference]: Without dead ends: 39 [2018-10-27 09:02:44,427 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 09:02:44,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-27 09:02:44,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-10-27 09:02:44,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-27 09:02:44,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2018-10-27 09:02:44,440 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 21 [2018-10-27 09:02:44,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:02:44,440 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2018-10-27 09:02:44,441 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 09:02:44,441 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2018-10-27 09:02:44,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-27 09:02:44,442 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:02:44,443 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:02:44,443 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:02:44,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:02:44,443 INFO L82 PathProgramCache]: Analyzing trace with hash -1500559425, now seen corresponding path program 1 times [2018-10-27 09:02:44,444 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:02:44,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:44,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:02:44,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:44,446 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:02:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:02:44,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:02:44,688 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:02:44,689 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:02:44,690 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-10-27 09:02:44,692 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [17], [21], [25], [29], [32], [58], [62], [65], [77], [81], [86], [96], [99], [101], [107], [108], [109], [111] [2018-10-27 09:02:44,733 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:02:44,733 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:02:44,905 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 09:02:44,906 INFO L272 AbstractInterpreter]: Visited 11 different actions 15 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 48 variables. [2018-10-27 09:02:44,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:02:44,957 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 09:02:45,121 INFO L227 lantSequenceWeakener]: Weakened 10 states. On average, predicates are now at 91.25% of their original sizes. [2018-10-27 09:02:45,121 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 09:02:45,287 INFO L415 sIntCurrentIteration]: We unified 24 AI predicates to 24 [2018-10-27 09:02:45,288 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 09:02:45,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 09:02:45,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [4] total 7 [2018-10-27 09:02:45,291 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:02:45,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 09:02:45,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 09:02:45,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 09:02:45,293 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand 5 states. [2018-10-27 09:02:46,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:02:46,278 INFO L93 Difference]: Finished difference Result 72 states and 87 transitions. [2018-10-27 09:02:46,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 09:02:46,278 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-10-27 09:02:46,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:02:46,280 INFO L225 Difference]: With dead ends: 72 [2018-10-27 09:02:46,280 INFO L226 Difference]: Without dead ends: 43 [2018-10-27 09:02:46,281 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 25 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-27 09:02:46,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-27 09:02:46,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-10-27 09:02:46,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-27 09:02:46,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-10-27 09:02:46,288 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 25 [2018-10-27 09:02:46,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:02:46,288 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-10-27 09:02:46,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 09:02:46,289 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-10-27 09:02:46,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-27 09:02:46,290 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:02:46,290 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:02:46,290 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:02:46,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:02:46,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1612370840, now seen corresponding path program 1 times [2018-10-27 09:02:46,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:02:46,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:46,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:02:46,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:46,293 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:02:46,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:02:46,662 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 09:02:46,663 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:02:46,663 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:02:46,663 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-10-27 09:02:46,663 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [17], [19], [21], [25], [29], [32], [58], [62], [65], [77], [81], [86], [96], [99], [101], [107], [108], [109], [111] [2018-10-27 09:02:46,667 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:02:46,668 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:02:46,726 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 09:02:46,727 INFO L272 AbstractInterpreter]: Visited 15 different actions 27 times. Merged at 4 different actions 8 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 48 variables. [2018-10-27 09:02:46,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:02:46,765 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 09:02:46,812 INFO L227 lantSequenceWeakener]: Weakened 17 states. On average, predicates are now at 81.17% of their original sizes. [2018-10-27 09:02:46,812 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 09:02:47,201 INFO L415 sIntCurrentIteration]: We unified 28 AI predicates to 28 [2018-10-27 09:02:47,201 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 09:02:47,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 09:02:47,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2018-10-27 09:02:47,202 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:02:47,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-27 09:02:47,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-27 09:02:47,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-10-27 09:02:47,203 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 6 states. [2018-10-27 09:02:47,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:02:47,843 INFO L93 Difference]: Finished difference Result 76 states and 89 transitions. [2018-10-27 09:02:47,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 09:02:47,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-10-27 09:02:47,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:02:47,847 INFO L225 Difference]: With dead ends: 76 [2018-10-27 09:02:47,851 INFO L226 Difference]: Without dead ends: 59 [2018-10-27 09:02:47,852 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-27 09:02:47,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-27 09:02:47,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 46. [2018-10-27 09:02:47,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-27 09:02:47,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2018-10-27 09:02:47,874 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 29 [2018-10-27 09:02:47,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:02:47,876 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2018-10-27 09:02:47,876 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-27 09:02:47,877 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2018-10-27 09:02:47,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-27 09:02:47,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:02:47,878 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:02:47,878 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:02:47,880 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:02:47,881 INFO L82 PathProgramCache]: Analyzing trace with hash -554026779, now seen corresponding path program 1 times [2018-10-27 09:02:47,881 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:02:47,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:47,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:02:47,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:47,883 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:02:47,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:02:48,152 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 09:02:48,153 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:02:48,153 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:02:48,153 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 39 with the following transitions: [2018-10-27 09:02:48,153 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [17], [19], [21], [25], [29], [32], [34], [38], [41], [54], [58], [62], [65], [67], [71], [73], [77], [81], [86], [96], [99], [101], [107], [108], [109], [111] [2018-10-27 09:02:48,157 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:02:48,158 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:02:48,200 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 09:02:48,200 INFO L272 AbstractInterpreter]: Visited 18 different actions 30 times. Merged at 4 different actions 8 times. Never widened. Found 3 fixpoints after 2 different actions. Largest state had 55 variables. [2018-10-27 09:02:48,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:02:48,230 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 09:02:48,277 INFO L227 lantSequenceWeakener]: Weakened 21 states. On average, predicates are now at 59.5% of their original sizes. [2018-10-27 09:02:48,278 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 09:02:48,823 INFO L415 sIntCurrentIteration]: We unified 37 AI predicates to 37 [2018-10-27 09:02:48,824 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 09:02:48,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 09:02:48,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 10 [2018-10-27 09:02:48,825 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:02:48,826 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-27 09:02:48,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-27 09:02:48,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-10-27 09:02:48,829 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand 7 states. [2018-10-27 09:02:49,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:02:49,591 INFO L93 Difference]: Finished difference Result 89 states and 105 transitions. [2018-10-27 09:02:49,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 09:02:49,591 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 38 [2018-10-27 09:02:49,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:02:49,593 INFO L225 Difference]: With dead ends: 89 [2018-10-27 09:02:49,593 INFO L226 Difference]: Without dead ends: 63 [2018-10-27 09:02:49,594 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-10-27 09:02:49,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-27 09:02:49,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 48. [2018-10-27 09:02:49,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-27 09:02:49,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2018-10-27 09:02:49,602 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 38 [2018-10-27 09:02:49,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:02:49,603 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2018-10-27 09:02:49,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-27 09:02:49,603 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2018-10-27 09:02:49,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-27 09:02:49,604 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:02:49,604 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:02:49,605 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:02:49,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:02:49,605 INFO L82 PathProgramCache]: Analyzing trace with hash -556797698, now seen corresponding path program 1 times [2018-10-27 09:02:49,605 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:02:49,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:49,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:02:49,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:49,607 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:02:49,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:02:49,872 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 09:02:49,872 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:02:49,872 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:02:49,873 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-10-27 09:02:49,873 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [17], [19], [21], [25], [29], [32], [34], [38], [41], [43], [48], [50], [54], [58], [62], [65], [67], [71], [73], [77], [81], [86], [96], [99], [101], [107], [108], [109], [111] [2018-10-27 09:02:49,876 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:02:49,876 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:02:49,996 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:02:49,997 INFO L272 AbstractInterpreter]: Visited 35 different actions 84 times. Merged at 16 different actions 37 times. Never widened. Found 8 fixpoints after 6 different actions. Largest state had 61 variables. [2018-10-27 09:02:50,025 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:02:50,027 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:02:50,027 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:02:50,027 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-27 09:02:50,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:02:50,048 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:02:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:02:50,127 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:02:50,301 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 09:02:50,301 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:02:50,510 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 09:02:50,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:02:50,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-10-27 09:02:50,533 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:02:50,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 09:02:50,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 09:02:50,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2018-10-27 09:02:50,534 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand 8 states. [2018-10-27 09:02:50,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:02:50,920 INFO L93 Difference]: Finished difference Result 93 states and 108 transitions. [2018-10-27 09:02:50,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 09:02:50,920 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-10-27 09:02:50,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:02:50,921 INFO L225 Difference]: With dead ends: 93 [2018-10-27 09:02:50,921 INFO L226 Difference]: Without dead ends: 62 [2018-10-27 09:02:50,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=46, Unknown=0, NotChecked=0, Total=90 [2018-10-27 09:02:50,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-27 09:02:50,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 55. [2018-10-27 09:02:50,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-27 09:02:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 63 transitions. [2018-10-27 09:02:50,933 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 63 transitions. Word has length 42 [2018-10-27 09:02:50,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:02:50,934 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 63 transitions. [2018-10-27 09:02:50,934 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 09:02:50,934 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-10-27 09:02:50,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-27 09:02:50,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:02:50,939 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:02:50,939 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:02:50,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:02:50,940 INFO L82 PathProgramCache]: Analyzing trace with hash 1742006791, now seen corresponding path program 2 times [2018-10-27 09:02:50,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:02:50,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:50,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:02:50,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:50,941 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:02:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:02:51,281 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 09:02:51,281 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:02:51,282 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:02:51,282 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:02:51,282 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:02:51,282 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:02:51,282 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-27 09:02:51,295 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:02:51,295 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:02:51,488 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 09:02:51,488 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:02:51,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:02:51,567 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-27 09:02:51,567 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:02:51,669 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-10-27 09:02:51,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:02:51,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2018-10-27 09:02:51,703 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:02:51,704 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 09:02:51,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 09:02:51,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-10-27 09:02:51,705 INFO L87 Difference]: Start difference. First operand 55 states and 63 transitions. Second operand 10 states. [2018-10-27 09:02:52,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:02:52,198 INFO L93 Difference]: Finished difference Result 140 states and 169 transitions. [2018-10-27 09:02:52,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 09:02:52,198 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 46 [2018-10-27 09:02:52,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:02:52,200 INFO L225 Difference]: With dead ends: 140 [2018-10-27 09:02:52,201 INFO L226 Difference]: Without dead ends: 109 [2018-10-27 09:02:52,202 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2018-10-27 09:02:52,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-27 09:02:52,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 69. [2018-10-27 09:02:52,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-27 09:02:52,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2018-10-27 09:02:52,223 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 46 [2018-10-27 09:02:52,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:02:52,223 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2018-10-27 09:02:52,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 09:02:52,223 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-10-27 09:02:52,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-27 09:02:52,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:02:52,225 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:02:52,225 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:02:52,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:02:52,226 INFO L82 PathProgramCache]: Analyzing trace with hash -544875330, now seen corresponding path program 3 times [2018-10-27 09:02:52,226 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:02:52,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:52,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:02:52,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:52,227 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:02:52,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:02:52,653 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-10-27 09:02:52,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:02:52,653 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:02:52,654 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:02:52,654 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:02:52,654 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:02:52,654 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:02:52,668 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 09:02:52,668 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 09:02:52,708 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 09:02:52,708 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:02:52,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:02:52,784 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-27 09:02:52,784 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:02:52,862 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 18 proven. 6 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-27 09:02:52,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:02:52,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2018-10-27 09:02:52,884 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:02:52,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 09:02:52,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 09:02:52,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-10-27 09:02:52,886 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand 9 states. [2018-10-27 09:02:53,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:02:53,400 INFO L93 Difference]: Finished difference Result 154 states and 184 transitions. [2018-10-27 09:02:53,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 09:02:53,401 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 60 [2018-10-27 09:02:53,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:02:53,402 INFO L225 Difference]: With dead ends: 154 [2018-10-27 09:02:53,402 INFO L226 Difference]: Without dead ends: 105 [2018-10-27 09:02:53,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 116 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2018-10-27 09:02:53,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-27 09:02:53,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2018-10-27 09:02:53,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-27 09:02:53,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 89 transitions. [2018-10-27 09:02:53,418 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 89 transitions. Word has length 60 [2018-10-27 09:02:53,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:02:53,418 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 89 transitions. [2018-10-27 09:02:53,418 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 09:02:53,419 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 89 transitions. [2018-10-27 09:02:53,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-27 09:02:53,420 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:02:53,420 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:02:53,420 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:02:53,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:02:53,421 INFO L82 PathProgramCache]: Analyzing trace with hash -1448575321, now seen corresponding path program 4 times [2018-10-27 09:02:53,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:02:53,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:53,422 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:02:53,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:53,422 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:02:53,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:02:53,800 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-27 09:02:53,800 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:02:53,801 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:02:53,801 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:02:53,801 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:02:53,801 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:02:53,801 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:02:53,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:02:53,809 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:02:53,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:02:53,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:02:53,927 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-27 09:02:53,928 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:02:53,967 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-10-27 09:02:53,988 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-10-27 09:02:53,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [8] total 12 [2018-10-27 09:02:53,988 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 09:02:53,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 09:02:53,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 09:02:53,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-10-27 09:02:53,989 INFO L87 Difference]: Start difference. First operand 77 states and 89 transitions. Second operand 4 states. [2018-10-27 09:02:54,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:02:54,182 INFO L93 Difference]: Finished difference Result 146 states and 170 transitions. [2018-10-27 09:02:54,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 09:02:54,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-10-27 09:02:54,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:02:54,186 INFO L225 Difference]: With dead ends: 146 [2018-10-27 09:02:54,186 INFO L226 Difference]: Without dead ends: 82 [2018-10-27 09:02:54,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-10-27 09:02:54,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-27 09:02:54,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2018-10-27 09:02:54,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-27 09:02:54,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 86 transitions. [2018-10-27 09:02:54,199 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 86 transitions. Word has length 72 [2018-10-27 09:02:54,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:02:54,199 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 86 transitions. [2018-10-27 09:02:54,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 09:02:54,199 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-10-27 09:02:54,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-27 09:02:54,201 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:02:54,201 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:02:54,201 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:02:54,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:02:54,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1246751387, now seen corresponding path program 5 times [2018-10-27 09:02:54,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:02:54,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:54,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:02:54,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:54,203 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:02:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:02:54,639 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2018-10-27 09:02:54,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:02:54,640 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:02:54,640 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:02:54,640 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:02:54,640 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:02:54,640 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:02:54,654 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:02:54,655 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:02:54,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 09:02:54,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:02:54,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:02:55,044 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-10-27 09:02:55,044 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:02:55,099 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-10-27 09:02:55,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:02:55,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 13 [2018-10-27 09:02:55,122 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:02:55,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-27 09:02:55,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 09:02:55,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-10-27 09:02:55,123 INFO L87 Difference]: Start difference. First operand 77 states and 86 transitions. Second operand 10 states. [2018-10-27 09:02:55,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:02:55,507 INFO L93 Difference]: Finished difference Result 152 states and 179 transitions. [2018-10-27 09:02:55,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 09:02:55,507 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2018-10-27 09:02:55,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:02:55,509 INFO L225 Difference]: With dead ends: 152 [2018-10-27 09:02:55,509 INFO L226 Difference]: Without dead ends: 99 [2018-10-27 09:02:55,510 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2018-10-27 09:02:55,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-27 09:02:55,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2018-10-27 09:02:55,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-27 09:02:55,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 105 transitions. [2018-10-27 09:02:55,526 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 105 transitions. Word has length 72 [2018-10-27 09:02:55,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:02:55,526 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 105 transitions. [2018-10-27 09:02:55,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-27 09:02:55,526 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 105 transitions. [2018-10-27 09:02:55,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-27 09:02:55,528 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:02:55,528 INFO L375 BasicCegarLoop]: trace histogram [9, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:02:55,528 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:02:55,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:02:55,529 INFO L82 PathProgramCache]: Analyzing trace with hash 803986661, now seen corresponding path program 6 times [2018-10-27 09:02:55,529 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:02:55,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:55,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:02:55,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:55,530 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:02:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:02:55,730 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 58 proven. 8 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-10-27 09:02:55,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:02:55,731 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:02:55,731 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:02:55,731 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:02:55,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:02:55,731 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-27 09:02:55,745 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 09:02:55,745 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 09:02:55,820 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 09:02:55,820 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:02:55,825 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:02:55,908 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 58 proven. 8 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-10-27 09:02:55,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:02:56,212 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 58 proven. 8 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2018-10-27 09:02:56,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:02:56,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2018-10-27 09:02:56,233 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:02:56,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-27 09:02:56,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-27 09:02:56,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2018-10-27 09:02:56,234 INFO L87 Difference]: Start difference. First operand 93 states and 105 transitions. Second operand 9 states. [2018-10-27 09:02:56,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:02:56,736 INFO L93 Difference]: Finished difference Result 163 states and 192 transitions. [2018-10-27 09:02:56,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-27 09:02:56,736 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2018-10-27 09:02:56,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:02:56,737 INFO L225 Difference]: With dead ends: 163 [2018-10-27 09:02:56,737 INFO L226 Difference]: Without dead ends: 111 [2018-10-27 09:02:56,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=67, Invalid=89, Unknown=0, NotChecked=0, Total=156 [2018-10-27 09:02:56,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-27 09:02:56,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2018-10-27 09:02:56,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-27 09:02:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 120 transitions. [2018-10-27 09:02:56,753 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 120 transitions. Word has length 88 [2018-10-27 09:02:56,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:02:56,754 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 120 transitions. [2018-10-27 09:02:56,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-27 09:02:56,754 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 120 transitions. [2018-10-27 09:02:56,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-27 09:02:56,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:02:56,756 INFO L375 BasicCegarLoop]: trace histogram [12, 9, 9, 9, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:02:56,756 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:02:56,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:02:56,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1282364450, now seen corresponding path program 7 times [2018-10-27 09:02:56,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:02:56,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:56,757 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:02:56,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:56,758 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:02:56,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:02:57,048 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 106 proven. 18 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-10-27 09:02:57,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:02:57,049 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:02:57,049 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:02:57,049 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:02:57,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:02:57,049 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-27 09:02:57,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:02:57,057 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:02:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:02:57,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:02:57,370 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 106 proven. 18 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-10-27 09:02:57,371 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:02:57,473 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 106 proven. 18 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2018-10-27 09:02:57,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:02:57,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2018-10-27 09:02:57,495 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:02:57,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 09:02:57,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 09:02:57,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-10-27 09:02:57,497 INFO L87 Difference]: Start difference. First operand 105 states and 120 transitions. Second operand 11 states. [2018-10-27 09:02:57,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:02:57,949 INFO L93 Difference]: Finished difference Result 183 states and 217 transitions. [2018-10-27 09:02:57,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 09:02:57,949 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 100 [2018-10-27 09:02:57,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:02:57,952 INFO L225 Difference]: With dead ends: 183 [2018-10-27 09:02:57,952 INFO L226 Difference]: Without dead ends: 123 [2018-10-27 09:02:57,953 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=137, Unknown=0, NotChecked=0, Total=240 [2018-10-27 09:02:57,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-27 09:02:57,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 117. [2018-10-27 09:02:57,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-27 09:02:57,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 135 transitions. [2018-10-27 09:02:57,966 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 135 transitions. Word has length 100 [2018-10-27 09:02:57,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:02:57,967 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 135 transitions. [2018-10-27 09:02:57,967 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 09:02:57,967 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 135 transitions. [2018-10-27 09:02:57,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-27 09:02:57,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:02:57,969 INFO L375 BasicCegarLoop]: trace histogram [15, 12, 12, 12, 6, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:02:57,969 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:02:57,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:02:57,969 INFO L82 PathProgramCache]: Analyzing trace with hash -639890089, now seen corresponding path program 8 times [2018-10-27 09:02:57,969 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:02:57,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:57,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:02:57,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:02:57,971 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:02:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:02:58,683 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 170 proven. 32 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2018-10-27 09:02:58,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:02:58,683 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:02:58,683 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:02:58,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:02:58,684 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:02:58,684 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-27 09:02:58,693 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:02:58,693 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:02:59,082 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 09:02:59,082 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:02:59,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:02:59,146 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2018-10-27 09:02:59,147 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:02:59,233 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 407 trivial. 0 not checked. [2018-10-27 09:02:59,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:02:59,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 15 [2018-10-27 09:02:59,266 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:02:59,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-27 09:02:59,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-27 09:02:59,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2018-10-27 09:02:59,268 INFO L87 Difference]: Start difference. First operand 117 states and 135 transitions. Second operand 11 states. [2018-10-27 09:03:00,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:03:00,518 INFO L93 Difference]: Finished difference Result 249 states and 300 transitions. [2018-10-27 09:03:00,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-27 09:03:00,519 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 112 [2018-10-27 09:03:00,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:03:00,521 INFO L225 Difference]: With dead ends: 249 [2018-10-27 09:03:00,521 INFO L226 Difference]: Without dead ends: 181 [2018-10-27 09:03:00,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=394, Invalid=728, Unknown=0, NotChecked=0, Total=1122 [2018-10-27 09:03:00,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-27 09:03:00,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 133. [2018-10-27 09:03:00,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-27 09:03:00,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 154 transitions. [2018-10-27 09:03:00,537 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 154 transitions. Word has length 112 [2018-10-27 09:03:00,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:03:00,537 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 154 transitions. [2018-10-27 09:03:00,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-27 09:03:00,537 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 154 transitions. [2018-10-27 09:03:00,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-27 09:03:00,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:03:00,539 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 15, 15, 6, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:03:00,539 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:03:00,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:03:00,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1673782583, now seen corresponding path program 9 times [2018-10-27 09:03:00,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:03:00,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:00,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:03:00,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:00,541 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:03:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:00,715 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 250 proven. 50 refuted. 0 times theorem prover too weak. 299 trivial. 0 not checked. [2018-10-27 09:03:00,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:00,715 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:03:00,716 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:03:00,716 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:03:00,716 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:00,716 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:03:00,724 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 09:03:00,724 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 09:03:00,818 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 09:03:00,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:03:00,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:03:00,973 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 38 proven. 236 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-10-27 09:03:00,973 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:03:01,107 INFO L134 CoverageAnalysis]: Checked inductivity of 599 backedges. 38 proven. 236 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2018-10-27 09:03:01,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:03:01,129 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 12] total 25 [2018-10-27 09:03:01,129 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:03:01,129 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-27 09:03:01,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-27 09:03:01,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2018-10-27 09:03:01,130 INFO L87 Difference]: Start difference. First operand 133 states and 154 transitions. Second operand 19 states. [2018-10-27 09:03:03,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:03:03,373 INFO L93 Difference]: Finished difference Result 318 states and 386 transitions. [2018-10-27 09:03:03,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-27 09:03:03,374 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 128 [2018-10-27 09:03:03,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:03:03,376 INFO L225 Difference]: With dead ends: 318 [2018-10-27 09:03:03,376 INFO L226 Difference]: Without dead ends: 238 [2018-10-27 09:03:03,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 241 SyntacticMatches, 4 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=960, Invalid=2946, Unknown=0, NotChecked=0, Total=3906 [2018-10-27 09:03:03,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-27 09:03:03,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 149. [2018-10-27 09:03:03,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-27 09:03:03,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 173 transitions. [2018-10-27 09:03:03,396 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 173 transitions. Word has length 128 [2018-10-27 09:03:03,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:03:03,396 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 173 transitions. [2018-10-27 09:03:03,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-27 09:03:03,396 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 173 transitions. [2018-10-27 09:03:03,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-27 09:03:03,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:03:03,398 INFO L375 BasicCegarLoop]: trace histogram [21, 18, 18, 18, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:03:03,398 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:03:03,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:03:03,399 INFO L82 PathProgramCache]: Analyzing trace with hash -2123608773, now seen corresponding path program 10 times [2018-10-27 09:03:03,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:03:03,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:03,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:03:03,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:03,400 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:03:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:03,581 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 346 proven. 72 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2018-10-27 09:03:03,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:03,582 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:03:03,582 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:03:03,582 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:03:03,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:03,582 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:03:03,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:03:03,591 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:03:03,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:03,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:03:03,908 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 346 proven. 72 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2018-10-27 09:03:03,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:03:04,125 INFO L134 CoverageAnalysis]: Checked inductivity of 823 backedges. 346 proven. 72 refuted. 0 times theorem prover too weak. 405 trivial. 0 not checked. [2018-10-27 09:03:04,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:03:04,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2018-10-27 09:03:04,147 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:03:04,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-27 09:03:04,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-27 09:03:04,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2018-10-27 09:03:04,149 INFO L87 Difference]: Start difference. First operand 149 states and 173 transitions. Second operand 17 states. [2018-10-27 09:03:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:03:04,988 INFO L93 Difference]: Finished difference Result 259 states and 308 transitions. [2018-10-27 09:03:04,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 09:03:04,989 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 144 [2018-10-27 09:03:04,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:03:04,991 INFO L225 Difference]: With dead ends: 259 [2018-10-27 09:03:04,991 INFO L226 Difference]: Without dead ends: 167 [2018-10-27 09:03:04,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=341, Unknown=0, NotChecked=0, Total=600 [2018-10-27 09:03:04,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-27 09:03:05,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 161. [2018-10-27 09:03:05,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-27 09:03:05,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 188 transitions. [2018-10-27 09:03:05,008 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 188 transitions. Word has length 144 [2018-10-27 09:03:05,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:03:05,009 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 188 transitions. [2018-10-27 09:03:05,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-27 09:03:05,009 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 188 transitions. [2018-10-27 09:03:05,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-27 09:03:05,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:03:05,011 INFO L375 BasicCegarLoop]: trace histogram [24, 21, 21, 21, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:03:05,011 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:03:05,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:03:05,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1855267532, now seen corresponding path program 11 times [2018-10-27 09:03:05,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:03:05,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:05,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:03:05,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:05,012 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:03:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:05,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 458 proven. 98 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2018-10-27 09:03:05,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:05,263 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:03:05,263 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:03:05,263 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:03:05,263 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:05,263 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-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 [2018-10-27 09:03:05,271 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:03:05,271 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:03:05,785 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-10-27 09:03:05,785 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:03:05,791 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:03:05,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 1037 trivial. 0 not checked. [2018-10-27 09:03:05,897 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:03:05,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 1037 trivial. 0 not checked. [2018-10-27 09:03:06,005 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:03:06,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 8] total 22 [2018-10-27 09:03:06,006 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:03:06,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-27 09:03:06,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-27 09:03:06,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2018-10-27 09:03:06,007 INFO L87 Difference]: Start difference. First operand 161 states and 188 transitions. Second operand 16 states. [2018-10-27 09:03:08,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:03:08,178 INFO L93 Difference]: Finished difference Result 429 states and 524 transitions. [2018-10-27 09:03:08,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-27 09:03:08,178 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 156 [2018-10-27 09:03:08,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:03:08,181 INFO L225 Difference]: With dead ends: 429 [2018-10-27 09:03:08,182 INFO L226 Difference]: Without dead ends: 329 [2018-10-27 09:03:08,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1546, Invalid=3146, Unknown=0, NotChecked=0, Total=4692 [2018-10-27 09:03:08,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-10-27 09:03:08,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 177. [2018-10-27 09:03:08,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-27 09:03:08,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 207 transitions. [2018-10-27 09:03:08,205 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 207 transitions. Word has length 156 [2018-10-27 09:03:08,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:03:08,205 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 207 transitions. [2018-10-27 09:03:08,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-27 09:03:08,206 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 207 transitions. [2018-10-27 09:03:08,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-27 09:03:08,207 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:03:08,208 INFO L375 BasicCegarLoop]: trace histogram [27, 24, 24, 24, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:03:08,208 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:03:08,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:03:08,208 INFO L82 PathProgramCache]: Analyzing trace with hash -1216945498, now seen corresponding path program 12 times [2018-10-27 09:03:08,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:03:08,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:08,209 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:03:08,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:08,209 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:03:08,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:08,685 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 586 proven. 128 refuted. 0 times theorem prover too weak. 655 trivial. 0 not checked. [2018-10-27 09:03:08,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:08,686 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:03:08,686 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:03:08,686 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:03:08,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:08,686 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:03:08,696 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 09:03:08,696 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 09:03:08,823 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 09:03:08,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:03:08,828 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:03:09,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 104 proven. 592 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2018-10-27 09:03:09,339 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:03:09,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 104 proven. 592 refuted. 0 times theorem prover too weak. 673 trivial. 0 not checked. [2018-10-27 09:03:09,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:03:09,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 17, 17] total 36 [2018-10-27 09:03:09,622 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:03:09,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-27 09:03:09,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-27 09:03:09,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1029, Unknown=0, NotChecked=0, Total=1260 [2018-10-27 09:03:09,623 INFO L87 Difference]: Start difference. First operand 177 states and 207 transitions. Second operand 27 states. [2018-10-27 09:03:11,446 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-27 09:03:12,687 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2018-10-27 09:03:14,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:03:14,313 INFO L93 Difference]: Finished difference Result 523 states and 641 transitions. [2018-10-27 09:03:14,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-27 09:03:14,314 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 172 [2018-10-27 09:03:14,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:03:14,318 INFO L225 Difference]: With dead ends: 523 [2018-10-27 09:03:14,318 INFO L226 Difference]: Without dead ends: 411 [2018-10-27 09:03:14,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 436 GetRequests, 321 SyntacticMatches, 6 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3540 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2553, Invalid=9657, Unknown=0, NotChecked=0, Total=12210 [2018-10-27 09:03:14,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2018-10-27 09:03:14,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 193. [2018-10-27 09:03:14,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-27 09:03:14,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 226 transitions. [2018-10-27 09:03:14,345 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 226 transitions. Word has length 172 [2018-10-27 09:03:14,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:03:14,345 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 226 transitions. [2018-10-27 09:03:14,345 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-27 09:03:14,346 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 226 transitions. [2018-10-27 09:03:14,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-27 09:03:14,347 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:03:14,348 INFO L375 BasicCegarLoop]: trace histogram [30, 27, 27, 27, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:03:14,348 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:03:14,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:03:14,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1852116248, now seen corresponding path program 13 times [2018-10-27 09:03:14,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:03:14,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:14,349 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:03:14,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:14,349 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:03:14,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:15,562 INFO L134 CoverageAnalysis]: Checked inductivity of 1709 backedges. 730 proven. 162 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2018-10-27 09:03:15,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:15,562 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:03:15,562 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:03:15,562 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:03:15,562 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:15,562 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:03:15,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:03:15,573 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:03:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:15,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:03:15,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1709 backedges. 730 proven. 162 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2018-10-27 09:03:15,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:03:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1709 backedges. 730 proven. 162 refuted. 0 times theorem prover too weak. 817 trivial. 0 not checked. [2018-10-27 09:03:16,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:03:16,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 34 [2018-10-27 09:03:16,120 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:03:16,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-27 09:03:16,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-27 09:03:16,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=635, Unknown=0, NotChecked=0, Total=1122 [2018-10-27 09:03:16,121 INFO L87 Difference]: Start difference. First operand 193 states and 226 transitions. Second operand 23 states. [2018-10-27 09:03:17,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:03:17,577 INFO L93 Difference]: Finished difference Result 335 states and 399 transitions. [2018-10-27 09:03:17,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-27 09:03:17,577 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 188 [2018-10-27 09:03:17,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:03:17,579 INFO L225 Difference]: With dead ends: 335 [2018-10-27 09:03:17,579 INFO L226 Difference]: Without dead ends: 211 [2018-10-27 09:03:17,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 356 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 436 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=487, Invalid=635, Unknown=0, NotChecked=0, Total=1122 [2018-10-27 09:03:17,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-27 09:03:17,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 205. [2018-10-27 09:03:17,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-27 09:03:17,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 241 transitions. [2018-10-27 09:03:17,605 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 241 transitions. Word has length 188 [2018-10-27 09:03:17,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:03:17,605 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 241 transitions. [2018-10-27 09:03:17,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-27 09:03:17,606 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 241 transitions. [2018-10-27 09:03:17,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-27 09:03:17,607 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:03:17,607 INFO L375 BasicCegarLoop]: trace histogram [33, 30, 30, 30, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:03:17,607 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:03:17,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:03:17,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1297877905, now seen corresponding path program 14 times [2018-10-27 09:03:17,608 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:03:17,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:17,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:03:17,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:03:17,609 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:03:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:03:18,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2063 backedges. 890 proven. 200 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2018-10-27 09:03:18,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:18,534 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:03:18,534 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:03:18,534 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:03:18,534 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:03:18,535 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:03:18,542 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:03:18,542 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:03:19,123 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-27 09:03:19,124 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:03:19,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:03:19,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-10-27 09:03:19,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 09:03:19,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:19,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:19,223 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:19,223 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-10-27 09:03:19,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-27 09:03:19,353 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:19,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 23 [2018-10-27 09:03:19,356 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:19,370 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:19,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:19,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:17 [2018-10-27 09:03:19,456 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2018-10-27 09:03:19,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 22 [2018-10-27 09:03:19,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 09:03:19,525 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 09:03:19,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 09:03:19,564 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:33 [2018-10-27 09:03:19,638 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 28 [2018-10-27 09:03:19,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-10-27 09:03:19,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:19,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:19,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-10-27 09:03:19,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 22 [2018-10-27 09:03:19,699 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-27 09:03:19,722 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 09:03:19,774 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 09:03:19,774 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:67, output treesize:46 [2018-10-27 09:03:19,914 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 31 [2018-10-27 09:03:19,917 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:03:19,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-10-27 09:03:19,919 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:19,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:19,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 26 [2018-10-27 09:03:19,985 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-10-27 09:03:19,985 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:19,993 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:20,022 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 09:03:20,022 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:69, output treesize:40 [2018-10-27 09:03:20,332 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 09:03:20,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-10-27 09:03:20,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 09:03:20,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:20,336 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:03:20,336 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-10-27 09:03:20,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2063 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 2013 trivial. 0 not checked. [2018-10-27 09:03:20,490 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:04:00,784 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2018-10-27 09:04:00,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2018-10-27 09:04:00,789 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:00,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 54 [2018-10-27 09:04:00,819 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:00,901 INFO L303 Elim1Store]: Index analysis took 108 ms [2018-10-27 09:04:00,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 76 [2018-10-27 09:04:01,008 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:01,064 INFO L303 Elim1Store]: Index analysis took 102 ms [2018-10-27 09:04:01,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 57 treesize of output 109 [2018-10-27 09:04:02,779 WARN L179 SmtUtils]: Spent 1.65 s on a formula simplification. DAG size of input: 467 DAG size of output: 335 [2018-10-27 09:04:02,791 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:02,793 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:02,797 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:02,823 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 92 [2018-10-27 09:04:02,826 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 8 xjuncts. [2018-10-27 09:04:02,852 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:02,854 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:02,857 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:02,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 92 [2018-10-27 09:04:02,907 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 8 xjuncts. [2018-10-27 09:04:02,911 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:02,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 52 [2018-10-27 09:04:02,921 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-10-27 09:04:05,701 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:05,713 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:05,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 59 [2018-10-27 09:04:05,724 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-10-27 09:04:05,731 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:05,733 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:05,734 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:05,737 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:05,760 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 89 [2018-10-27 09:04:05,764 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 8 xjuncts. [2018-10-27 09:04:07,960 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:07,963 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:07,972 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 48 [2018-10-27 09:04:07,973 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-10-27 09:04:07,979 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:07,979 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:07,983 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:07,986 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:07,987 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:07,990 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:08,009 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 77 [2018-10-27 09:04:08,011 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 3 xjuncts. [2018-10-27 09:04:09,902 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:09,902 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:09,904 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:09,911 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 63 [2018-10-27 09:04:09,913 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-10-27 09:04:09,923 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:09,925 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-10-27 09:04:09,925 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:11,593 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:11,595 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:11,600 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2018-10-27 09:04:11,601 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:11,628 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:11,630 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:11,632 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:11,632 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:11,634 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:11,637 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:11,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 73 [2018-10-27 09:04:11,650 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-10-27 09:04:14,489 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:14,490 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:14,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 60 [2018-10-27 09:04:14,502 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-10-27 09:04:14,510 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:14,511 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:14,512 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:14,517 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:14,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 90 [2018-10-27 09:04:14,542 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 7 xjuncts. [2018-10-27 09:04:18,972 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:18,974 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-10-27 09:04:18,974 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:18,989 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:19,031 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 68 [2018-10-27 09:04:19,034 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 4 xjuncts. [2018-10-27 09:04:20,337 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:20,341 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:20,367 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 68 [2018-10-27 09:04:20,369 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 4 xjuncts. [2018-10-27 09:04:20,376 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:20,380 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:20,408 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:20,431 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:20,475 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 57 treesize of output 106 [2018-10-27 09:04:20,476 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 09:04:20,482 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 14 xjuncts. [2018-10-27 09:04:22,008 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:22,077 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 77 [2018-10-27 09:04:22,081 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 16 xjuncts. [2018-10-27 09:04:22,139 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:22,142 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:22,149 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:22,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 53 treesize of output 115 [2018-10-27 09:04:22,199 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-10-27 09:04:22,224 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 96 xjuncts. [2018-10-27 09:04:25,298 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:25,299 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:25,299 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:25,300 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:25,303 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:25,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 88 [2018-10-27 09:04:25,322 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 4 xjuncts. [2018-10-27 09:04:25,326 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:25,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 64 [2018-10-27 09:04:25,346 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 4 xjuncts. [2018-10-27 09:04:26,920 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:26,924 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:26,933 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:26,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 120 [2018-10-27 09:04:26,991 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-10-27 09:04:27,037 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 208 xjuncts. [2018-10-27 09:04:27,110 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:27,265 INFO L303 Elim1Store]: Index analysis took 227 ms [2018-10-27 09:04:27,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 82 [2018-10-27 09:04:27,298 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 32 xjuncts. [2018-10-27 09:04:31,690 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:31,696 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:31,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 86 [2018-10-27 09:04:31,723 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 4 xjuncts. [2018-10-27 09:04:31,733 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:31,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 44 [2018-10-27 09:04:31,751 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-10-27 09:04:32,843 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 53 [2018-10-27 09:04:32,845 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 8 xjuncts. [2018-10-27 09:04:32,852 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:32,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 95 [2018-10-27 09:04:32,889 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 16 xjuncts. [2018-10-27 09:04:35,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 52 [2018-10-27 09:04:35,504 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 8 xjuncts. [2018-10-27 09:04:35,510 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:35,513 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:35,517 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:35,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 91 [2018-10-27 09:04:35,545 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 6 xjuncts. [2018-10-27 09:04:36,121 INFO L267 ElimStorePlain]: Start of recursive call 6: 20 dim-1 vars, End of recursive call: and 21 xjuncts. [2018-10-27 09:04:36,593 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:36,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 77 [2018-10-27 09:04:36,761 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2018-10-27 09:04:36,767 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:36,786 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 68 [2018-10-27 09:04:36,787 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 4 xjuncts. [2018-10-27 09:04:36,791 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:36,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-10-27 09:04:36,794 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:36,800 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:36,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 68 [2018-10-27 09:04:36,819 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 4 xjuncts. [2018-10-27 09:04:37,020 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:37,022 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-10-27 09:04:37,023 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:37,027 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:37,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 70 [2018-10-27 09:04:37,109 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 4 xjuncts. [2018-10-27 09:04:38,270 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:38,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 57 [2018-10-27 09:04:38,435 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 4 xjuncts. [2018-10-27 09:04:38,445 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:38,485 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 101 [2018-10-27 09:04:38,490 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 32 xjuncts. [2018-10-27 09:04:38,824 INFO L267 ElimStorePlain]: Start of recursive call 36: 3 dim-1 vars, End of recursive call: and 9 xjuncts. [2018-10-27 09:04:39,589 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:39,619 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 77 [2018-10-27 09:04:39,760 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 67 [2018-10-27 09:04:39,816 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:39,830 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:39,841 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:39,848 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 64 [2018-10-27 09:04:39,850 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 2 xjuncts. [2018-10-27 09:04:39,853 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:39,854 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:39,856 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:39,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 64 [2018-10-27 09:04:39,866 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 2 xjuncts. [2018-10-27 09:04:39,870 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:39,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-10-27 09:04:39,872 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:40,030 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:40,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 37 [2018-10-27 09:04:40,033 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:40,038 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:40,056 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 71 [2018-10-27 09:04:40,058 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 4 xjuncts. [2018-10-27 09:04:40,243 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:40,245 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:40,251 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:40,281 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 98 [2018-10-27 09:04:40,285 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 14 xjuncts. [2018-10-27 09:04:40,289 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 09:04:40,307 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 58 [2018-10-27 09:04:40,308 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 4 xjuncts. [2018-10-27 09:04:40,512 INFO L267 ElimStorePlain]: Start of recursive call 44: 3 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-10-27 09:04:40,803 INFO L267 ElimStorePlain]: Start of recursive call 5: 4 dim-1 vars, End of recursive call: and 14 xjuncts. [2018-10-27 09:04:41,008 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 12 xjuncts. [2018-10-27 09:04:41,213 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 12 xjuncts. [2018-10-27 09:04:41,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 12 xjuncts. [2018-10-27 09:04:41,634 INFO L267 ElimStorePlain]: Start of recursive call 1: 10 dim-0 vars, 1 dim-2 vars, End of recursive call: and 9 xjuncts. [2018-10-27 09:04:41,634 INFO L202 ElimStorePlain]: Needed 51 recursive calls to eliminate 11 variables, input treesize:77, output treesize:715 [2018-10-27 09:04:41,973 WARN L179 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 20 [2018-10-27 09:04:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2063 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 2013 trivial. 0 not checked. [2018-10-27 09:04:42,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:04:42,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17, 18] total 44 [2018-10-27 09:04:42,113 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:04:42,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-27 09:04:42,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-27 09:04:42,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=1602, Unknown=21, NotChecked=0, Total=1892 [2018-10-27 09:04:42,115 INFO L87 Difference]: Start difference. First operand 205 states and 241 transitions. Second operand 29 states. [2018-10-27 09:04:45,594 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 29 [2018-10-27 09:04:46,422 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 29 [2018-10-27 09:04:53,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:04:53,223 INFO L93 Difference]: Finished difference Result 792 states and 967 transitions. [2018-10-27 09:04:53,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-27 09:04:53,223 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 200 [2018-10-27 09:04:53,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:04:53,228 INFO L225 Difference]: With dead ends: 792 [2018-10-27 09:04:53,228 INFO L226 Difference]: Without dead ends: 660 [2018-10-27 09:04:53,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 370 SyntacticMatches, 1 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8055 ImplicationChecksByTransitivity, 51.2s TimeCoverageRelationStatistics Valid=5733, Invalid=20006, Unknown=21, NotChecked=0, Total=25760 [2018-10-27 09:04:53,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2018-10-27 09:04:53,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 491. [2018-10-27 09:04:53,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491 states. [2018-10-27 09:04:53,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 591 transitions. [2018-10-27 09:04:53,290 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 591 transitions. Word has length 200 [2018-10-27 09:04:53,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:04:53,290 INFO L481 AbstractCegarLoop]: Abstraction has 491 states and 591 transitions. [2018-10-27 09:04:53,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-27 09:04:53,291 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 591 transitions. [2018-10-27 09:04:53,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-27 09:04:53,292 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:04:53,293 INFO L375 BasicCegarLoop]: trace histogram [36, 33, 33, 32, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:04:53,293 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:04:53,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:04:53,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1882388856, now seen corresponding path program 1 times [2018-10-27 09:04:53,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:04:53,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:04:53,294 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:04:53,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:04:53,294 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:04:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:04:53,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2453 backedges. 1066 proven. 242 refuted. 0 times theorem prover too weak. 1145 trivial. 0 not checked. [2018-10-27 09:04:53,695 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:04:53,695 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:04:53,695 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 213 with the following transitions: [2018-10-27 09:04:53,695 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [17], [19], [21], [25], [29], [32], [34], [38], [41], [43], [46], [48], [50], [54], [58], [62], [65], [67], [71], [73], [77], [81], [86], [96], [99], [101], [107], [108], [109], [111] [2018-10-27 09:04:53,698 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-10-27 09:04:53,699 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 09:04:53,815 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 09:04:53,816 INFO L272 AbstractInterpreter]: Visited 36 different actions 89 times. Merged at 16 different actions 37 times. Never widened. Found 13 fixpoints after 7 different actions. Largest state had 63 variables. [2018-10-27 09:04:53,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:04:53,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 09:04:53,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:04:53,855 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:04:53,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:04:53,866 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:04:54,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:04:54,043 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:04:55,037 INFO L134 CoverageAnalysis]: Checked inductivity of 2453 backedges. 1066 proven. 242 refuted. 0 times theorem prover too weak. 1145 trivial. 0 not checked. [2018-10-27 09:04:55,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:04:55,249 INFO L134 CoverageAnalysis]: Checked inductivity of 2453 backedges. 1066 proven. 242 refuted. 0 times theorem prover too weak. 1145 trivial. 0 not checked. [2018-10-27 09:04:55,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:04:55,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 36 [2018-10-27 09:04:55,271 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:04:55,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-27 09:04:55,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-27 09:04:55,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=537, Invalid=723, Unknown=0, NotChecked=0, Total=1260 [2018-10-27 09:04:55,272 INFO L87 Difference]: Start difference. First operand 491 states and 591 transitions. Second operand 27 states. [2018-10-27 09:04:56,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:04:56,161 INFO L93 Difference]: Finished difference Result 910 states and 1110 transitions. [2018-10-27 09:04:56,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-27 09:04:56,162 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 212 [2018-10-27 09:04:56,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:04:56,168 INFO L225 Difference]: With dead ends: 910 [2018-10-27 09:04:56,169 INFO L226 Difference]: Without dead ends: 539 [2018-10-27 09:04:56,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 400 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=537, Invalid=723, Unknown=0, NotChecked=0, Total=1260 [2018-10-27 09:04:56,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2018-10-27 09:04:56,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 523. [2018-10-27 09:04:56,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-10-27 09:04:56,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 631 transitions. [2018-10-27 09:04:56,239 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 631 transitions. Word has length 212 [2018-10-27 09:04:56,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:04:56,239 INFO L481 AbstractCegarLoop]: Abstraction has 523 states and 631 transitions. [2018-10-27 09:04:56,239 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-27 09:04:56,239 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 631 transitions. [2018-10-27 09:04:56,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-27 09:04:56,241 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:04:56,242 INFO L375 BasicCegarLoop]: trace histogram [39, 36, 36, 35, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:04:56,242 INFO L424 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:04:56,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:04:56,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1640371711, now seen corresponding path program 2 times [2018-10-27 09:04:56,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:04:56,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:04:56,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:04:56,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:04:56,244 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:04:56,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:04:57,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2879 backedges. 1258 proven. 288 refuted. 0 times theorem prover too weak. 1333 trivial. 0 not checked. [2018-10-27 09:04:57,065 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:04:57,066 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:04:57,066 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:04:57,066 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:04:57,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:04:57,066 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:04:57,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:04:57,074 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:04:57,891 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-27 09:04:57,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:04:57,901 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:04:57,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-10-27 09:04:57,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2018-10-27 09:04:58,077 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:58,103 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:58,153 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 09:04:58,153 INFO L303 Elim1Store]: Index analysis took 110 ms [2018-10-27 09:04:58,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-10-27 09:04:58,154 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 09:04:58,227 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:58,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:58,503 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:04:58,504 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:27, output treesize:25 [2018-10-27 09:04:59,496 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification that was a NOOP. DAG size: 65 [2018-10-27 09:04:59,816 INFO L303 Elim1Store]: Index analysis took 313 ms [2018-10-27 09:04:59,828 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 112 treesize of output 113 [2018-10-27 09:05:00,103 INFO L303 Elim1Store]: Index analysis took 273 ms [2018-10-27 09:05:00,172 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 101 treesize of output 271 [2018-10-27 09:05:00,173 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 09:05:00,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 27 xjuncts. [2018-10-27 09:05:00,462 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 8 xjuncts. [2018-10-27 09:05:00,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 24 dim-0 vars, and 7 xjuncts. [2018-10-27 09:05:00,615 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:141, output treesize:776 [2018-10-27 09:05:51,120 WARN L179 SmtUtils]: Spent 48.39 s on a formula simplification that was a NOOP. DAG size: 220 [2018-10-27 09:05:51,588 WARN L179 SmtUtils]: Spent 248.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2018-10-27 09:05:51,980 INFO L134 CoverageAnalysis]: Checked inductivity of 2879 backedges. 1215 proven. 192 refuted. 0 times theorem prover too weak. 1472 trivial. 0 not checked. [2018-10-27 09:05:51,980 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:05:52,482 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 09:05:52,482 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 09:05:52,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 09:05:52,483 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:109, output treesize:1 [2018-10-27 09:05:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2879 backedges. 1360 proven. 69 refuted. 0 times theorem prover too weak. 1450 trivial. 0 not checked. [2018-10-27 09:05:52,666 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:05:52,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 10, 11] total 33 [2018-10-27 09:05:52,666 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:05:52,667 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-27 09:05:52,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-27 09:05:52,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=268, Invalid=787, Unknown=1, NotChecked=0, Total=1056 [2018-10-27 09:05:52,668 INFO L87 Difference]: Start difference. First operand 523 states and 631 transitions. Second operand 24 states. [2018-10-27 09:06:00,811 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 90 [2018-10-27 09:06:01,403 WARN L179 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 234 DAG size of output: 228 [2018-10-27 09:06:02,019 WARN L179 SmtUtils]: Spent 379.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 283 [2018-10-27 09:06:02,403 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2018-10-27 09:06:03,073 WARN L179 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 304 [2018-10-27 09:06:03,654 WARN L179 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 230 [2018-10-27 09:06:04,400 WARN L179 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 283 [2018-10-27 09:06:04,609 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2018-10-27 09:06:05,287 WARN L179 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 304 [2018-10-27 09:06:05,900 WARN L179 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 230 [2018-10-27 09:06:06,699 WARN L179 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 283 [2018-10-27 09:06:06,917 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2018-10-27 09:06:07,638 WARN L179 SmtUtils]: Spent 508.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 304 [2018-10-27 09:06:08,280 WARN L179 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 230 [2018-10-27 09:06:08,625 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2018-10-27 09:06:09,282 WARN L179 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 283 [2018-10-27 09:06:09,513 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2018-10-27 09:06:10,312 WARN L179 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 304 [2018-10-27 09:06:10,966 WARN L179 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 230 [2018-10-27 09:06:11,914 WARN L179 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 283 [2018-10-27 09:06:12,146 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2018-10-27 09:06:12,899 WARN L179 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 304 [2018-10-27 09:06:13,609 WARN L179 SmtUtils]: Spent 409.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 230 [2018-10-27 09:06:14,608 WARN L179 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 283 [2018-10-27 09:06:14,844 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2018-10-27 09:06:15,713 WARN L179 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 304 [2018-10-27 09:06:16,385 WARN L179 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 230 [2018-10-27 09:06:17,525 WARN L179 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 283 [2018-10-27 09:06:17,774 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2018-10-27 09:06:18,666 WARN L179 SmtUtils]: Spent 513.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 304 [2018-10-27 09:06:19,385 WARN L179 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 230 [2018-10-27 09:06:20,644 WARN L179 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 283 [2018-10-27 09:06:20,893 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2018-10-27 09:06:21,830 WARN L179 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 304 [2018-10-27 09:06:22,559 WARN L179 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 230 [2018-10-27 09:06:23,772 WARN L179 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 283 [2018-10-27 09:06:24,042 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2018-10-27 09:06:25,091 WARN L179 SmtUtils]: Spent 530.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 304 [2018-10-27 09:06:25,851 WARN L179 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 230 [2018-10-27 09:06:27,095 WARN L179 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 283 [2018-10-27 09:06:27,368 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2018-10-27 09:06:28,498 WARN L179 SmtUtils]: Spent 533.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 304 [2018-10-27 09:06:29,324 WARN L179 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 230 [2018-10-27 09:06:30,664 WARN L179 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 283 [2018-10-27 09:06:30,945 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2018-10-27 09:06:31,987 WARN L179 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 304 [2018-10-27 09:06:32,882 WARN L179 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 230 [2018-10-27 09:06:34,395 WARN L179 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 283 [2018-10-27 09:06:34,680 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 92 [2018-10-27 09:06:35,764 WARN L179 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 312 DAG size of output: 304 [2018-10-27 09:06:36,606 WARN L179 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 230 [2018-10-27 09:06:38,002 WARN L179 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 287 DAG size of output: 280 [2018-10-27 09:06:38,309 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 90 [2018-10-27 09:06:39,436 WARN L179 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 309 DAG size of output: 301 [2018-10-27 09:06:40,348 WARN L179 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 232 DAG size of output: 232 [2018-10-27 09:06:40,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:06:40,792 INFO L93 Difference]: Finished difference Result 1430 states and 1767 transitions. [2018-10-27 09:06:40,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-10-27 09:06:40,793 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 224 [2018-10-27 09:06:40,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:06:40,798 INFO L225 Difference]: With dead ends: 1430 [2018-10-27 09:06:40,798 INFO L226 Difference]: Without dead ends: 1035 [2018-10-27 09:06:40,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 609 GetRequests, 431 SyntacticMatches, 1 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11284 ImplicationChecksByTransitivity, 96.6s TimeCoverageRelationStatistics Valid=5550, Invalid=26311, Unknown=1, NotChecked=0, Total=31862 [2018-10-27 09:06:40,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2018-10-27 09:06:40,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 681. [2018-10-27 09:06:40,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2018-10-27 09:06:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 829 transitions. [2018-10-27 09:06:40,940 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 829 transitions. Word has length 224 [2018-10-27 09:06:40,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:06:40,940 INFO L481 AbstractCegarLoop]: Abstraction has 681 states and 829 transitions. [2018-10-27 09:06:40,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-27 09:06:40,940 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 829 transitions. [2018-10-27 09:06:40,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-27 09:06:40,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:06:40,943 INFO L375 BasicCegarLoop]: trace histogram [42, 39, 39, 38, 7, 6, 6, 6, 6, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:06:40,943 INFO L424 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:06:40,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:06:40,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1275228410, now seen corresponding path program 3 times [2018-10-27 09:06:40,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:06:40,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:06:40,944 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:06:40,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:06:40,944 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:06:40,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:06:41,459 INFO L134 CoverageAnalysis]: Checked inductivity of 3341 backedges. 1466 proven. 338 refuted. 0 times theorem prover too weak. 1537 trivial. 0 not checked. [2018-10-27 09:06:41,459 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:06:41,459 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:06:41,460 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:06:41,460 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:06:41,460 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:06:41,460 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:06:41,469 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 09:06:41,469 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 09:06:41,655 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 09:06:41,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:06:41,665 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:06:42,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3341 backedges. 294 proven. 1474 refuted. 0 times theorem prover too weak. 1573 trivial. 0 not checked. [2018-10-27 09:06:42,088 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:06:42,472 INFO L134 CoverageAnalysis]: Checked inductivity of 3341 backedges. 294 proven. 1474 refuted. 0 times theorem prover too weak. 1573 trivial. 0 not checked. [2018-10-27 09:06:42,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:06:42,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 23, 23] total 52 [2018-10-27 09:06:42,494 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:06:42,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-27 09:06:42,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-27 09:06:42,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=481, Invalid=2171, Unknown=0, NotChecked=0, Total=2652 [2018-10-27 09:06:42,496 INFO L87 Difference]: Start difference. First operand 681 states and 829 transitions. Second operand 38 states. [2018-10-27 09:06:47,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:06:47,891 INFO L93 Difference]: Finished difference Result 2392 states and 2980 transitions. [2018-10-27 09:06:47,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-10-27 09:06:47,894 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 236 [2018-10-27 09:06:47,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:06:47,903 INFO L225 Difference]: With dead ends: 2392 [2018-10-27 09:06:47,903 INFO L226 Difference]: Without dead ends: 1850 [2018-10-27 09:06:47,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 438 SyntacticMatches, 7 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9752 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5780, Invalid=25726, Unknown=0, NotChecked=0, Total=31506 [2018-10-27 09:06:47,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2018-10-27 09:06:48,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 729. [2018-10-27 09:06:48,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2018-10-27 09:06:48,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 887 transitions. [2018-10-27 09:06:48,080 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 887 transitions. Word has length 236 [2018-10-27 09:06:48,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:06:48,080 INFO L481 AbstractCegarLoop]: Abstraction has 729 states and 887 transitions. [2018-10-27 09:06:48,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-27 09:06:48,081 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 887 transitions. [2018-10-27 09:06:48,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-27 09:06:48,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:06:48,084 INFO L375 BasicCegarLoop]: trace histogram [45, 42, 42, 41, 8, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:06:48,084 INFO L424 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:06:48,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:06:48,084 INFO L82 PathProgramCache]: Analyzing trace with hash -1285011092, now seen corresponding path program 4 times [2018-10-27 09:06:48,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:06:48,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:06:48,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 09:06:48,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:06:48,085 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:06:48,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:06:50,232 INFO L134 CoverageAnalysis]: Checked inductivity of 3865 backedges. 1690 proven. 392 refuted. 0 times theorem prover too weak. 1783 trivial. 0 not checked. [2018-10-27 09:06:50,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:06:50,233 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:06:50,233 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:06:50,233 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:06:50,233 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:06:50,233 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:06:50,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:06:50,243 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 09:06:50,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:06:50,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 09:06:50,753 INFO L134 CoverageAnalysis]: Checked inductivity of 3865 backedges. 1690 proven. 392 refuted. 0 times theorem prover too weak. 1783 trivial. 0 not checked. [2018-10-27 09:06:50,753 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 09:06:50,993 INFO L134 CoverageAnalysis]: Checked inductivity of 3865 backedges. 1690 proven. 392 refuted. 0 times theorem prover too weak. 1783 trivial. 0 not checked. [2018-10-27 09:06:51,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 09:06:51,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 39 [2018-10-27 09:06:51,015 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 09:06:51,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-27 09:06:51,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-27 09:06:51,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=612, Invalid=870, Unknown=0, NotChecked=0, Total=1482 [2018-10-27 09:06:51,019 INFO L87 Difference]: Start difference. First operand 729 states and 887 transitions. Second operand 33 states. [2018-10-27 09:06:51,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 09:06:51,869 INFO L93 Difference]: Finished difference Result 1404 states and 1722 transitions. [2018-10-27 09:06:51,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 09:06:51,869 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 252 [2018-10-27 09:06:51,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 09:06:51,874 INFO L225 Difference]: With dead ends: 1404 [2018-10-27 09:06:51,874 INFO L226 Difference]: Without dead ends: 822 [2018-10-27 09:06:51,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 521 GetRequests, 474 SyntacticMatches, 10 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 986 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=612, Invalid=870, Unknown=0, NotChecked=0, Total=1482 [2018-10-27 09:06:51,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 822 states. [2018-10-27 09:06:52,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 822 to 769. [2018-10-27 09:06:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-10-27 09:06:52,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 937 transitions. [2018-10-27 09:06:52,052 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 937 transitions. Word has length 252 [2018-10-27 09:06:52,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 09:06:52,052 INFO L481 AbstractCegarLoop]: Abstraction has 769 states and 937 transitions. [2018-10-27 09:06:52,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-27 09:06:52,052 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 937 transitions. [2018-10-27 09:06:52,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-27 09:06:52,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 09:06:52,055 INFO L375 BasicCegarLoop]: trace histogram [48, 45, 45, 44, 8, 7, 7, 7, 6, 5, 5, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 09:06:52,055 INFO L424 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 09:06:52,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 09:06:52,056 INFO L82 PathProgramCache]: Analyzing trace with hash 417808357, now seen corresponding path program 5 times [2018-10-27 09:06:52,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 09:06:52,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:06:52,056 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 09:06:52,056 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 09:06:52,057 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 09:06:52,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 09:06:52,490 INFO L134 CoverageAnalysis]: Checked inductivity of 4399 backedges. 1930 proven. 450 refuted. 0 times theorem prover too weak. 2019 trivial. 0 not checked. [2018-10-27 09:06:52,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:06:52,491 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 09:06:52,491 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 09:06:52,491 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 09:06:52,491 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 09:06:52,491 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:06:52,499 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 09:06:52,499 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 09:06:53,340 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-27 09:06:53,340 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 09:06:53,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-10-27 09:06:55,065 WARN L187 SmtUtils]: Removed 16 from assertion stack [2018-10-27 09:06:55,065 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-27 09:06:55,266 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 09:06:55,267 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-27 09:06:55,272 WARN L205 ceAbstractionStarter]: Timeout [2018-10-27 09:06:55,273 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 09:06:55 BoogieIcfgContainer [2018-10-27 09:06:55,273 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 09:06:55,274 INFO L168 Benchmark]: Toolchain (without parser) took 253827.91 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 981.5 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -718.7 MB). Peak memory consumption was 262.7 MB. Max. memory is 7.1 GB. [2018-10-27 09:06:55,274 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 09:06:55,275 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-27 09:06:55,275 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.93 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 09:06:55,275 INFO L168 Benchmark]: Boogie Preprocessor took 93.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-27 09:06:55,275 INFO L168 Benchmark]: RCFGBuilder took 1446.23 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -672.2 MB). Peak memory consumption was 69.3 MB. Max. memory is 7.1 GB. [2018-10-27 09:06:55,276 INFO L168 Benchmark]: TraceAbstraction took 251904.89 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 253.8 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -67.7 MB). Peak memory consumption was 186.0 MB. Max. memory is 7.1 GB. [2018-10-27 09:06:55,278 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 292.16 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 84.93 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 93.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1446.23 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 727.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -672.2 MB). Peak memory consumption was 69.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 251904.89 ms. Allocated memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: 253.8 MB). Free memory was 2.1 GB in the beginning and 2.1 GB in the end (delta: -67.7 MB). Peak memory consumption was 186.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 5]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 5). Cancelled while BasicCegarLoop was analyzing trace of length 265 with TraceHistMax 48,while TraceCheckSpWp was constructing forward predicates,while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations,while SimplifyDDAWithTimeout was simplifying term of DAG size 246. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 40 locations, 1 error locations. TIMEOUT Result, 251.8s OverallTime, 24 OverallIterations, 48 TraceHistogramMax, 84.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 830 SDtfs, 8130 SDslu, 5682 SDs, 0 SdLazy, 5086 SolverSat, 2365 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.4s Time, PredicateUnifierStatistics: 6 DeclaredPredicates, 5880 GetRequests, 4822 SyntacticMatches, 44 SemanticMatches, 1014 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37761 ImplicationChecksByTransitivity, 169.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=769occurred in iteration=23, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.7s AbstIntTime, 5 AbstIntIterations, 3 AbstIntStrong, 0.8425871880928058 AbsIntWeakeningRatio, 1.7752808988764044 AbsIntAvgWeakeningVarsNumRemoved, 4.876404494382022 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 23 MinimizatonAttempts, 2361 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 4.1s SatisfiabilityAnalysisTime, 154.6s InterpolantComputationTime, 5139 NumberOfCodeBlocks, 4706 NumberOfCodeBlocksAsserted, 59 NumberOfCheckSat, 7584 ConstructedInterpolants, 124 QuantifiedInterpolants, 6522662 SizeOfPredicates, 112 NumberOfNonLiveVariables, 10199 ConjunctsInSsa, 277 ConjunctsInUnsatCore, 59 InterpolantComputations, 4 PerfectInterpolantSequences, 54911/63952 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown