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/invert_string_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1dbac8b [2018-10-27 15:28:48,649 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 15:28:48,651 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 15:28:48,666 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 15:28:48,666 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 15:28:48,667 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 15:28:48,668 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 15:28:48,670 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 15:28:48,672 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 15:28:48,673 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 15:28:48,674 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 15:28:48,674 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 15:28:48,675 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 15:28:48,676 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 15:28:48,677 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 15:28:48,678 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 15:28:48,679 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 15:28:48,681 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 15:28:48,683 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 15:28:48,685 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 15:28:48,686 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 15:28:48,687 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 15:28:48,690 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 15:28:48,690 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 15:28:48,690 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 15:28:48,691 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 15:28:48,692 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 15:28:48,693 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 15:28:48,694 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 15:28:48,696 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 15:28:48,696 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 15:28:48,697 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 15:28:48,697 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 15:28:48,697 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 15:28:48,699 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 15:28:48,699 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 15:28:48,700 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:28:48,726 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 15:28:48,726 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 15:28:48,727 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-10-27 15:28:48,727 INFO L133 SettingsManager]: * User list type=DISABLED [2018-10-27 15:28:48,728 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-10-27 15:28:48,728 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-27 15:28:48,728 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-10-27 15:28:48,728 INFO L133 SettingsManager]: * Octagon Domain=false [2018-10-27 15:28:48,728 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-10-27 15:28:48,729 INFO L133 SettingsManager]: * Log string format=TERM [2018-10-27 15:28:48,729 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-10-27 15:28:48,729 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-27 15:28:48,730 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 15:28:48,730 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 15:28:48,730 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 15:28:48,730 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-10-27 15:28:48,730 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-27 15:28:48,731 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-10-27 15:28:48,731 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 15:28:48,731 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-10-27 15:28:48,731 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 15:28:48,732 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 15:28:48,732 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-27 15:28:48,732 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-27 15:28:48,732 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-27 15:28:48,732 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 15:28:48,733 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-27 15:28:48,733 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-10-27 15:28:48,733 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-10-27 15:28:48,733 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-27 15:28:48,733 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-27 15:28:48,733 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-10-27 15:28:48,734 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-10-27 15:28:48,734 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-27 15:28:48,782 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 15:28:48,801 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 15:28:48,805 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 15:28:48,807 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 15:28:48,807 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 15:28:48,808 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/../../../trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i [2018-10-27 15:28:48,875 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6b2d8fff3/4564f666395b488589c8209bf6fc1497/FLAG20ac0edeb [2018-10-27 15:28:49,309 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 15:28:49,310 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i [2018-10-27 15:28:49,316 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6b2d8fff3/4564f666395b488589c8209bf6fc1497/FLAG20ac0edeb [2018-10-27 15:28:49,335 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UTaipan-linux/data/6b2d8fff3/4564f666395b488589c8209bf6fc1497 [2018-10-27 15:28:49,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 15:28:49,350 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-27 15:28:49,351 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 15:28:49,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 15:28:49,357 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 15:28:49,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 03:28:49" (1/1) ... [2018-10-27 15:28:49,362 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ccbb6d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:28:49, skipping insertion in model container [2018-10-27 15:28:49,362 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 03:28:49" (1/1) ... [2018-10-27 15:28:49,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 15:28:49,393 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 15:28:49,626 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 15:28:49,631 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 15:28:49,657 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 15:28:49,678 INFO L193 MainTranslator]: Completed translation [2018-10-27 15:28:49,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:28:49 WrapperNode [2018-10-27 15:28:49,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 15:28:49,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 15:28:49,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 15:28:49,680 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 15:28:49,690 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:28:49" (1/1) ... [2018-10-27 15:28:49,700 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:28:49" (1/1) ... [2018-10-27 15:28:49,725 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 15:28:49,725 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 15:28:49,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 15:28:49,726 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 15:28:49,735 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:28:49" (1/1) ... [2018-10-27 15:28:49,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:28:49" (1/1) ... [2018-10-27 15:28:49,738 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:28:49" (1/1) ... [2018-10-27 15:28:49,738 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:28:49" (1/1) ... [2018-10-27 15:28:49,744 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:28:49" (1/1) ... [2018-10-27 15:28:49,750 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:28:49" (1/1) ... [2018-10-27 15:28:49,752 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:28:49" (1/1) ... [2018-10-27 15:28:49,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 15:28:49,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 15:28:49,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 15:28:49,757 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 15:28:49,758 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:28:49" (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:28:49,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-10-27 15:28:49,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-10-27 15:28:49,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 15:28:49,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 15:28:49,890 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-10-27 15:28:49,890 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-10-27 15:28:49,891 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-10-27 15:28:49,891 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-10-27 15:28:50,376 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 15:28:50,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 03:28:50 BoogieIcfgContainer [2018-10-27 15:28:50,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 15:28:50,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-27 15:28:50,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-27 15:28:50,382 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-27 15:28:50,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.10 03:28:49" (1/3) ... [2018-10-27 15:28:50,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3006638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 03:28:50, skipping insertion in model container [2018-10-27 15:28:50,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 03:28:49" (2/3) ... [2018-10-27 15:28:50,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3006638 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.10 03:28:50, skipping insertion in model container [2018-10-27 15:28:50,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 03:28:50" (3/3) ... [2018-10-27 15:28:50,386 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string_true-unreach-call_true-termination.i [2018-10-27 15:28:50,396 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-27 15:28:50,405 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-27 15:28:50,423 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-27 15:28:50,454 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-27 15:28:50,455 INFO L383 AbstractCegarLoop]: Hoare is true [2018-10-27 15:28:50,455 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-27 15:28:50,455 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 15:28:50,455 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 15:28:50,455 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-27 15:28:50,456 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 15:28:50,456 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-27 15:28:50,482 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-10-27 15:28:50,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-27 15:28:50,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:28:50,491 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:28:50,493 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:28:50,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:50,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1989464865, now seen corresponding path program 1 times [2018-10-27 15:28:50,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:28:50,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:50,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:28:50,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:50,550 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:28:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:50,648 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:28:50,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:28:50,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 15:28:50,651 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:28:50,657 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-10-27 15:28:50,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-10-27 15:28:50,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-10-27 15:28:50,674 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-10-27 15:28:50,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:28:50,697 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-10-27 15:28:50,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-10-27 15:28:50,699 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-10-27 15:28:50,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:28:50,707 INFO L225 Difference]: With dead ends: 51 [2018-10-27 15:28:50,708 INFO L226 Difference]: Without dead ends: 25 [2018-10-27 15:28:50,711 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:28:50,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-27 15:28:50,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-10-27 15:28:50,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-27 15:28:50,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-10-27 15:28:50,756 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-10-27 15:28:50,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:28:50,757 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-10-27 15:28:50,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-10-27 15:28:50,757 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-10-27 15:28:50,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-27 15:28:50,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:28:50,759 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:28:50,759 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:28:50,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:50,760 INFO L82 PathProgramCache]: Analyzing trace with hash 971272842, now seen corresponding path program 1 times [2018-10-27 15:28:50,760 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:28:50,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:50,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:28:50,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:50,762 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:28:50,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:51,188 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 9 [2018-10-27 15:28:51,206 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:28:51,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 15:28:51,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 15:28:51,209 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:28:51,211 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-27 15:28:51,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 15:28:51,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-10-27 15:28:51,215 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 4 states. [2018-10-27 15:28:51,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:28:51,448 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-10-27 15:28:51,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 15:28:51,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-10-27 15:28:51,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:28:51,450 INFO L225 Difference]: With dead ends: 40 [2018-10-27 15:28:51,450 INFO L226 Difference]: Without dead ends: 28 [2018-10-27 15:28:51,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-27 15:28:51,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-27 15:28:51,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-10-27 15:28:51,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-27 15:28:51,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-10-27 15:28:51,460 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2018-10-27 15:28:51,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:28:51,460 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-10-27 15:28:51,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-27 15:28:51,460 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-10-27 15:28:51,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-10-27 15:28:51,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:28:51,461 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] [2018-10-27 15:28:51,462 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:28:51,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:51,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1585722772, now seen corresponding path program 1 times [2018-10-27 15:28:51,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:28:51,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:51,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:28:51,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:51,464 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:28:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:51,895 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 13 [2018-10-27 15:28:51,902 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:28:51,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:51,902 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:28:51,903 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-10-27 15:28:51,905 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [20], [24], [27], [29], [31], [35], [39], [44], [54], [57], [59], [65], [66], [67], [69] [2018-10-27 15:28:51,940 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 15:28:51,940 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 15:28:52,040 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 15:28:52,068 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-10-27 15:28:52,070 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Never found a fixpoint. Largest state had 36 variables. [2018-10-27 15:28:52,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:52,077 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-10-27 15:28:52,138 INFO L227 lantSequenceWeakener]: Weakened 6 states. On average, predicates are now at 86.11% of their original sizes. [2018-10-27 15:28:52,138 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-10-27 15:28:52,166 INFO L415 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-10-27 15:28:52,167 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-10-27 15:28:52,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-27 15:28:52,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-10-27 15:28:52,168 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-10-27 15:28:52,169 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-27 15:28:52,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 15:28:52,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 15:28:52,170 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 3 states. [2018-10-27 15:28:52,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:28:52,362 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-10-27 15:28:52,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 15:28:52,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-10-27 15:28:52,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:28:52,364 INFO L225 Difference]: With dead ends: 48 [2018-10-27 15:28:52,364 INFO L226 Difference]: Without dead ends: 30 [2018-10-27 15:28:52,365 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 20 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 15:28:52,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-27 15:28:52,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-10-27 15:28:52,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-27 15:28:52,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-10-27 15:28:52,372 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 21 [2018-10-27 15:28:52,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:28:52,373 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-10-27 15:28:52,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-27 15:28:52,373 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-10-27 15:28:52,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-27 15:28:52,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:28:52,374 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:28:52,374 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:28:52,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:52,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1045245671, now seen corresponding path program 1 times [2018-10-27 15:28:52,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:28:52,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:52,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:28:52,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:52,376 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:28:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:53,003 WARN L179 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2018-10-27 15:28:53,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 15:28:53,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:53,147 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:28:53,148 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-10-27 15:28:53,148 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [27], [29], [31], [35], [39], [44], [54], [57], [59], [65], [66], [67], [69] [2018-10-27 15:28:53,151 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 15:28:53,151 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 15:28:53,158 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 15:28:53,585 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 15:28:53,586 INFO L272 AbstractInterpreter]: Visited 22 different actions 108 times. Merged at 11 different actions 67 times. Widened at 2 different actions 8 times. Found 15 fixpoints after 5 different actions. Largest state had 38 variables. [2018-10-27 15:28:53,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:53,632 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 15:28:53,632 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:53,632 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) [2018-10-27 15:28:53,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:28:53,646 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:28:53,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:53,717 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:28:53,896 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-27 15:28:53,898 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:53,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:53,923 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-10-27 15:28:54,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 39 [2018-10-27 15:28:54,090 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 14 treesize of output 13 [2018-10-27 15:28:54,091 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:54,207 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:54,214 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 15:28:54,214 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:54,268 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:54,269 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:87, output treesize:35 [2018-10-27 15:28:55,016 WARN L179 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 30 [2018-10-27 15:28:55,059 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 36 treesize of output 32 [2018-10-27 15:28:55,065 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:55,066 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-10-27 15:28:55,067 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:55,094 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:55,095 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 15:28:55,096 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:55,102 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:55,121 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:28:55,121 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:54, output treesize:3 [2018-10-27 15:28:55,228 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 15:28:55,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:28:55,798 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2018-10-27 15:28:55,809 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 45 treesize of output 47 [2018-10-27 15:28:55,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 42 treesize of output 38 [2018-10-27 15:28:55,907 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:55,987 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 39 treesize of output 38 [2018-10-27 15:28:55,989 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:56,048 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:28:56,108 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 44 treesize of output 46 [2018-10-27 15:28:56,221 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 32 [2018-10-27 15:28:56,228 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 36 treesize of output 35 [2018-10-27 15:28:56,229 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:56,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-10-27 15:28:56,298 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:56,398 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:28:56,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 15:28:56,472 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:120, output treesize:95 [2018-10-27 15:28:56,603 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 15:28:56,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:28:56,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 10] total 22 [2018-10-27 15:28:56,625 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:28:56,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-27 15:28:56,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-27 15:28:56,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=392, Unknown=0, NotChecked=0, Total=462 [2018-10-27 15:28:56,629 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 15 states. [2018-10-27 15:28:57,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:28:57,526 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-10-27 15:28:57,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-27 15:28:57,527 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 24 [2018-10-27 15:28:57,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:28:57,528 INFO L225 Difference]: With dead ends: 45 [2018-10-27 15:28:57,528 INFO L226 Difference]: Without dead ends: 33 [2018-10-27 15:28:57,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2018-10-27 15:28:57,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-27 15:28:57,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-10-27 15:28:57,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-27 15:28:57,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-10-27 15:28:57,536 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 24 [2018-10-27 15:28:57,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:28:57,537 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-10-27 15:28:57,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-27 15:28:57,537 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-10-27 15:28:57,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-10-27 15:28:57,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:28:57,538 INFO L375 BasicCegarLoop]: trace histogram [3, 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:28:57,539 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:28:57,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:57,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1179396881, now seen corresponding path program 2 times [2018-10-27 15:28:57,539 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:28:57,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:57,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:28:57,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:57,541 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:28:57,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:57,889 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-27 15:28:57,889 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:57,889 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:28:57,889 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:28:57,889 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:57,890 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:57,890 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:28:57,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 15:28:57,898 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 15:28:57,936 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-10-27 15:28:57,937 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:28:57,940 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:28:58,004 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 15:28:58,004 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:28:58,068 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 15:28:58,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:28:58,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 6] total 12 [2018-10-27 15:28:58,089 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:28:58,090 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 15:28:58,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 15:28:58,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2018-10-27 15:28:58,090 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 8 states. [2018-10-27 15:28:58,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:28:58,447 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-10-27 15:28:58,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-27 15:28:58,448 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2018-10-27 15:28:58,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:28:58,451 INFO L225 Difference]: With dead ends: 79 [2018-10-27 15:28:58,452 INFO L226 Difference]: Without dead ends: 58 [2018-10-27 15:28:58,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-10-27 15:28:58,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-27 15:28:58,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 38. [2018-10-27 15:28:58,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-27 15:28:58,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-10-27 15:28:58,465 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 27 [2018-10-27 15:28:58,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:28:58,466 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-10-27 15:28:58,466 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 15:28:58,466 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-10-27 15:28:58,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-10-27 15:28:58,467 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:28:58,467 INFO L375 BasicCegarLoop]: trace histogram [4, 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:28:58,468 INFO L424 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:28:58,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:28:58,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1439664076, now seen corresponding path program 3 times [2018-10-27 15:28:58,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:28:58,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:58,469 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:28:58,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:28:58,469 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:28:58,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:28:58,768 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 15:28:58,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:58,769 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:28:58,769 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:28:58,769 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:58,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:28:58,770 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:28:58,787 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 15:28:58,788 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 15:28:58,853 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 15:28:58,853 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:28:58,858 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:28:58,885 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-27 15:28:58,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:58,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:58,899 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-10-27 15:28:59,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-10-27 15:28:59,476 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 16 treesize of output 15 [2018-10-27 15:28:59,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:59,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:59,494 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 15:28:59,494 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:59,510 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:59,511 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2018-10-27 15:28:59,865 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 40 treesize of output 36 [2018-10-27 15:28:59,868 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:59,869 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-10-27 15:28:59,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:59,883 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:28:59,884 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 15:28:59,884 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:28:59,888 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:28:59,916 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:28:59,917 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2018-10-27 15:29:00,010 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-27 15:29:00,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:29:00,404 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 45 treesize of output 47 [2018-10-27 15:29:00,522 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2018-10-27 15:29:00,526 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 42 treesize of output 38 [2018-10-27 15:29:00,526 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:00,561 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 39 treesize of output 38 [2018-10-27 15:29:00,562 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:00,682 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:29:00,883 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 44 treesize of output 46 [2018-10-27 15:29:00,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-10-27 15:29:00,962 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:01,045 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 36 treesize of output 35 [2018-10-27 15:29:01,046 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:01,214 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:29:01,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 15:29:01,277 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:120, output treesize:95 [2018-10-27 15:29:01,710 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-10-27 15:29:01,946 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 15:29:01,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:29:01,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 16, 14] total 32 [2018-10-27 15:29:01,976 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:29:01,976 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-27 15:29:01,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-27 15:29:01,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2018-10-27 15:29:01,977 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 21 states. [2018-10-27 15:29:03,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:29:03,765 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2018-10-27 15:29:03,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-27 15:29:03,771 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 33 [2018-10-27 15:29:03,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:29:03,772 INFO L225 Difference]: With dead ends: 73 [2018-10-27 15:29:03,772 INFO L226 Difference]: Without dead ends: 61 [2018-10-27 15:29:03,773 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=311, Invalid=1581, Unknown=0, NotChecked=0, Total=1892 [2018-10-27 15:29:03,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-27 15:29:03,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 41. [2018-10-27 15:29:03,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-27 15:29:03,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-10-27 15:29:03,780 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 33 [2018-10-27 15:29:03,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:29:03,780 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-10-27 15:29:03,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-27 15:29:03,781 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-10-27 15:29:03,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-27 15:29:03,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:29:03,782 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:29:03,782 INFO L424 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:29:03,782 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:29:03,783 INFO L82 PathProgramCache]: Analyzing trace with hash -2091215382, now seen corresponding path program 4 times [2018-10-27 15:29:03,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:29:03,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:03,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:29:03,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:03,784 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:29:03,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:04,049 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 15:29:04,049 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:04,050 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:29:04,050 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:29:04,050 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:04,050 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:04,050 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:29:04,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:29:04,057 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:29:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:04,106 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:29:04,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-27 15:29:04,212 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:04,261 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:04,262 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-10-27 15:29:04,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-10-27 15:29:04,967 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 16 treesize of output 15 [2018-10-27 15:29:04,968 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:04,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:04,981 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 15:29:04,981 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:04,995 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:04,996 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2018-10-27 15:29:05,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 40 treesize of output 36 [2018-10-27 15:29:05,416 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:05,417 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-10-27 15:29:05,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:05,428 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:05,429 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 15:29:05,430 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:05,437 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:05,448 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:05,448 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2018-10-27 15:29:05,506 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 15:29:05,506 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:29:05,805 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 45 treesize of output 47 [2018-10-27 15:29:05,887 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 39 treesize of output 38 [2018-10-27 15:29:05,888 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:05,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 42 treesize of output 38 [2018-10-27 15:29:05,928 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:05,989 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:29:06,044 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 46 treesize of output 48 [2018-10-27 15:29:06,131 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 42 treesize of output 41 [2018-10-27 15:29:06,132 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:06,176 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 45 treesize of output 33 [2018-10-27 15:29:06,177 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:06,242 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:29:06,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 15:29:06,306 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:118, output treesize:95 [2018-10-27 15:29:06,753 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-10-27 15:29:06,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:29:06,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 17, 16] total 36 [2018-10-27 15:29:06,776 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:29:06,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-27 15:29:06,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-27 15:29:06,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=1100, Unknown=0, NotChecked=0, Total=1260 [2018-10-27 15:29:06,777 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 23 states. [2018-10-27 15:29:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:29:08,791 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2018-10-27 15:29:08,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-27 15:29:08,792 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 36 [2018-10-27 15:29:08,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:29:08,794 INFO L225 Difference]: With dead ends: 75 [2018-10-27 15:29:08,794 INFO L226 Difference]: Without dead ends: 63 [2018-10-27 15:29:08,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=394, Invalid=2056, Unknown=0, NotChecked=0, Total=2450 [2018-10-27 15:29:08,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-27 15:29:08,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 44. [2018-10-27 15:29:08,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-27 15:29:08,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-10-27 15:29:08,805 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 36 [2018-10-27 15:29:08,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:29:08,806 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-10-27 15:29:08,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-27 15:29:08,806 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-10-27 15:29:08,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-27 15:29:08,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:29:08,807 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:29:08,807 INFO L424 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:29:08,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:29:08,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1817864972, now seen corresponding path program 5 times [2018-10-27 15:29:08,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:29:08,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:08,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:29:08,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:08,809 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:29:08,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-27 15:29:09,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:09,043 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:29:09,044 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:29:09,044 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:09,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:09,044 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:29:09,052 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 15:29:09,052 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 15:29:09,093 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-10-27 15:29:09,093 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:29:09,096 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:29:09,249 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-27 15:29:09,250 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:29:09,293 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-27 15:29:09,315 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:29:09,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-10-27 15:29:09,315 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:29:09,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-27 15:29:09,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-27 15:29:09,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-27 15:29:09,316 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 8 states. [2018-10-27 15:29:09,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:29:09,382 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-10-27 15:29:09,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-27 15:29:09,382 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-10-27 15:29:09,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:29:09,383 INFO L225 Difference]: With dead ends: 78 [2018-10-27 15:29:09,384 INFO L226 Difference]: Without dead ends: 48 [2018-10-27 15:29:09,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-10-27 15:29:09,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-27 15:29:09,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-10-27 15:29:09,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-27 15:29:09,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-10-27 15:29:09,392 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 39 [2018-10-27 15:29:09,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:29:09,392 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-10-27 15:29:09,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-27 15:29:09,393 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-10-27 15:29:09,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-27 15:29:09,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:29:09,394 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:29:09,394 INFO L424 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:29:09,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:29:09,395 INFO L82 PathProgramCache]: Analyzing trace with hash 905430727, now seen corresponding path program 6 times [2018-10-27 15:29:09,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:29:09,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:09,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:29:09,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:09,396 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:29:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:09,737 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-27 15:29:09,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:09,738 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:29:09,738 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:29:09,738 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:09,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:09,738 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:29:09,746 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 15:29:09,747 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 15:29:09,794 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 15:29:09,795 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:29:09,800 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:29:09,859 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-27 15:29:09,860 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:09,867 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:09,868 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-10-27 15:29:10,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-10-27 15:29:10,410 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 16 treesize of output 15 [2018-10-27 15:29:10,411 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:10,427 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:10,430 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 15:29:10,430 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:10,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:10,443 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2018-10-27 15:29:10,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 40 treesize of output 36 [2018-10-27 15:29:10,698 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:10,699 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-10-27 15:29:10,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:10,711 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:10,713 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 15:29:10,713 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:10,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:10,731 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:10,732 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2018-10-27 15:29:10,793 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 15:29:10,794 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:29:11,120 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 45 treesize of output 47 [2018-10-27 15:29:11,240 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2018-10-27 15:29:11,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 42 treesize of output 38 [2018-10-27 15:29:11,244 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:11,374 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 39 treesize of output 38 [2018-10-27 15:29:11,375 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:11,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:29:11,465 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 44 treesize of output 46 [2018-10-27 15:29:11,546 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 [2018-10-27 15:29:11,546 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:11,608 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 40 treesize of output 39 [2018-10-27 15:29:11,609 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:11,642 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:29:11,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 15:29:11,704 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:118, output treesize:95 [2018-10-27 15:29:12,555 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-10-27 15:29:12,576 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:29:12,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 20, 18] total 40 [2018-10-27 15:29:12,576 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:29:12,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-27 15:29:12,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-27 15:29:12,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1372, Unknown=0, NotChecked=0, Total=1560 [2018-10-27 15:29:12,578 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 25 states. [2018-10-27 15:29:13,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:29:13,802 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2018-10-27 15:29:13,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-27 15:29:13,803 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 42 [2018-10-27 15:29:13,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:29:13,804 INFO L225 Difference]: With dead ends: 104 [2018-10-27 15:29:13,804 INFO L226 Difference]: Without dead ends: 74 [2018-10-27 15:29:13,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=321, Invalid=2031, Unknown=0, NotChecked=0, Total=2352 [2018-10-27 15:29:13,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-27 15:29:13,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 61. [2018-10-27 15:29:13,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-27 15:29:13,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-10-27 15:29:13,821 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 42 [2018-10-27 15:29:13,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:29:13,821 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-10-27 15:29:13,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-27 15:29:13,822 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-10-27 15:29:13,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-27 15:29:13,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:29:13,823 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:29:13,823 INFO L424 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:29:13,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:29:13,823 INFO L82 PathProgramCache]: Analyzing trace with hash -907144054, now seen corresponding path program 7 times [2018-10-27 15:29:13,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:29:13,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:13,824 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:29:13,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:13,825 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:29:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:14,107 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-10-27 15:29:14,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:14,108 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:29:14,108 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:29:14,108 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:14,108 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:14,108 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:29:14,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:29:14,116 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:29:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:14,169 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:29:14,190 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-27 15:29:14,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:14,197 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:14,197 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-10-27 15:29:14,713 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 15:29:14,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:14,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-10-27 15:29: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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-10-27 15:29:14,802 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:14,971 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:15,045 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:15,045 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2018-10-27 15:29:15,397 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 40 treesize of output 36 [2018-10-27 15:29:15,400 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:15,401 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2018-10-27 15:29:15,401 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:15,411 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:15,412 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2018-10-27 15:29:15,413 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:15,417 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:15,427 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:15,428 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2018-10-27 15:29:15,493 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-27 15:29:15,493 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:29:15,835 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 43 treesize of output 45 [2018-10-27 15:29:15,919 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 40 treesize of output 38 [2018-10-27 15:29:15,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:15,988 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 37 treesize of output 36 [2018-10-27 15:29:15,989 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:16,019 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:29:16,073 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 44 treesize of output 46 [2018-10-27 15:29:16,160 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 36 treesize of output 35 [2018-10-27 15:29:16,161 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:16,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-10-27 15:29:16,200 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:16,803 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:29:16,871 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 15:29:16,871 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:120, output treesize:95 [2018-10-27 15:29:18,073 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-10-27 15:29:18,095 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:29:18,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 21, 20] total 44 [2018-10-27 15:29:18,095 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:29:18,096 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-27 15:29:18,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-27 15:29:18,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1676, Unknown=0, NotChecked=0, Total=1892 [2018-10-27 15:29:18,097 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 27 states. [2018-10-27 15:29:20,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:29:20,278 INFO L93 Difference]: Finished difference Result 124 states and 133 transitions. [2018-10-27 15:29:20,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-27 15:29:20,278 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 48 [2018-10-27 15:29:20,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:29:20,281 INFO L225 Difference]: With dead ends: 124 [2018-10-27 15:29:20,281 INFO L226 Difference]: Without dead ends: 83 [2018-10-27 15:29:20,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=354, Invalid=2508, Unknown=0, NotChecked=0, Total=2862 [2018-10-27 15:29:20,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-27 15:29:20,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 67. [2018-10-27 15:29:20,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-27 15:29:20,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-10-27 15:29:20,296 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 48 [2018-10-27 15:29:20,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:29:20,296 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-10-27 15:29:20,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-27 15:29:20,296 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-10-27 15:29:20,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-27 15:29:20,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:29:20,297 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:29:20,298 INFO L424 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:29:20,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:29:20,298 INFO L82 PathProgramCache]: Analyzing trace with hash -2053536857, now seen corresponding path program 8 times [2018-10-27 15:29:20,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:29:20,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:20,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:29:20,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:20,299 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:29:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:20,964 WARN L179 SmtUtils]: Spent 440.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 15 [2018-10-27 15:29:21,099 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 60 proven. 17 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-27 15:29:21,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:21,099 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:29:21,099 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:29:21,099 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:21,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:21,100 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:29:21,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 15:29:21,107 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 15:29:21,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-10-27 15:29:21,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:29:21,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:29:21,578 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-27 15:29:21,578 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:21,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:21,581 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-10-27 15:29:22,208 WARN L179 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-27 15:29:22,537 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 15:29:22,537 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:22,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-10-27 15:29:22,557 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 16 treesize of output 15 [2018-10-27 15:29:22,558 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:22,575 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:22,596 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:22,597 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2018-10-27 15:29:23,017 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 40 treesize of output 36 [2018-10-27 15:29:23,020 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:23,021 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2018-10-27 15:29:23,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:23,033 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:23,034 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 15:29:23,034 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:23,040 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:23,051 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:23,051 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2018-10-27 15:29:23,130 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-27 15:29:23,130 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:29:23,483 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 45 treesize of output 47 [2018-10-27 15:29:23,567 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 42 treesize of output 33 [2018-10-27 15:29:23,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:23,634 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 39 treesize of output 38 [2018-10-27 15:29:23,635 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:23,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:29:23,716 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 44 treesize of output 46 [2018-10-27 15:29:23,794 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 31 [2018-10-27 15:29:23,795 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:23,860 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 36 treesize of output 35 [2018-10-27 15:29:23,861 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:23,891 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:29:23,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 15:29:23,955 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:120, output treesize:95 [2018-10-27 15:29:25,231 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-27 15:29:25,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:29:25,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 23, 22] total 50 [2018-10-27 15:29:25,252 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:29:25,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-27 15:29:25,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-27 15:29:25,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=2143, Unknown=0, NotChecked=0, Total=2450 [2018-10-27 15:29:25,254 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 31 states. [2018-10-27 15:29:27,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:29:27,285 INFO L93 Difference]: Finished difference Result 103 states and 110 transitions. [2018-10-27 15:29:27,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-27 15:29:27,286 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 54 [2018-10-27 15:29:27,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:29:27,287 INFO L225 Difference]: With dead ends: 103 [2018-10-27 15:29:27,287 INFO L226 Difference]: Without dead ends: 77 [2018-10-27 15:29:27,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 938 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=652, Invalid=3638, Unknown=0, NotChecked=0, Total=4290 [2018-10-27 15:29:27,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-27 15:29:27,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 60. [2018-10-27 15:29:27,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-27 15:29:27,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-10-27 15:29:27,302 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 54 [2018-10-27 15:29:27,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:29:27,303 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-10-27 15:29:27,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-27 15:29:27,303 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-10-27 15:29:27,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-27 15:29:27,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:29:27,304 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 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:29:27,304 INFO L424 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:29:27,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:29:27,304 INFO L82 PathProgramCache]: Analyzing trace with hash 824594169, now seen corresponding path program 1 times [2018-10-27 15:29:27,305 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:29:27,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:27,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:29:27,306 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:29:27,306 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:29:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:27,764 WARN L179 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-27 15:29:28,149 WARN L179 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 19 [2018-10-27 15:29:29,175 WARN L179 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 38 [2018-10-27 15:29:29,423 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2018-10-27 15:29:29,568 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2018-10-27 15:29:29,943 WARN L179 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2018-10-27 15:29:30,175 WARN L179 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 61 [2018-10-27 15:29:30,615 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 37 [2018-10-27 15:29:31,013 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 10 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 15:29:31,013 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:31,013 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:29:31,013 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 58 with the following transitions: [2018-10-27 15:29:31,014 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [14], [16], [20], [24], [27], [29], [31], [35], [39], [44], [46], [48], [54], [57], [59], [62], [64], [65], [66], [67], [69], [70] [2018-10-27 15:29:31,016 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-10-27 15:29:31,016 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-10-27 15:29:31,021 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-10-27 15:29:31,262 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-10-27 15:29:31,262 INFO L272 AbstractInterpreter]: Visited 27 different actions 195 times. Merged at 14 different actions 104 times. Widened at 3 different actions 13 times. Found 17 fixpoints after 6 different actions. Largest state had 40 variables. [2018-10-27 15:29:31,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:29:31,300 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-10-27 15:29:31,300 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:29:31,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 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:29:31,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:29:31,316 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-10-27 15:29:31,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:29:31,372 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:29:31,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-27 15:29:31,388 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:31,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:31,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-10-27 15:29:31,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-10-27 15:29:31,940 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 16 treesize of output 15 [2018-10-27 15:29:31,940 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:31,952 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,989 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 43 [2018-10-27 15:29:31,993 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 16 treesize of output 15 [2018-10-27 15:29:31,993 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:32,005 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:32,120 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:29:32,121 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:93, output treesize:85 [2018-10-27 15:29:32,337 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 15:29:32,337 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:32,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-10-27 15:29:32,365 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:32,366 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 25 treesize of output 34 [2018-10-27 15:29:32,367 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:32,373 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:32,390 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:32,390 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:113, output treesize:43 [2018-10-27 15:29:35,244 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (main_~max~0 Int) (|v_main_~#str2~0.offset_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (let ((.cse0 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= .cse0 4) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|)) (<= .cse0 2147483647) (= (select (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|) (+ .cse0 (- 3))) (select (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|) (+ |v_main_~#str2~0.offset_BEFORE_CALL_1| 3))) (<= 4 .cse0)))) is different from true [2018-10-27 15:29:39,302 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 31 [2018-10-27 15:29:43,295 WARN L179 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 32 [2018-10-27 15:29:44,016 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 41 treesize of output 37 [2018-10-27 15:29:44,019 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:44,020 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2018-10-27 15:29:44,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:44,030 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:44,031 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 15:29:44,031 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:44,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:44,115 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:44,116 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:66, output treesize:3 [2018-10-27 15:29:46,202 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 40 trivial. 1 not checked. [2018-10-27 15:29:46,203 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:29:47,126 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-10-27 15:29:47,130 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-10-27 15:29:47,134 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-10-27 15:29:47,215 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:47,216 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:47,217 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:47,222 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 0 case distinctions, treesize of input 57 treesize of output 55 [2018-10-27 15:29:47,222 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:47,226 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:47,229 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 35 treesize of output 31 [2018-10-27 15:29:47,229 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:47,233 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:47,233 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:47,234 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:47,237 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 0 case distinctions, treesize of input 50 treesize of output 52 [2018-10-27 15:29:47,238 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:47,264 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:47,279 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:47,301 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:47,344 INFO L303 Elim1Store]: Index analysis took 105 ms [2018-10-27 15:29:47,345 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 48 [2018-10-27 15:29:47,345 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:47,348 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:47,352 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:47,361 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 40 treesize of output 59 [2018-10-27 15:29:47,362 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-10-27 15:29:47,365 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:47,365 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:47,367 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:47,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 54 [2018-10-27 15:29:47,372 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:47,408 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:29:47,436 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:29:47,444 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 105 treesize of output 99 [2018-10-27 15:29:47,454 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:47,457 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 0 case distinctions, treesize of input 91 treesize of output 84 [2018-10-27 15:29:47,577 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 40 [2018-10-27 15:29:47,581 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:47,584 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 35 treesize of output 31 [2018-10-27 15:29:47,584 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:47,587 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 0 case distinctions, treesize of input 43 treesize of output 46 [2018-10-27 15:29:47,588 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:47,592 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 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 44 [2018-10-27 15:29:47,592 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:47,596 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:47,597 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:47,597 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:47,598 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:47,605 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 0 case distinctions, treesize of input 47 treesize of output 70 [2018-10-27 15:29:47,605 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:47,608 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:47,609 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:47,612 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 0 case distinctions, treesize of input 41 treesize of output 60 [2018-10-27 15:29:47,612 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:47,616 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:47,617 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:47,619 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 0 case distinctions, treesize of input 53 treesize of output 63 [2018-10-27 15:29:47,620 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:47,695 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:47,734 INFO L267 ElimStorePlain]: Start of recursive call 10: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:47,741 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 54 treesize of output 48 [2018-10-27 15:29:47,744 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 31 treesize of output 35 [2018-10-27 15:29:47,768 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2018-10-27 15:29:47,768 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:47,770 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:47,771 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:47,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 29 treesize of output 27 [2018-10-27 15:29:47,772 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:47,785 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:29:47,814 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 20 treesize of output 16 [2018-10-27 15:29:47,815 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:47,830 INFO L267 ElimStorePlain]: Start of recursive call 18: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:29:47,952 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 64 [2018-10-27 15:29:47,955 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-10-27 15:29:48,034 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:48,035 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:48,045 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 40 treesize of output 59 [2018-10-27 15:29:48,046 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 2 xjuncts. [2018-10-27 15:29:48,048 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:48,049 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:48,051 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:48,052 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 0 case distinctions, treesize of input 41 treesize of output 48 [2018-10-27 15:29:48,052 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:48,057 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:48,057 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:48,059 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:48,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 3 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 52 [2018-10-27 15:29:48,061 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:48,074 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:48,075 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:48,080 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:48,082 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 0 case distinctions, treesize of input 57 treesize of output 55 [2018-10-27 15:29:48,083 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:48,088 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:48,091 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2018-10-27 15:29:48,091 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:48,097 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:48,098 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:29:48,110 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:48,112 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 0 case distinctions, treesize of input 43 treesize of output 54 [2018-10-27 15:29:48,113 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:48,163 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:29:48,195 INFO L267 ElimStorePlain]: Start of recursive call 23: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:29:48,198 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 54 treesize of output 48 [2018-10-27 15:29:48,234 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:29:48,235 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 31 treesize of output 32 [2018-10-27 15:29:48,235 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 15:29:48,279 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 23 treesize of output 27 [2018-10-27 15:29:48,300 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-10-27 15:29:48,300 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:48,305 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 10 [2018-10-27 15:29:48,305 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-10-27 15:29:48,324 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:29:48,356 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:29:48,478 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: 4 dim-0 vars, and 6 xjuncts. [2018-10-27 15:29:48,479 INFO L202 ElimStorePlain]: Needed 35 recursive calls to eliminate 6 variables, input treesize:147, output treesize:192 [2018-10-27 15:29:48,718 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2018-10-27 15:29:49,524 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-10-27 15:29:49,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:29:49,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 22] total 63 [2018-10-27 15:29:49,546 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:29:49,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-27 15:29:49,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-27 15:29:49,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=3340, Unknown=4, NotChecked=120, Total=3906 [2018-10-27 15:29:49,548 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 46 states. [2018-10-27 15:29:51,786 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 29 [2018-10-27 15:29:56,537 WARN L179 SmtUtils]: Spent 4.12 s on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-10-27 15:29:56,763 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 32 [2018-10-27 15:29:57,164 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 40 [2018-10-27 15:29:57,472 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 43 [2018-10-27 15:30:03,566 WARN L179 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2018-10-27 15:30:07,681 WARN L179 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-10-27 15:30:20,792 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 34 [2018-10-27 15:30:22,046 WARN L179 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 36 [2018-10-27 15:30:22,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:30:22,515 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-10-27 15:30:22,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-27 15:30:22,515 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 57 [2018-10-27 15:30:22,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:30:22,517 INFO L225 Difference]: With dead ends: 89 [2018-10-27 15:30:22,517 INFO L226 Difference]: Without dead ends: 87 [2018-10-27 15:30:22,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 76 SyntacticMatches, 4 SemanticMatches, 89 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 2018 ImplicationChecksByTransitivity, 40.0s TimeCoverageRelationStatistics Valid=1066, Invalid=6942, Unknown=6, NotChecked=176, Total=8190 [2018-10-27 15:30:22,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-27 15:30:22,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 69. [2018-10-27 15:30:22,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-27 15:30:22,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-10-27 15:30:22,535 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 57 [2018-10-27 15:30:22,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:30:22,536 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-10-27 15:30:22,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-27 15:30:22,536 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-10-27 15:30:22,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-27 15:30:22,537 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:30:22,537 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:30:22,538 INFO L424 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:30:22,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:30:22,538 INFO L82 PathProgramCache]: Analyzing trace with hash -925373209, now seen corresponding path program 2 times [2018-10-27 15:30:22,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:30:22,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:30:22,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 15:30:22,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:30:22,539 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:30:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:30:22,921 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-27 15:30:23,508 WARN L179 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 29 [2018-10-27 15:30:23,727 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 34 [2018-10-27 15:30:23,862 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 35 [2018-10-27 15:30:24,042 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 34 [2018-10-27 15:30:24,286 WARN L179 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 56 [2018-10-27 15:30:24,498 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 55 [2018-10-27 15:30:24,660 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 47 [2018-10-27 15:30:24,813 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2018-10-27 15:30:25,568 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 15:30:25,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:30:25,569 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:30:25,569 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:30:25,569 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:25,569 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:30:25,569 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:30:25,578 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-10-27 15:30:25,578 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-10-27 15:30:25,851 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-10-27 15:30:25,851 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:30:25,859 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:30:25,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-27 15:30:25,907 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:25,917 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:25,917 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2018-10-27 15:30:26,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 21 [2018-10-27 15:30:26,312 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 16 treesize of output 15 [2018-10-27 15:30:26,312 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:26,318 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:26,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:26,334 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:48, output treesize:44 [2018-10-27 15:30:26,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-10-27 15:30:26,509 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:26,511 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 25 treesize of output 34 [2018-10-27 15:30:26,511 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:26,519 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:26,544 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:30:26,544 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:45 [2018-10-27 15:30:26,717 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-10-27 15:30:26,722 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:26,723 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 25 treesize of output 34 [2018-10-27 15:30:26,724 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:26,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:26,756 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:30:26,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:58, output treesize:42 [2018-10-27 15:30:34,400 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str2~0.base_BEFORE_CALL_3| Int) (main_~max~0 Int) (|v_main_~#str1~0.base_BEFORE_CALL_3| Int) (v_main_~i~0_126 Int)) (let ((.cse0 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= main_~max~0 5) (<= .cse0 2147483647) (= (select (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_3|) 2) (select (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_3|) (+ v_main_~i~0_126 2))) (<= 5 main_~max~0) (<= .cse0 (+ v_main_~i~0_126 4)) (<= v_main_~i~0_126 0) (not (= |v_main_~#str2~0.base_BEFORE_CALL_3| |v_main_~#str1~0.base_BEFORE_CALL_3|))))) is different from true [2018-10-27 15:30:36,836 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str2~0.base_BEFORE_CALL_4| Int) (main_~max~0 Int) (|v_main_~#str1~0.base_BEFORE_CALL_4| Int) (v_main_~i~0_126 Int)) (let ((.cse0 (mod (+ main_~max~0 4294967295) 4294967296))) (and (<= main_~max~0 5) (<= .cse0 2147483647) (= (select (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_4|) 2) (select (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_4|) (+ v_main_~i~0_126 2))) (<= 5 main_~max~0) (<= .cse0 (+ v_main_~i~0_126 4)) (<= v_main_~i~0_126 0) (not (= |v_main_~#str2~0.base_BEFORE_CALL_4| |v_main_~#str1~0.base_BEFORE_CALL_4|))))) is different from true [2018-10-27 15:30:40,919 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2018-10-27 15:30:45,095 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2018-10-27 15:30:45,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 34 treesize of output 30 [2018-10-27 15:30:45,451 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:45,452 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-27 15:30:45,452 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:45,465 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:45,465 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 15:30:45,466 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:45,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:45,489 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:30:45,489 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:63, output treesize:3 [2018-10-27 15:30:47,613 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 83 refuted. 0 times theorem prover too weak. 9 trivial. 7 not checked. [2018-10-27 15:30:47,613 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:30:49,104 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 60 treesize of output 54 [2018-10-27 15:30:49,107 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:49,110 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 38 [2018-10-27 15:30:49,111 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 15:30:49,128 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 29 treesize of output 33 [2018-10-27 15:30:49,132 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:49,134 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 33 treesize of output 44 [2018-10-27 15:30:49,158 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:49,168 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 42 [2018-10-27 15:30:49,169 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-10-27 15:30:49,172 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:49,174 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-10-27 15:30:49,175 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:49,287 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 15:30:49,322 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 15:30:49,364 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 15:30:49,367 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 76 [2018-10-27 15:30:49,371 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 57 [2018-10-27 15:30:49,378 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:49,396 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 2 case distinctions, treesize of input 53 treesize of output 72 [2018-10-27 15:30:49,582 WARN L179 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2018-10-27 15:30:49,590 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:49,592 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:49,612 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 2 case distinctions, treesize of input 44 treesize of output 52 [2018-10-27 15:30:49,613 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 2 xjuncts. [2018-10-27 15:30:49,622 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:49,623 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:49,632 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:49,670 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 3 case distinctions, treesize of input 59 treesize of output 91 [2018-10-27 15:30:49,672 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 3 xjuncts. [2018-10-27 15:30:49,679 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:49,681 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:49,688 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:49,719 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 3 case distinctions, treesize of input 62 treesize of output 90 [2018-10-27 15:30:49,721 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 3 xjuncts. [2018-10-27 15:30:49,730 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:49,730 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:49,732 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:49,732 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:49,769 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 49 treesize of output 93 [2018-10-27 15:30:49,771 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 4 xjuncts. [2018-10-27 15:30:49,782 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:49,783 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:49,790 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:49,817 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 93 [2018-10-27 15:30:49,818 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 3 xjuncts. [2018-10-27 15:30:49,827 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:49,833 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:49,840 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:49,869 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 3 case distinctions, treesize of input 50 treesize of output 87 [2018-10-27 15:30:49,871 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 3 xjuncts. [2018-10-27 15:30:50,041 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:50,043 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:50,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 44 [2018-10-27 15:30:50,045 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:50,099 INFO L267 ElimStorePlain]: Start of recursive call 10: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 15:30:50,147 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 15:30:50,210 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 15:30:50,220 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 123 treesize of output 117 [2018-10-27 15:30:50,225 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 112 treesize of output 97 [2018-10-27 15:30:50,231 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:50,234 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 81 treesize of output 80 [2018-10-27 15:30:50,342 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 51 [2018-10-27 15:30:50,366 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:50,370 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:50,378 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:50,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 105 [2018-10-27 15:30:50,402 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 6 xjuncts. [2018-10-27 15:30:50,412 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:50,413 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:50,416 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:50,424 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 71 [2018-10-27 15:30:50,425 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-10-27 15:30:50,428 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:50,432 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:50,439 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:50,460 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 68 treesize of output 111 [2018-10-27 15:30:50,463 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 6 xjuncts. [2018-10-27 15:30:50,493 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:50,525 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 44 treesize of output 56 [2018-10-27 15:30:50,527 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 4 xjuncts. [2018-10-27 15:30:50,530 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:50,534 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:50,541 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:50,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, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 108 [2018-10-27 15:30:50,566 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 6 xjuncts. [2018-10-27 15:30:50,569 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:50,573 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:50,579 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:50,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 109 [2018-10-27 15:30:50,604 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 6 xjuncts. [2018-10-27 15:30:50,779 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-10-27 15:30:50,877 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 15:30:51,025 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:51,029 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 0 case distinctions, treesize of input 109 treesize of output 102 [2018-10-27 15:30:51,035 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:51,053 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 90 [2018-10-27 15:30:51,280 WARN L179 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 73 [2018-10-27 15:30:51,288 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:51,288 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:51,289 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:51,305 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 2 case distinctions, treesize of input 67 treesize of output 92 [2018-10-27 15:30:51,306 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 2 xjuncts. [2018-10-27 15:30:51,312 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:51,312 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:51,328 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 2 case distinctions, treesize of input 51 treesize of output 52 [2018-10-27 15:30:51,329 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 2 xjuncts. [2018-10-27 15:30:51,335 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:51,336 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:51,338 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:51,341 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:51,355 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 2 case distinctions, treesize of input 67 treesize of output 92 [2018-10-27 15:30:51,356 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 2 xjuncts. [2018-10-27 15:30:51,359 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:51,359 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:51,359 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:51,372 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 91 [2018-10-27 15:30:51,373 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-10-27 15:30:51,392 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:51,393 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:51,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, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 82 treesize of output 94 [2018-10-27 15:30:51,419 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 3 xjuncts. [2018-10-27 15:30:51,425 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:51,426 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:51,451 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 3 case distinctions, treesize of input 75 treesize of output 91 [2018-10-27 15:30:51,453 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 3 xjuncts. [2018-10-27 15:30:51,459 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:51,459 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:51,486 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 3 case distinctions, treesize of input 75 treesize of output 96 [2018-10-27 15:30:51,488 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 3 xjuncts. [2018-10-27 15:30:51,494 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:51,494 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:51,519 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 3 case distinctions, treesize of input 89 treesize of output 94 [2018-10-27 15:30:51,522 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 3 xjuncts. [2018-10-27 15:30:51,527 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:51,528 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:51,555 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 93 [2018-10-27 15:30:51,557 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 3 xjuncts. [2018-10-27 15:30:51,565 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:51,565 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:51,590 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 3 case distinctions, treesize of input 73 treesize of output 87 [2018-10-27 15:30:51,592 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 3 xjuncts. [2018-10-27 15:30:51,598 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:51,599 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:51,626 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 3 case distinctions, treesize of input 75 treesize of output 96 [2018-10-27 15:30:51,628 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 3 xjuncts. [2018-10-27 15:30:51,632 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:51,632 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:51,632 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:51,645 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 72 treesize of output 94 [2018-10-27 15:30:51,646 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 2 xjuncts. [2018-10-27 15:30:51,658 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:51,658 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:51,683 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 3 case distinctions, treesize of input 82 treesize of output 94 [2018-10-27 15:30:51,684 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 3 xjuncts. [2018-10-27 15:30:51,866 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 15:30:51,915 INFO L267 ElimStorePlain]: Start of recursive call 27: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 15:30:52,096 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 15:30:52,282 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 76 [2018-10-27 15:30:52,288 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 57 [2018-10-27 15:30:52,312 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:52,330 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 2 case distinctions, treesize of input 53 treesize of output 72 [2018-10-27 15:30:52,523 WARN L179 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2018-10-27 15:30:52,529 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:52,530 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:52,544 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 2 case distinctions, treesize of input 44 treesize of output 52 [2018-10-27 15:30:52,545 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 2 xjuncts. [2018-10-27 15:30:52,548 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:52,549 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:52,553 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:52,554 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:52,578 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 3 case distinctions, treesize of input 62 treesize of output 90 [2018-10-27 15:30:52,580 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 3 xjuncts. [2018-10-27 15:30:52,583 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:52,585 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:52,590 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:52,591 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:52,616 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 3 case distinctions, treesize of input 59 treesize of output 91 [2018-10-27 15:30:52,618 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 3 xjuncts. [2018-10-27 15:30:52,627 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:52,629 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:52,633 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:52,634 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:52,659 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 3 case distinctions, treesize of input 50 treesize of output 87 [2018-10-27 15:30:52,660 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 3 xjuncts. [2018-10-27 15:30:52,684 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:52,686 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:52,692 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:52,692 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:52,716 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 93 [2018-10-27 15:30:52,718 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 3 xjuncts. [2018-10-27 15:30:52,721 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:52,724 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:52,725 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:52,725 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:52,749 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 49 treesize of output 93 [2018-10-27 15:30:52,750 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 4 xjuncts. [2018-10-27 15:30:52,909 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:52,911 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:30:52,912 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 0 case distinctions, treesize of input 44 treesize of output 44 [2018-10-27 15:30:52,912 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:52,968 INFO L267 ElimStorePlain]: Start of recursive call 44: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 15:30:53,020 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 15:30:53,078 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 15:30:53,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 60 treesize of output 54 [2018-10-27 15:30:53,086 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 37 treesize of output 41 [2018-10-27 15:30:53,088 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:53,090 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 41 treesize of output 52 [2018-10-27 15:30:53,116 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:53,116 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:53,117 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:53,126 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 53 [2018-10-27 15:30:53,127 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 2 xjuncts. [2018-10-27 15:30:53,130 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:30:53,132 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 19 [2018-10-27 15:30:53,132 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:53,165 INFO L267 ElimStorePlain]: Start of recursive call 54: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-10-27 15:30:53,204 INFO L267 ElimStorePlain]: Start of recursive call 53: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-10-27 15:30:53,251 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 33 treesize of output 29 [2018-10-27 15:30:53,252 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:53,254 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 29 treesize of output 25 [2018-10-27 15:30:53,254 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-10-27 15:30:53,281 INFO L267 ElimStorePlain]: Start of recursive call 52: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:30:53,517 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 10 xjuncts. [2018-10-27 15:30:53,518 INFO L202 ElimStorePlain]: Needed 58 recursive calls to eliminate 6 variables, input treesize:171, output treesize:430 [2018-10-27 15:30:53,963 WARN L179 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 54 [2018-10-27 15:30:54,371 WARN L179 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2018-10-27 15:30:54,637 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-10-27 15:30:54,983 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-10-27 15:30:55,241 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-10-27 15:30:55,553 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 49 [2018-10-27 15:30:55,603 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 4 proven. 51 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-10-27 15:30:55,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-10-27 15:30:55,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 30, 23] total 68 [2018-10-27 15:30:55,624 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-10-27 15:30:55,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-27 15:30:55,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-27 15:30:55,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=382, Invalid=3908, Unknown=8, NotChecked=258, Total=4556 [2018-10-27 15:30:55,627 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 50 states. [2018-10-27 15:30:57,216 WARN L179 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 28 [2018-10-27 15:30:57,597 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2018-10-27 15:31:05,728 WARN L179 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2018-10-27 15:31:07,333 WARN L179 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2018-10-27 15:31:07,961 WARN L179 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 52 [2018-10-27 15:31:14,096 WARN L179 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 36 DAG size of output: 34 [2018-10-27 15:31:18,218 WARN L179 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-10-27 15:31:32,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 15:31:32,406 INFO L93 Difference]: Finished difference Result 93 states and 96 transitions. [2018-10-27 15:31:32,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-27 15:31:32,406 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 66 [2018-10-27 15:31:32,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-27 15:31:32,407 INFO L225 Difference]: With dead ends: 93 [2018-10-27 15:31:32,407 INFO L226 Difference]: Without dead ends: 91 [2018-10-27 15:31:32,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 89 SyntacticMatches, 9 SemanticMatches, 94 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2097 ImplicationChecksByTransitivity, 50.5s TimeCoverageRelationStatistics Valid=934, Invalid=7806, Unknown=10, NotChecked=370, Total=9120 [2018-10-27 15:31:32,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-27 15:31:32,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 78. [2018-10-27 15:31:32,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-27 15:31:32,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-10-27 15:31:32,427 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 66 [2018-10-27 15:31:32,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-27 15:31:32,427 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-10-27 15:31:32,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-27 15:31:32,427 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-10-27 15:31:32,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-27 15:31:32,429 INFO L367 BasicCegarLoop]: Found error trace [2018-10-27 15:31:32,429 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 15:31:32,429 INFO L424 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-10-27 15:31:32,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 15:31:32,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1861098169, now seen corresponding path program 3 times [2018-10-27 15:31:32,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-10-27 15:31:32,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:31:32,430 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 15:31:32,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 15:31:32,431 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-10-27 15:31:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 15:31:32,871 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-27 15:31:33,277 WARN L179 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2018-10-27 15:31:33,605 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 34 [2018-10-27 15:31:33,855 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 46 [2018-10-27 15:31:34,032 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 47 [2018-10-27 15:31:34,241 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 56 [2018-10-27 15:31:34,429 WARN L179 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2018-10-27 15:31:34,600 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 52 [2018-10-27 15:31:34,767 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 53 [2018-10-27 15:31:35,947 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 5 proven. 108 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-10-27 15:31:35,947 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:31:35,947 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-10-27 15:31:35,947 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-10-27 15:31:35,948 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:31:35,948 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-27 15:31:35,948 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:31:35,956 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-10-27 15:31:35,956 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-10-27 15:31:36,022 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-10-27 15:31:36,022 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-27 15:31:36,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 15:31:36,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 5 treesize of output 1 [2018-10-27 15:31:36,048 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-27 15:31:36,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:31:36,061 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-10-27 15:31:36,520 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-10-27 15:31:36,528 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 16 treesize of output 15 [2018-10-27 15:31:36,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:31:36,543 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:31:36,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 46 [2018-10-27 15:31:36,554 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 16 treesize of output 15 [2018-10-27 15:31:36,554 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 15:31:36,571 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:31:36,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:31:36,612 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:99, output treesize:91 [2018-10-27 15:31:36,834 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 61 [2018-10-27 15:31:36,840 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:31:36,841 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 30 [2018-10-27 15:31:36,841 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:31:36,864 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:31:36,927 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 61 [2018-10-27 15:31:36,936 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:31:36,938 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 30 [2018-10-27 15:31:36,939 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 15:31:36,961 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:31:37,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:31:37,016 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 6 variables, input treesize:133, output treesize:97 [2018-10-27 15:31:37,249 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2018-10-27 15:31:37,252 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:31:37,254 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 25 treesize of output 34 [2018-10-27 15:31:37,255 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:31:37,274 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:31:37,375 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 54 [2018-10-27 15:31:37,378 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:31:37,379 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 25 treesize of output 34 [2018-10-27 15:31:37,380 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 15:31:37,401 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:31:37,448 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-27 15:31:37,448 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:119, output treesize:93 [2018-10-27 15:31:37,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 57 [2018-10-27 15:31:37,697 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:31:37,699 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 30 [2018-10-27 15:31:37,699 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:31:37,722 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:31:37,724 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-10-27 15:31:37,725 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:31:37,747 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:31:37,748 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:125, output treesize:46 [2018-10-27 15:31:40,205 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_main_~#str1~0.base_BEFORE_CALL_7| Int) (main_~max~0 Int) (|v_main_~#str2~0.base_BEFORE_CALL_7| Int)) (let ((.cse0 (mod (+ main_~max~0 4294967295) 4294967296))) (and (not (= |v_main_~#str2~0.base_BEFORE_CALL_7| |v_main_~#str1~0.base_BEFORE_CALL_7|)) (= (select (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_7|) 1) (select (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_7|) (+ .cse0 (- 1)))) (<= .cse0 2147483647) (< .cse0 5) (<= 4 .cse0)))) is different from true [2018-10-27 15:31:42,451 WARN L179 SmtUtils]: Spent 1.89 s on a formula simplification that was a NOOP. DAG size: 31 [2018-10-27 15:32:43,520 WARN L179 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 26 [2018-10-27 15:32:55,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 38 treesize of output 34 [2018-10-27 15:32:55,951 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:32:55,952 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2018-10-27 15:32:55,952 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 15:32:55,962 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:32:55,963 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-10-27 15:32:55,963 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 15:32:55,967 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 15:32:55,978 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:32:55,978 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:63, output treesize:3 [2018-10-27 15:32:56,289 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 11 trivial. 3 not checked. [2018-10-27 15:32:56,289 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-10-27 15:32:58,591 WARN L179 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-10-27 15:32:59,276 WARN L179 SmtUtils]: Spent 295.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2018-10-27 15:32:59,953 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-27 15:33:00,440 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-10-27 15:33:01,076 WARN L179 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-10-27 15:33:01,580 WARN L179 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2018-10-27 15:33:01,670 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 135 treesize of output 129 [2018-10-27 15:33:01,676 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:01,681 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 0 case distinctions, treesize of input 121 treesize of output 114 [2018-10-27 15:33:01,687 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:01,702 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 94 [2018-10-27 15:33:01,708 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:01,726 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 2 case distinctions, treesize of input 77 treesize of output 88 [2018-10-27 15:33:02,129 WARN L179 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2018-10-27 15:33:02,133 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,134 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,135 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:02,139 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 0 case distinctions, treesize of input 80 treesize of output 78 [2018-10-27 15:33:02,140 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 15:33:02,151 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,152 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,152 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,153 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:02,157 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 0 case distinctions, treesize of input 72 treesize of output 84 [2018-10-27 15:33:02,158 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-10-27 15:33:02,162 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,162 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,163 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:02,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 0 case distinctions, treesize of input 80 treesize of output 83 [2018-10-27 15:33:02,167 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 15:33:02,171 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,172 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,173 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:02,176 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 0 case distinctions, treesize of input 73 treesize of output 80 [2018-10-27 15:33:02,177 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-10-27 15:33:02,181 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,181 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,182 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:02,185 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 81 [2018-10-27 15:33:02,186 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-10-27 15:33:02,189 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,189 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,190 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:02,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 81 [2018-10-27 15:33:02,195 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-10-27 15:33:02,198 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 15:33:02,198 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-10-27 15:33:02,200 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,201 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:02,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 56 [2018-10-27 15:33:02,205 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-10-27 15:33:02,208 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,209 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,209 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:02,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 84 [2018-10-27 15:33:02,214 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-10-27 15:33:02,219 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,220 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,220 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,221 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:02,227 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 0 case distinctions, treesize of input 72 treesize of output 96 [2018-10-27 15:33:02,228 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-10-27 15:33:02,231 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 15:33:02,232 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-10-27 15:33:02,236 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,236 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,238 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:02,261 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 0 case distinctions, treesize of input 80 treesize of output 83 [2018-10-27 15:33:02,261 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-10-27 15:33:02,266 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,266 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,268 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:02,272 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 75 [2018-10-27 15:33:02,272 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-10-27 15:33:02,434 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,438 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,439 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:02,440 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,463 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 3 case distinctions, treesize of input 72 treesize of output 107 [2018-10-27 15:33:02,465 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 3 xjuncts. [2018-10-27 15:33:02,468 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,469 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,470 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,470 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 95 [2018-10-27 15:33:02,488 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 2 xjuncts. [2018-10-27 15:33:02,493 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,494 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:02,495 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,508 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 55 treesize of output 66 [2018-10-27 15:33:02,509 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-10-27 15:33:02,667 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-10-27 15:33:02,793 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,801 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:02,843 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 2 new quantified variables, introduced 5 case distinctions, treesize of input 78 treesize of output 114 [2018-10-27 15:33:03,873 WARN L179 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 243 DAG size of output: 214 [2018-10-27 15:33:03,908 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:03,912 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:03,913 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:03,929 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 95 [2018-10-27 15:33:03,930 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 2 xjuncts. [2018-10-27 15:33:03,934 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:03,937 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:03,939 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:03,954 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 86 treesize of output 100 [2018-10-27 15:33:03,955 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 2 xjuncts. [2018-10-27 15:33:03,958 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 15:33:03,959 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-10-27 15:33:03,961 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:03,965 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:03,967 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:03,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 101 treesize of output 98 [2018-10-27 15:33:03,981 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 2 xjuncts. [2018-10-27 15:33:03,987 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:03,988 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:04,001 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 66 [2018-10-27 15:33:04,002 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-10-27 15:33:04,006 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:04,009 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:04,010 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:04,023 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 8 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 98 [2018-10-27 15:33:04,024 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 2 xjuncts. [2018-10-27 15:33:05,063 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:05,064 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:05,065 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:05,069 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 77 treesize of output 76 [2018-10-27 15:33:05,070 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-10-27 15:33:05,073 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:05,073 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:05,076 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2018-10-27 15:33:05,077 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-10-27 15:33:05,548 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:05,552 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:05,554 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:05,554 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:05,579 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 3 case distinctions, treesize of input 68 treesize of output 100 [2018-10-27 15:33:05,580 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 3 xjuncts. [2018-10-27 15:33:05,586 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:05,588 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:05,588 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:05,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 61 [2018-10-27 15:33:05,602 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-10-27 15:33:06,045 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:06,063 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 2 case distinctions, treesize of input 61 treesize of output 94 [2018-10-27 15:33:06,065 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 3 xjuncts. [2018-10-27 15:33:06,072 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:06,090 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 68 treesize of output 92 [2018-10-27 15:33:06,091 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 3 xjuncts. [2018-10-27 15:33:06,094 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:06,095 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:06,097 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:06,103 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 58 treesize of output 61 [2018-10-27 15:33:06,103 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-10-27 15:33:06,444 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:06,447 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:06,450 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:06,450 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:06,453 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:06,457 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:06,542 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 65 treesize of output 136 [2018-10-27 15:33:06,545 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 11 xjuncts. [2018-10-27 15:33:06,549 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:06,552 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:06,554 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:06,555 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:06,558 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:06,561 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:06,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 7 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 72 treesize of output 134 [2018-10-27 15:33:06,607 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 11 xjuncts. [2018-10-27 15:33:06,611 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:06,611 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:06,614 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:06,618 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:06,644 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 3 case distinctions, treesize of input 57 treesize of output 80 [2018-10-27 15:33:06,645 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 4 xjuncts. [2018-10-27 15:33:07,097 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:07,100 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:07,106 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:07,108 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:07,112 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:07,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 56 treesize of output 128 [2018-10-27 15:33:07,166 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 16 xjuncts. [2018-10-27 15:33:07,180 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:07,182 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:07,187 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:07,190 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:07,194 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:07,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 67 treesize of output 134 [2018-10-27 15:33:07,244 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 16 xjuncts. [2018-10-27 15:33:07,248 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:07,262 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:07,288 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 3 case distinctions, treesize of input 52 treesize of output 72 [2018-10-27 15:33:07,290 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 8 xjuncts. [2018-10-27 15:33:07,854 INFO L267 ElimStorePlain]: Start of recursive call 22: 7 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-10-27 15:33:08,106 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-10-27 15:33:08,307 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-10-27 15:33:09,285 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 11 xjuncts. [2018-10-27 15:33:09,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 72 treesize of output 66 [2018-10-27 15:33:09,295 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:09,296 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 38 [2018-10-27 15:33:09,297 INFO L267 ElimStorePlain]: Start of recursive call 43: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-27 15:33:09,352 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 29 treesize of output 33 [2018-10-27 15:33:09,355 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:09,357 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 33 treesize of output 41 [2018-10-27 15:33:09,362 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:09,379 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 2 case distinctions, treesize of input 36 treesize of output 60 [2018-10-27 15:33:09,486 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2018-10-27 15:33:09,493 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:09,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 84 [2018-10-27 15:33:09,523 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 8 xjuncts. [2018-10-27 15:33:09,531 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:09,559 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 76 [2018-10-27 15:33:09,561 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 8 xjuncts. [2018-10-27 15:33:09,565 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:09,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 40 [2018-10-27 15:33:09,575 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 2 xjuncts. [2018-10-27 15:33:09,752 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:09,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 24 [2018-10-27 15:33:09,754 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-10-27 15:33:09,758 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:09,767 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 60 [2018-10-27 15:33:09,768 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 2 xjuncts. [2018-10-27 15:33:09,852 INFO L267 ElimStorePlain]: Start of recursive call 46: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 15:33:09,919 INFO L267 ElimStorePlain]: Start of recursive call 45: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 15:33:09,982 INFO L267 ElimStorePlain]: Start of recursive call 44: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 15:33:10,066 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-10-27 15:33:10,070 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 88 [2018-10-27 15:33:10,075 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 57 [2018-10-27 15:33:10,082 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:10,099 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 2 case distinctions, treesize of input 53 treesize of output 69 [2018-10-27 15:33:10,248 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:10,302 INFO L303 Elim1Store]: Index analysis took 200 ms [2018-10-27 15:33:10,332 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 5 case distinctions, treesize of input 58 treesize of output 95 [2018-10-27 15:33:11,117 WARN L179 SmtUtils]: Spent 780.00 ms on a formula simplification. DAG size of input: 209 DAG size of output: 185 [2018-10-27 15:33:11,124 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:11,130 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:11,131 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:11,277 INFO L303 Elim1Store]: Index analysis took 156 ms [2018-10-27 15:33:11,329 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 84 treesize of output 108 [2018-10-27 15:33:11,330 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 3 xjuncts. [2018-10-27 15:33:11,336 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:11,343 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:11,344 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:11,376 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 70 treesize of output 107 [2018-10-27 15:33:11,377 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 3 xjuncts. [2018-10-27 15:33:11,382 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:11,389 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:11,390 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:11,422 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 77 treesize of output 105 [2018-10-27 15:33:11,424 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 3 xjuncts. [2018-10-27 15:33:11,441 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-10-27 15:33:11,442 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-10-27 15:33:11,461 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:11,462 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:11,473 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 0 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 63 [2018-10-27 15:33:11,474 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 2 xjuncts. [2018-10-27 15:33:11,480 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:11,486 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:11,487 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:11,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 5 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 66 treesize of output 99 [2018-10-27 15:33:11,521 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 3 xjuncts. [2018-10-27 15:33:12,350 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:12,352 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:12,356 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:12,357 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:12,379 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 98 [2018-10-27 15:33:12,380 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 3 xjuncts. [2018-10-27 15:33:12,386 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:12,387 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:12,399 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 57 [2018-10-27 15:33:12,400 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 2 xjuncts. [2018-10-27 15:33:12,404 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:12,406 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:12,407 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:12,408 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:12,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 66 treesize of output 98 [2018-10-27 15:33:12,430 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 4 xjuncts. [2018-10-27 15:33:13,010 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:13,017 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:13,018 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:13,049 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 66 [2018-10-27 15:33:13,050 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 2 xjuncts. [2018-10-27 15:33:13,056 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:13,064 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:13,066 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:13,067 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:13,068 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:13,116 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 65 treesize of output 122 [2018-10-27 15:33:13,119 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 8 xjuncts. [2018-10-27 15:33:13,124 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:13,126 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:13,128 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:13,134 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:13,142 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:13,143 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:13,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 117 [2018-10-27 15:33:13,185 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 3 xjuncts. [2018-10-27 15:33:13,783 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:13,786 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:13,790 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:13,821 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 80 [2018-10-27 15:33:13,823 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 8 xjuncts. [2018-10-27 15:33:13,827 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:13,834 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:13,835 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:13,836 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:13,837 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:13,888 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 5 case distinctions, treesize of input 57 treesize of output 136 [2018-10-27 15:33:13,896 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 32 xjuncts. [2018-10-27 15:33:13,922 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:13,923 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:13,929 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:13,932 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:13,936 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:13,988 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 3 new quantified variables, introduced 7 case distinctions, treesize of input 60 treesize of output 136 [2018-10-27 15:33:13,994 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 16 xjuncts. [2018-10-27 15:33:14,812 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:14,815 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:14,816 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:14,816 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:14,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 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 102 [2018-10-27 15:33:14,841 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 4 xjuncts. [2018-10-27 15:33:14,848 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:14,849 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:14,864 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 2 case distinctions, treesize of input 51 treesize of output 59 [2018-10-27 15:33:14,865 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 2 xjuncts. [2018-10-27 15:33:15,208 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:15,208 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:15,209 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:15,210 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:15,223 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 77 [2018-10-27 15:33:15,224 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 2 xjuncts. [2018-10-27 15:33:15,477 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:15,479 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:15,480 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:15,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 78 [2018-10-27 15:33:15,493 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 2 xjuncts. [2018-10-27 15:33:15,495 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 15:33:15,496 INFO L682 Elim1Store]: detected equality via solver [2018-10-27 15:33:15,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2018-10-27 15:33:15,500 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-10-27 15:33:15,695 INFO L267 ElimStorePlain]: Start of recursive call 55: 7 dim-1 vars, End of recursive call: and 11 xjuncts. Received shutdown request... [2018-10-27 15:33:15,877 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-10-27 15:33:16,078 WARN L522 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-27 15:33:16,078 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-27 15:33:16,084 WARN L205 ceAbstractionStarter]: Timeout [2018-10-27 15:33:16,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.10 03:33:16 BoogieIcfgContainer [2018-10-27 15:33:16,084 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-27 15:33:16,085 INFO L168 Benchmark]: Toolchain (without parser) took 266737.33 ms. Allocated memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: 996.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -792.9 MB). Peak memory consumption was 856.4 MB. Max. memory is 7.1 GB. [2018-10-27 15:33:16,085 INFO L168 Benchmark]: CDTParser took 0.21 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:33:16,085 INFO L168 Benchmark]: CACSL2BoogieTranslator took 327.90 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:33:16,086 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.42 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:33:16,086 INFO L168 Benchmark]: Boogie Preprocessor took 30.71 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:33:16,086 INFO L168 Benchmark]: RCFGBuilder took 620.91 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 764.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.9 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2018-10-27 15:33:16,086 INFO L168 Benchmark]: TraceAbstraction took 265705.76 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 232.3 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.5 MB). Peak memory consumption was 888.4 MB. Max. memory is 7.1 GB. [2018-10-27 15:33:16,088 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.21 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 327.90 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 45.42 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 30.71 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 620.91 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 764.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.9 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 265705.76 ms. Allocated memory was 2.3 GB in the beginning and 2.5 GB in the end (delta: 232.3 MB). Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 3.5 MB). Peak memory consumption was 888.4 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 76 with TraceHistMax 6,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 65. - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 30 locations, 1 error locations. TIMEOUT Result, 265.6s OverallTime, 14 OverallIterations, 8 TraceHistogramMax, 80.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 374 SDtfs, 620 SDslu, 3855 SDs, 0 SdLazy, 6346 SolverSat, 536 SolverUnsat, 10 SolverUnknown, 0 SolverNotchecked, 30.8s Time, PredicateUnifierStatistics: 2 DeclaredPredicates, 1119 GetRequests, 611 SyntacticMatches, 21 SemanticMatches, 487 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 7076 ImplicationChecksByTransitivity, 110.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 3 AbstIntIterations, 1 AbstIntStrong, 0.85 AbsIntWeakeningRatio, 2.15 AbsIntAvgWeakeningVarsNumRemoved, 1.1 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 140 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 77.7s InterpolantComputationTime, 907 NumberOfCodeBlocks, 895 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1300 ConstructedInterpolants, 56 QuantifiedInterpolants, 1611151 SizeOfPredicates, 259 NumberOfNonLiveVariables, 2457 ConjunctsInSsa, 612 ConjunctsInUnsatCore, 33 InterpolantComputations, 2 PerfectInterpolantSequences, 701/1664 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown