java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf -i ../../../trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-63daa26 [2018-11-12 20:29:33,577 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-12 20:29:33,581 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-12 20:29:33,595 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-12 20:29:33,596 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-12 20:29:33,597 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-12 20:29:33,598 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-12 20:29:33,600 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-12 20:29:33,601 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-12 20:29:33,602 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-12 20:29:33,603 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-12 20:29:33,603 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-12 20:29:33,604 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-12 20:29:33,605 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-12 20:29:33,606 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-12 20:29:33,607 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-12 20:29:33,608 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-12 20:29:33,609 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-12 20:29:33,611 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-12 20:29:33,615 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-12 20:29:33,616 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-12 20:29:33,617 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-12 20:29:33,624 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-12 20:29:33,625 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-12 20:29:33,625 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-12 20:29:33,626 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-12 20:29:33,627 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-12 20:29:33,631 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-12 20:29:33,632 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-12 20:29:33,633 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-12 20:29:33,633 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-12 20:29:33,634 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-12 20:29:33,634 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-12 20:29:33,635 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-12 20:29:33,635 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-12 20:29:33,638 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-12 20:29:33,639 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-64bit-Taipan_Default-INT-LIM.epf [2018-11-12 20:29:33,669 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-12 20:29:33,669 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-12 20:29:33,670 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-12 20:29:33,670 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-12 20:29:33,674 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-12 20:29:33,674 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-12 20:29:33,674 INFO L133 SettingsManager]: * Maximum recursion depth of evaluation operations=6 [2018-11-12 20:29:33,674 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-12 20:29:33,674 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-12 20:29:33,675 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-12 20:29:33,675 INFO L133 SettingsManager]: * Log string format=TERM [2018-11-12 20:29:33,675 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-12 20:29:33,675 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-12 20:29:33,676 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-12 20:29:33,676 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-12 20:29:33,676 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-12 20:29:33,677 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-12 20:29:33,678 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-12 20:29:33,678 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-12 20:29:33,678 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-12 20:29:33,678 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-12 20:29:33,678 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-12 20:29:33,679 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-12 20:29:33,679 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-12 20:29:33,679 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-12 20:29:33,679 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:29:33,679 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-12 20:29:33,680 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-12 20:29:33,680 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-12 20:29:33,680 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-12 20:29:33,680 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-12 20:29:33,681 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-12 20:29:33,681 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-12 20:29:33,681 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-12 20:29:33,681 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-11-12 20:29:33,738 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-12 20:29:33,755 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-12 20:29:33,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-12 20:29:33,760 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-12 20:29:33,761 INFO L276 PluginConnector]: CDTParser initialized [2018-11-12 20:29:33,761 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i [2018-11-12 20:29:33,812 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dc443bb9/7b9c7ceafc134c7d91d60377c85a2f2c/FLAG498859efc [2018-11-12 20:29:34,254 INFO L298 CDTParser]: Found 1 translation units. [2018-11-12 20:29:34,254 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string_true-unreach-call_true-termination.i [2018-11-12 20:29:34,263 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dc443bb9/7b9c7ceafc134c7d91d60377c85a2f2c/FLAG498859efc [2018-11-12 20:29:34,284 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8dc443bb9/7b9c7ceafc134c7d91d60377c85a2f2c [2018-11-12 20:29:34,298 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-12 20:29:34,300 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-12 20:29:34,301 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-12 20:29:34,301 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-12 20:29:34,305 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-12 20:29:34,306 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:29:34" (1/1) ... [2018-11-12 20:29:34,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c173f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:29:34, skipping insertion in model container [2018-11-12 20:29:34,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 08:29:34" (1/1) ... [2018-11-12 20:29:34,319 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-12 20:29:34,340 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-12 20:29:34,546 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:29:34,555 INFO L189 MainTranslator]: Completed pre-run [2018-11-12 20:29:34,586 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-12 20:29:34,608 INFO L193 MainTranslator]: Completed translation [2018-11-12 20:29:34,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:29:34 WrapperNode [2018-11-12 20:29:34,609 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-12 20:29:34,609 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-12 20:29:34,610 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-12 20:29:34,610 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-12 20:29:34,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:29:34" (1/1) ... [2018-11-12 20:29:34,629 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:29:34" (1/1) ... [2018-11-12 20:29:34,636 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-12 20:29:34,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-12 20:29:34,636 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-12 20:29:34,636 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-12 20:29:34,647 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:29:34" (1/1) ... [2018-11-12 20:29:34,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:29:34" (1/1) ... [2018-11-12 20:29:34,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:29:34" (1/1) ... [2018-11-12 20:29:34,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:29:34" (1/1) ... [2018-11-12 20:29:34,657 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:29:34" (1/1) ... [2018-11-12 20:29:34,672 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:29:34" (1/1) ... [2018-11-12 20:29:34,674 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:29:34" (1/1) ... [2018-11-12 20:29:34,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-12 20:29:34,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-12 20:29:34,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-12 20:29:34,683 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-12 20:29:34,684 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:29:34" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-12 20:29:34,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-12 20:29:34,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-12 20:29:34,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-12 20:29:34,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-12 20:29:34,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-12 20:29:34,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-12 20:29:34,838 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-12 20:29:34,838 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-12 20:29:34,838 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-12 20:29:34,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-12 20:29:34,839 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-12 20:29:34,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-12 20:29:35,270 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-12 20:29:35,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:29:35 BoogieIcfgContainer [2018-11-12 20:29:35,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-12 20:29:35,272 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-12 20:29:35,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-12 20:29:35,275 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-12 20:29:35,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 08:29:34" (1/3) ... [2018-11-12 20:29:35,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4750006e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:29:35, skipping insertion in model container [2018-11-12 20:29:35,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 08:29:34" (2/3) ... [2018-11-12 20:29:35,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4750006e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 08:29:35, skipping insertion in model container [2018-11-12 20:29:35,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 08:29:35" (3/3) ... [2018-11-12 20:29:35,279 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string_true-unreach-call_true-termination.i [2018-11-12 20:29:35,287 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-12 20:29:35,294 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-12 20:29:35,310 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-12 20:29:35,344 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-12 20:29:35,344 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-12 20:29:35,344 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-12 20:29:35,345 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-12 20:29:35,345 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-12 20:29:35,345 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-12 20:29:35,345 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-12 20:29:35,345 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-12 20:29:35,364 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-12 20:29:35,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-12 20:29:35,371 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:29:35,372 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:29:35,374 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:29:35,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:29:35,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1989464865, now seen corresponding path program 1 times [2018-11-12 20:29:35,383 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:29:35,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:35,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:29:35,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:35,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:29:35,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:29:35,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:29:35,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:29:35,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-12 20:29:35,518 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:29:35,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-12 20:29:35,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-12 20:29:35,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:29:35,539 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-12 20:29:35,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:29:35,563 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-11-12 20:29:35,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-12 20:29:35,565 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-12 20:29:35,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:29:35,572 INFO L225 Difference]: With dead ends: 51 [2018-11-12 20:29:35,572 INFO L226 Difference]: Without dead ends: 25 [2018-11-12 20:29:35,576 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-12 20:29:35,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-12 20:29:35,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-12 20:29:35,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-12 20:29:35,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-11-12 20:29:35,617 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 16 [2018-11-12 20:29:35,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:29:35,618 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-11-12 20:29:35,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-12 20:29:35,618 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-12 20:29:35,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-12 20:29:35,619 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:29:35,619 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:29:35,620 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:29:35,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:29:35,621 INFO L82 PathProgramCache]: Analyzing trace with hash 971272842, now seen corresponding path program 1 times [2018-11-12 20:29:35,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:29:35,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:35,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:29:35,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:35,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:29:35,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:29:35,924 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 9 [2018-11-12 20:29:35,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:29:35,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-12 20:29:35,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-12 20:29:35,934 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:29:35,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-12 20:29:35,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-12 20:29:35,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-12 20:29:35,937 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 4 states. [2018-11-12 20:29:36,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:29:36,069 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-11-12 20:29:36,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-12 20:29:36,070 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-12 20:29:36,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:29:36,071 INFO L225 Difference]: With dead ends: 40 [2018-11-12 20:29:36,071 INFO L226 Difference]: Without dead ends: 28 [2018-11-12 20:29:36,072 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-12 20:29:36,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-12 20:29:36,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-11-12 20:29:36,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-12 20:29:36,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-12 20:29:36,079 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2018-11-12 20:29:36,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:29:36,080 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-12 20:29:36,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-12 20:29:36,080 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-12 20:29:36,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-12 20:29:36,081 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:29:36,081 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-11-12 20:29:36,081 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:29:36,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:29:36,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1585722772, now seen corresponding path program 1 times [2018-11-12 20:29:36,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:29:36,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:36,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:29:36,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:36,084 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:29:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:29:36,515 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 13 [2018-11-12 20:29:36,528 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-12 20:29:36,528 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:29:36,528 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:29:36,529 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-11-12 20:29:36,531 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [9], [12], [20], [24], [27], [29], [31], [35], [39], [44], [54], [57], [59], [65], [66], [67], [69] [2018-11-12 20:29:36,564 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:29:36,564 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:29:36,689 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-12 20:29:36,691 INFO L272 AbstractInterpreter]: Visited 8 different actions 8 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 3. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 22 variables. [2018-11-12 20:29:36,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:29:36,703 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-12 20:29:36,758 INFO L227 lantSequenceWeakener]: Weakened 6 states. On average, predicates are now at 80% of their original sizes. [2018-11-12 20:29:36,759 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-12 20:29:36,787 INFO L415 sIntCurrentIteration]: We unified 20 AI predicates to 20 [2018-11-12 20:29:36,788 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-12 20:29:36,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-12 20:29:36,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-12 20:29:36,789 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-12 20:29:36,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-12 20:29:36,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-12 20:29:36,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-12 20:29:36,791 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 3 states. [2018-11-12 20:29:36,800 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:29:37,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:29:37,022 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-11-12 20:29:37,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-12 20:29:37,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-12 20:29:37,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:29:37,023 INFO L225 Difference]: With dead ends: 48 [2018-11-12 20:29:37,023 INFO L226 Difference]: Without dead ends: 30 [2018-11-12 20:29:37,024 INFO L604 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-11-12 20:29:37,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-12 20:29:37,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-12 20:29:37,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-12 20:29:37,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2018-11-12 20:29:37,034 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 21 [2018-11-12 20:29:37,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:29:37,035 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2018-11-12 20:29:37,035 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-12 20:29:37,036 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-12 20:29:37,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-12 20:29:37,038 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:29:37,038 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-11-12 20:29:37,039 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:29:37,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:29:37,040 INFO L82 PathProgramCache]: Analyzing trace with hash 1045245671, now seen corresponding path program 1 times [2018-11-12 20:29:37,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:29:37,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:37,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:29:37,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:37,043 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:29:37,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:29:37,429 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:29:37,430 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:29:37,430 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:29:37,430 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-11-12 20:29:37,430 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-11-12 20:29:37,433 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:29:37,433 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:29:37,450 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:29:37,831 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:29:37,831 INFO L272 AbstractInterpreter]: Visited 22 different actions 100 times. Merged at 8 different actions 62 times. Widened at 2 different actions 8 times. Performed 495 root evaluator evaluations with a maximum evaluation depth of 5. Performed 495 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 16 fixpoints after 4 different actions. Largest state had 24 variables. [2018-11-12 20:29:37,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:29:37,878 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:29:37,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:29:37,878 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:29:37,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:29:37,896 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:29:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:29:37,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:29:38,028 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-11-12 20:29:38,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:38,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:38,044 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-12 20:29:38,178 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-12 20:29:38,178 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:38,218 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 45 treesize of output 42 [2018-11-12 20:29:38,237 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-11-12 20:29:38,237 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:38,373 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:38,484 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:38,485 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:38 [2018-11-12 20:29:38,864 WARN L179 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-12 20:29:39,164 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 31 [2018-11-12 20:29:39,211 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-11-12 20:29:39,219 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:39,220 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-11-12 20:29:39,221 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:39,256 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:39,257 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-11-12 20:29:39,257 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:39,262 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:39,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:39,276 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:52, output treesize:3 [2018-11-12 20:29:39,346 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:29:39,346 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:29:39,826 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-11-12 20:29:39,843 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 42 treesize of output 44 [2018-11-12 20:29:39,987 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2018-11-12 20:29:39,991 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 37 treesize of output 35 [2018-11-12 20:29:39,991 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:40,041 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 34 treesize of output 33 [2018-11-12 20:29:40,042 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:40,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:29:40,201 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-11-12 20:29:40,329 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 33 [2018-11-12 20:29:40,333 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-11-12 20:29:40,334 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:40,381 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 31 [2018-11-12 20:29:40,382 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:40,448 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:29:40,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:29:40,539 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:120, output treesize:114 [2018-11-12 20:29:40,730 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:29:40,751 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:29:40,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 11, 10] total 21 [2018-11-12 20:29:40,752 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:29:40,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-12 20:29:40,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-12 20:29:40,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-11-12 20:29:40,754 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 14 states. [2018-11-12 20:29:41,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:29:41,272 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-11-12 20:29:41,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-12 20:29:41,273 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 24 [2018-11-12 20:29:41,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:29:41,275 INFO L225 Difference]: With dead ends: 45 [2018-11-12 20:29:41,275 INFO L226 Difference]: Without dead ends: 33 [2018-11-12 20:29:41,277 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2018-11-12 20:29:41,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-12 20:29:41,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2018-11-12 20:29:41,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-12 20:29:41,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-11-12 20:29:41,283 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 24 [2018-11-12 20:29:41,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:29:41,284 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-11-12 20:29:41,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-12 20:29:41,284 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-11-12 20:29:41,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-12 20:29:41,285 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:29:41,285 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-11-12 20:29:41,286 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:29:41,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:29:41,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1179396881, now seen corresponding path program 2 times [2018-11-12 20:29:41,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:29:41,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:41,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:29:41,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:41,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:29:41,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:29:41,571 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:29:41,571 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:29:41,571 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:29:41,572 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:29:41,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:29:41,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:29:41,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:29:41,584 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:29:41,584 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:29:41,605 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-12 20:29:41,605 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:29:41,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:29:41,678 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 20:29:41,679 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:29:41,710 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 20:29:41,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:29:41,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2018-11-12 20:29:41,731 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:29:41,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-12 20:29:41,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-12 20:29:41,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:29:41,732 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 9 states. [2018-11-12 20:29:42,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:29:42,144 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-11-12 20:29:42,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-12 20:29:42,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2018-11-12 20:29:42,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:29:42,149 INFO L225 Difference]: With dead ends: 79 [2018-11-12 20:29:42,149 INFO L226 Difference]: Without dead ends: 58 [2018-11-12 20:29:42,150 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-11-12 20:29:42,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-12 20:29:42,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 38. [2018-11-12 20:29:42,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-12 20:29:42,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-11-12 20:29:42,163 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 27 [2018-11-12 20:29:42,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:29:42,163 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-11-12 20:29:42,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-12 20:29:42,163 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-11-12 20:29:42,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-12 20:29:42,164 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:29:42,165 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-11-12 20:29:42,165 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:29:42,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:29:42,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1439664076, now seen corresponding path program 3 times [2018-11-12 20:29:42,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:29:42,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:42,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:29:42,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:42,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:29:42,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:29:42,413 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 20:29:42,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:29:42,414 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:29:42,414 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:29:42,414 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:29:42,414 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:29:42,414 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:29:42,426 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:29:42,426 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:29:42,475 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:29:42,475 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:29:42,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:29:42,500 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-11-12 20:29:42,501 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:42,507 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:42,507 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2018-11-12 20:29:42,896 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-12 20:29:43,045 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-12 20:29:43,045 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:43,052 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-11-12 20:29:43,057 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-11-12 20:29:43,057 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:43,073 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:43,102 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:43,102 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2018-11-12 20:29:43,409 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-11-12 20:29:43,414 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:43,415 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-11-12 20:29:43,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:43,428 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:43,430 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-12 20:29:43,431 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:43,450 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:43,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:43,461 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2018-11-12 20:29:43,516 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 20:29:43,516 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:29:43,872 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-11-12 20:29:44,008 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2018-11-12 20:29:44,012 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 31 [2018-11-12 20:29:44,013 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:44,051 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-11-12 20:29:44,053 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:44,129 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:29:44,226 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-11-12 20:29:44,311 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-11-12 20:29:44,312 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:44,355 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-11-12 20:29:44,356 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:44,579 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:29:44,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:29:44,638 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:120, output treesize:95 [2018-11-12 20:29:44,904 WARN L179 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 20 [2018-11-12 20:29:45,264 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 20:29:45,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:29:45,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 15, 14] total 31 [2018-11-12 20:29:45,285 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:29:45,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-12 20:29:45,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-12 20:29:45,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=804, Unknown=0, NotChecked=0, Total=930 [2018-11-12 20:29:45,287 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 20 states. [2018-11-12 20:29:46,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:29:46,319 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2018-11-12 20:29:46,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-12 20:29:46,319 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2018-11-12 20:29:46,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:29:46,320 INFO L225 Difference]: With dead ends: 54 [2018-11-12 20:29:46,320 INFO L226 Difference]: Without dead ends: 42 [2018-11-12 20:29:46,322 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=251, Invalid=1309, Unknown=0, NotChecked=0, Total=1560 [2018-11-12 20:29:46,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-12 20:29:46,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-12 20:29:46,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-12 20:29:46,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-11-12 20:29:46,329 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 33 [2018-11-12 20:29:46,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:29:46,329 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-11-12 20:29:46,329 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-12 20:29:46,330 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-12 20:29:46,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-12 20:29:46,331 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:29:46,331 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-11-12 20:29:46,331 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:29:46,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:29:46,332 INFO L82 PathProgramCache]: Analyzing trace with hash -2091215382, now seen corresponding path program 4 times [2018-11-12 20:29:46,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:29:46,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:46,334 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:29:46,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:46,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:29:46,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:29:46,656 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 20:29:46,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:29:46,657 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:29:46,657 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:29:46,657 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:29:46,657 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:29:46,657 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:29:46,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:29:46,667 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:29:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:29:46,702 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:29:46,806 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-12 20:29:46,823 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-11-12 20:29:46,824 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:46,834 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:46,835 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-12 20:29:47,515 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-12 20:29:47,515 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:47,521 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-11-12 20:29:47,542 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-11-12 20:29:47,543 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:47,557 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:47,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:47,570 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2018-11-12 20:29:47,815 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-11-12 20:29:47,825 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:47,828 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-11-12 20:29:47,828 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:47,838 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:47,839 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-11-12 20:29:47,839 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:47,843 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:47,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:47,855 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2018-11-12 20:29:47,907 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:29:47,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:29:48,330 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-11-12 20:29:48,408 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-11-12 20:29:48,409 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:48,473 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-11-12 20:29:48,474 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:48,505 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:29:48,566 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-11-12 20:29:48,641 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-11-12 20:29:48,642 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:48,709 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-11-12 20:29:48,710 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:48,740 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:29:48,801 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:29:48,802 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:120, output treesize:95 [2018-11-12 20:29:49,278 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-12 20:29:49,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:29:49,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 18, 16] total 37 [2018-11-12 20:29:49,299 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:29:49,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-12 20:29:49,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-12 20:29:49,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1161, Unknown=0, NotChecked=0, Total=1332 [2018-11-12 20:29:49,301 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 24 states. [2018-11-12 20:29:51,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:29:51,021 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-11-12 20:29:51,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-12 20:29:51,021 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 36 [2018-11-12 20:29:51,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:29:51,023 INFO L225 Difference]: With dead ends: 76 [2018-11-12 20:29:51,024 INFO L226 Difference]: Without dead ends: 64 [2018-11-12 20:29:51,026 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=427, Invalid=2225, Unknown=0, NotChecked=0, Total=2652 [2018-11-12 20:29:51,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-12 20:29:51,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 44. [2018-11-12 20:29:51,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-12 20:29:51,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 46 transitions. [2018-11-12 20:29:51,036 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 46 transitions. Word has length 36 [2018-11-12 20:29:51,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:29:51,036 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 46 transitions. [2018-11-12 20:29:51,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-12 20:29:51,036 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 46 transitions. [2018-11-12 20:29:51,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-12 20:29:51,038 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:29:51,038 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-11-12 20:29:51,038 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:29:51,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:29:51,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1817864972, now seen corresponding path program 5 times [2018-11-12 20:29:51,039 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:29:51,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:51,040 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:29:51,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:51,040 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:29:51,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:29:51,391 WARN L179 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-11-12 20:29:51,468 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:29:51,468 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:29:51,468 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:29:51,468 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:29:51,469 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:29:51,469 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:29:51,469 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:29:51,478 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-12 20:29:51,478 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-12 20:29:51,509 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-12 20:29:51,509 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:29:51,512 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:29:51,575 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:29:51,575 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:29:51,632 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:29:51,652 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:29:51,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2018-11-12 20:29:51,652 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:29:51,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-12 20:29:51,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-12 20:29:51,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:29:51,654 INFO L87 Difference]: Start difference. First operand 44 states and 46 transitions. Second operand 8 states. [2018-11-12 20:29:51,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:29:51,735 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2018-11-12 20:29:51,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-12 20:29:51,736 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2018-11-12 20:29:51,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:29:51,737 INFO L225 Difference]: With dead ends: 78 [2018-11-12 20:29:51,737 INFO L226 Difference]: Without dead ends: 48 [2018-11-12 20:29:51,738 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2018-11-12 20:29:51,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-12 20:29:51,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-11-12 20:29:51,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-12 20:29:51,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2018-11-12 20:29:51,746 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 39 [2018-11-12 20:29:51,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:29:51,747 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2018-11-12 20:29:51,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-12 20:29:51,747 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2018-11-12 20:29:51,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-12 20:29:51,748 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:29:51,748 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-11-12 20:29:51,749 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:29:51,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:29:51,749 INFO L82 PathProgramCache]: Analyzing trace with hash 905430727, now seen corresponding path program 6 times [2018-11-12 20:29:51,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:29:51,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:51,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:29:51,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:51,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:29:51,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:29:52,016 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-12 20:29:52,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:29:52,017 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:29:52,017 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:29:52,017 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:29:52,017 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:29:52,017 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:29:52,026 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-12 20:29:52,026 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-12 20:29:52,055 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-12 20:29:52,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-12 20:29:52,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:29:52,104 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-11-12 20:29:52,105 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:52,113 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:52,113 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-12 20:29:52,727 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-12 20:29:52,727 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:52,735 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-11-12 20:29:52,739 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-11-12 20:29:52,739 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:52,755 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:52,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:52,770 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:99, output treesize:45 [2018-11-12 20:29:53,006 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-11-12 20:29:53,009 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:53,010 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 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-11-12 20:29:53,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:53,023 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:53,024 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-11-12 20:29:53,025 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:53,066 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:53,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:53,077 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:61, output treesize:3 [2018-11-12 20:29:53,137 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-12 20:29:53,138 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:29:53,420 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-11-12 20:29:53,557 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 33 [2018-11-12 20:29:53,560 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-11-12 20:29:53,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:53,595 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-11-12 20:29:53,596 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:53,653 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:29:53,706 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-11-12 20:29:53,797 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 31 [2018-11-12 20:29:53,798 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:53,859 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-11-12 20:29:53,860 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:53,895 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:29:53,953 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:29:53,953 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:120, output treesize:116 [2018-11-12 20:29:54,222 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-11-12 20:29:54,974 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-12 20:29:54,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:29:54,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 19, 18] total 38 [2018-11-12 20:29:54,995 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:29:54,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-12 20:29:54,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-12 20:29:54,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1234, Unknown=0, NotChecked=0, Total=1406 [2018-11-12 20:29:54,997 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand 23 states. [2018-11-12 20:29:56,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:29:56,296 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2018-11-12 20:29:56,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-12 20:29:56,296 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 42 [2018-11-12 20:29:56,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:29:56,298 INFO L225 Difference]: With dead ends: 99 [2018-11-12 20:29:56,298 INFO L226 Difference]: Without dead ends: 69 [2018-11-12 20:29:56,300 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 52 SyntacticMatches, 2 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 385 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=295, Invalid=1867, Unknown=0, NotChecked=0, Total=2162 [2018-11-12 20:29:56,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-12 20:29:56,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2018-11-12 20:29:56,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-12 20:29:56,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2018-11-12 20:29:56,312 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 42 [2018-11-12 20:29:56,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:29:56,312 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2018-11-12 20:29:56,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-12 20:29:56,312 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2018-11-12 20:29:56,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-12 20:29:56,313 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:29:56,313 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-11-12 20:29:56,314 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:29:56,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:29:56,314 INFO L82 PathProgramCache]: Analyzing trace with hash -907144054, now seen corresponding path program 7 times [2018-11-12 20:29:56,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:29:56,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:56,315 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-12 20:29:56,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:29:56,315 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:29:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:29:56,614 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 43 proven. 14 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-12 20:29:56,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:29:56,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:29:56,614 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-12 20:29:56,614 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-12 20:29:56,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:29:56,614 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:29:56,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:29:56,623 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:29:56,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:29:56,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:29:56,665 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-11-12 20:29:56,665 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:56,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:56,672 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-12 20:29:57,223 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-11-12 20:29:57,226 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-11-12 20:29:57,226 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:57,239 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:57,241 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-12 20:29:57,242 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:57,256 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:57,256 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:93, output treesize:42 [2018-11-12 20:29:57,513 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-11-12 20:29:57,515 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:57,516 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-11-12 20:29:57,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:57,524 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:29:57,525 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-11-12 20:29:57,526 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:57,530 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:57,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:29:57,541 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:65, output treesize:3 [2018-11-12 20:29:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-12 20:29:57,618 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:29:58,189 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-11-12 20:29:58,273 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-11-12 20:29:58,274 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:58,339 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-11-12 20:29:58,340 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:58,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:29:58,434 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-11-12 20:29:58,511 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-11-12 20:29:58,512 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:58,970 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-11-12 20:29:58,971 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-12 20:29:59,045 INFO L267 ElimStorePlain]: Start of recursive call 5: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:29:59,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:29:59,105 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 4 variables, input treesize:120, output treesize:95 [2018-11-12 20:29:59,938 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-12 20:29:59,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:29:59,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 24, 20] total 48 [2018-11-12 20:29:59,969 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:29:59,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-12 20:29:59,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-12 20:29:59,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=1974, Unknown=0, NotChecked=0, Total=2256 [2018-11-12 20:29:59,971 INFO L87 Difference]: Start difference. First operand 61 states and 64 transitions. Second operand 31 states. [2018-11-12 20:30:00,988 WARN L179 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 20 [2018-11-12 20:30:02,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:30:02,933 INFO L93 Difference]: Finished difference Result 90 states and 96 transitions. [2018-11-12 20:30:02,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-12 20:30:02,935 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 48 [2018-11-12 20:30:02,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:30:02,936 INFO L225 Difference]: With dead ends: 90 [2018-11-12 20:30:02,936 INFO L226 Difference]: Without dead ends: 75 [2018-11-12 20:30:02,939 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 812 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=603, Invalid=3429, Unknown=0, NotChecked=0, Total=4032 [2018-11-12 20:30:02,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-12 20:30:02,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 57. [2018-11-12 20:30:02,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-12 20:30:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-12 20:30:02,950 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 48 [2018-11-12 20:30:02,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:30:02,950 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-12 20:30:02,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-12 20:30:02,951 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-12 20:30:02,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-12 20:30:02,952 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:30:02,952 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-12 20:30:02,952 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:30:02,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:02,952 INFO L82 PathProgramCache]: Analyzing trace with hash 1761081364, now seen corresponding path program 1 times [2018-11-12 20:30:02,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:30:02,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:02,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:02,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:30:02,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:30:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:03,239 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2018-11-12 20:30:03,239 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:03,239 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-12 20:30:03,239 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 55 with the following transitions: [2018-11-12 20:30:03,240 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-11-12 20:30:03,242 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, IntervalDomain] [2018-11-12 20:30:03,242 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-12 20:30:03,252 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-12 20:30:03,640 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-12 20:30:03,640 INFO L272 AbstractInterpreter]: Visited 27 different actions 193 times. Merged at 13 different actions 102 times. Widened at 3 different actions 12 times. Performed 878 root evaluator evaluations with a maximum evaluation depth of 6. Performed 878 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 17 fixpoints after 5 different actions. Largest state had 26 variables. [2018-11-12 20:30:03,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:30:03,678 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-12 20:30:03,678 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-12 20:30:03,678 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-12 20:30:03,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:30:03,692 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-12 20:30:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:30:03,735 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-12 20:30:03,880 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-11-12 20:30:03,895 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-11-12 20:30:03,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:04,001 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:04,002 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:14 [2018-11-12 20:30:04,736 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-11-12 20:30:04,749 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-11-12 20:30:04,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:04,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:04,776 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-11-12 20:30:04,780 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-11-12 20:30:04,781 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:04,795 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:04,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:30:04,836 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:99, output treesize:91 [2018-11-12 20:30:05,010 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-12 20:30:05,010 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:05,037 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 36 treesize of output 35 [2018-11-12 20:30:05,044 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:05,047 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 31 treesize of output 40 [2018-11-12 20:30:05,047 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:05,056 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:05,076 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:05,076 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:131, output treesize:61 [2018-11-12 20:30:09,781 WARN L854 $PredicateComparison]: unable to prove that (exists ((v_prenex_27 Int) (|v_main_~#str2~0.base_BEFORE_CALL_1| Int) (|v_main_~#str1~0.base_BEFORE_CALL_1| Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#str2~0.base_BEFORE_CALL_1|)) (.cse0 (select |c_#memory_int| |v_main_~#str1~0.base_BEFORE_CALL_1|)) (.cse1 (mod (+ v_prenex_27 4294967295) 4294967296))) (and (= (select .cse0 (+ .cse1 (- 3))) (select .cse2 3)) (<= .cse1 2147483647) (not (= |v_main_~#str2~0.base_BEFORE_CALL_1| |v_main_~#str1~0.base_BEFORE_CALL_1|)) (= (select .cse2 4) (select .cse0 (+ .cse1 (- 4)))) (<= .cse1 4) (<= 4 .cse1)))) is different from true [2018-11-12 20:30:11,827 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 34 [2018-11-12 20:30:13,876 WARN L179 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 35 [2018-11-12 20:30:14,103 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 55 treesize of output 47 [2018-11-12 20:30:14,119 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:14,120 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:14,121 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:14,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 41 [2018-11-12 20:30:14,125 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:14,146 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:14,148 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-11-12 20:30:14,148 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:14,160 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:14,169 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:14,169 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:80, output treesize:3 [2018-11-12 20:30:16,263 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 2 trivial. 1 not checked. [2018-11-12 20:30:16,264 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-12 20:30:19,088 WARN L179 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 70 [2018-11-12 20:30:19,118 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 141 [2018-11-12 20:30:19,123 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 139 treesize of output 111 [2018-11-12 20:30:19,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:19,206 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 77 [2018-11-12 20:30:19,207 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:19,292 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 144 treesize of output 126 [2018-11-12 20:30:19,316 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:19,316 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:19,318 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:19,338 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 3 new quantified variables, introduced 2 case distinctions, treesize of input 108 treesize of output 122 [2018-11-12 20:30:19,905 WARN L179 SmtUtils]: Spent 562.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 48 [2018-11-12 20:30:19,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 55 [2018-11-12 20:30:19,911 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:19,967 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:19,967 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:19,968 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 61 [2018-11-12 20:30:19,969 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:20,019 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:30:20,089 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:20,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 81 treesize of output 79 [2018-11-12 20:30:20,163 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:20,164 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:20,166 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:20,169 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 38 treesize of output 49 [2018-11-12 20:30:20,170 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:20,187 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:20,229 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:30:20,300 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 108 treesize of output 98 [2018-11-12 20:30:20,478 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 63 [2018-11-12 20:30:20,486 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:20,487 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:20,488 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 0 case distinctions, treesize of input 101 treesize of output 95 [2018-11-12 20:30:20,489 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:20,493 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:20,494 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:20,495 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 87 treesize of output 86 [2018-11-12 20:30:20,496 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:20,503 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:20,504 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:20,505 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:20,508 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 0 case distinctions, treesize of input 98 treesize of output 105 [2018-11-12 20:30:20,509 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:20,513 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:20,513 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 82 [2018-11-12 20:30:20,514 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:20,516 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:20,517 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 75 treesize of output 71 [2018-11-12 20:30:20,517 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:20,520 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:20,520 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:20,521 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:20,524 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 77 treesize of output 84 [2018-11-12 20:30:20,525 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:20,528 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:20,529 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:20,530 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 0 case distinctions, treesize of input 95 treesize of output 89 [2018-11-12 20:30:20,530 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:20,533 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:20,534 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:20,535 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 0 case distinctions, treesize of input 89 treesize of output 88 [2018-11-12 20:30:20,536 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:20,541 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:20,544 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:20,545 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 78 treesize of output 77 [2018-11-12 20:30:20,545 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:20,547 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:20,550 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:20,550 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 57 treesize of output 56 [2018-11-12 20:30:20,551 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:20,558 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:20,559 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:20,561 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 62 treesize of output 61 [2018-11-12 20:30:20,561 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:20,565 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:20,568 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:20,568 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 0 case distinctions, treesize of input 80 treesize of output 74 [2018-11-12 20:30:20,569 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:20,599 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:20,612 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:20,613 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 0 case distinctions, treesize of input 83 treesize of output 82 [2018-11-12 20:30:20,614 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:20,638 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:20,662 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:20,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 99 treesize of output 93 [2018-11-12 20:30:20,663 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:20,674 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:20,675 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:20,678 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:20,683 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 87 treesize of output 94 [2018-11-12 20:30:20,684 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:20,874 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 1 case distinctions, treesize of input 60 treesize of output 70 [2018-11-12 20:30:20,875 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 2 xjuncts. [2018-11-12 20:30:20,893 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 41 treesize of output 40 [2018-11-12 20:30:20,893 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:20,907 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-11-12 20:30:20,908 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:21,027 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:21,038 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:21,040 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:21,043 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 51 treesize of output 62 [2018-11-12 20:30:21,044 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:21,098 INFO L267 ElimStorePlain]: Start of recursive call 11: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:30:21,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:30:21,178 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 66 treesize of output 66 [2018-11-12 20:30:21,182 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 61 treesize of output 64 [2018-11-12 20:30:21,214 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-11-12 20:30:21,214 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:21,217 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:21,217 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:21,218 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-11-12 20:30:21,218 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:21,240 INFO L267 ElimStorePlain]: Start of recursive call 32: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:30:21,326 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 49 treesize of output 48 [2018-11-12 20:30:21,327 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:21,374 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:21,375 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:21,376 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:21,377 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:21,385 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 0 case distinctions, treesize of input 58 treesize of output 93 [2018-11-12 20:30:21,446 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 35 treesize of output 34 [2018-11-12 20:30:21,447 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:21,478 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 69 [2018-11-12 20:30:21,479 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 2 xjuncts. [2018-11-12 20:30:21,483 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 38 treesize of output 41 [2018-11-12 20:30:21,484 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:21,517 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:21,551 INFO L267 ElimStorePlain]: Start of recursive call 31: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:30:21,556 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 61 treesize of output 53 [2018-11-12 20:30:21,559 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:21,560 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:21,561 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:21,564 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 48 [2018-11-12 20:30:21,565 INFO L267 ElimStorePlain]: Start of recursive call 41: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-12 20:30:21,584 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-11-12 20:30:21,606 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-11-12 20:30:21,607 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:21,624 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-11-12 20:30:21,625 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:21,637 INFO L267 ElimStorePlain]: Start of recursive call 42: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:30:21,660 INFO L267 ElimStorePlain]: Start of recursive call 40: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:30:21,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 141 treesize of output 141 [2018-11-12 20:30:21,853 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:21,856 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:21,859 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:21,884 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 2 case distinctions, treesize of input 126 treesize of output 142 [2018-11-12 20:30:21,886 INFO L267 ElimStorePlain]: Start of recursive call 46: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-12 20:30:21,998 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 139 treesize of output 111 [2018-11-12 20:30:21,998 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:22,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 111 treesize of output 93 [2018-11-12 20:30:22,214 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2018-11-12 20:30:22,219 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:22,220 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:22,221 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 0 case distinctions, treesize of input 67 treesize of output 66 [2018-11-12 20:30:22,222 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:22,228 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:22,229 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 59 treesize of output 55 [2018-11-12 20:30:22,229 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:22,232 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:22,233 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:22,234 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 46 treesize of output 45 [2018-11-12 20:30:22,235 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:22,239 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:22,240 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:22,241 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 0 case distinctions, treesize of input 64 treesize of output 58 [2018-11-12 20:30:22,241 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:22,245 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:22,246 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 66 [2018-11-12 20:30:22,247 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:22,250 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:22,251 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:22,252 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 0 case distinctions, treesize of input 79 treesize of output 73 [2018-11-12 20:30:22,253 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:22,265 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:22,267 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:22,268 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 0 case distinctions, treesize of input 83 treesize of output 77 [2018-11-12 20:30:22,268 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:22,271 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:22,273 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:22,274 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 62 treesize of output 61 [2018-11-12 20:30:22,274 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:22,279 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:22,280 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:22,281 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 41 treesize of output 40 [2018-11-12 20:30:22,281 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:22,285 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:22,286 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:22,286 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 0 case distinctions, treesize of input 73 treesize of output 72 [2018-11-12 20:30:22,287 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:22,317 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:22,339 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:22,341 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 71 treesize of output 70 [2018-11-12 20:30:22,341 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:22,364 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:22,365 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:22,366 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:22,371 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 61 treesize of output 68 [2018-11-12 20:30:22,372 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:22,377 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:22,378 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:22,379 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:22,385 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 0 case distinctions, treesize of input 82 treesize of output 89 [2018-11-12 20:30:22,385 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:22,388 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:22,389 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:22,390 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:22,392 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 71 treesize of output 78 [2018-11-12 20:30:22,393 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:22,396 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:22,397 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:22,397 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 0 case distinctions, treesize of input 85 treesize of output 79 [2018-11-12 20:30:22,398 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:22,510 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 1 case distinctions, treesize of input 50 treesize of output 60 [2018-11-12 20:30:22,511 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 2 xjuncts. [2018-11-12 20:30:22,516 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 30 treesize of output 29 [2018-11-12 20:30:22,516 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:22,520 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 31 treesize of output 30 [2018-11-12 20:30:22,520 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:22,589 INFO L267 ElimStorePlain]: Start of recursive call 48: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:30:22,674 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 81 treesize of output 69 [2018-11-12 20:30:22,750 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:22,751 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:22,752 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:22,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 40 [2018-11-12 20:30:22,757 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:22,868 INFO L267 ElimStorePlain]: Start of recursive call 67: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:22,947 INFO L267 ElimStorePlain]: Start of recursive call 45: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:30:22,958 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 66 treesize of output 66 [2018-11-12 20:30:22,961 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 61 treesize of output 64 [2018-11-12 20:30:22,995 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:22,996 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:22,997 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-11-12 20:30:22,997 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:23,001 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-11-12 20:30:23,001 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:23,029 INFO L267 ElimStorePlain]: Start of recursive call 70: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:30:23,093 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:23,094 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:23,094 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:23,096 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:23,104 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 0 case distinctions, treesize of input 58 treesize of output 93 [2018-11-12 20:30:23,206 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 35 treesize of output 34 [2018-11-12 20:30:23,206 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:23,210 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 38 treesize of output 41 [2018-11-12 20:30:23,211 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:23,240 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 69 [2018-11-12 20:30:23,241 INFO L267 ElimStorePlain]: Start of recursive call 76: End of recursive call: and 2 xjuncts. [2018-11-12 20:30:23,276 INFO L267 ElimStorePlain]: Start of recursive call 73: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-12 20:30:23,427 INFO L267 ElimStorePlain]: Start of recursive call 69: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:30:23,432 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 61 treesize of output 53 [2018-11-12 20:30:23,435 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:23,435 INFO L682 Elim1Store]: detected equality via solver [2018-11-12 20:30:23,436 INFO L700 Elim1Store]: detected not equals via solver [2018-11-12 20:30:23,439 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 48 [2018-11-12 20:30:23,440 INFO L267 ElimStorePlain]: Start of recursive call 78: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-12 20:30:23,461 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-11-12 20:30:23,481 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-11-12 20:30:23,482 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:23,484 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-11-12 20:30:23,485 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 1 xjuncts. [2018-11-12 20:30:23,497 INFO L267 ElimStorePlain]: Start of recursive call 79: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:30:23,522 INFO L267 ElimStorePlain]: Start of recursive call 77: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-12 20:30:23,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-11-12 20:30:23,599 INFO L202 ElimStorePlain]: Needed 81 recursive calls to eliminate 2 variables, input treesize:239, output treesize:135 [2018-11-12 20:30:24,469 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 2 proven. 43 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-12 20:30:24,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-12 20:30:24,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 27, 20] total 50 [2018-11-12 20:30:24,490 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-12 20:30:24,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-12 20:30:24,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-12 20:30:24,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=2097, Unknown=4, NotChecked=94, Total=2450 [2018-11-12 20:30:24,492 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 33 states. [2018-11-12 20:30:25,545 WARN L179 SmtUtils]: Spent 659.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 26 [2018-11-12 20:30:26,499 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 40 [2018-11-12 20:30:27,741 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 40 [2018-11-12 20:30:30,456 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 42 [2018-11-12 20:30:32,123 WARN L179 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 72 DAG size of output: 48 [2018-11-12 20:30:34,310 WARN L179 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 68 DAG size of output: 51 [2018-11-12 20:30:41,273 WARN L179 SmtUtils]: Spent 2.09 s on a formula simplification that was a NOOP. DAG size: 59 [2018-11-12 20:30:42,702 WARN L179 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-11-12 20:30:49,130 WARN L179 SmtUtils]: Spent 4.01 s on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2018-11-12 20:30:53,212 WARN L179 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2018-11-12 20:30:53,860 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 52 [2018-11-12 20:30:54,339 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 37 [2018-11-12 20:30:59,371 WARN L179 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-11-12 20:31:00,464 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-11-12 20:31:00,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-12 20:31:00,486 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-11-12 20:31:00,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-12 20:31:00,486 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 54 [2018-11-12 20:31:00,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-12 20:31:00,487 INFO L225 Difference]: With dead ends: 120 [2018-11-12 20:31:00,487 INFO L226 Difference]: Without dead ends: 83 [2018-11-12 20:31:00,490 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 75 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 45.2s TimeCoverageRelationStatistics Valid=717, Invalid=4980, Unknown=7, NotChecked=148, Total=5852 [2018-11-12 20:31:00,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-11-12 20:31:00,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 69. [2018-11-12 20:31:00,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-12 20:31:00,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-11-12 20:31:00,507 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 54 [2018-11-12 20:31:00,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-12 20:31:00,507 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-11-12 20:31:00,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-12 20:31:00,507 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-11-12 20:31:00,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-12 20:31:00,508 INFO L367 BasicCegarLoop]: Found error trace [2018-11-12 20:31:00,509 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-11-12 20:31:00,510 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-12 20:31:00,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-12 20:31:00,510 INFO L82 PathProgramCache]: Analyzing trace with hash -925373209, now seen corresponding path program 2 times [2018-11-12 20:31:00,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-12 20:31:00,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:00,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-12 20:31:00,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-12 20:31:00,513 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-12 20:31:00,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-12 20:31:00,915 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-11-12 20:31:01,531 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 31 [2018-11-12 20:31:01,618 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ClassCastException: [Ljava.lang.Object; cannot be cast to [Lde.uni_freiburg.informatik.ultimate.logic.Term; at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.unaryNumericMinus(SmtUtils.java:578) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.termWithLocalSimplification(SmtUtils.java:1272) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubstitutionWithLocalSimplification.convertApplicationTerm(SubstitutionWithLocalSimplification.java:57) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$BuildApplicationTerm.walk(TermTransformer.java:320) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.IteRemover.removeIteTerm(IteRemover.java:87) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.IteRemover.transformNonCoreBooleanSubterm(IteRemover.java:66) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.NonCoreBooleanSubTermTransformer$NonCoreBooleanSubtermTransformerHelper.convert(NonCoreBooleanSubTermTransformer.java:97) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.NonCoreBooleanSubTermTransformer.transform(NonCoreBooleanSubTermTransformer.java:49) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:583) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getTraceCheck(BaseTaipanRefinementStrategy.java:214) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-12 20:31:01,622 INFO L168 Benchmark]: Toolchain (without parser) took 87323.96 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.8 GB in the end (delta: -387.7 MB). Peak memory consumption was 728.0 MB. Max. memory is 7.1 GB. [2018-11-12 20:31:01,623 INFO L168 Benchmark]: CDTParser took 2.66 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:31:01,623 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.86 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-12 20:31:01,623 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.50 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:31:01,624 INFO L168 Benchmark]: Boogie Preprocessor took 43.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-12 20:31:01,624 INFO L168 Benchmark]: RCFGBuilder took 588.52 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -783.7 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-12 20:31:01,624 INFO L168 Benchmark]: TraceAbstraction took 86349.46 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 374.3 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 385.4 MB). Peak memory consumption was 759.8 MB. Max. memory is 7.1 GB. [2018-11-12 20:31:01,626 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.66 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 307.86 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 26.50 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 43.29 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 588.52 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 741.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -783.7 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 86349.46 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 374.3 MB). Free memory was 2.2 GB in the beginning and 1.8 GB in the end (delta: 385.4 MB). Peak memory consumption was 759.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ClassCastException: [Ljava.lang.Object; cannot be cast to [Lde.uni_freiburg.informatik.ultimate.logic.Term; de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ClassCastException: [Ljava.lang.Object; cannot be cast to [Lde.uni_freiburg.informatik.ultimate.logic.Term;: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SmtUtils.unaryNumericMinus(SmtUtils.java:578) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...