java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-07 04:52:12,573 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-07 04:52:12,575 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-07 04:52:12,589 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-07 04:52:12,590 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-07 04:52:12,591 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-07 04:52:12,592 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-07 04:52:12,594 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-07 04:52:12,596 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-07 04:52:12,596 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-07 04:52:12,597 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-07 04:52:12,598 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-07 04:52:12,599 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-07 04:52:12,600 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-07 04:52:12,601 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-07 04:52:12,602 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-07 04:52:12,602 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-07 04:52:12,606 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-07 04:52:12,608 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-07 04:52:12,614 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-07 04:52:12,615 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-07 04:52:12,618 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-07 04:52:12,625 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-07 04:52:12,625 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-07 04:52:12,625 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-07 04:52:12,626 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-07 04:52:12,627 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-07 04:52:12,630 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-07 04:52:12,631 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-07 04:52:12,632 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-07 04:52:12,632 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-07 04:52:12,633 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-07 04:52:12,633 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-07 04:52:12,633 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-07 04:52:12,634 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-07 04:52:12,637 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-07 04:52:12,638 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default.epf [2018-11-07 04:52:12,661 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-07 04:52:12,661 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-07 04:52:12,662 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-07 04:52:12,662 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-07 04:52:12,663 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-07 04:52:12,663 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-07 04:52:12,663 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-07 04:52:12,663 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-07 04:52:12,663 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-07 04:52:12,666 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-07 04:52:12,667 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-07 04:52:12,667 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-07 04:52:12,668 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-07 04:52:12,668 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-07 04:52:12,668 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-07 04:52:12,668 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-07 04:52:12,668 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-07 04:52:12,669 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-07 04:52:12,670 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-07 04:52:12,670 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-07 04:52:12,670 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-07 04:52:12,671 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-07 04:52:12,671 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-07 04:52:12,671 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-07 04:52:12,671 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 04:52:12,672 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-07 04:52:12,672 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-07 04:52:12,672 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-07 04:52:12,672 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-07 04:52:12,672 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-07 04:52:12,673 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-07 04:52:12,673 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-07 04:52:12,673 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-07 04:52:12,673 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-07 04:52:12,741 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-07 04:52:12,760 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-07 04:52:12,764 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-07 04:52:12,765 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-07 04:52:12,766 INFO L276 PluginConnector]: CDTParser initialized [2018-11-07 04:52:12,767 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-07 04:52:12,832 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fae3bc0bb/ffafee7ccd414fdeb2d1ddc796b34ab4/FLAGaa0c159eb [2018-11-07 04:52:13,245 INFO L298 CDTParser]: Found 1 translation units. [2018-11-07 04:52:13,246 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-11-07 04:52:13,253 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fae3bc0bb/ffafee7ccd414fdeb2d1ddc796b34ab4/FLAGaa0c159eb [2018-11-07 04:52:13,270 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fae3bc0bb/ffafee7ccd414fdeb2d1ddc796b34ab4 [2018-11-07 04:52:13,281 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-07 04:52:13,283 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-07 04:52:13,284 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-07 04:52:13,284 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-07 04:52:13,288 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-07 04:52:13,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:52:13" (1/1) ... [2018-11-07 04:52:13,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53459a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:13, skipping insertion in model container [2018-11-07 04:52:13,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:52:13" (1/1) ... [2018-11-07 04:52:13,304 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-07 04:52:13,326 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-07 04:52:13,557 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:52:13,562 INFO L189 MainTranslator]: Completed pre-run [2018-11-07 04:52:13,594 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-07 04:52:13,627 INFO L193 MainTranslator]: Completed translation [2018-11-07 04:52:13,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:13 WrapperNode [2018-11-07 04:52:13,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-07 04:52:13,628 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-07 04:52:13,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-07 04:52:13,629 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-07 04:52:13,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:13" (1/1) ... [2018-11-07 04:52:13,653 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:13" (1/1) ... [2018-11-07 04:52:13,662 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-07 04:52:13,662 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-07 04:52:13,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-07 04:52:13,663 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-07 04:52:13,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:13" (1/1) ... [2018-11-07 04:52:13,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:13" (1/1) ... [2018-11-07 04:52:13,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:13" (1/1) ... [2018-11-07 04:52:13,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:13" (1/1) ... [2018-11-07 04:52:13,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:13" (1/1) ... [2018-11-07 04:52:13,708 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:13" (1/1) ... [2018-11-07 04:52:13,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:13" (1/1) ... [2018-11-07 04:52:13,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-07 04:52:13,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-07 04:52:13,720 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-07 04:52:13,720 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-07 04:52:13,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-07 04:52:13,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-07 04:52:13,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-07 04:52:13,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-07 04:52:13,893 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-07 04:52:13,893 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-07 04:52:13,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-07 04:52:13,894 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-07 04:52:13,894 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-07 04:52:13,894 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-07 04:52:13,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-07 04:52:13,895 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-07 04:52:13,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-07 04:52:14,414 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-07 04:52:14,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:52:14 BoogieIcfgContainer [2018-11-07 04:52:14,416 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-07 04:52:14,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-07 04:52:14,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-07 04:52:14,420 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-07 04:52:14,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:52:13" (1/3) ... [2018-11-07 04:52:14,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f18c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:52:14, skipping insertion in model container [2018-11-07 04:52:14,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:52:13" (2/3) ... [2018-11-07 04:52:14,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61f18c55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:52:14, skipping insertion in model container [2018-11-07 04:52:14,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:52:14" (3/3) ... [2018-11-07 04:52:14,424 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-11-07 04:52:14,435 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-07 04:52:14,444 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-07 04:52:14,462 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-07 04:52:14,498 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-07 04:52:14,498 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-07 04:52:14,498 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-07 04:52:14,498 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-07 04:52:14,499 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-07 04:52:14,499 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-07 04:52:14,499 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-07 04:52:14,499 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-07 04:52:14,520 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2018-11-07 04:52:14,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-07 04:52:14,528 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:14,529 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:52:14,531 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:14,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:14,537 INFO L82 PathProgramCache]: Analyzing trace with hash 700728677, now seen corresponding path program 1 times [2018-11-07 04:52:14,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:14,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:14,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:14,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:14,584 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:14,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:14,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:52:14,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-07 04:52:14,672 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:52:14,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-07 04:52:14,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-07 04:52:14,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-07 04:52:14,693 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 2 states. [2018-11-07 04:52:14,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:52:14,721 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2018-11-07 04:52:14,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-07 04:52:14,723 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-07 04:52:14,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:52:14,734 INFO L225 Difference]: With dead ends: 84 [2018-11-07 04:52:14,735 INFO L226 Difference]: Without dead ends: 39 [2018-11-07 04:52:14,741 INFO L604 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-11-07 04:52:14,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-07 04:52:14,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-11-07 04:52:14,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-07 04:52:14,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-07 04:52:14,789 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 18 [2018-11-07 04:52:14,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:52:14,789 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-07 04:52:14,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-07 04:52:14,790 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-07 04:52:14,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-07 04:52:14,791 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:14,791 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:52:14,792 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:14,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:14,792 INFO L82 PathProgramCache]: Analyzing trace with hash -560510619, now seen corresponding path program 1 times [2018-11-07 04:52:14,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:14,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:14,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:14,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:14,794 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:15,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:15,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:52:15,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 04:52:15,013 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:52:15,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 04:52:15,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 04:52:15,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-07 04:52:15,016 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 5 states. [2018-11-07 04:52:15,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:52:15,233 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2018-11-07 04:52:15,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-07 04:52:15,236 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-07 04:52:15,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:52:15,240 INFO L225 Difference]: With dead ends: 72 [2018-11-07 04:52:15,240 INFO L226 Difference]: Without dead ends: 56 [2018-11-07 04:52:15,241 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-07 04:52:15,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-07 04:52:15,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 41. [2018-11-07 04:52:15,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-07 04:52:15,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-07 04:52:15,249 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 19 [2018-11-07 04:52:15,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:52:15,249 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-07 04:52:15,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 04:52:15,249 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-07 04:52:15,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-07 04:52:15,250 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:15,251 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, 1, 1, 1, 1] [2018-11-07 04:52:15,251 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:15,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:15,251 INFO L82 PathProgramCache]: Analyzing trace with hash 25713751, now seen corresponding path program 1 times [2018-11-07 04:52:15,252 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:15,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:15,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:15,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:15,253 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:15,533 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 5 [2018-11-07 04:52:15,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:15,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-07 04:52:15,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-07 04:52:15,537 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-07 04:52:15,538 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-07 04:52:15,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-07 04:52:15,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-07 04:52:15,539 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2018-11-07 04:52:15,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:52:15,704 INFO L93 Difference]: Finished difference Result 100 states and 114 transitions. [2018-11-07 04:52:15,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-07 04:52:15,704 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-11-07 04:52:15,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:52:15,706 INFO L225 Difference]: With dead ends: 100 [2018-11-07 04:52:15,706 INFO L226 Difference]: Without dead ends: 69 [2018-11-07 04:52:15,707 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-07 04:52:15,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-07 04:52:15,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 46. [2018-11-07 04:52:15,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-07 04:52:15,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-07 04:52:15,715 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 29 [2018-11-07 04:52:15,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:52:15,715 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-07 04:52:15,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-07 04:52:15,716 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-07 04:52:15,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-07 04:52:15,717 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:15,717 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, 1, 1, 1, 1, 1, 1] [2018-11-07 04:52:15,717 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:15,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:15,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1322865364, now seen corresponding path program 1 times [2018-11-07 04:52:15,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:15,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:15,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:15,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:15,720 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:16,086 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2018-11-07 04:52:16,958 WARN L179 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 19 [2018-11-07 04:52:17,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:17,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:17,161 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:52:17,162 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 32 with the following transitions: [2018-11-07 04:52:17,164 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [35], [51], [53], [57], [61], [66], [67], [68], [80], [83], [85], [91], [92], [93], [95] [2018-11-07 04:52:17,226 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:52:17,226 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:52:17,379 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 04:52:18,190 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:52:18,191 INFO L272 AbstractInterpreter]: Visited 30 different actions 206 times. Merged at 18 different actions 144 times. Widened at 3 different actions 12 times. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 04:52:18,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:18,225 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:52:18,225 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:18,225 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:52:18,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:18,240 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:52:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:18,284 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:52:18,787 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 28 treesize of output 23 [2018-11-07 04:52:18,791 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:18,794 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 23 treesize of output 37 [2018-11-07 04:52:18,795 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:18,808 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:18,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 04:52:18,836 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-11-07 04:52:19,142 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 26 treesize of output 18 [2018-11-07 04:52:19,149 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-07 04:52:19,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:19,155 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:19,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:19,157 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 04:52:19,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:19,174 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:52:20,108 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 43 treesize of output 37 [2018-11-07 04:52:20,183 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:20,186 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-11-07 04:52:20,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:20,201 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:20,203 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:20,204 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:20,213 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 43 [2018-11-07 04:52:20,216 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-07 04:52:20,219 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:20,223 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:20,223 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:20,237 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 45 [2018-11-07 04:52:20,239 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 04:52:20,308 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 04:52:20,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:20,312 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-11-07 04:52:20,494 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:20,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:52:20,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 15] total 36 [2018-11-07 04:52:20,525 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:52:20,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 04:52:20,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 04:52:20,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1072, Unknown=0, NotChecked=0, Total=1260 [2018-11-07 04:52:20,528 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 24 states. [2018-11-07 04:52:21,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:52:21,728 INFO L93 Difference]: Finished difference Result 139 states and 159 transitions. [2018-11-07 04:52:21,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-07 04:52:21,729 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 31 [2018-11-07 04:52:21,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:52:21,732 INFO L225 Difference]: With dead ends: 139 [2018-11-07 04:52:21,733 INFO L226 Difference]: Without dead ends: 108 [2018-11-07 04:52:21,734 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=380, Invalid=1782, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 04:52:21,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-07 04:52:21,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 72. [2018-11-07 04:52:21,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-07 04:52:21,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 80 transitions. [2018-11-07 04:52:21,749 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 80 transitions. Word has length 31 [2018-11-07 04:52:21,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:52:21,749 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 80 transitions. [2018-11-07 04:52:21,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 04:52:21,749 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 80 transitions. [2018-11-07 04:52:21,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-07 04:52:21,750 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:21,751 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:52:21,751 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:21,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:21,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1800151797, now seen corresponding path program 1 times [2018-11-07 04:52:21,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:21,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:21,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:21,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:21,753 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:21,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:22,602 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:22,602 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:22,602 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:52:22,602 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2018-11-07 04:52:22,603 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [31], [35], [37], [40], [41], [42], [43], [47], [51], [53], [57], [61], [66], [67], [68], [80], [83], [85], [91], [92], [93], [95] [2018-11-07 04:52:22,606 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:52:22,606 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:52:22,618 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 04:52:23,358 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:52:23,358 INFO L272 AbstractInterpreter]: Visited 37 different actions 424 times. Merged at 25 different actions 311 times. Widened at 4 different actions 20 times. Found 42 fixpoints after 10 different actions. Largest state had 25 variables. [2018-11-07 04:52:23,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:23,400 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:52:23,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:23,401 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:52:23,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:23,414 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:52:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:23,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:52:23,879 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 41 treesize of output 34 [2018-11-07 04:52:23,883 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:23,885 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 34 treesize of output 50 [2018-11-07 04:52:23,886 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:23,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:23,906 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:23,906 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-11-07 04:52:24,362 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:24,363 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 50 treesize of output 52 [2018-11-07 04:52:24,372 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:24,373 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:24,378 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:24,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 71 [2018-11-07 04:52:24,381 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:24,411 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:24,459 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 04:52:24,460 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-11-07 04:52:24,891 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 39 treesize of output 31 [2018-11-07 04:52:24,898 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:24,899 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:24,899 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:24,900 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:24,916 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:24,917 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2018-11-07 04:52:24,918 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:24,923 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:24,929 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:24,929 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-11-07 04:52:24,971 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:24,971 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:52:30,679 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 72 treesize of output 64 [2018-11-07 04:52:30,682 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:30,684 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 64 treesize of output 71 [2018-11-07 04:52:30,788 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 04:52:30,788 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:30,795 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:30,795 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:30,796 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:30,796 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:30,798 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:30,802 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:30,802 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:30,803 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:30,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 89 [2018-11-07 04:52:30,818 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 04:52:30,843 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:30,852 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:30,865 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:30,874 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:30,886 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:30,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 64 [2018-11-07 04:52:30,911 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:30,934 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:30,949 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:30,958 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:30,970 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:30,975 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:30,975 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:30,991 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 85 [2018-11-07 04:52:30,994 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-07 04:52:31,006 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:31,006 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:31,008 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:31,008 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:31,009 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:31,010 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:31,032 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 85 [2018-11-07 04:52:31,034 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-07 04:52:31,043 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:31,044 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:31,044 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:31,045 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:31,046 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:31,047 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:31,050 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:31,051 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:31,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 92 [2018-11-07 04:52:31,063 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-11-07 04:52:31,065 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:31,066 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:31,066 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:31,067 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:31,068 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:31,068 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:31,069 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:31,069 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:31,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 89 [2018-11-07 04:52:31,083 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-07 04:52:31,118 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:31,124 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:31,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 04:52:31,132 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:80, output treesize:14 [2018-11-07 04:52:32,022 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:32,045 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:52:32,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 18] total 50 [2018-11-07 04:52:32,045 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:52:32,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-07 04:52:32,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-07 04:52:32,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=280, Invalid=2169, Unknown=1, NotChecked=0, Total=2450 [2018-11-07 04:52:32,048 INFO L87 Difference]: Start difference. First operand 72 states and 80 transitions. Second operand 35 states. [2018-11-07 04:52:33,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:52:33,949 INFO L93 Difference]: Finished difference Result 174 states and 197 transitions. [2018-11-07 04:52:33,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-07 04:52:33,950 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 40 [2018-11-07 04:52:33,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:52:33,953 INFO L225 Difference]: With dead ends: 174 [2018-11-07 04:52:33,954 INFO L226 Difference]: Without dead ends: 117 [2018-11-07 04:52:33,956 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1452 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=529, Invalid=3630, Unknown=1, NotChecked=0, Total=4160 [2018-11-07 04:52:33,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-07 04:52:33,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 72. [2018-11-07 04:52:33,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-07 04:52:33,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 78 transitions. [2018-11-07 04:52:33,968 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 78 transitions. Word has length 40 [2018-11-07 04:52:33,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:52:33,968 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 78 transitions. [2018-11-07 04:52:33,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-07 04:52:33,969 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 78 transitions. [2018-11-07 04:52:33,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-07 04:52:33,970 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:33,970 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:52:33,971 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:33,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:33,971 INFO L82 PathProgramCache]: Analyzing trace with hash 549234438, now seen corresponding path program 1 times [2018-11-07 04:52:33,971 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:33,972 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:33,972 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:33,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:33,973 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:33,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:34,071 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:34,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:34,072 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:52:34,072 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 42 with the following transitions: [2018-11-07 04:52:34,073 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [31], [35], [51], [53], [57], [61], [66], [67], [68], [80], [83], [85], [91], [92], [93], [95] [2018-11-07 04:52:34,075 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:52:34,075 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:52:34,084 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 04:52:34,482 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:52:34,482 INFO L272 AbstractInterpreter]: Visited 31 different actions 215 times. Merged at 18 different actions 144 times. Widened at 3 different actions 12 times. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-07 04:52:34,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:34,521 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:52:34,521 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:34,521 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:52:34,537 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:34,538 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:52:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:34,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:52:34,575 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:34,576 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:52:35,041 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:35,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:52:35,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 10 [2018-11-07 04:52:35,075 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:52:35,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-07 04:52:35,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-07 04:52:35,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-07 04:52:35,077 INFO L87 Difference]: Start difference. First operand 72 states and 78 transitions. Second operand 8 states. [2018-11-07 04:52:35,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:52:35,639 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2018-11-07 04:52:35,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 04:52:35,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-11-07 04:52:35,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:52:35,642 INFO L225 Difference]: With dead ends: 128 [2018-11-07 04:52:35,642 INFO L226 Difference]: Without dead ends: 97 [2018-11-07 04:52:35,643 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2018-11-07 04:52:35,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-07 04:52:35,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 75. [2018-11-07 04:52:35,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-07 04:52:35,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 81 transitions. [2018-11-07 04:52:35,652 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 81 transitions. Word has length 41 [2018-11-07 04:52:35,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:52:35,652 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 81 transitions. [2018-11-07 04:52:35,652 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-07 04:52:35,652 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 81 transitions. [2018-11-07 04:52:35,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-07 04:52:35,654 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:35,654 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:52:35,654 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:35,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:35,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1677539559, now seen corresponding path program 1 times [2018-11-07 04:52:35,655 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:35,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:35,656 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:35,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:35,656 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:35,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:36,136 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:36,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:36,137 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:52:36,137 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 43 with the following transitions: [2018-11-07 04:52:36,138 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [35], [51], [53], [57], [61], [66], [67], [68], [70], [72], [80], [83], [85], [88], [90], [91], [92], [93], [95], [96] [2018-11-07 04:52:36,140 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:52:36,140 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:52:36,148 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 04:52:36,545 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:52:36,546 INFO L272 AbstractInterpreter]: Visited 35 different actions 355 times. Merged at 21 different actions 216 times. Widened at 4 different actions 19 times. Found 10 fixpoints after 3 different actions. Largest state had 25 variables. [2018-11-07 04:52:36,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:36,579 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:52:36,579 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:36,579 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:52:36,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:36,589 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:52:36,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:36,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:52:36,733 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:36,733 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:52:37,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:37,036 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:52:37,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 12 [2018-11-07 04:52:37,037 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:52:37,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 04:52:37,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 04:52:37,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-07 04:52:37,038 INFO L87 Difference]: Start difference. First operand 75 states and 81 transitions. Second operand 9 states. [2018-11-07 04:52:37,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:52:37,260 INFO L93 Difference]: Finished difference Result 110 states and 119 transitions. [2018-11-07 04:52:37,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 04:52:37,262 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 42 [2018-11-07 04:52:37,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:52:37,263 INFO L225 Difference]: With dead ends: 110 [2018-11-07 04:52:37,263 INFO L226 Difference]: Without dead ends: 83 [2018-11-07 04:52:37,264 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 77 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-11-07 04:52:37,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-07 04:52:37,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 65. [2018-11-07 04:52:37,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-07 04:52:37,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2018-11-07 04:52:37,271 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 42 [2018-11-07 04:52:37,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:52:37,271 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2018-11-07 04:52:37,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 04:52:37,272 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2018-11-07 04:52:37,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-07 04:52:37,273 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:37,273 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:52:37,273 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:37,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:37,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1915071939, now seen corresponding path program 2 times [2018-11-07 04:52:37,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:37,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:37,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:52:37,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:37,275 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:37,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:37,728 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 13 [2018-11-07 04:52:38,110 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 23 [2018-11-07 04:52:38,359 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:38,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:38,360 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:52:38,360 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:52:38,360 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:52:38,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:38,360 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:52:38,369 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:52:38,369 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:52:38,426 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 04:52:38,427 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:52:38,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:52:38,780 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 28 treesize of output 23 [2018-11-07 04:52:38,784 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:38,787 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 23 treesize of output 37 [2018-11-07 04:52:38,787 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:38,793 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:38,802 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:38,802 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-07 04:52:38,930 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 33 treesize of output 24 [2018-11-07 04:52:38,933 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:38,934 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:38,935 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:38,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 43 [2018-11-07 04:52:38,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:38,947 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:38,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:38,952 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:17 [2018-11-07 04:52:39,007 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 26 treesize of output 18 [2018-11-07 04:52:39,010 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-07 04:52:39,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:39,012 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:39,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:39,015 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 04:52:39,030 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:39,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:52:39,522 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 93 treesize of output 83 [2018-11-07 04:52:39,560 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:39,561 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:39,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 94 [2018-11-07 04:52:39,662 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:39,699 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:39,708 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:39,742 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:39,751 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:39,794 INFO L303 Elim1Store]: Index analysis took 161 ms [2018-11-07 04:52:39,807 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 73 [2018-11-07 04:52:39,810 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-07 04:52:39,868 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:39,871 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:39,873 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 61 treesize of output 68 [2018-11-07 04:52:39,932 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:39,933 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:39,935 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:39,936 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:39,937 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:39,937 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:39,953 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 68 [2018-11-07 04:52:39,955 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-07 04:52:39,974 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:39,982 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,004 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 110 treesize of output 113 [2018-11-07 04:52:40,262 WARN L179 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 50 [2018-11-07 04:52:40,265 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,265 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,267 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,267 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,268 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,269 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,269 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,271 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,272 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 87 [2018-11-07 04:52:40,283 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-07 04:52:40,287 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,287 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,290 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,291 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,292 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,310 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 85 [2018-11-07 04:52:40,313 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-11-07 04:52:40,344 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,358 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,368 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,368 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,369 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,369 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,387 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 86 [2018-11-07 04:52:40,391 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-11-07 04:52:40,393 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,394 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,395 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,396 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,396 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,397 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,400 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,401 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:40,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 86 [2018-11-07 04:52:40,411 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-07 04:52:40,478 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 04:52:40,490 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:40,494 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:40,495 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:96, output treesize:14 [2018-11-07 04:52:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:40,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:52:40,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 21, 21] total 45 [2018-11-07 04:52:40,630 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:52:40,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-07 04:52:40,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-07 04:52:40,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=1719, Unknown=0, NotChecked=0, Total=1980 [2018-11-07 04:52:40,631 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand 27 states. [2018-11-07 04:52:42,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:52:42,207 INFO L93 Difference]: Finished difference Result 193 states and 218 transitions. [2018-11-07 04:52:42,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-07 04:52:42,208 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 43 [2018-11-07 04:52:42,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:52:42,210 INFO L225 Difference]: With dead ends: 193 [2018-11-07 04:52:42,210 INFO L226 Difference]: Without dead ends: 159 [2018-11-07 04:52:42,213 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 54 SyntacticMatches, 8 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=585, Invalid=3075, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 04:52:42,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-07 04:52:42,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 100. [2018-11-07 04:52:42,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-11-07 04:52:42,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2018-11-07 04:52:42,227 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 43 [2018-11-07 04:52:42,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:52:42,227 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2018-11-07 04:52:42,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-07 04:52:42,228 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2018-11-07 04:52:42,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-07 04:52:42,229 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:42,229 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:52:42,230 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:42,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:42,230 INFO L82 PathProgramCache]: Analyzing trace with hash 534095078, now seen corresponding path program 2 times [2018-11-07 04:52:42,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:42,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:42,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:52:42,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:42,231 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:42,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:42,353 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:42,353 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:42,353 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:52:42,354 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:52:42,354 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:52:42,354 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:42,354 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:52:42,381 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:52:42,381 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:52:42,416 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 04:52:42,416 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:52:42,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:52:42,429 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:42,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:52:42,482 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:42,503 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:52:42,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 9 [2018-11-07 04:52:42,503 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:52:42,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-07 04:52:42,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-07 04:52:42,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-11-07 04:52:42,504 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand 9 states. [2018-11-07 04:52:42,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:52:42,846 INFO L93 Difference]: Finished difference Result 181 states and 202 transitions. [2018-11-07 04:52:42,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-07 04:52:42,846 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2018-11-07 04:52:42,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:52:42,849 INFO L225 Difference]: With dead ends: 181 [2018-11-07 04:52:42,849 INFO L226 Difference]: Without dead ends: 147 [2018-11-07 04:52:42,850 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 105 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=197, Unknown=0, NotChecked=0, Total=306 [2018-11-07 04:52:42,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-11-07 04:52:42,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 111. [2018-11-07 04:52:42,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-11-07 04:52:42,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2018-11-07 04:52:42,862 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 52 [2018-11-07 04:52:42,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:52:42,863 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2018-11-07 04:52:42,863 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-07 04:52:42,863 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2018-11-07 04:52:42,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-07 04:52:42,864 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:52:42,864 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:52:42,865 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:52:42,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:52:42,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1480305564, now seen corresponding path program 3 times [2018-11-07 04:52:42,865 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:52:42,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:42,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:52:42,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:52:42,866 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:52:42,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:52:43,506 WARN L179 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 10 [2018-11-07 04:52:43,787 WARN L179 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 14 [2018-11-07 04:52:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:44,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:44,391 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:52:44,391 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:52:44,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:52:44,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:52:44,391 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:52:44,401 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:52:44,402 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:52:44,417 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:52:44,417 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:52:44,421 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:52:44,648 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 41 treesize of output 34 [2018-11-07 04:52:44,651 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:44,653 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 34 treesize of output 50 [2018-11-07 04:52:44,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:44,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:44,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:44,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-11-07 04:52:44,845 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:44,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 50 treesize of output 52 [2018-11-07 04:52:44,851 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:44,852 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:44,853 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:44,857 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:44,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 85 [2018-11-07 04:52:44,860 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:44,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:44,889 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 04:52:44,890 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:32 [2018-11-07 04:52:45,131 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 29 [2018-11-07 04:52:45,138 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:45,140 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:45,142 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:45,144 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:45,147 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 87 [2018-11-07 04:52:45,147 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:45,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:45,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 04:52:45,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:42, output treesize:29 [2018-11-07 04:52:45,921 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 39 treesize of output 31 [2018-11-07 04:52:45,923 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:45,924 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:45,925 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:45,925 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:52:45,926 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:52:45,927 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 55 [2018-11-07 04:52:45,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:52:45,937 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:45,941 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:52:45,941 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-11-07 04:52:46,001 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:52:46,001 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:52:48,222 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~key~0 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ (* 4 c_main_~i~0) |c_main_~#v~0.offset| 4) main_~key~0))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1)))) is different from false [2018-11-07 04:52:50,253 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~key~0 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ |c_main_~#v~0.offset| (* 4 c_main_~j~0)) main_~key~0))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1)))) is different from false [2018-11-07 04:53:08,980 WARN L832 $PredicateComparison]: unable to prove that (forall ((|v_main_#t~mem5_9| Int) (v_main_~i~0_26 Int) (v_subst_1 Int)) (let ((.cse1 (select |c_#memory_int| |c_main_~#v~0.base|)) (.cse2 (* 4 c_main_~i~0))) (or (< (+ v_main_~i~0_26 1) c_main_~i~0) (let ((.cse0 (store (store (store .cse1 (+ .cse2 |c_main_~#v~0.offset| 4) |v_main_#t~mem5_9|) (+ |c_main_~#v~0.offset| (* 4 v_main_~i~0_26) 4) c_main_~key~0) (+ (* 4 c_main_~j~0) |c_main_~#v~0.offset| 4) v_subst_1))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1))) (<= 0 v_main_~i~0_26) (< |v_main_#t~mem5_9| (select .cse1 (+ .cse2 |c_main_~#v~0.offset|)))))) is different from false [2018-11-07 04:53:15,619 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 88 treesize of output 80 [2018-11-07 04:53:15,624 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:15,626 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 80 treesize of output 87 [2018-11-07 04:53:15,630 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:15,634 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:15,635 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:15,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 75 treesize of output 115 [2018-11-07 04:53:16,484 WARN L179 SmtUtils]: Spent 822.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 91 [2018-11-07 04:53:16,489 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,490 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,493 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,499 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 60 treesize of output 75 [2018-11-07 04:53:16,501 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 04:53:16,504 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,505 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,505 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,506 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,507 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,507 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,514 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,521 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 98 [2018-11-07 04:53:16,523 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-07 04:53:16,549 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,564 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,573 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,607 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,616 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,630 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,728 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,729 INFO L303 Elim1Store]: Index analysis took 204 ms [2018-11-07 04:53:16,806 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 96 [2018-11-07 04:53:16,808 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-07 04:53:16,812 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,815 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,815 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,816 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,817 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,818 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,824 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,831 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 98 [2018-11-07 04:53:16,833 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-07 04:53:16,844 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,848 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,860 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 69 [2018-11-07 04:53:16,862 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 3 xjuncts. [2018-11-07 04:53:16,865 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,865 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,866 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,868 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,868 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,869 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,877 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,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, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 99 [2018-11-07 04:53:16,885 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-07 04:53:16,889 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,890 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,890 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,892 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,892 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,892 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,899 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:16,907 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 96 [2018-11-07 04:53:16,909 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-11-07 04:53:17,791 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:17,793 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:17,796 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:17,803 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 63 [2018-11-07 04:53:17,805 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-07 04:53:17,809 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:17,809 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:17,810 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:17,810 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:17,812 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:17,813 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:17,819 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:17,826 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 96 [2018-11-07 04:53:17,828 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-11-07 04:53:17,831 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:17,831 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:17,832 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:17,834 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:17,835 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 64 [2018-11-07 04:53:17,836 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-07 04:53:18,118 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,119 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,119 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,120 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,121 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,122 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,125 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,126 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,127 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,128 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,140 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,141 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,148 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 132 [2018-11-07 04:53:18,150 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-07 04:53:18,156 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,157 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,159 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,159 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,160 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,168 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,169 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,177 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 91 [2018-11-07 04:53:18,178 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-07 04:53:18,181 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,182 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,182 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,183 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,183 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,184 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,186 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,187 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,188 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,189 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,202 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,203 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 134 [2018-11-07 04:53:18,213 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-07 04:53:18,215 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,216 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,216 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,217 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,217 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,218 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,226 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,227 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:18,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 94 [2018-11-07 04:53:18,229 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-07 04:53:18,358 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-07 04:53:18,413 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-07 04:53:18,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-11-07 04:53:18,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 5 xjuncts. [2018-11-07 04:53:18,585 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 7 variables, input treesize:96, output treesize:63 [2018-11-07 04:53:32,387 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2018-11-07 04:53:32,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:53:32,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23, 22] total 59 [2018-11-07 04:53:32,410 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:53:32,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 04:53:32,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 04:53:32,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=2714, Unknown=18, NotChecked=330, Total=3422 [2018-11-07 04:53:32,412 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand 39 states. [2018-11-07 04:53:34,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:53:34,853 INFO L93 Difference]: Finished difference Result 247 states and 277 transitions. [2018-11-07 04:53:34,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-07 04:53:34,854 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 52 [2018-11-07 04:53:34,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:53:34,856 INFO L225 Difference]: With dead ends: 247 [2018-11-07 04:53:34,856 INFO L226 Difference]: Without dead ends: 202 [2018-11-07 04:53:34,858 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 78 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2021 ImplicationChecksByTransitivity, 47.1s TimeCoverageRelationStatistics Valid=788, Invalid=5058, Unknown=18, NotChecked=456, Total=6320 [2018-11-07 04:53:34,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-11-07 04:53:34,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 107. [2018-11-07 04:53:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-07 04:53:34,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 117 transitions. [2018-11-07 04:53:34,870 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 117 transitions. Word has length 52 [2018-11-07 04:53:34,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:53:34,871 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 117 transitions. [2018-11-07 04:53:34,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 04:53:34,871 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 117 transitions. [2018-11-07 04:53:34,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-07 04:53:34,872 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:53:34,872 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:53:34,873 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:53:34,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:53:34,873 INFO L82 PathProgramCache]: Analyzing trace with hash 472777368, now seen corresponding path program 2 times [2018-11-07 04:53:34,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:53:34,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:34,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:53:34,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:34,874 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:53:34,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:53:35,195 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-11-07 04:53:35,656 WARN L179 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 16 [2018-11-07 04:53:36,187 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:53:36,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:36,188 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:53:36,188 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:53:36,188 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:53:36,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:36,188 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:53:36,197 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:53:36,197 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:53:36,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-07 04:53:36,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:53:36,238 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:53:36,477 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 23 treesize of output 18 [2018-11-07 04:53:36,479 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:53:36,481 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-11-07 04:53:36,481 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:53:36,488 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:53:36,496 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:53:36,496 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-07 04:53:36,860 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 26 treesize of output 18 [2018-11-07 04:53:36,864 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-07 04:53:36,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:53:36,866 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:53:36,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:53:36,867 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 04:53:37,243 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:53:37,243 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:53:37,528 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 47 treesize of output 41 [2018-11-07 04:53:37,581 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:37,583 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:37,584 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:37,594 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 51 [2018-11-07 04:53:37,596 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-07 04:53:37,616 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:37,622 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:37,622 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:37,629 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 53 [2018-11-07 04:53:37,631 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-07 04:53:37,633 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:37,635 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2018-11-07 04:53:37,635 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 04:53:37,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:53:37,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:53:37,652 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:47, output treesize:11 [2018-11-07 04:53:37,745 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 2 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:53:37,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:53:37,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 15] total 39 [2018-11-07 04:53:37,772 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:53:37,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-07 04:53:37,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-07 04:53:37,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1341, Unknown=0, NotChecked=0, Total=1482 [2018-11-07 04:53:37,774 INFO L87 Difference]: Start difference. First operand 107 states and 117 transitions. Second operand 34 states. [2018-11-07 04:53:56,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:53:56,428 INFO L93 Difference]: Finished difference Result 195 states and 213 transitions. [2018-11-07 04:53:56,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 04:53:56,428 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 54 [2018-11-07 04:53:56,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:53:56,430 INFO L225 Difference]: With dead ends: 195 [2018-11-07 04:53:56,430 INFO L226 Difference]: Without dead ends: 193 [2018-11-07 04:53:56,433 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 82 SyntacticMatches, 13 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=417, Invalid=3243, Unknown=0, NotChecked=0, Total=3660 [2018-11-07 04:53:56,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-07 04:53:56,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 123. [2018-11-07 04:53:56,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-07 04:53:56,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2018-11-07 04:53:56,444 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 54 [2018-11-07 04:53:56,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:53:56,445 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2018-11-07 04:53:56,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-07 04:53:56,445 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2018-11-07 04:53:56,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-07 04:53:56,446 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:53:56,446 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:53:56,446 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:53:56,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:53:56,447 INFO L82 PathProgramCache]: Analyzing trace with hash 251048867, now seen corresponding path program 1 times [2018-11-07 04:53:56,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:53:56,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:56,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:53:56,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:53:56,448 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:53:56,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:53:57,398 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:53:57,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:57,399 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:53:57,399 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2018-11-07 04:53:57,399 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [35], [37], [40], [41], [42], [43], [47], [51], [53], [57], [61], [66], [67], [68], [80], [83], [85], [91], [92], [93], [95] [2018-11-07 04:53:57,401 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:53:57,401 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:53:57,409 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 04:53:57,798 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:53:57,798 INFO L272 AbstractInterpreter]: Visited 36 different actions 337 times. Merged at 24 different actions 256 times. Widened at 4 different actions 22 times. Found 15 fixpoints after 4 different actions. Largest state had 25 variables. [2018-11-07 04:53:57,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:53:57,835 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:53:57,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:53:57,835 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:53:57,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:53:57,849 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:53:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:53:57,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:53:58,109 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-11-07 04:53:58,111 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:53:58,112 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-11-07 04:53:58,112 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:53:58,122 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:53:58,128 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:53:58,128 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-11-07 04:53:58,391 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-11-07 04:53:58,408 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 26 treesize of output 18 [2018-11-07 04:53:58,431 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-07 04:53:58,431 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:53:58,457 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:53:58,482 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:53:58,482 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 04:53:58,598 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:53:58,599 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:53:59,030 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 43 treesize of output 37 [2018-11-07 04:53:59,080 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:59,082 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:59,082 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:59,091 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 48 [2018-11-07 04:53:59,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-07 04:53:59,095 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:59,096 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:59,097 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:59,106 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 50 [2018-11-07 04:53:59,107 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-07 04:53:59,109 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:53:59,111 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-11-07 04:53:59,111 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 04:53:59,125 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:53:59,126 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:53:59,126 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:5 [2018-11-07 04:53:59,252 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:53:59,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:53:59,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 17] total 38 [2018-11-07 04:53:59,273 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:53:59,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-07 04:53:59,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-07 04:53:59,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1220, Unknown=0, NotChecked=0, Total=1406 [2018-11-07 04:53:59,275 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand 24 states. [2018-11-07 04:54:01,396 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-11-07 04:54:01,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:01,747 INFO L93 Difference]: Finished difference Result 324 states and 363 transitions. [2018-11-07 04:54:01,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-07 04:54:01,748 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 54 [2018-11-07 04:54:01,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:01,750 INFO L225 Difference]: With dead ends: 324 [2018-11-07 04:54:01,751 INFO L226 Difference]: Without dead ends: 279 [2018-11-07 04:54:01,753 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 84 SyntacticMatches, 13 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1293 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=722, Invalid=3970, Unknown=0, NotChecked=0, Total=4692 [2018-11-07 04:54:01,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-11-07 04:54:01,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 146. [2018-11-07 04:54:01,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-07 04:54:01,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 161 transitions. [2018-11-07 04:54:01,770 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 161 transitions. Word has length 54 [2018-11-07 04:54:01,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:01,771 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 161 transitions. [2018-11-07 04:54:01,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-07 04:54:01,771 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2018-11-07 04:54:01,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-07 04:54:01,772 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:01,772 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1] [2018-11-07 04:54:01,772 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:01,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:01,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1639595941, now seen corresponding path program 1 times [2018-11-07 04:54:01,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:01,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:01,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:54:01,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:01,774 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:02,676 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:54:02,676 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:02,677 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:54:02,677 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 64 with the following transitions: [2018-11-07 04:54:02,677 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [35], [37], [45], [47], [51], [53], [57], [61], [66], [67], [68], [80], [83], [85], [91], [92], [93], [95] [2018-11-07 04:54:02,679 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:54:02,679 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:54:02,685 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 04:54:02,993 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:54:02,993 INFO L272 AbstractInterpreter]: Visited 33 different actions 297 times. Merged at 21 different actions 218 times. Widened at 4 different actions 18 times. Found 14 fixpoints after 3 different actions. Largest state had 24 variables. [2018-11-07 04:54:03,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:03,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:54:03,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:03,002 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:54:03,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:54:03,012 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:54:03,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:03,036 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:54:03,221 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 28 treesize of output 23 [2018-11-07 04:54:03,223 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:54:03,225 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 23 treesize of output 37 [2018-11-07 04:54:03,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:54:03,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:54:03,241 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:54:03,241 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-07 04:54:03,302 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 22 [2018-11-07 04:54:03,304 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:54:03,305 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:54:03,305 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:54:03,309 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 49 [2018-11-07 04:54:03,310 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:54:03,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:54:03,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:54:03,324 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:19 [2018-11-07 04:54:03,378 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 32 treesize of output 25 [2018-11-07 04:54:03,380 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:54:03,381 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:54:03,382 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:54:03,387 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-07 04:54:03,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:54:03,399 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:54:03,407 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:54:03,407 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-11-07 04:54:03,455 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 26 treesize of output 18 [2018-11-07 04:54:03,458 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-07 04:54:03,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:54:03,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:54:03,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:54:03,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 04:54:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 51 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-07 04:54:03,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:54:05,591 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~key~0 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ (* 4 c_main_~i~0) |c_main_~#v~0.offset| 4) main_~key~0))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1)))) is different from false [2018-11-07 04:54:07,720 WARN L832 $PredicateComparison]: unable to prove that (forall ((main_~key~0 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_main_~#v~0.base|) (+ |c_main_~#v~0.offset| (* 4 c_main_~j~0)) main_~key~0))) (< (select .cse0 |c_main_~#v~0.offset|) (+ (select .cse0 (+ |c_main_~#v~0.offset| 4)) 1)))) is different from false [2018-11-07 04:54:23,977 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 17 [2018-11-07 04:54:32,113 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 22 [2018-11-07 04:54:34,177 WARN L179 SmtUtils]: Spent 2.04 s on a formula simplification that was a NOOP. DAG size: 24 [2018-11-07 04:54:37,484 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 59 treesize of output 53 [2018-11-07 04:54:37,487 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,489 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 53 treesize of output 60 [2018-11-07 04:54:37,573 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,574 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,575 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,576 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,579 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,594 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 83 [2018-11-07 04:54:37,597 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-07 04:54:37,599 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,601 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,601 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,604 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,604 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,624 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 85 [2018-11-07 04:54:37,627 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-11-07 04:54:37,629 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,631 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,631 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,632 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,636 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,653 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 83 [2018-11-07 04:54:37,655 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-11-07 04:54:37,658 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,659 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,660 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,661 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,662 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,681 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 85 [2018-11-07 04:54:37,684 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-11-07 04:54:37,693 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,708 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 63 [2018-11-07 04:54:37,710 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-11-07 04:54:37,713 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,714 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,714 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,716 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,717 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,737 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 86 [2018-11-07 04:54:37,740 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-11-07 04:54:37,743 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:37,759 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 52 [2018-11-07 04:54:37,760 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-11-07 04:54:37,851 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-07 04:54:37,873 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-07 04:54:37,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-07 04:54:37,896 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:59, output treesize:50 [2018-11-07 04:54:38,361 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 10 trivial. 36 not checked. [2018-11-07 04:54:38,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:54:38,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 19] total 44 [2018-11-07 04:54:38,381 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:54:38,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-07 04:54:38,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-07 04:54:38,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1498, Unknown=10, NotChecked=162, Total=1892 [2018-11-07 04:54:38,383 INFO L87 Difference]: Start difference. First operand 146 states and 161 transitions. Second operand 28 states. [2018-11-07 04:54:40,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:40,760 INFO L93 Difference]: Finished difference Result 396 states and 447 transitions. [2018-11-07 04:54:40,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-07 04:54:40,762 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 63 [2018-11-07 04:54:40,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:40,765 INFO L225 Difference]: With dead ends: 396 [2018-11-07 04:54:40,765 INFO L226 Difference]: Without dead ends: 351 [2018-11-07 04:54:40,767 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 97 SyntacticMatches, 13 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1413 ImplicationChecksByTransitivity, 36.3s TimeCoverageRelationStatistics Valid=575, Invalid=3583, Unknown=10, NotChecked=254, Total=4422 [2018-11-07 04:54:40,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-11-07 04:54:40,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 223. [2018-11-07 04:54:40,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-11-07 04:54:40,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 252 transitions. [2018-11-07 04:54:40,793 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 252 transitions. Word has length 63 [2018-11-07 04:54:40,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:40,793 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 252 transitions. [2018-11-07 04:54:40,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-07 04:54:40,794 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 252 transitions. [2018-11-07 04:54:40,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-07 04:54:40,795 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:40,795 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:54:40,795 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:40,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:40,795 INFO L82 PathProgramCache]: Analyzing trace with hash 238536355, now seen corresponding path program 3 times [2018-11-07 04:54:40,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:40,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:40,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:54:40,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:40,796 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:41,120 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 04:54:41,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:41,120 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:54:41,121 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:54:41,121 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:54:41,121 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:41,121 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:54:41,132 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-07 04:54:41,132 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-07 04:54:41,154 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-07 04:54:41,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:54:41,157 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:54:41,264 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 04:54:41,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:54:41,554 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 10 proven. 27 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-07 04:54:41,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:54:41,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-11-07 04:54:41,575 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:54:41,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-07 04:54:41,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-07 04:54:41,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2018-11-07 04:54:41,576 INFO L87 Difference]: Start difference. First operand 223 states and 252 transitions. Second operand 11 states. [2018-11-07 04:54:41,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:41,803 INFO L93 Difference]: Finished difference Result 328 states and 373 transitions. [2018-11-07 04:54:41,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-07 04:54:41,803 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2018-11-07 04:54:41,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:41,805 INFO L225 Difference]: With dead ends: 328 [2018-11-07 04:54:41,805 INFO L226 Difference]: Without dead ends: 294 [2018-11-07 04:54:41,806 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 120 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=331, Unknown=0, NotChecked=0, Total=420 [2018-11-07 04:54:41,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-11-07 04:54:41,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 234. [2018-11-07 04:54:41,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-11-07 04:54:41,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 264 transitions. [2018-11-07 04:54:41,833 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 264 transitions. Word has length 65 [2018-11-07 04:54:41,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:41,833 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 264 transitions. [2018-11-07 04:54:41,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-07 04:54:41,833 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 264 transitions. [2018-11-07 04:54:41,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-07 04:54:41,835 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:41,835 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:54:41,836 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:41,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:41,836 INFO L82 PathProgramCache]: Analyzing trace with hash -1919075578, now seen corresponding path program 4 times [2018-11-07 04:54:41,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:41,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:41,837 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:54:41,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:41,837 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:42,878 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:54:42,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:42,878 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:54:42,879 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:54:42,879 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:54:42,879 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:42,879 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 04:54:42,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:54:42,888 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:54:42,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:42,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:54:43,148 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 41 treesize of output 34 [2018-11-07 04:54:43,152 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:54:43,153 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 34 treesize of output 50 [2018-11-07 04:54:43,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:54:43,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:54:43,172 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:54:43,173 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-11-07 04:54:43,442 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:54:43,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 50 treesize of output 52 [2018-11-07 04:54:43,446 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:54:43,447 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:43,451 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:54:43,452 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 71 [2018-11-07 04:54:43,453 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:54:43,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:54:43,477 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 04:54:43,477 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:64, output treesize:29 [2018-11-07 04:54:43,577 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 39 treesize of output 31 [2018-11-07 04:54:43,579 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:54:43,580 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:54:43,580 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:43,581 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:43,582 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:54:43,583 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2018-11-07 04:54:43,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:54:43,591 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:54:43,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:54:43,598 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:45, output treesize:5 [2018-11-07 04:54:43,620 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:54:43,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:54:50,563 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 72 treesize of output 64 [2018-11-07 04:54:50,565 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,567 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 64 treesize of output 71 [2018-11-07 04:54:50,644 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,645 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,646 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,647 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,649 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,649 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,663 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 85 [2018-11-07 04:54:50,664 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-07 04:54:50,670 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 04:54:50,670 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 04:54:50,672 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,673 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,673 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,688 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,689 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,690 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,703 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 85 [2018-11-07 04:54:50,704 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-07 04:54:50,707 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,707 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,708 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,709 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,710 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,712 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 59 [2018-11-07 04:54:50,713 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-07 04:54:50,715 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,716 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,716 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,717 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,718 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,719 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,720 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,721 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,730 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 89 [2018-11-07 04:54:50,732 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-07 04:54:50,734 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-07 04:54:50,734 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-07 04:54:50,736 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,737 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,738 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,738 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,740 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,741 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,742 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,743 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:54:50,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 89 [2018-11-07 04:54:50,756 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-11-07 04:54:50,877 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:54:50,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:54:50,892 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 04:54:50,892 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:80, output treesize:14 [2018-11-07 04:54:54,991 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 29 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-07 04:54:55,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:54:55,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 18] total 54 [2018-11-07 04:54:55,012 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:54:55,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-07 04:54:55,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-07 04:54:55,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=2550, Unknown=4, NotChecked=0, Total=2862 [2018-11-07 04:54:55,014 INFO L87 Difference]: Start difference. First operand 234 states and 264 transitions. Second operand 38 states. [2018-11-07 04:54:58,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:54:58,836 INFO L93 Difference]: Finished difference Result 488 states and 560 transitions. [2018-11-07 04:54:58,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-07 04:54:58,836 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 63 [2018-11-07 04:54:58,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:54:58,839 INFO L225 Difference]: With dead ends: 488 [2018-11-07 04:54:58,839 INFO L226 Difference]: Without dead ends: 362 [2018-11-07 04:54:58,844 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2813 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=1373, Invalid=8723, Unknown=4, NotChecked=0, Total=10100 [2018-11-07 04:54:58,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-11-07 04:54:58,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 234. [2018-11-07 04:54:58,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-11-07 04:54:58,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 260 transitions. [2018-11-07 04:54:58,873 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 260 transitions. Word has length 63 [2018-11-07 04:54:58,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:54:58,873 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 260 transitions. [2018-11-07 04:54:58,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-07 04:54:58,873 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 260 transitions. [2018-11-07 04:54:58,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-07 04:54:58,874 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:54:58,874 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:54:58,874 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:54:58,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:54:58,875 INFO L82 PathProgramCache]: Analyzing trace with hash 912822456, now seen corresponding path program 1 times [2018-11-07 04:54:58,875 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:54:58,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:58,876 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:54:58,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:54:58,876 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:54:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:54:59,587 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:54:59,587 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:54:59,587 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:54:59,588 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 66 with the following transitions: [2018-11-07 04:54:59,588 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [35], [37], [40], [41], [42], [43], [47], [51], [53], [57], [61], [66], [67], [68], [70], [72], [80], [83], [85], [88], [90], [91], [92], [93], [95], [96] [2018-11-07 04:54:59,590 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:54:59,590 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:54:59,596 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 04:55:00,215 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:55:00,215 INFO L272 AbstractInterpreter]: Visited 41 different actions 536 times. Merged at 27 different actions 359 times. Widened at 5 different actions 32 times. Found 25 fixpoints after 5 different actions. Largest state had 26 variables. [2018-11-07 04:55:00,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:00,242 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:55:00,242 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:00,242 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 04:55:00,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:00,260 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:55:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:00,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:00,766 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 41 treesize of output 34 [2018-11-07 04:55:00,771 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:00,772 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 34 treesize of output 50 [2018-11-07 04:55:00,773 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:55:00,781 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:55:00,793 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:55:00,794 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-11-07 04:55:00,957 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:00,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 43 treesize of output 45 [2018-11-07 04:55:00,962 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:00,962 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:00,966 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:00,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 59 [2018-11-07 04:55:00,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:55:00,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:55:00,990 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-07 04:55:00,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:52, output treesize:30 [2018-11-07 04:55:01,819 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 32 treesize of output 24 [2018-11-07 04:55:01,823 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:01,823 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:01,825 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:01,825 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 31 [2018-11-07 04:55:01,826 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:55:01,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:55:01,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:55:01,852 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:5 [2018-11-07 04:55:02,002 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:55:02,002 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:08,191 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 74 treesize of output 66 [2018-11-07 04:55:08,193 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,196 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 66 treesize of output 73 [2018-11-07 04:55:08,279 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,280 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,281 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,281 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,282 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,283 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,283 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,288 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,289 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 91 [2018-11-07 04:55:08,293 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 04:55:08,296 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,297 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,298 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,298 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,299 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,300 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,301 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,306 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,307 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 90 [2018-11-07 04:55:08,309 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-07 04:55:08,311 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,312 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,313 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,314 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,314 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,315 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,316 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,324 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 84 [2018-11-07 04:55:08,324 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-07 04:55:08,327 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,328 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,329 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,331 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,332 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,332 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,345 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 89 [2018-11-07 04:55:08,347 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-11-07 04:55:08,349 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,349 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,350 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,354 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 56 [2018-11-07 04:55:08,355 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-07 04:55:08,358 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,359 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,360 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,360 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,361 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,361 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,361 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,368 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,369 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 90 [2018-11-07 04:55:08,373 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-07 04:55:08,375 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,375 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,376 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,376 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,377 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:08,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 57 [2018-11-07 04:55:08,380 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-07 04:55:08,422 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 04:55:08,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 04:55:08,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-07 04:55:08,458 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:82, output treesize:31 [2018-11-07 04:55:10,589 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:55:10,612 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:55:10,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 24, 20] total 57 [2018-11-07 04:55:10,612 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:55:10,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-07 04:55:10,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-07 04:55:10,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=2911, Unknown=2, NotChecked=0, Total=3192 [2018-11-07 04:55:10,614 INFO L87 Difference]: Start difference. First operand 234 states and 260 transitions. Second operand 42 states. [2018-11-07 04:55:12,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:55:12,518 INFO L93 Difference]: Finished difference Result 285 states and 315 transitions. [2018-11-07 04:55:12,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-07 04:55:12,519 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 65 [2018-11-07 04:55:12,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:55:12,520 INFO L225 Difference]: With dead ends: 285 [2018-11-07 04:55:12,520 INFO L226 Difference]: Without dead ends: 262 [2018-11-07 04:55:12,522 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 93 SyntacticMatches, 8 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1665 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=546, Invalid=5002, Unknown=2, NotChecked=0, Total=5550 [2018-11-07 04:55:12,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-11-07 04:55:12,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 238. [2018-11-07 04:55:12,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-11-07 04:55:12,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 264 transitions. [2018-11-07 04:55:12,580 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 264 transitions. Word has length 65 [2018-11-07 04:55:12,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:55:12,581 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 264 transitions. [2018-11-07 04:55:12,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-07 04:55:12,581 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 264 transitions. [2018-11-07 04:55:12,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-07 04:55:12,582 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:55:12,582 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-07 04:55:12,582 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:55:12,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:55:12,584 INFO L82 PathProgramCache]: Analyzing trace with hash -720319799, now seen corresponding path program 4 times [2018-11-07 04:55:12,584 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:55:12,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:12,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:12,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:55:12,586 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:55:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:13,073 WARN L179 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 7 [2018-11-07 04:55:13,844 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 1 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:55:13,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:13,845 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:55:13,845 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:55:13,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:55:13,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:55:13,845 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 04:55:13,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:55:13,854 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:55:13,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:55:13,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:55:14,177 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 28 treesize of output 23 [2018-11-07 04:55:14,179 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:14,180 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 23 treesize of output 37 [2018-11-07 04:55:14,181 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:55:14,188 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:55:14,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:55:14,196 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-11-07 04:55:14,292 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 32 treesize of output 25 [2018-11-07 04:55:14,303 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:14,304 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:14,305 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:55:14,310 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 58 [2018-11-07 04:55:14,311 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:55:14,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:55:14,328 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:55:14,328 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-11-07 04:55:14,605 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 26 treesize of output 18 [2018-11-07 04:55:14,609 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-07 04:55:14,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:55:14,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:55:14,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:55:14,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 04:55:14,676 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:55:14,676 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:55:23,727 WARN L179 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 20 [2018-11-07 04:55:41,952 WARN L179 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 23 [2018-11-07 04:55:50,569 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 30 [2018-11-07 04:55:55,732 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 63 treesize of output 57 [2018-11-07 04:55:55,734 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,736 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 57 treesize of output 64 [2018-11-07 04:55:55,804 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,834 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 63 [2018-11-07 04:55:55,836 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-11-07 04:55:55,838 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,857 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 58 [2018-11-07 04:55:55,859 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-11-07 04:55:55,861 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,863 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,863 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,866 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,871 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,888 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 97 [2018-11-07 04:55:55,890 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-11-07 04:55:55,893 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,895 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,895 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,899 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,904 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,922 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 99 [2018-11-07 04:55:55,924 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-11-07 04:55:55,927 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,928 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,928 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,930 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,933 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,951 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 97 [2018-11-07 04:55:55,953 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-11-07 04:55:55,956 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,958 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,959 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,961 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,965 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,982 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 98 [2018-11-07 04:55:55,985 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-11-07 04:55:55,987 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,988 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,988 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,990 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:55,994 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:55:56,011 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 95 [2018-11-07 04:55:56,014 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-11-07 04:55:56,106 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-07 04:55:56,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-07 04:55:56,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-07 04:55:56,156 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:66, output treesize:43 [2018-11-07 04:55:56,217 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:55:56,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:55:56,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 18] total 47 [2018-11-07 04:55:56,239 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:55:56,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-07 04:55:56,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-07 04:55:56,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1945, Unknown=13, NotChecked=0, Total=2162 [2018-11-07 04:55:56,240 INFO L87 Difference]: Start difference. First operand 238 states and 264 transitions. Second operand 39 states. [2018-11-07 04:55:57,315 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-07 04:56:12,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:56:12,993 INFO L93 Difference]: Finished difference Result 376 states and 418 transitions. [2018-11-07 04:56:12,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-07 04:56:12,993 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 66 [2018-11-07 04:56:12,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:56:12,995 INFO L225 Difference]: With dead ends: 376 [2018-11-07 04:56:12,995 INFO L226 Difference]: Without dead ends: 299 [2018-11-07 04:56:12,996 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 100 SyntacticMatches, 14 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1327 ImplicationChecksByTransitivity, 43.8s TimeCoverageRelationStatistics Valid=491, Invalid=3918, Unknown=13, NotChecked=0, Total=4422 [2018-11-07 04:56:12,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-11-07 04:56:13,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 261. [2018-11-07 04:56:13,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-11-07 04:56:13,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 287 transitions. [2018-11-07 04:56:13,032 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 287 transitions. Word has length 66 [2018-11-07 04:56:13,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:56:13,033 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 287 transitions. [2018-11-07 04:56:13,033 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-07 04:56:13,033 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 287 transitions. [2018-11-07 04:56:13,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-07 04:56:13,034 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:56:13,034 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 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, 1, 1, 1, 1, 1] [2018-11-07 04:56:13,035 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:56:13,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:56:13,035 INFO L82 PathProgramCache]: Analyzing trace with hash -316321774, now seen corresponding path program 2 times [2018-11-07 04:56:13,035 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:56:13,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:56:13,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:56:13,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:56:13,036 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:56:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:56:14,103 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:56:14,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:56:14,103 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:56:14,103 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:56:14,103 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:56:14,103 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:56:14,103 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 04:56:14,113 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:56:14,113 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:56:14,143 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-07 04:56:14,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:56:14,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:56:14,371 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-11-07 04:56:14,374 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:14,381 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-11-07 04:56:14,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:14,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:14,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:14,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:17 [2018-11-07 04:56:14,633 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 41 treesize of output 32 [2018-11-07 04:56:14,636 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:14,638 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:14,655 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 48 [2018-11-07 04:56:14,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:14,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:14,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:14,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:19 [2018-11-07 04:56:14,730 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 26 treesize of output 18 [2018-11-07 04:56:14,733 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2018-11-07 04:56:14,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:14,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:14,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:14,737 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-07 04:56:14,756 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 28 proven. 26 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-07 04:56:14,756 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:56:15,091 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 43 treesize of output 37 [2018-11-07 04:56:15,137 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:15,139 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:15,140 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:15,149 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 45 [2018-11-07 04:56:15,150 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-07 04:56:15,152 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:15,154 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-11-07 04:56:15,155 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:15,157 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:15,159 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:15,160 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:15,169 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 43 [2018-11-07 04:56:15,170 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-07 04:56:15,189 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-07 04:56:15,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:15,194 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2018-11-07 04:56:15,304 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 41 proven. 5 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-07 04:56:15,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:56:15,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 22, 18] total 47 [2018-11-07 04:56:15,324 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:56:15,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-07 04:56:15,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-07 04:56:15,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=254, Invalid=1908, Unknown=0, NotChecked=0, Total=2162 [2018-11-07 04:56:15,325 INFO L87 Difference]: Start difference. First operand 261 states and 287 transitions. Second operand 32 states. [2018-11-07 04:56:17,856 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 37 [2018-11-07 04:56:21,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:56:21,179 INFO L93 Difference]: Finished difference Result 488 states and 543 transitions. [2018-11-07 04:56:21,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-11-07 04:56:21,180 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 66 [2018-11-07 04:56:21,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:56:21,183 INFO L225 Difference]: With dead ends: 488 [2018-11-07 04:56:21,183 INFO L226 Difference]: Without dead ends: 486 [2018-11-07 04:56:21,185 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 99 SyntacticMatches, 12 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3664 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1721, Invalid=11161, Unknown=0, NotChecked=0, Total=12882 [2018-11-07 04:56:21,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-11-07 04:56:21,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 274. [2018-11-07 04:56:21,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-11-07 04:56:21,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 302 transitions. [2018-11-07 04:56:21,227 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 302 transitions. Word has length 66 [2018-11-07 04:56:21,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:56:21,228 INFO L480 AbstractCegarLoop]: Abstraction has 274 states and 302 transitions. [2018-11-07 04:56:21,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-07 04:56:21,228 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 302 transitions. [2018-11-07 04:56:21,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-07 04:56:21,229 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:56:21,229 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1] [2018-11-07 04:56:21,229 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:56:21,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:56:21,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1196814012, now seen corresponding path program 1 times [2018-11-07 04:56:21,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:56:21,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:56:21,231 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-07 04:56:21,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:56:21,231 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:56:21,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:56:21,550 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 42 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-07 04:56:21,551 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:56:21,551 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:56:21,551 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 73 with the following transitions: [2018-11-07 04:56:21,552 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [6], [7], [11], [14], [16], [17], [18], [22], [24], [27], [28], [29], [31], [35], [37], [40], [41], [42], [43], [45], [47], [51], [53], [57], [61], [66], [67], [68], [80], [83], [85], [91], [92], [93], [95] [2018-11-07 04:56:21,553 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-07 04:56:21,554 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-07 04:56:21,560 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-07 04:56:22,042 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-07 04:56:22,042 INFO L272 AbstractInterpreter]: Visited 38 different actions 439 times. Merged at 26 different actions 313 times. Widened at 4 different actions 22 times. Found 56 fixpoints after 10 different actions. Largest state had 25 variables. [2018-11-07 04:56:22,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:56:22,078 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-07 04:56:22,078 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:56:22,078 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 04:56:22,126 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:56:22,127 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-07 04:56:22,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:56:22,161 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:56:22,168 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 42 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-07 04:56:22,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-07 04:56:22,348 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 42 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-07 04:56:22,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-07 04:56:22,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2018-11-07 04:56:22,382 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-07 04:56:22,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-07 04:56:22,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-07 04:56:22,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-07 04:56:22,384 INFO L87 Difference]: Start difference. First operand 274 states and 302 transitions. Second operand 6 states. [2018-11-07 04:56:22,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-07 04:56:22,592 INFO L93 Difference]: Finished difference Result 419 states and 464 transitions. [2018-11-07 04:56:22,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-07 04:56:22,592 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-11-07 04:56:22,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-07 04:56:22,594 INFO L225 Difference]: With dead ends: 419 [2018-11-07 04:56:22,594 INFO L226 Difference]: Without dead ends: 320 [2018-11-07 04:56:22,595 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 143 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-07 04:56:22,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-11-07 04:56:22,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 258. [2018-11-07 04:56:22,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-11-07 04:56:22,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 281 transitions. [2018-11-07 04:56:22,623 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 281 transitions. Word has length 72 [2018-11-07 04:56:22,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-07 04:56:22,623 INFO L480 AbstractCegarLoop]: Abstraction has 258 states and 281 transitions. [2018-11-07 04:56:22,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-07 04:56:22,623 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 281 transitions. [2018-11-07 04:56:22,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-07 04:56:22,624 INFO L367 BasicCegarLoop]: Found error trace [2018-11-07 04:56:22,624 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 1, 1] [2018-11-07 04:56:22,625 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-07 04:56:22,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-07 04:56:22,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1212396602, now seen corresponding path program 2 times [2018-11-07 04:56:22,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-07 04:56:22,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:56:22,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-07 04:56:22,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-07 04:56:22,626 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-07 04:56:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-07 04:56:23,801 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:56:23,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:56:23,802 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-07 04:56:23,802 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-07 04:56:23,802 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-07 04:56:23,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-07 04:56:23,802 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-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-11-07 04:56:23,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-07 04:56:23,812 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-07 04:56:23,843 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-07 04:56:23,843 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-07 04:56:23,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-07 04:56:23,934 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 41 treesize of output 34 [2018-11-07 04:56:23,937 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:23,938 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:23,941 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 74 [2018-11-07 04:56:23,942 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:23,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:23,968 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:23,968 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:52, output treesize:45 [2018-11-07 04:56:24,142 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:24,143 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 51 treesize of output 53 [2018-11-07 04:56:24,151 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:24,152 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:24,153 INFO L682 Elim1Store]: detected equality via solver [2018-11-07 04:56:24,157 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:24,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 84 [2018-11-07 04:56:24,159 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:24,169 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:24,183 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:24,183 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:32 [2018-11-07 04:56:24,263 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 32 treesize of output 25 [2018-11-07 04:56:24,266 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:24,267 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:24,268 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:24,268 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:24,271 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 68 [2018-11-07 04:56:24,272 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:24,282 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:24,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:24,294 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:22 [2018-11-07 04:56:24,439 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 32 treesize of output 25 [2018-11-07 04:56:24,441 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:24,442 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:24,443 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:24,444 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:24,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 68 [2018-11-07 04:56:24,448 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:24,459 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:24,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:24,469 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:19 [2018-11-07 04:56:24,540 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 28 treesize of output 20 [2018-11-07 04:56:24,543 INFO L700 Elim1Store]: detected not equals via solver [2018-11-07 04:56:24,544 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-07 04:56:24,544 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-07 04:56:24,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:24,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-07 04:56:24,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-11-07 04:56:24,614 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 4 proven. 74 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-07 04:56:24,614 INFO L316 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2018-11-07 04:56:34,947 WARN L187 SmtUtils]: Removed 2 from assertion stack [2018-11-07 04:56:34,948 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-11-07 04:56:35,148 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-07 04:56:35,149 WARN L549 AbstractCegarLoop]: Verification canceled [2018-11-07 04:56:35,154 WARN L205 ceAbstractionStarter]: Timeout [2018-11-07 04:56:35,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 04:56:35 BoogieIcfgContainer [2018-11-07 04:56:35,154 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-07 04:56:35,155 INFO L168 Benchmark]: Toolchain (without parser) took 261872.96 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -636.5 MB). Peak memory consumption was 406.8 MB. Max. memory is 7.1 GB. [2018-11-07 04:56:35,155 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-07 04:56:35,155 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.92 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-11-07 04:56:35,155 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.85 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-11-07 04:56:35,156 INFO L168 Benchmark]: Boogie Preprocessor took 53.80 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-11-07 04:56:35,156 INFO L168 Benchmark]: RCFGBuilder took 695.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 759.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-07 04:56:35,156 INFO L168 Benchmark]: TraceAbstraction took 260737.40 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 283.6 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 156.8 MB). Peak memory consumption was 440.5 MB. Max. memory is 7.1 GB. [2018-11-07 04:56:35,158 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.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 343.92 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 33.85 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 53.80 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. * RCFGBuilder took 695.98 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 759.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -803.9 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 260737.40 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 283.6 MB). Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 156.8 MB). Peak memory consumption was 440.5 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 73 with TraceHistMax 5,while TraceCheckSpWp was constructing backward predicates,while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 20. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 46 locations, 1 error locations. TIMEOUT Result, 260.6s OverallTime, 20 OverallIterations, 5 TraceHistogramMax, 61.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 879 SDtfs, 3848 SDslu, 6982 SDs, 0 SdLazy, 11361 SolverSat, 1226 SolverUnsat, 17 SolverUnknown, 0 SolverNotchecked, 44.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2370 GetRequests, 1387 SyntacticMatches, 121 SemanticMatches, 862 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 18755 ImplicationChecksByTransitivity, 183.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=274occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 4.6s AbstIntTime, 8 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 1204 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 180.0s InterpolantComputationTime, 1804 NumberOfCodeBlocks, 1799 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 2622 ConstructedInterpolants, 206 QuantifiedInterpolants, 1695690 SizeOfPredicates, 215 NumberOfNonLiveVariables, 1731 ConjunctsInSsa, 356 ConjunctsInUnsatCore, 51 InterpolantComputations, 3 PerfectInterpolantSequences, 542/1544 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown