java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf -i ../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 15:27:10,566 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 15:27:10,568 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 15:27:10,586 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 15:27:10,586 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 15:27:10,587 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 15:27:10,589 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 15:27:10,591 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 15:27:10,592 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 15:27:10,593 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 15:27:10,594 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 15:27:10,594 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 15:27:10,595 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 15:27:10,596 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 15:27:10,597 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 15:27:10,598 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 15:27:10,602 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 15:27:10,605 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 15:27:10,607 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 15:27:10,614 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 15:27:10,615 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 15:27:10,616 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 15:27:10,621 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 15:27:10,621 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 15:27:10,621 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 15:27:10,622 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 15:27:10,624 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 15:27:10,625 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 15:27:10,626 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 15:27:10,627 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 15:27:10,627 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 15:27:10,628 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 15:27:10,628 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 15:27:10,628 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 15:27:10,629 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 15:27:10,630 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 15:27:10,630 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT.epf [2018-10-27 15:27:10,651 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 15:27:10,652 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 15:27:10,652 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 15:27:10,653 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 15:27:10,653 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 15:27:10,653 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 15:27:10,653 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 15:27:10,654 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 15:27:10,654 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 15:27:10,654 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 15:27:10,654 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 15:27:10,654 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 15:27:10,655 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 15:27:10,655 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 15:27:10,655 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 15:27:10,656 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 15:27:10,656 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 15:27:10,656 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 15:27:10,656 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 15:27:10,656 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 15:27:10,657 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 15:27:10,657 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 15:27:10,657 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 15:27:10,657 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 15:27:10,658 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 15:27:10,658 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 15:27:10,658 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 15:27:10,658 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 15:27:10,658 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 15:27:10,659 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 15:27:10,659 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 15:27:10,659 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 15:27:10,659 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 15:27:10,659 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 15:27:10,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 15:27:10,724 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 15:27:10,730 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 15:27:10,731 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 15:27:10,732 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 15:27:10,733 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-10-27 15:27:10,805 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/606e2216c/b449a581a59a4f1a8bfaffea245c03cb/FLAG313ce2953 [2018-10-27 15:27:11,278 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 15:27:11,279 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/insertion_sort_false-unreach-call_true-termination.i [2018-10-27 15:27:11,286 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/606e2216c/b449a581a59a4f1a8bfaffea245c03cb/FLAG313ce2953 [2018-10-27 15:27:11,304 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/606e2216c/b449a581a59a4f1a8bfaffea245c03cb [2018-10-27 15:27:11,315 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 15:27:11,317 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 15:27:11,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 15:27:11,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 15:27:11,322 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 15:27:11,323 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 03:27:11" (1/1) ... [2018-10-27 15:27:11,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e8b281a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:11, skipping insertion in model container [2018-10-27 15:27:11,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 03:27:11" (1/1) ... [2018-10-27 15:27:11,338 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 15:27:11,360 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 15:27:11,561 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 15:27:11,565 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 15:27:11,598 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 15:27:11,623 INFO L193 MainTranslator]: Completed translation [2018-10-27 15:27:11,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:11 WrapperNode [2018-10-27 15:27:11,624 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 15:27:11,625 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 15:27:11,625 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 15:27:11,625 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 15:27:11,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:11" (1/1) ... [2018-10-27 15:27:11,645 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:11" (1/1) ... [2018-10-27 15:27:11,671 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 15:27:11,672 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 15:27:11,672 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 15:27:11,672 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 15:27:11,683 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:11" (1/1) ... [2018-10-27 15:27:11,683 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:11" (1/1) ... [2018-10-27 15:27:11,686 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:11" (1/1) ... [2018-10-27 15:27:11,686 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:11" (1/1) ... [2018-10-27 15:27:11,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:11" (1/1) ... [2018-10-27 15:27:11,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:11" (1/1) ... [2018-10-27 15:27:11,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:11" (1/1) ... [2018-10-27 15:27:11,703 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 15:27:11,704 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 15:27:11,704 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 15:27:11,704 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 15:27:11,705 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 15:27:11,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 15:27:11,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 15:27:11,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 15:27:11,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 15:27:11,861 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 15:27:11,861 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 15:27:11,861 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-27 15:27:11,861 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-27 15:27:12,407 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 15:27:12,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 03:27:12 BoogieIcfgContainer [2018-10-27 15:27:12,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 15:27:12,409 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 15:27:12,410 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 15:27:12,413 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 15:27:12,413 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 03:27:11" (1/3) ... [2018-10-27 15:27:12,414 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b2f594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 03:27:12, skipping insertion in model container [2018-10-27 15:27:12,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:27:11" (2/3) ... [2018-10-27 15:27:12,415 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26b2f594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 03:27:12, skipping insertion in model container [2018-10-27 15:27:12,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 03:27:12" (3/3) ... [2018-10-27 15:27:12,417 INFO L112 eAbstractionObserver]: Analyzing ICFG insertion_sort_false-unreach-call_true-termination.i [2018-10-27 15:27:12,427 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 15:27:12,437 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 15:27:12,454 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 15:27:12,490 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 15:27:12,490 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 15:27:12,490 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 15:27:12,490 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 15:27:12,491 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 15:27:12,491 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 15:27:12,491 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 15:27:12,491 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 15:27:12,515 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-10-27 15:27:12,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-27 15:27:12,522 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:12,523 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:12,525 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:12,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:12,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1403248464, now seen corresponding path program 1 times [2018-10-27 15:27:12,534 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:12,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:12,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:12,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:12,594 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:12,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:12,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:27:12,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 15:27:12,692 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:27:12,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 15:27:12,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 15:27:12,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 15:27:12,718 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-10-27 15:27:12,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:12,745 INFO L93 Difference]: Finished difference Result 60 states and 77 transitions. [2018-10-27 15:27:12,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 15:27:12,746 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-10-27 15:27:12,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:12,756 INFO L225 Difference]: With dead ends: 60 [2018-10-27 15:27:12,757 INFO L226 Difference]: Without dead ends: 28 [2018-10-27 15:27:12,761 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 15:27:12,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-27 15:27:12,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-10-27 15:27:12,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-10-27 15:27:12,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-10-27 15:27:12,805 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 14 [2018-10-27 15:27:12,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:12,806 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-10-27 15:27:12,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 15:27:12,806 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-10-27 15:27:12,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-27 15:27:12,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:12,807 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:12,807 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:12,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:12,808 INFO L82 PathProgramCache]: Analyzing trace with hash 969867983, now seen corresponding path program 1 times [2018-10-27 15:27:12,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:12,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:12,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:12,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:12,810 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:13,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:13,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:27:13,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 15:27:13,061 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:27:13,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 15:27:13,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 15:27:13,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-27 15:27:13,064 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2018-10-27 15:27:13,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:13,214 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-10-27 15:27:13,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 15:27:13,215 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-10-27 15:27:13,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:13,217 INFO L225 Difference]: With dead ends: 52 [2018-10-27 15:27:13,218 INFO L226 Difference]: Without dead ends: 38 [2018-10-27 15:27:13,219 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-27 15:27:13,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-27 15:27:13,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2018-10-27 15:27:13,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-27 15:27:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-10-27 15:27:13,232 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 15 [2018-10-27 15:27:13,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:13,232 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-10-27 15:27:13,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 15:27:13,233 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-10-27 15:27:13,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-27 15:27:13,233 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:13,234 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] [2018-10-27 15:27:13,235 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:13,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:13,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1889876064, now seen corresponding path program 1 times [2018-10-27 15:27:13,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:13,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:13,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:13,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:13,238 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:13,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:13,745 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 11 [2018-10-27 15:27:13,886 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 16 [2018-10-27 15:27:14,194 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2018-10-27 15:27:14,405 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 21 [2018-10-27 15:27:14,967 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:14,967 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:27:14,968 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:27:14,969 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 24 with the following transitions: [2018-10-27 15:27:14,971 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-10-27 15:27:15,012 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 15:27:15,012 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 15:27:15,123 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 15:27:15,606 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 15:27:15,607 INFO L272 AbstractInterpreter]: Visited 22 different actions 112 times. Merged at 12 different actions 69 times. Widened at 3 different actions 5 times. Found 2 fixpoints after 2 different actions. Largest state had 38 variables. [2018-10-27 15:27:15,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:15,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 15:27:15,653 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:27:15,653 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:27:15,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:15,669 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:27:15,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:15,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:27:16,076 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-10-27 15:27:16,084 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:16,092 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-10-27 15:27:16,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:16,108 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:16,121 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-10-27 15:27:16,122 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-27 15:27:16,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-27 15:27:16,270 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:16,272 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:16,275 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:16,291 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:16,305 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-10-27 15:27:16,306 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:16,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:16,420 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:16,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-27 15:27:16,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:16,461 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:27:16,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 43 treesize of output 37 [2018-10-27 15:27:16,971 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 25 [2018-10-27 15:27:16,976 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:16,978 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:16,978 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:16,986 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-10-27 15:27:16,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 15:27:16,992 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:16,993 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:16,995 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:17,004 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-10-27 15:27:17,008 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 15:27:17,024 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:17,027 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-10-27 15:27:17,028 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:17,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:17,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:17,055 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:8 [2018-10-27 15:27:17,113 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:17,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:27:17,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 27 [2018-10-27 15:27:17,141 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:27:17,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-27 15:27:17,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 15:27:17,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2018-10-27 15:27:17,143 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 20 states. [2018-10-27 15:27:17,436 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2018-10-27 15:27:18,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:18,242 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2018-10-27 15:27:18,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 15:27:18,244 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 23 [2018-10-27 15:27:18,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:18,249 INFO L225 Difference]: With dead ends: 99 [2018-10-27 15:27:18,249 INFO L226 Difference]: Without dead ends: 77 [2018-10-27 15:27:18,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 30 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=217, Invalid=1043, Unknown=0, NotChecked=0, Total=1260 [2018-10-27 15:27:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-27 15:27:18,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 55. [2018-10-27 15:27:18,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-27 15:27:18,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2018-10-27 15:27:18,266 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 23 [2018-10-27 15:27:18,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:18,267 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2018-10-27 15:27:18,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-27 15:27:18,267 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2018-10-27 15:27:18,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-27 15:27:18,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:18,269 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] [2018-10-27 15:27:18,269 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:18,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:18,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1303070050, now seen corresponding path program 1 times [2018-10-27 15:27:18,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:18,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:18,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:18,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:18,271 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:18,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:18,330 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:18,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:27:18,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-27 15:27:18,330 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:27:18,331 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-27 15:27:18,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-27 15:27:18,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-27 15:27:18,331 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 5 states. [2018-10-27 15:27:18,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:18,424 INFO L93 Difference]: Finished difference Result 137 states and 171 transitions. [2018-10-27 15:27:18,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 15:27:18,425 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-10-27 15:27:18,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:18,429 INFO L225 Difference]: With dead ends: 137 [2018-10-27 15:27:18,430 INFO L226 Difference]: Without dead ends: 90 [2018-10-27 15:27:18,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-10-27 15:27:18,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-27 15:27:18,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 64. [2018-10-27 15:27:18,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-27 15:27:18,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2018-10-27 15:27:18,446 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 23 [2018-10-27 15:27:18,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:18,446 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2018-10-27 15:27:18,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-27 15:27:18,446 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2018-10-27 15:27:18,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-27 15:27:18,447 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:18,448 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] [2018-10-27 15:27:18,448 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:18,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:18,449 INFO L82 PathProgramCache]: Analyzing trace with hash -249426572, now seen corresponding path program 1 times [2018-10-27 15:27:18,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:18,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:18,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:18,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:18,450 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:19,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:19,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:27:19,094 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:27:19,094 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 30 with the following transitions: [2018-10-27 15:27:19,094 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [25], [29], [31], [34], [38], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-10-27 15:27:19,097 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 15:27:19,097 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 15:27:19,103 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 15:27:19,435 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 15:27:19,436 INFO L272 AbstractInterpreter]: Visited 26 different actions 171 times. Merged at 16 different actions 103 times. Widened at 4 different actions 7 times. Found 20 fixpoints after 8 different actions. Largest state had 39 variables. [2018-10-27 15:27:19,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:19,481 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 15:27:19,481 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:27:19,482 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:27:19,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:19,502 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:27:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:19,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:27:19,829 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-10-27 15:27:19,835 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:19,838 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-10-27 15:27:19,838 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:19,855 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:19,878 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:19,878 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:50, output treesize:43 [2018-10-27 15:27:20,071 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:20,072 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 52 treesize of output 54 [2018-10-27 15:27:20,090 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:20,092 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:20,093 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2018-10-27 15:27:20,096 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:20,107 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:20,120 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-10-27 15:27:20,121 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:37 [2018-10-27 15:27:20,154 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-10-27 15:27:20,165 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:20,166 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-10-27 15:27:20,167 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:20,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:20,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-10-27 15:27:20,172 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-27 15:27:20,213 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:20,213 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:27:30,815 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 70 treesize of output 62 [2018-10-27 15:27:30,817 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:30,822 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 62 treesize of output 69 [2018-10-27 15:27:30,904 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:30,919 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:30,928 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:30,942 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:30,978 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:30,979 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:30,985 INFO L303 Elim1Store]: Index analysis took 107 ms [2018-10-27 15:27:30,993 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 48 treesize of output 78 [2018-10-27 15:27:30,995 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 15:27:31,000 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:31,002 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:31,003 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:31,005 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:31,006 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:31,027 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 83 [2018-10-27 15:27:31,031 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-10-27 15:27:31,034 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:31,034 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:31,035 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:31,040 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 45 treesize of output 47 [2018-10-27 15:27:31,041 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:31,074 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:31,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:31,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:31,088 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:72, output treesize:13 [2018-10-27 15:27:33,214 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:33,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:27:33,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 14] total 34 [2018-10-27 15:27:33,236 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:27:33,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-27 15:27:33,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-27 15:27:33,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=981, Unknown=5, NotChecked=0, Total=1122 [2018-10-27 15:27:33,238 INFO L87 Difference]: Start difference. First operand 64 states and 75 transitions. Second operand 22 states. [2018-10-27 15:27:33,817 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 24 [2018-10-27 15:27:34,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:34,580 INFO L93 Difference]: Finished difference Result 152 states and 183 transitions. [2018-10-27 15:27:34,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-27 15:27:34,581 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 29 [2018-10-27 15:27:34,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:34,584 INFO L225 Difference]: With dead ends: 152 [2018-10-27 15:27:34,584 INFO L226 Difference]: Without dead ends: 150 [2018-10-27 15:27:34,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 14.1s TimeCoverageRelationStatistics Valid=217, Invalid=1418, Unknown=5, NotChecked=0, Total=1640 [2018-10-27 15:27:34,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-27 15:27:34,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 75. [2018-10-27 15:27:34,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-27 15:27:34,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 90 transitions. [2018-10-27 15:27:34,599 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 90 transitions. Word has length 29 [2018-10-27 15:27:34,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:34,600 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 90 transitions. [2018-10-27 15:27:34,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-27 15:27:34,600 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 90 transitions. [2018-10-27 15:27:34,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-27 15:27:34,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:34,601 INFO L375 BasicCegarLoop]: trace histogram [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-10-27 15:27:34,602 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:34,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:34,602 INFO L82 PathProgramCache]: Analyzing trace with hash -853417747, now seen corresponding path program 1 times [2018-10-27 15:27:34,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:34,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:34,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:34,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:34,603 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:34,855 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:34,855 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:27:34,855 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:27:34,856 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 33 with the following transitions: [2018-10-27 15:27:34,856 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [42], [44], [48], [52], [57], [59], [61], [67], [70], [72], [75], [77], [78], [79], [80], [82], [83] [2018-10-27 15:27:34,858 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 15:27:34,858 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 15:27:34,864 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 15:27:35,040 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 15:27:35,041 INFO L272 AbstractInterpreter]: Visited 27 different actions 175 times. Merged at 15 different actions 94 times. Widened at 4 different actions 8 times. Found 8 fixpoints after 3 different actions. Largest state had 39 variables. [2018-10-27 15:27:35,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:35,079 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 15:27:35,079 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:27:35,079 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:27:35,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:35,094 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:27:35,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:35,138 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:27:35,274 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:35,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:27:40,050 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:40,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:27:40,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2018-10-27 15:27:40,081 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:27:40,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 15:27:40,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 15:27:40,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=81, Unknown=2, NotChecked=0, Total=110 [2018-10-27 15:27:40,083 INFO L87 Difference]: Start difference. First operand 75 states and 90 transitions. Second operand 8 states. [2018-10-27 15:27:40,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:40,383 INFO L93 Difference]: Finished difference Result 142 states and 173 transitions. [2018-10-27 15:27:40,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 15:27:40,384 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-10-27 15:27:40,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:40,386 INFO L225 Difference]: With dead ends: 142 [2018-10-27 15:27:40,387 INFO L226 Difference]: Without dead ends: 123 [2018-10-27 15:27:40,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=49, Invalid=131, Unknown=2, NotChecked=0, Total=182 [2018-10-27 15:27:40,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-27 15:27:40,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 94. [2018-10-27 15:27:40,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-27 15:27:40,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 112 transitions. [2018-10-27 15:27:40,406 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 112 transitions. Word has length 32 [2018-10-27 15:27:40,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:40,406 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 112 transitions. [2018-10-27 15:27:40,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 15:27:40,407 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 112 transitions. [2018-10-27 15:27:40,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-27 15:27:40,411 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:40,411 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:40,411 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:40,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:40,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1757852431, now seen corresponding path program 2 times [2018-10-27 15:27:40,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:40,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:40,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:40,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:40,415 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:41,342 WARN L179 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 22 [2018-10-27 15:27:41,560 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:41,560 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:27:41,560 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:27:41,561 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:27:41,561 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:27:41,561 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:27:41,561 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:27:41,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 15:27:41,575 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 15:27:41,645 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 15:27:41,645 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:27:41,649 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:27:41,806 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 24 treesize of output 19 [2018-10-27 15:27:41,810 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:41,812 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 19 treesize of output 29 [2018-10-27 15:27:41,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:41,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:41,840 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-10-27 15:27:41,841 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:47, output treesize:40 [2018-10-27 15:27:41,980 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 25 treesize of output 18 [2018-10-27 15:27:41,984 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:41,985 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:41,986 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:41,991 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 18 treesize of output 37 [2018-10-27 15:27:41,992 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:42,003 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:42,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:42,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:33, output treesize:17 [2018-10-27 15:27:42,053 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-10-27 15:27:42,056 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-10-27 15:27:42,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:42,057 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:42,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:42,059 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-27 15:27:42,178 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:42,178 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:27:44,610 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 49 treesize of output 43 [2018-10-27 15:27:44,614 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:44,616 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 43 treesize of output 50 [2018-10-27 15:27:44,688 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:44,689 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:44,690 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:44,692 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:44,693 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:44,718 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-10-27 15:27:44,722 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-10-27 15:27:44,725 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 15:27:44,725 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:44,727 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:44,729 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:44,729 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:44,731 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:44,732 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:44,752 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 2 case distinctions, treesize of input 40 treesize of output 81 [2018-10-27 15:27:44,755 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-10-27 15:27:44,762 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:44,780 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-10-27 15:27:44,783 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-10-27 15:27:44,824 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:44,845 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:44,845 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:44,849 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:44,850 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:44,871 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 42 treesize of output 81 [2018-10-27 15:27:44,874 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-10-27 15:27:44,876 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:44,878 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:44,879 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:44,881 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:44,882 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:44,905 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 83 [2018-10-27 15:27:44,908 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-10-27 15:27:44,910 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 15:27:44,910 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:45,014 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 15:27:45,032 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 15:27:45,059 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-10-27 15:27:45,059 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 4 variables, input treesize:62, output treesize:49 [2018-10-27 15:27:45,373 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:45,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:27:45,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 34 [2018-10-27 15:27:45,395 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:27:45,395 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-27 15:27:45,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-27 15:27:45,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=973, Unknown=1, NotChecked=0, Total=1122 [2018-10-27 15:27:45,396 INFO L87 Difference]: Start difference. First operand 94 states and 112 transitions. Second operand 20 states. [2018-10-27 15:27:46,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:46,549 INFO L93 Difference]: Finished difference Result 194 states and 240 transitions. [2018-10-27 15:27:46,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-27 15:27:46,550 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 31 [2018-10-27 15:27:46,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:46,553 INFO L225 Difference]: With dead ends: 194 [2018-10-27 15:27:46,553 INFO L226 Difference]: Without dead ends: 141 [2018-10-27 15:27:46,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 38 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 538 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=305, Invalid=1764, Unknown=1, NotChecked=0, Total=2070 [2018-10-27 15:27:46,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-27 15:27:46,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 101. [2018-10-27 15:27:46,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-27 15:27:46,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 121 transitions. [2018-10-27 15:27:46,570 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 121 transitions. Word has length 31 [2018-10-27 15:27:46,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:46,570 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 121 transitions. [2018-10-27 15:27:46,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-27 15:27:46,570 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 121 transitions. [2018-10-27 15:27:46,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-27 15:27:46,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:46,572 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:46,572 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:46,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:46,573 INFO L82 PathProgramCache]: Analyzing trace with hash 982712326, now seen corresponding path program 2 times [2018-10-27 15:27:46,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:46,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:46,574 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:27:46,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:46,574 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:46,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:46,641 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 15:27:46,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:27:46,642 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:27:46,642 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:27:46,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:27:46,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:27:46,642 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:27:46,651 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 15:27:46,651 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 15:27:46,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 15:27:46,683 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:27:46,686 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:27:46,827 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-10-27 15:27:46,859 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:46,862 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-10-27 15:27:46,862 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:46,874 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:46,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:46,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:47, output treesize:40 [2018-10-27 15:27:47,058 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:47,059 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 52 treesize of output 54 [2018-10-27 15:27:47,063 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:47,066 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:47,067 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 61 [2018-10-27 15:27:47,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:47,116 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:47,129 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-10-27 15:27:47,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:63, output treesize:35 [2018-10-27 15:27:47,197 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 36 treesize of output 28 [2018-10-27 15:27:47,201 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:47,202 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:47,202 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:47,203 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:47,205 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:47,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 50 [2018-10-27 15:27:47,208 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:47,214 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:47,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:47,221 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:5 [2018-10-27 15:27:47,280 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 15:27:47,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:27:51,702 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 70 treesize of output 62 [2018-10-27 15:27:51,725 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:51,753 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 62 treesize of output 69 [2018-10-27 15:27:51,866 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:51,880 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:51,889 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:51,900 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:51,901 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:51,901 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:51,915 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 50 treesize of output 78 [2018-10-27 15:27:51,918 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 15:27:51,920 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 15:27:51,921 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:51,923 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:51,924 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:51,925 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:51,927 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:51,928 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:51,929 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:51,944 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 48 treesize of output 78 [2018-10-27 15:27:51,946 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 15:27:52,039 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:52,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:52,054 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:52,054 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 3 variables, input treesize:75, output treesize:16 [2018-10-27 15:27:52,117 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 15:27:52,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:27:52,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 14] total 31 [2018-10-27 15:27:52,138 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:27:52,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-27 15:27:52,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-27 15:27:52,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=814, Unknown=2, NotChecked=0, Total=930 [2018-10-27 15:27:52,139 INFO L87 Difference]: Start difference. First operand 101 states and 121 transitions. Second operand 19 states. [2018-10-27 15:27:53,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:53,605 INFO L93 Difference]: Finished difference Result 213 states and 259 transitions. [2018-10-27 15:27:53,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-27 15:27:53,606 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 35 [2018-10-27 15:27:53,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:53,608 INFO L225 Difference]: With dead ends: 213 [2018-10-27 15:27:53,608 INFO L226 Difference]: Without dead ends: 134 [2018-10-27 15:27:53,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=393, Invalid=2467, Unknown=2, NotChecked=0, Total=2862 [2018-10-27 15:27:53,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-27 15:27:53,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 74. [2018-10-27 15:27:53,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-27 15:27:53,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 82 transitions. [2018-10-27 15:27:53,622 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 82 transitions. Word has length 35 [2018-10-27 15:27:53,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:53,622 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 82 transitions. [2018-10-27 15:27:53,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-27 15:27:53,623 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 82 transitions. [2018-10-27 15:27:53,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-27 15:27:53,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:53,624 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:53,624 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:53,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:53,624 INFO L82 PathProgramCache]: Analyzing trace with hash -289889213, now seen corresponding path program 1 times [2018-10-27 15:27:53,625 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:53,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:53,625 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:27:53,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:53,626 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:53,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:54,148 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:54,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:27:54,148 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:27:54,149 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-10-27 15:27:54,149 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [31], [34], [38], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-10-27 15:27:54,151 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 15:27:54,151 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 15:27:54,155 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 15:27:54,272 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 15:27:54,273 INFO L272 AbstractInterpreter]: Visited 25 different actions 126 times. Merged at 15 different actions 76 times. Widened at 4 different actions 5 times. Found 7 fixpoints after 4 different actions. Largest state had 39 variables. [2018-10-27 15:27:54,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:54,299 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 15:27:54,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:27:54,300 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:27:54,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:54,315 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:27:54,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:54,355 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:27:54,532 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-10-27 15:27:54,535 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:54,537 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-10-27 15:27:54,538 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:54,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:54,554 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-10-27 15:27:54,555 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-27 15:27:54,612 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-27 15:27:54,614 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:54,615 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:54,630 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:54,630 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:54,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-10-27 15:27:54,636 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:54,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:54,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:54,653 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-27 15:27:54,669 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:54,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:27:54,804 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-10-27 15:27:54,857 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:54,859 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:54,860 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:54,868 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-10-27 15:27:54,870 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 15:27:54,884 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:54,886 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-10-27 15:27:54,886 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:54,893 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:54,895 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:54,896 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:27:54,905 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-10-27 15:27:54,906 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-27 15:27:55,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:55,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:55,256 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:45, output treesize:8 [2018-10-27 15:27:56,014 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:56,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:27:56,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 30 [2018-10-27 15:27:56,034 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:27:56,035 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-27 15:27:56,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-27 15:27:56,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=748, Unknown=0, NotChecked=0, Total=870 [2018-10-27 15:27:56,035 INFO L87 Difference]: Start difference. First operand 74 states and 82 transitions. Second operand 23 states. [2018-10-27 15:27:57,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:27:57,715 INFO L93 Difference]: Finished difference Result 190 states and 222 transitions. [2018-10-27 15:27:57,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-27 15:27:57,715 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 37 [2018-10-27 15:27:57,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:27:57,717 INFO L225 Difference]: With dead ends: 190 [2018-10-27 15:27:57,717 INFO L226 Difference]: Without dead ends: 147 [2018-10-27 15:27:57,719 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 54 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=558, Invalid=2304, Unknown=0, NotChecked=0, Total=2862 [2018-10-27 15:27:57,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-27 15:27:57,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 78. [2018-10-27 15:27:57,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-27 15:27:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2018-10-27 15:27:57,732 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 37 [2018-10-27 15:27:57,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:27:57,733 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2018-10-27 15:27:57,733 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-27 15:27:57,733 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2018-10-27 15:27:57,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-27 15:27:57,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:27:57,734 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:27:57,735 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:27:57,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:27:57,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1634323973, now seen corresponding path program 3 times [2018-10-27 15:27:57,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:27:57,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:57,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:27:57,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:27:57,736 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:27:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:27:58,227 WARN L179 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-10-27 15:27:59,214 WARN L179 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 17 [2018-10-27 15:27:59,250 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:27:59,250 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:27:59,250 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:27:59,250 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:27:59,251 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:27:59,251 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:27:59,251 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:27:59,259 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 15:27:59,259 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 15:27:59,293 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 15:27:59,294 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:27:59,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:27:59,420 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 25 treesize of output 21 [2018-10-27 15:27:59,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-10-27 15:27:59,422 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:59,448 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:59,463 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 16 treesize of output 13 [2018-10-27 15:27:59,466 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-10-27 15:27:59,466 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:59,468 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:59,480 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:59,480 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:53, output treesize:27 [2018-10-27 15:27:59,649 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 30 treesize of output 25 [2018-10-27 15:27:59,652 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:59,653 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:59,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 51 [2018-10-27 15:27:59,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:27:59,665 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:27:59,680 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-10-27 15:27:59,681 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:42 [2018-10-27 15:27:59,768 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-10-27 15:27:59,795 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:59,819 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:59,842 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:59,869 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:27:59,899 INFO L303 Elim1Store]: Index analysis took 129 ms [2018-10-27 15:27:59,900 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 22 treesize of output 61 [2018-10-27 15:27:59,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:00,071 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:00,134 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:00,134 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:21 [2018-10-27 15:28:00,189 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-10-27 15:28:00,191 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:28:00,192 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-10-27 15:28:00,192 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:00,194 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:00,195 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:00,195 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:5 [2018-10-27 15:28:00,212 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:28:00,212 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:28:14,798 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 51 treesize of output 47 [2018-10-27 15:28:14,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2018-10-27 15:28:14,804 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:14,805 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 43 treesize of output 51 [2018-10-27 15:28:14,870 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:14,871 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:14,875 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:14,875 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:14,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 86 [2018-10-27 15:28:14,902 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 6 xjuncts. [2018-10-27 15:28:14,904 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:14,905 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:14,913 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 1 case distinctions, treesize of input 35 treesize of output 46 [2018-10-27 15:28:14,914 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 15:28:14,920 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:14,920 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:14,924 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:14,925 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:15,022 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 85 [2018-10-27 15:28:15,025 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 6 xjuncts. [2018-10-27 15:28:15,028 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:15,028 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:15,032 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:15,033 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:15,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 85 [2018-10-27 15:28:15,061 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 6 xjuncts. [2018-10-27 15:28:15,064 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:15,065 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:15,072 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:15,072 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:15,096 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 83 [2018-10-27 15:28:15,101 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 6 xjuncts. [2018-10-27 15:28:15,127 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:15,133 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:15,140 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:15,141 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:15,166 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 83 [2018-10-27 15:28:15,170 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 6 xjuncts. [2018-10-27 15:28:15,176 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:15,194 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 38 treesize of output 52 [2018-10-27 15:28:15,196 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-10-27 15:28:15,396 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-10-27 15:28:15,461 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-10-27 15:28:15,526 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-10-27 15:28:15,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 6 xjuncts. [2018-10-27 15:28:15,612 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 5 variables, input treesize:77, output treesize:104 [2018-10-27 15:28:26,755 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 14 refuted. 6 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:28:26,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:28:26,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 42 [2018-10-27 15:28:26,777 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:28:26,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-27 15:28:26,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-27 15:28:26,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1494, Unknown=13, NotChecked=0, Total=1722 [2018-10-27 15:28:26,782 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand 26 states. [2018-10-27 15:28:27,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:28:27,653 INFO L93 Difference]: Finished difference Result 119 states and 135 transitions. [2018-10-27 15:28:27,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-27 15:28:27,654 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 37 [2018-10-27 15:28:27,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:28:27,655 INFO L225 Difference]: With dead ends: 119 [2018-10-27 15:28:27,655 INFO L226 Difference]: Without dead ends: 117 [2018-10-27 15:28:27,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 46 SyntacticMatches, 7 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 848 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=308, Invalid=2031, Unknown=13, NotChecked=0, Total=2352 [2018-10-27 15:28:27,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-27 15:28:27,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 70. [2018-10-27 15:28:27,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-27 15:28:27,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2018-10-27 15:28:27,668 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 37 [2018-10-27 15:28:27,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:28:27,669 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2018-10-27 15:28:27,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-27 15:28:27,669 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2018-10-27 15:28:27,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-27 15:28:27,670 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:28:27,670 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] [2018-10-27 15:28:27,671 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:28:27,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:27,671 INFO L82 PathProgramCache]: Analyzing trace with hash -411213956, now seen corresponding path program 2 times [2018-10-27 15:28:27,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:28:27,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:27,672 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:28:27,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:27,672 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:28:27,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:28,210 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:28:28,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:28,211 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:28:28,211 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:28:28,211 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:28:28,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:28,212 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:28:28,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 15:28:28,224 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 15:28:28,261 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 15:28:28,261 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:28:28,266 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:28:28,452 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-10-27 15:28:28,455 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:28:28,457 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-10-27 15:28:28,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:28,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:28,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-10-27 15:28:28,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:27 [2018-10-27 15:28:28,789 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-10-27 15:28:28,792 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-10-27 15:28:28,793 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:28,799 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:28,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:28,800 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-10-27 15:28:28,844 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:28:28,845 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:28:31,223 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 45 treesize of output 39 [2018-10-27 15:28:31,290 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:31,293 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-10-27 15:28:31,293 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:31,300 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:31,303 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:31,305 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:31,316 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 37 treesize of output 52 [2018-10-27 15:28:31,318 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 15:28:31,328 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:31,330 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:31,332 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:31,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 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 52 [2018-10-27 15:28:31,346 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-10-27 15:28:31,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:31,395 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-10-27 15:28:31,395 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:61, output treesize:22 [2018-10-27 15:28:31,788 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:28:31,810 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:28:31,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 19, 16] total 43 [2018-10-27 15:28:31,811 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:28:31,811 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-27 15:28:31,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-27 15:28:31,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=1574, Unknown=1, NotChecked=0, Total=1806 [2018-10-27 15:28:31,812 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 32 states. [2018-10-27 15:28:45,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:28:45,062 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2018-10-27 15:28:45,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-27 15:28:45,062 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 40 [2018-10-27 15:28:45,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:28:45,064 INFO L225 Difference]: With dead ends: 136 [2018-10-27 15:28:45,064 INFO L226 Difference]: Without dead ends: 134 [2018-10-27 15:28:45,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 53 SyntacticMatches, 3 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 940 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=400, Invalid=2679, Unknown=1, NotChecked=0, Total=3080 [2018-10-27 15:28:45,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-27 15:28:45,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 85. [2018-10-27 15:28:45,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-27 15:28:45,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 95 transitions. [2018-10-27 15:28:45,079 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 95 transitions. Word has length 40 [2018-10-27 15:28:45,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:28:45,079 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 95 transitions. [2018-10-27 15:28:45,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-27 15:28:45,079 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-10-27 15:28:45,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-27 15:28:45,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:28:45,081 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:28:45,081 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:28:45,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:45,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1027358850, now seen corresponding path program 3 times [2018-10-27 15:28:45,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:28:45,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:45,082 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:28:45,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:45,082 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:28:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 7 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:28:45,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:45,781 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:28:45,781 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:28:45,781 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:28:45,781 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:45,781 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:28:45,793 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 15:28:45,793 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 15:28:45,844 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 15:28:45,844 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:28:45,849 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:28:45,970 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-10-27 15:28:45,973 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:28:45,975 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-10-27 15:28:45,976 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:45,983 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:45,989 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:45,989 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:24 [2018-10-27 15:28:46,059 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-10-27 15:28:46,062 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:28:46,062 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:28:46,063 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:28:46,066 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-10-27 15:28:46,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:46,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:46,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:46,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:17 [2018-10-27 15:28:46,137 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 25 treesize of output 18 [2018-10-27 15:28:46,146 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:28:46,147 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:28:46,148 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:28:46,152 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 18 treesize of output 37 [2018-10-27 15:28:46,153 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:46,162 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:46,171 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:46,171 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:36, output treesize:13 [2018-10-27 15:28:46,213 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 30 treesize of output 22 [2018-10-27 15:28:46,215 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:28:46,217 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 22 treesize of output 16 [2018-10-27 15:28:46,218 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:46,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:46,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:46,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:3 [2018-10-27 15:28:46,238 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:28:46,238 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:29:08,989 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-10-27 15:29:08,992 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:08,995 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-10-27 15:29:08,998 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:09,030 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 4 case distinctions, treesize of input 52 treesize of output 92 [2018-10-27 15:29:09,487 WARN L179 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 79 [2018-10-27 15:29:09,499 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:09,505 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:09,506 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:09,540 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 95 [2018-10-27 15:29:09,547 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 9 xjuncts. [2018-10-27 15:29:09,552 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:09,553 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:09,564 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 43 treesize of output 56 [2018-10-27 15:29:09,565 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 15:29:09,567 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:09,572 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:09,573 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:09,606 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 95 [2018-10-27 15:29:09,612 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 9 xjuncts. [2018-10-27 15:29:09,614 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:09,615 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:09,615 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:09,619 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 40 treesize of output 50 [2018-10-27 15:29:09,619 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:09,622 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:09,629 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:09,630 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:09,665 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 4 case distinctions, treesize of input 46 treesize of output 97 [2018-10-27 15:29:09,671 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 9 xjuncts. [2018-10-27 15:29:09,684 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:09,686 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:09,686 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:09,689 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:09,689 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:09,691 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:09,706 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 47 treesize of output 83 [2018-10-27 15:29:09,707 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-10-27 15:29:09,710 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:09,715 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:09,716 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:09,750 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 97 [2018-10-27 15:29:09,754 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 9 xjuncts. [2018-10-27 15:29:10,169 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:10,173 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:10,176 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:10,181 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:10,182 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:10,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 142 [2018-10-27 15:29:10,236 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 15:29:10,251 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 39 xjuncts. [2018-10-27 15:29:10,281 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:10,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 43 treesize of output 98 [2018-10-27 15:29:10,328 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 32 xjuncts. [2018-10-27 15:29:10,332 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:10,339 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:10,376 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 4 case distinctions, treesize of input 43 treesize of output 97 [2018-10-27 15:29:10,381 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 16 xjuncts. [2018-10-27 15:29:11,601 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:11,607 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:11,608 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:11,640 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 54 treesize of output 99 [2018-10-27 15:29:11,645 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 9 xjuncts. [2018-10-27 15:29:11,659 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:11,673 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 59 [2018-10-27 15:29:11,675 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 4 xjuncts. [2018-10-27 15:29:11,678 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:11,698 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 51 [2018-10-27 15:29:11,699 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 4 xjuncts. [2018-10-27 15:29:11,705 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:11,710 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:11,711 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:11,742 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 97 [2018-10-27 15:29:11,746 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 9 xjuncts. [2018-10-27 15:29:12,163 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-10-27 15:29:12,295 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-10-27 15:29:12,470 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-10-27 15:29:12,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 10 xjuncts. [2018-10-27 15:29:12,612 INFO L202 ElimStorePlain]: Needed 18 recursive calls to eliminate 8 variables, input treesize:76, output treesize:145 [2018-10-27 15:29:12,737 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:29:12,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:29:12,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 17] total 40 [2018-10-27 15:29:12,758 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:29:12,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-27 15:29:12,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-27 15:29:12,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=1358, Unknown=8, NotChecked=0, Total=1560 [2018-10-27 15:29:12,759 INFO L87 Difference]: Start difference. First operand 85 states and 95 transitions. Second operand 28 states. [2018-10-27 15:29:14,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:29:14,043 INFO L93 Difference]: Finished difference Result 202 states and 233 transitions. [2018-10-27 15:29:14,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-27 15:29:14,043 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 39 [2018-10-27 15:29:14,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:29:14,044 INFO L225 Difference]: With dead ends: 202 [2018-10-27 15:29:14,044 INFO L226 Difference]: Without dead ends: 157 [2018-10-27 15:29:14,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 909 ImplicationChecksByTransitivity, 24.2s TimeCoverageRelationStatistics Valid=418, Invalid=2544, Unknown=8, NotChecked=0, Total=2970 [2018-10-27 15:29:14,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-27 15:29:14,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 106. [2018-10-27 15:29:14,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-27 15:29:14,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 120 transitions. [2018-10-27 15:29:14,061 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 120 transitions. Word has length 39 [2018-10-27 15:29:14,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:29:14,061 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 120 transitions. [2018-10-27 15:29:14,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-27 15:29:14,061 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 120 transitions. [2018-10-27 15:29:14,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-27 15:29:14,063 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:29:14,063 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:29:14,063 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:29:14,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:29:14,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1389059306, now seen corresponding path program 1 times [2018-10-27 15:29:14,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:29:14,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:14,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:29:14,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:14,064 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:29:14,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:14,630 WARN L179 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 10 [2018-10-27 15:29:14,861 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 19 [2018-10-27 15:29:15,427 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:29:15,427 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:15,427 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:29:15,428 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 46 with the following transitions: [2018-10-27 15:29:15,428 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [31], [36], [38], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-10-27 15:29:15,429 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 15:29:15,430 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 15:29:15,433 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 15:29:15,546 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 15:29:15,546 INFO L272 AbstractInterpreter]: Visited 25 different actions 140 times. Merged at 15 different actions 87 times. Widened at 3 different actions 6 times. Found 8 fixpoints after 3 different actions. Largest state had 38 variables. [2018-10-27 15:29:15,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:29:15,585 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 15:29:15,585 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:15,585 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:29:15,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:29:15,599 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:29:15,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:15,636 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:29:15,805 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-10-27 15:29:15,809 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:15,810 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-10-27 15:29:15,811 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:15,818 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:15,830 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-10-27 15:29:15,831 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-10-27 15:29:15,979 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-10-27 15:29:15,982 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:15,983 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:15,984 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:15,990 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-10-27 15:29:15,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:16,002 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:16,013 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-10-27 15:29:16,014 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:27 [2018-10-27 15:29:16,125 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-10-27 15:29:16,128 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:16,130 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:16,131 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:16,137 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-10-27 15:29:16,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:16,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:16,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 15:29:16,167 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:49, output treesize:27 [2018-10-27 15:29:16,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-27 15:29:16,211 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:16,212 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:16,213 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:16,213 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:16,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 49 [2018-10-27 15:29:16,220 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:16,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:16,233 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:16,234 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-27 15:29:16,256 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 4 proven. 35 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 15:29:16,256 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:29:16,936 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 55 treesize of output 49 [2018-10-27 15:29:16,938 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:16,940 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 49 treesize of output 56 [2018-10-27 15:29:16,943 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:16,975 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 4 case distinctions, treesize of input 44 treesize of output 79 [2018-10-27 15:29:17,225 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2018-10-27 15:29:17,230 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:17,232 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:17,234 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:17,240 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:17,241 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:17,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 126 [2018-10-27 15:29:17,294 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 15:29:17,304 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 39 xjuncts. [2018-10-27 15:29:17,306 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 15:29:17,306 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:17,309 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:17,312 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:17,316 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:17,319 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:17,320 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:17,394 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 124 [2018-10-27 15:29:17,395 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 15:29:17,403 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 39 xjuncts. [2018-10-27 15:29:17,418 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 15:29:17,418 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:17,435 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:17,441 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:17,445 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:17,451 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:17,453 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:17,514 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 52 treesize of output 126 [2018-10-27 15:29:17,514 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 15:29:17,523 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 39 xjuncts. [2018-10-27 15:29:17,525 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 15:29:17,525 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:17,533 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:17,539 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:17,541 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:17,549 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:17,550 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:17,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 48 treesize of output 124 [2018-10-27 15:29:17,619 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 15:29:17,631 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 39 xjuncts. [2018-10-27 15:29:18,892 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:18,899 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:18,900 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:18,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 92 [2018-10-27 15:29:18,935 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 9 xjuncts. [2018-10-27 15:29:19,107 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:19,113 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:19,114 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:19,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 97 [2018-10-27 15:29:19,149 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 9 xjuncts. [2018-10-27 15:29:19,236 INFO L267 ElimStorePlain]: Start of recursive call 4: 3 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-10-27 15:29:19,281 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 15:29:19,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 15:29:19,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 15:29:19,365 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 7 variables, input treesize:76, output treesize:57 [2018-10-27 15:29:19,520 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:29:19,541 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:29:19,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 18] total 46 [2018-10-27 15:29:19,542 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:29:19,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-27 15:29:19,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-27 15:29:19,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=1837, Unknown=0, NotChecked=0, Total=2070 [2018-10-27 15:29:19,543 INFO L87 Difference]: Start difference. First operand 106 states and 120 transitions. Second operand 31 states. [2018-10-27 15:29:22,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:29:22,406 INFO L93 Difference]: Finished difference Result 278 states and 325 transitions. [2018-10-27 15:29:22,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-27 15:29:22,407 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 45 [2018-10-27 15:29:22,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:29:22,409 INFO L225 Difference]: With dead ends: 278 [2018-10-27 15:29:22,409 INFO L226 Difference]: Without dead ends: 233 [2018-10-27 15:29:22,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1325 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=694, Invalid=4562, Unknown=0, NotChecked=0, Total=5256 [2018-10-27 15:29:22,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-27 15:29:22,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 140. [2018-10-27 15:29:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-27 15:29:22,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 164 transitions. [2018-10-27 15:29:22,433 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 164 transitions. Word has length 45 [2018-10-27 15:29:22,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:29:22,434 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 164 transitions. [2018-10-27 15:29:22,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-27 15:29:22,434 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 164 transitions. [2018-10-27 15:29:22,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-27 15:29:22,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:29:22,435 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:29:22,435 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:29:22,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:29:22,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1009376150, now seen corresponding path program 1 times [2018-10-27 15:29:22,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:29:22,436 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:22,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:29:22,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:22,437 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:29:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:23,071 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:29:23,072 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:23,072 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:29:23,072 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 47 with the following transitions: [2018-10-27 15:29:23,073 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [31], [34], [38], [42], [44], [48], [52], [57], [59], [61], [67], [70], [72], [75], [77], [78], [79], [80], [82], [83] [2018-10-27 15:29:23,074 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 15:29:23,074 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 15:29:23,078 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 15:29:23,237 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 15:29:23,237 INFO L272 AbstractInterpreter]: Visited 30 different actions 200 times. Merged at 18 different actions 106 times. Widened at 5 different actions 9 times. Found 13 fixpoints after 6 different actions. Largest state had 40 variables. [2018-10-27 15:29:23,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:29:23,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 15:29:23,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:23,269 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:29:23,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:29:23,284 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:29:23,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:23,329 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:29:23,589 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-10-27 15:29:23,592 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:23,594 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-10-27 15:29:23,595 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:23,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:23,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:23,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:49, output treesize:42 [2018-10-27 15:29:24,064 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:24,065 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-10-27 15:29:24,068 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:24,069 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:24,070 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:24,075 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:24,076 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 86 [2018-10-27 15:29:24,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:24,089 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:24,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 15:29:24,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:66, output treesize:37 [2018-10-27 15:29:24,557 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 61 [2018-10-27 15:29:24,560 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:24,562 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:24,563 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:24,564 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:24,566 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:24,567 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 57 treesize of output 78 [2018-10-27 15:29:24,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:24,604 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:24,606 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:24,607 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 29 treesize of output 33 [2018-10-27 15:29:24,608 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:24,639 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:24,642 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:24,643 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:24,646 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:24,651 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:24,661 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:24,665 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:24,701 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 4 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 150 [2018-10-27 15:29:24,708 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 6 xjuncts. [2018-10-27 15:29:24,755 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:24,769 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:24,770 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 9 variables, input treesize:91, output treesize:5 [2018-10-27 15:29:24,834 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:29:24,834 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:29:25,571 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-10-27 15:29:25,574 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,576 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-10-27 15:29:25,652 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,653 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,654 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,655 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,656 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,656 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,657 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,664 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,665 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,667 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-10-27 15:29:25,668 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:25,672 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,672 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,673 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,673 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,674 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,674 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,675 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,681 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,682 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,685 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-10-27 15:29:25,686 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:25,688 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,689 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,690 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,695 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 47 treesize of output 51 [2018-10-27 15:29:25,696 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:25,698 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,698 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,699 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,699 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,700 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,700 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,701 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,709 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-10-27 15:29:25,710 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:25,713 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,713 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,714 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,715 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,716 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,717 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,731 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-10-27 15:29:25,733 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-10-27 15:29:25,735 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,736 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,736 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,737 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,738 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,739 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,739 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,747 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,747 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,750 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-10-27 15:29:25,751 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:25,754 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,755 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,755 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,756 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,757 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:25,760 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 52 treesize of output 62 [2018-10-27 15:29:25,761 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:25,806 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:29:25,820 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:29:25,842 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:29:25,842 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 5 variables, input treesize:82, output treesize:27 [2018-10-27 15:29:25,956 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:29:25,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:29:25,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 17] total 49 [2018-10-27 15:29:25,977 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:29:25,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-27 15:29:25,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-27 15:29:25,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=2126, Unknown=0, NotChecked=0, Total=2352 [2018-10-27 15:29:25,979 INFO L87 Difference]: Start difference. First operand 140 states and 164 transitions. Second operand 36 states. [2018-10-27 15:29:28,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:29:28,669 INFO L93 Difference]: Finished difference Result 279 states and 329 transitions. [2018-10-27 15:29:28,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-27 15:29:28,670 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 46 [2018-10-27 15:29:28,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:29:28,675 INFO L225 Difference]: With dead ends: 279 [2018-10-27 15:29:28,676 INFO L226 Difference]: Without dead ends: 234 [2018-10-27 15:29:28,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 62 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1545 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=607, Invalid=5093, Unknown=0, NotChecked=0, Total=5700 [2018-10-27 15:29:28,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-27 15:29:28,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 181. [2018-10-27 15:29:28,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-27 15:29:28,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 211 transitions. [2018-10-27 15:29:28,709 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 211 transitions. Word has length 46 [2018-10-27 15:29:28,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:29:28,709 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 211 transitions. [2018-10-27 15:29:28,709 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-27 15:29:28,709 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 211 transitions. [2018-10-27 15:29:28,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-27 15:29:28,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:29:28,712 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:29:28,712 INFO L424 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:29:28,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:29:28,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1700799956, now seen corresponding path program 2 times [2018-10-27 15:29:28,712 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:29:28,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:28,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:29:28,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:28,713 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:29:28,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:28,965 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 8 [2018-10-27 15:29:29,496 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:29:29,496 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:29,496 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:29:29,497 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:29:29,497 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:29:29,497 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:29,497 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:29:29,505 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 15:29:29,505 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 15:29:29,548 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-10-27 15:29:29,548 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:29:29,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:29:29,720 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-10-27 15:29:29,724 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:29,726 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-10-27 15:29:29,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:29,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:29,746 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-10-27 15:29:29,746 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:37, output treesize:30 [2018-10-27 15:29:29,927 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 46 treesize of output 37 [2018-10-27 15:29:29,932 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:29,933 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:29,958 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 37 treesize of output 80 [2018-10-27 15:29:29,959 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-27 15:29:29,978 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:29,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-10-27 15:29:29,990 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:58, output treesize:30 [2018-10-27 15:29:30,061 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-10-27 15:29:30,085 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:30,086 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:30,086 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:30,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 32 [2018-10-27 15:29:30,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:30,097 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:30,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:30,103 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2018-10-27 15:29:30,122 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 15:29:30,122 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:29:30,632 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-10-27 15:29:30,656 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:30,658 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-10-27 15:29:30,728 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:30,731 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:30,737 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:30,738 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:30,738 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:30,739 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:30,752 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-10-27 15:29:30,753 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-10-27 15:29:30,796 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:30,801 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:30,802 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:30,811 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-10-27 15:29:30,870 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:30,872 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:30,872 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:30,874 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:30,875 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:30,915 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-10-27 15:29:30,917 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-10-27 15:29:30,971 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:30,975 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:31,000 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-10-27 15:29:31,257 WARN L179 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 48 [2018-10-27 15:29:31,261 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:31,263 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:31,263 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:31,264 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:31,264 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:31,265 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:31,283 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 49 treesize of output 81 [2018-10-27 15:29:31,284 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-10-27 15:29:31,287 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:31,289 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:31,290 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:31,291 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:31,292 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:31,292 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:31,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, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 83 [2018-10-27 15:29:31,310 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-10-27 15:29:31,387 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:31,390 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:31,391 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:31,393 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:31,394 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:31,414 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 37 treesize of output 78 [2018-10-27 15:29:31,415 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-10-27 15:29:31,418 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:31,420 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:31,420 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:31,421 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:31,421 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:31,422 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:31,426 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:31,427 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:31,434 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 39 treesize of output 79 [2018-10-27 15:29:31,436 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-10-27 15:29:31,471 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:29:31,481 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:31,487 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:31,488 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:98, output treesize:13 [2018-10-27 15:29:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 31 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-27 15:29:31,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:29:31,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 16] total 44 [2018-10-27 15:29:31,597 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:29:31,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-27 15:29:31,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-27 15:29:31,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1627, Unknown=0, NotChecked=0, Total=1892 [2018-10-27 15:29:31,599 INFO L87 Difference]: Start difference. First operand 181 states and 211 transitions. Second operand 31 states. [2018-10-27 15:29:36,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:29:36,206 INFO L93 Difference]: Finished difference Result 430 states and 510 transitions. [2018-10-27 15:29:36,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-27 15:29:36,207 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 45 [2018-10-27 15:29:36,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:29:36,210 INFO L225 Difference]: With dead ends: 430 [2018-10-27 15:29:36,211 INFO L226 Difference]: Without dead ends: 385 [2018-10-27 15:29:36,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 65 SyntacticMatches, 4 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3090 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1663, Invalid=8639, Unknown=0, NotChecked=0, Total=10302 [2018-10-27 15:29:36,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-10-27 15:29:36,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 213. [2018-10-27 15:29:36,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-27 15:29:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 257 transitions. [2018-10-27 15:29:36,268 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 257 transitions. Word has length 45 [2018-10-27 15:29:36,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:29:36,268 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 257 transitions. [2018-10-27 15:29:36,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-27 15:29:36,268 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 257 transitions. [2018-10-27 15:29:36,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-27 15:29:36,269 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:29:36,269 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:29:36,270 INFO L424 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:29:36,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:29:36,270 INFO L82 PathProgramCache]: Analyzing trace with hash -390828650, now seen corresponding path program 4 times [2018-10-27 15:29:36,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:29:36,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:36,271 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:29:36,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:36,271 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:29:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:36,783 WARN L179 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 11 [2018-10-27 15:29:37,098 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 25 [2018-10-27 15:29:37,704 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:29:37,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:37,705 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:29:37,705 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:29:37,705 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:29:37,705 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:37,705 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:29:37,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:29:37,712 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:29:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:37,750 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:29:38,012 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 25 treesize of output 21 [2018-10-27 15:29:38,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-10-27 15:29:38,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:38,021 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:38,046 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 16 treesize of output 13 [2018-10-27 15:29:38,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-10-27 15:29:38,048 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:38,051 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:38,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:38,087 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:26 [2018-10-27 15:29:38,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2018-10-27 15:29:38,295 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:38,297 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:38,298 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 54 [2018-10-27 15:29:38,298 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:38,309 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:38,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 15:29:38,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:50, output treesize:38 [2018-10-27 15:29:38,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2018-10-27 15:29:38,451 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:38,452 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:38,454 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:38,456 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:38,460 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 28 treesize of output 85 [2018-10-27 15:29:38,461 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:38,476 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:38,493 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 15:29:38,494 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:56, output treesize:38 [2018-10-27 15:29:38,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 28 [2018-10-27 15:29:38,717 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:38,718 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:38,720 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:38,721 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:38,725 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 28 treesize of output 85 [2018-10-27 15:29:38,726 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:38,740 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:38,755 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-10-27 15:29:38,755 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:57, output treesize:35 [2018-10-27 15:29:38,856 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 40 treesize of output 32 [2018-10-27 15:29:38,874 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:38,876 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:38,876 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:38,876 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:38,878 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:38,879 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 32 treesize of output 51 [2018-10-27 15:29:38,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:38,889 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:38,896 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:38,896 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:51, output treesize:5 [2018-10-27 15:29:38,921 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:29:38,921 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:29:40,076 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 55 [2018-10-27 15:29:40,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2018-10-27 15:29:40,186 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 61 [2018-10-27 15:29:40,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 59 [2018-10-27 15:29:40,363 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2018-10-27 15:29:40,368 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:40,368 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:40,370 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:40,380 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 1 case distinctions, treesize of input 49 treesize of output 64 [2018-10-27 15:29:40,381 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 15:29:40,393 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 50 [2018-10-27 15:29:40,394 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-10-27 15:29:40,398 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:40,399 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:40,400 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:40,409 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 1 case distinctions, treesize of input 43 treesize of output 62 [2018-10-27 15:29:40,410 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-10-27 15:29:40,414 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:40,414 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:40,416 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:40,427 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 46 treesize of output 65 [2018-10-27 15:29:40,428 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-10-27 15:29:40,431 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:40,431 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:40,433 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:40,443 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 51 treesize of output 64 [2018-10-27 15:29:40,444 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-10-27 15:29:40,447 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:40,449 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2018-10-27 15:29:40,450 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:40,454 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:40,454 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:40,456 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:40,466 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 1 case distinctions, treesize of input 45 treesize of output 62 [2018-10-27 15:29:40,466 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-10-27 15:29:40,641 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 58 [2018-10-27 15:29:40,643 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 8 xjuncts. [2018-10-27 15:29:40,647 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:40,666 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 51 [2018-10-27 15:29:40,667 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-10-27 15:29:40,671 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:40,673 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:40,679 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:40,715 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 84 [2018-10-27 15:29:40,718 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 11 xjuncts. [2018-10-27 15:29:40,935 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-10-27 15:29:41,108 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 46 treesize of output 84 [2018-10-27 15:29:41,778 WARN L179 SmtUtils]: Spent 665.00 ms on a formula simplification. DAG size of input: 197 DAG size of output: 165 [2018-10-27 15:29:41,804 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:41,807 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:41,811 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:41,812 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:41,840 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 107 [2018-10-27 15:29:41,844 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 6 xjuncts. [2018-10-27 15:29:41,849 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:41,850 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:41,861 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 1 case distinctions, treesize of input 47 treesize of output 59 [2018-10-27 15:29:41,862 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 2 xjuncts. [2018-10-27 15:29:41,866 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:41,868 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:41,873 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:41,874 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:41,903 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 109 [2018-10-27 15:29:41,906 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 6 xjuncts. [2018-10-27 15:29:41,912 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:41,931 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 50 treesize of output 75 [2018-10-27 15:29:41,932 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 4 xjuncts. [2018-10-27 15:29:41,936 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:41,938 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:41,942 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:41,943 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:41,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 109 [2018-10-27 15:29:41,973 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 6 xjuncts. [2018-10-27 15:29:41,984 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:41,986 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:41,989 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:41,990 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:42,020 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 107 [2018-10-27 15:29:42,023 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 6 xjuncts. [2018-10-27 15:29:42,026 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:42,028 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:42,032 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:42,032 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:42,061 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 110 [2018-10-27 15:29:42,064 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 6 xjuncts. [2018-10-27 15:29:43,372 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:43,420 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 98 [2018-10-27 15:29:43,425 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 32 xjuncts. [2018-10-27 15:29:43,428 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:43,430 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:43,441 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:43,442 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:43,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 7 case distinctions, treesize of input 55 treesize of output 137 [2018-10-27 15:29:43,503 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-10-27 15:29:43,516 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 68 xjuncts. [2018-10-27 15:29:43,520 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:43,526 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:43,561 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 49 treesize of output 91 [2018-10-27 15:29:43,564 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 16 xjuncts. [2018-10-27 15:29:46,335 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:46,338 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:46,351 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:46,417 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 135 [2018-10-27 15:29:46,418 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-10-27 15:29:46,450 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 120 xjuncts. [2018-10-27 15:29:46,563 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 96 [2018-10-27 15:29:46,564 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-10-27 15:29:46,570 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 64 xjuncts. [2018-10-27 15:29:46,574 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:46,617 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 89 [2018-10-27 15:29:46,622 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 32 xjuncts. [2018-10-27 15:29:46,625 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:46,627 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:46,640 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:46,706 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 8 case distinctions, treesize of input 54 treesize of output 137 [2018-10-27 15:29:46,706 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-10-27 15:29:46,745 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 120 xjuncts. [2018-10-27 15:29:54,390 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:54,391 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:54,393 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:54,404 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 1 case distinctions, treesize of input 54 treesize of output 69 [2018-10-27 15:29:54,406 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-10-27 15:29:54,419 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 52 [2018-10-27 15:29:54,420 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-10-27 15:29:54,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 38 [2018-10-27 15:29:54,431 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 2 xjuncts. [2018-10-27 15:29:54,435 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:54,435 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:54,437 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:54,448 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 1 case distinctions, treesize of input 50 treesize of output 67 [2018-10-27 15:29:54,449 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 2 xjuncts. [2018-10-27 15:29:55,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 52 [2018-10-27 15:29:55,498 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 8 xjuncts. [2018-10-27 15:29:55,502 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:55,502 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:55,510 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:55,561 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 56 treesize of output 111 [2018-10-27 15:29:55,565 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 11 xjuncts. [2018-10-27 15:29:55,576 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:55,577 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:55,584 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:55,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 52 treesize of output 109 [2018-10-27 15:29:55,627 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 11 xjuncts. [2018-10-27 15:29:55,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 79 [2018-10-27 15:29:55,665 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 8 xjuncts. [2018-10-27 15:29:56,899 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:56,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 72 [2018-10-27 15:29:56,918 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 4 xjuncts. [2018-10-27 15:29:56,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 55 [2018-10-27 15:29:56,950 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 8 xjuncts. [2018-10-27 15:29:56,954 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:56,954 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:56,958 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:56,959 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:56,989 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 102 [2018-10-27 15:29:56,992 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 6 xjuncts. [2018-10-27 15:29:57,725 INFO L267 ElimStorePlain]: Start of recursive call 16: 7 dim-1 vars, End of recursive call: and 28 xjuncts. [2018-10-27 15:29:58,171 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 22 xjuncts. [2018-10-27 15:29:58,542 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 21 xjuncts. [2018-10-27 15:29:58,896 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 21 xjuncts. [2018-10-27 15:29:59,266 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 18 xjuncts. [2018-10-27 15:29:59,266 INFO L202 ElimStorePlain]: Needed 41 recursive calls to eliminate 9 variables, input treesize:103, output treesize:259 [2018-10-27 15:29:59,637 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 6 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:29:59,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:29:59,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 57 [2018-10-27 15:29:59,658 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:29:59,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-27 15:29:59,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-27 15:29:59,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=2834, Unknown=0, NotChecked=0, Total=3192 [2018-10-27 15:29:59,660 INFO L87 Difference]: Start difference. First operand 213 states and 257 transitions. Second operand 38 states. [2018-10-27 15:30:01,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:30:01,603 INFO L93 Difference]: Finished difference Result 361 states and 434 transitions. [2018-10-27 15:30:01,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-27 15:30:01,604 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 45 [2018-10-27 15:30:01,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:30:01,607 INFO L225 Difference]: With dead ends: 361 [2018-10-27 15:30:01,607 INFO L226 Difference]: Without dead ends: 272 [2018-10-27 15:30:01,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 54 SyntacticMatches, 4 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1718 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=653, Invalid=4459, Unknown=0, NotChecked=0, Total=5112 [2018-10-27 15:30:01,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-27 15:30:01,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 222. [2018-10-27 15:30:01,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-27 15:30:01,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 268 transitions. [2018-10-27 15:30:01,656 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 268 transitions. Word has length 45 [2018-10-27 15:30:01,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:30:01,656 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 268 transitions. [2018-10-27 15:30:01,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-27 15:30:01,656 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 268 transitions. [2018-10-27 15:30:01,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-27 15:30:01,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:30:01,657 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-27 15:30:01,657 INFO L424 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:30:01,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:30:01,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1905129809, now seen corresponding path program 3 times [2018-10-27 15:30:01,657 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:30:01,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:30:01,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:30:01,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:30:01,658 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:30:01,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:30:02,594 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 15:30:02,594 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:30:02,594 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:30:02,594 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:30:02,594 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:30:02,595 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:30:02,595 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:30:02,602 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 15:30:02,602 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 15:30:02,632 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 15:30:02,632 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:30:02,634 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:30:02,758 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 15:30:02,758 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:30:02,907 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-27 15:30:02,928 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:30:02,928 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2018-10-27 15:30:02,928 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:30:02,928 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-27 15:30:02,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-27 15:30:02,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=276, Unknown=0, NotChecked=0, Total=342 [2018-10-27 15:30:02,929 INFO L87 Difference]: Start difference. First operand 222 states and 268 transitions. Second operand 13 states. [2018-10-27 15:30:03,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:30:03,311 INFO L93 Difference]: Finished difference Result 307 states and 369 transitions. [2018-10-27 15:30:03,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-27 15:30:03,312 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 49 [2018-10-27 15:30:03,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:30:03,313 INFO L225 Difference]: With dead ends: 307 [2018-10-27 15:30:03,313 INFO L226 Difference]: Without dead ends: 275 [2018-10-27 15:30:03,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=105, Invalid=401, Unknown=0, NotChecked=0, Total=506 [2018-10-27 15:30:03,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-27 15:30:03,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 217. [2018-10-27 15:30:03,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-27 15:30:03,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 259 transitions. [2018-10-27 15:30:03,354 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 259 transitions. Word has length 49 [2018-10-27 15:30:03,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:30:03,354 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 259 transitions. [2018-10-27 15:30:03,355 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-27 15:30:03,355 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 259 transitions. [2018-10-27 15:30:03,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-27 15:30:03,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:30:03,356 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:30:03,356 INFO L424 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:30:03,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:30:03,356 INFO L82 PathProgramCache]: Analyzing trace with hash -139141365, now seen corresponding path program 4 times [2018-10-27 15:30:03,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:30:03,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:30:03,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:30:03,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:30:03,357 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:30:03,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:30:03,678 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 15:30:04,267 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 1 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:30:04,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:30:04,268 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:30:04,268 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:30:04,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-10-27 15:30:04,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:30:04,268 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:30:04,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:30:04,279 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:30:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:30:04,318 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:30:04,393 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-10-27 15:30:04,396 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:04,398 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-10-27 15:30:04,398 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:04,405 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:04,422 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-10-27 15:30:04,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:55, output treesize:48 [2018-10-27 15:30:04,530 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-10-27 15:30:04,534 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:04,535 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:04,537 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:04,542 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-10-27 15:30:04,542 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:04,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:04,568 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 15:30:04,568 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:60, output treesize:36 [2018-10-27 15:30:04,826 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-10-27 15:30:04,829 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:04,831 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:04,831 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:04,832 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:04,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 53 [2018-10-27 15:30:04,839 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:04,847 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:04,853 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:04,853 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:54, output treesize:3 [2018-10-27 15:30:04,904 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:30:04,905 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:30:05,251 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 53 treesize of output 47 [2018-10-27 15:30:05,254 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,256 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 47 treesize of output 54 [2018-10-27 15:30:05,328 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,348 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-10-27 15:30:05,349 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 4 xjuncts. [2018-10-27 15:30:05,353 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,354 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,354 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,355 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,366 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,385 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-10-27 15:30:05,387 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-10-27 15:30:05,390 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,390 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,391 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,392 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,397 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,418 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-10-27 15:30:05,420 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-10-27 15:30:05,425 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,443 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-10-27 15:30:05,444 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-10-27 15:30:05,448 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,449 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,450 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,450 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,456 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,474 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-10-27 15:30:05,476 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-10-27 15:30:05,479 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,480 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,480 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,481 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,486 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,667 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-10-27 15:30:05,669 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-10-27 15:30:05,683 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,685 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,685 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,687 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,691 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:05,709 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-10-27 15:30:05,712 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-10-27 15:30:05,821 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 15:30:05,848 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 15:30:05,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 15:30:05,882 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 6 variables, input treesize:64, output treesize:44 [2018-10-27 15:30:05,932 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 2 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:30:05,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:30:05,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 16] total 39 [2018-10-27 15:30:05,954 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:30:05,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-27 15:30:05,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-27 15:30:05,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=1338, Unknown=0, NotChecked=0, Total=1482 [2018-10-27 15:30:05,955 INFO L87 Difference]: Start difference. First operand 217 states and 259 transitions. Second operand 32 states. [2018-10-27 15:30:07,648 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2018-10-27 15:30:08,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:30:08,254 INFO L93 Difference]: Finished difference Result 299 states and 352 transitions. [2018-10-27 15:30:08,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-27 15:30:08,254 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 48 [2018-10-27 15:30:08,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:30:08,257 INFO L225 Difference]: With dead ends: 299 [2018-10-27 15:30:08,257 INFO L226 Difference]: Without dead ends: 297 [2018-10-27 15:30:08,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 70 SyntacticMatches, 11 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=411, Invalid=2895, Unknown=0, NotChecked=0, Total=3306 [2018-10-27 15:30:08,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-10-27 15:30:08,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 227. [2018-10-27 15:30:08,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-27 15:30:08,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 269 transitions. [2018-10-27 15:30:08,316 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 269 transitions. Word has length 48 [2018-10-27 15:30:08,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:30:08,316 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 269 transitions. [2018-10-27 15:30:08,316 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-27 15:30:08,316 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 269 transitions. [2018-10-27 15:30:08,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-27 15:30:08,317 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:30:08,317 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:30:08,318 INFO L424 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:30:08,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:30:08,318 INFO L82 PathProgramCache]: Analyzing trace with hash -740834584, now seen corresponding path program 1 times [2018-10-27 15:30:08,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:30:08,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:30:08,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:30:08,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:30:08,319 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:30:08,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:30:08,650 WARN L179 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 8 [2018-10-27 15:30:09,373 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 2 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:30:09,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:30:09,373 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:30:09,373 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 52 with the following transitions: [2018-10-27 15:30:09,373 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [29], [31], [34], [36], [38], [42], [44], [48], [52], [57], [67], [70], [72], [78], [79], [80], [82] [2018-10-27 15:30:09,375 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 15:30:09,375 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 15:30:09,379 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 15:30:09,486 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 15:30:09,486 INFO L272 AbstractInterpreter]: Visited 26 different actions 136 times. Merged at 16 different actions 80 times. Widened at 4 different actions 5 times. Found 11 fixpoints after 4 different actions. Largest state had 39 variables. [2018-10-27 15:30:09,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:30:09,514 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 15:30:09,514 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:30:09,514 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:30:09,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:30:09,530 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:30:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:30:09,580 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:30:09,960 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-10-27 15:30:09,963 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:09,965 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-10-27 15:30:09,966 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:09,972 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:09,982 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-10-27 15:30:09,983 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:27 [2018-10-27 15:30:10,132 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-10-27 15:30:10,136 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:10,137 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:10,138 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:10,145 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-10-27 15:30:10,145 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:10,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:10,175 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 15:30:10,175 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:49, output treesize:27 [2018-10-27 15:30:10,242 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-10-27 15:30:10,246 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:10,246 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:10,247 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:10,248 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:10,255 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-10-27 15:30:10,256 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:10,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:10,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:10,270 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:43, output treesize:3 [2018-10-27 15:30:10,292 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 8 proven. 49 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 15:30:10,292 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:30:10,647 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 49 treesize of output 43 [2018-10-27 15:30:10,650 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:10,652 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 43 treesize of output 50 [2018-10-27 15:30:10,727 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 15:30:10,727 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:10,730 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:10,731 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:10,734 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:10,735 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:10,735 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:10,756 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 83 [2018-10-27 15:30:10,758 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 4 xjuncts. [2018-10-27 15:30:10,761 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:10,762 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:10,765 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:10,776 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:10,777 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:10,796 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 2 case distinctions, treesize of input 40 treesize of output 81 [2018-10-27 15:30:10,798 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-10-27 15:30:10,800 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 15:30:10,801 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:10,803 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 15:30:10,803 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:10,806 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:10,807 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:10,811 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:10,811 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:10,812 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:10,834 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 42 treesize of output 81 [2018-10-27 15:30:10,836 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-10-27 15:30:10,839 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:10,840 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:10,842 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:10,843 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:10,844 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:10,866 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-10-27 15:30:10,868 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-10-27 15:30:10,919 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:10,921 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:10,929 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 1 xjuncts. [2018-10-27 15:30:10,930 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 7 variables, input treesize:62, output treesize:13 [2018-10-27 15:30:11,128 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 5 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:30:11,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:30:11,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 17] total 39 [2018-10-27 15:30:11,149 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:30:11,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-27 15:30:11,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-27 15:30:11,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=1314, Unknown=0, NotChecked=0, Total=1482 [2018-10-27 15:30:11,151 INFO L87 Difference]: Start difference. First operand 227 states and 269 transitions. Second operand 29 states. [2018-10-27 15:30:15,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:30:15,498 INFO L93 Difference]: Finished difference Result 433 states and 514 transitions. [2018-10-27 15:30:15,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-27 15:30:15,499 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 51 [2018-10-27 15:30:15,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:30:15,504 INFO L225 Difference]: With dead ends: 433 [2018-10-27 15:30:15,505 INFO L226 Difference]: Without dead ends: 344 [2018-10-27 15:30:15,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 76 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1597 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=920, Invalid=5400, Unknown=0, NotChecked=0, Total=6320 [2018-10-27 15:30:15,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-10-27 15:30:15,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 176. [2018-10-27 15:30:15,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-27 15:30:15,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 201 transitions. [2018-10-27 15:30:15,559 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 201 transitions. Word has length 51 [2018-10-27 15:30:15,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:30:15,560 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 201 transitions. [2018-10-27 15:30:15,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-27 15:30:15,560 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 201 transitions. [2018-10-27 15:30:15,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-27 15:30:15,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:30:15,561 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 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] [2018-10-27 15:30:15,561 INFO L424 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:30:15,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:30:15,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2124575766, now seen corresponding path program 1 times [2018-10-27 15:30:15,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:30:15,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:30:15,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:30:15,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:30:15,562 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:30:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:30:16,176 WARN L179 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 10 [2018-10-27 15:30:17,426 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 5 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:30:17,426 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:30:17,426 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:30:17,426 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 53 with the following transitions: [2018-10-27 15:30:17,427 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [18], [20], [23], [25], [29], [31], [34], [38], [42], [44], [48], [52], [57], [59], [61], [67], [70], [72], [75], [77], [78], [79], [80], [82], [83] [2018-10-27 15:30:17,428 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 15:30:17,428 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 15:30:17,431 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 15:30:17,588 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 15:30:17,588 INFO L272 AbstractInterpreter]: Visited 31 different actions 218 times. Merged at 19 different actions 117 times. Widened at 5 different actions 10 times. Found 25 fixpoints after 9 different actions. Largest state had 40 variables. [2018-10-27 15:30:17,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:30:17,627 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 15:30:17,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:30:17,627 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 15:30:17,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:30:17,642 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:30:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:30:17,689 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:30:19,006 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-10-27 15:30:19,011 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:19,014 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-10-27 15:30:19,014 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:19,022 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:19,036 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-10-27 15:30:19,036 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:39, output treesize:32 [2018-10-27 15:30:19,209 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 43 treesize of output 34 [2018-10-27 15:30:19,211 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:19,212 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:19,213 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:19,214 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:19,222 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 80 [2018-10-27 15:30:19,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:19,234 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:19,248 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-10-27 15:30:19,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:49, output treesize:45 [2018-10-27 15:30:19,422 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 66 treesize of output 53 [2018-10-27 15:30:19,427 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:19,428 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:19,434 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:19,435 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:19,440 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:19,442 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:19,489 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 154 [2018-10-27 15:30:19,491 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-10-27 15:30:19,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:30:19,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-10-27 15:30:19,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:78, output treesize:114 [2018-10-27 15:30:20,090 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 55 treesize of output 44 [2018-10-27 15:30:20,095 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:20,096 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:20,097 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:20,098 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:20,098 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:20,099 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:20,113 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 104 [2018-10-27 15:30:20,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:20,132 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:20,145 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-10-27 15:30:20,146 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:27 [2018-10-27 15:30:20,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 51 [2018-10-27 15:30:20,651 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:20,651 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:20,655 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 0 case distinctions, treesize of input 47 treesize of output 46 [2018-10-27 15:30:20,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:20,685 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:20,687 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 22 treesize of output 22 [2018-10-27 15:30:20,687 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:20,711 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:20,713 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:20,717 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:20,761 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 102 [2018-10-27 15:30:20,767 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 16 xjuncts. [2018-10-27 15:30:20,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:20,839 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:20,839 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:71, output treesize:3 [2018-10-27 15:30:20,939 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:30:20,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:30:22,379 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 137 treesize of output 127 [2018-10-27 15:30:22,418 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:22,443 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 119 treesize of output 136 [2018-10-27 15:30:22,544 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:22,549 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:22,549 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:22,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 9 case distinctions, treesize of input 107 treesize of output 171 [2018-10-27 15:30:22,619 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:22,621 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:22,624 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:22,624 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:22,628 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:22,629 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:22,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 6 case distinctions, treesize of input 142 treesize of output 220 [2018-10-27 15:30:23,076 WARN L179 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 109 [2018-10-27 15:30:23,080 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 15:30:23,081 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:23,084 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:23,085 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,085 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,086 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,086 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,087 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,088 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:23,089 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,090 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,091 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,097 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,102 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 140 [2018-10-27 15:30:23,103 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:23,106 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 15:30:23,106 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:23,110 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:23,110 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,110 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,111 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,111 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,112 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,113 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:23,114 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,115 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,116 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,122 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 140 [2018-10-27 15:30:23,128 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:23,131 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 15:30:23,131 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:23,135 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:23,136 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,136 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,136 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,137 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,137 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,138 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:23,138 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,139 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,139 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,146 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,151 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 140 [2018-10-27 15:30:23,152 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:23,155 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:23,156 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,156 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,157 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,158 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,158 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,160 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:23,160 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,161 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,162 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,168 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 8 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 140 [2018-10-27 15:30:23,174 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:23,411 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:23,412 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,415 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,416 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,416 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,420 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,424 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,424 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,425 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,426 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,426 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,435 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,455 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 12 disjoint index pairs (out of 21 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 84 treesize of output 231 [2018-10-27 15:30:23,500 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 20 xjuncts. [2018-10-27 15:30:23,779 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:23,780 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,780 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,781 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,782 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,783 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:23,784 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,785 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,786 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:23,791 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,796 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:23,797 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 5 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 126 [2018-10-27 15:30:23,798 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-10-27 15:30:23,904 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 15:30:24,080 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:24,090 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:24,104 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:24,104 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:24,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 4 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 15 case distinctions, treesize of input 105 treesize of output 270 [2018-10-27 15:30:24,283 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 Received shutdown request... [2018-10-27 15:31:30,194 WARN L187 SmtUtils]: Removed 63 from assertion stack [2018-10-27 15:31:30,195 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-27 15:31:30,395 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:31:30,396 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-27 15:31:30,401 WARN L205 ceAbstractionStarter]: Timeout [2018-10-27 15:31:30,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 03:31:30 BoogieIcfgContainer [2018-10-27 15:31:30,402 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 15:31:30,402 INFO L168 Benchmark]: Toolchain (without parser) took 259086.68 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 780.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -763.5 MB). Peak memory consumption was 686.3 MB. Max. memory is 7.1 GB. [2018-10-27 15:31:30,403 INFO L168 Benchmark]: CDTParser took 0.53 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-10-27 15:31:30,403 INFO L168 Benchmark]: CACSL2BoogieTranslator took 306.04 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-10-27 15:31:30,403 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.10 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 15:31:30,404 INFO L168 Benchmark]: Boogie Preprocessor took 31.12 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-27 15:31:30,404 INFO L168 Benchmark]: RCFGBuilder took 704.82 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -786.5 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2018-10-27 15:31:30,404 INFO L168 Benchmark]: TraceAbstraction took 257992.25 ms. Allocated memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 35.1 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 12.4 MB). Peak memory consumption was 717.3 MB. Max. memory is 7.1 GB. [2018-10-27 15:31:30,406 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.53 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 306.04 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 47.10 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 31.12 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 704.82 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 745.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -786.5 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 257992.25 ms. Allocated memory was 2.3 GB in the beginning and 2.3 GB in the end (delta: 35.1 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 12.4 MB). Peak memory consumption was 717.3 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 53 with TraceHistMax 4,while TraceCheckSpWp was constructing backward predicates,while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations,while SimplifyDDAWithTimeout was simplifying term of DAG size 6639. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 33 locations, 1 error locations. TIMEOUT Result, 257.9s OverallTime, 20 OverallIterations, 5 TraceHistogramMax, 41.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 718 SDtfs, 2643 SDslu, 6165 SDs, 0 SdLazy, 8197 SolverSat, 1735 SolverUnsat, 6 SolverUnknown, 0 SolverNotchecked, 23.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1843 GetRequests, 896 SyntacticMatches, 80 SemanticMatches, 867 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 15792 ImplicationChecksByTransitivity, 116.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=227occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.1s AbstIntTime, 8 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 19 MinimizatonAttempts, 1140 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 136.6s InterpolantComputationTime, 1316 NumberOfCodeBlocks, 1302 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 1897 ConstructedInterpolants, 360 QuantifiedInterpolants, 1230864 SizeOfPredicates, 480 NumberOfNonLiveVariables, 2957 ConjunctsInSsa, 787 ConjunctsInUnsatCore, 51 InterpolantComputations, 3 PerfectInterpolantSequences, 228/1223 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown