java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf -i ../../../trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-dd2f093 [2018-07-24 10:44:14,593 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-24 10:44:14,595 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-24 10:44:14,607 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-24 10:44:14,608 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-24 10:44:14,609 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-24 10:44:14,610 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-24 10:44:14,613 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-24 10:44:14,615 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-24 10:44:14,616 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-24 10:44:14,617 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-24 10:44:14,618 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-24 10:44:14,620 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-24 10:44:14,621 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-24 10:44:14,624 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-24 10:44:14,625 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-24 10:44:14,626 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-24 10:44:14,628 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-24 10:44:14,630 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-24 10:44:14,632 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-24 10:44:14,633 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-24 10:44:14,634 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-24 10:44:14,636 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-24 10:44:14,636 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-24 10:44:14,637 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-24 10:44:14,638 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-24 10:44:14,639 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-24 10:44:14,639 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-24 10:44:14,640 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-24 10:44:14,641 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-24 10:44:14,642 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-24 10:44:14,642 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-24 10:44:14,643 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-24 10:44:14,643 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-24 10:44:14,644 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-24 10:44:14,645 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-24 10:44:14,645 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/taipanbench/svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf [2018-07-24 10:44:14,660 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-24 10:44:14,661 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-24 10:44:14,661 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-07-24 10:44:14,662 INFO L133 SettingsManager]: * User list type=DISABLED [2018-07-24 10:44:14,662 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-07-24 10:44:14,662 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-07-24 10:44:14,662 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-07-24 10:44:14,662 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-07-24 10:44:14,663 INFO L133 SettingsManager]: * Log string format=TERM [2018-07-24 10:44:14,663 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-07-24 10:44:14,663 INFO L133 SettingsManager]: * Interval Domain=false [2018-07-24 10:44:14,664 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-07-24 10:44:14,664 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-07-24 10:44:14,664 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-07-24 10:44:14,664 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-07-24 10:44:14,664 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-07-24 10:44:14,665 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-07-24 10:44:14,665 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-07-24 10:44:14,665 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-07-24 10:44:14,665 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-24 10:44:14,665 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-07-24 10:44:14,666 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-07-24 10:44:14,666 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-07-24 10:44:14,666 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-07-24 10:44:14,666 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-24 10:44:14,667 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-07-24 10:44:14,667 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-07-24 10:44:14,667 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-07-24 10:44:14,667 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-07-24 10:44:14,667 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-07-24 10:44:14,667 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-24 10:44:14,668 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-07-24 10:44:14,668 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-07-24 10:44:14,719 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-24 10:44:14,736 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-24 10:44:14,742 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-24 10:44:14,744 INFO L271 PluginConnector]: Initializing CDTParser... [2018-07-24 10:44:14,744 INFO L276 PluginConnector]: CDTParser initialized [2018-07-24 10:44:14,745 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-07-24 10:44:15,086 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed52918ff/d57f807493234998b0a33fa76fccb5eb/FLAG336176679 [2018-07-24 10:44:15,241 INFO L276 CDTParser]: Found 1 translation units. [2018-07-24 10:44:15,242 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-07-24 10:44:15,250 INFO L324 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed52918ff/d57f807493234998b0a33fa76fccb5eb/FLAG336176679 [2018-07-24 10:44:15,265 INFO L332 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed52918ff/d57f807493234998b0a33fa76fccb5eb [2018-07-24 10:44:15,277 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-24 10:44:15,278 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-07-24 10:44:15,279 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-07-24 10:44:15,280 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-07-24 10:44:15,286 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-07-24 10:44:15,288 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 10:44:15" (1/1) ... [2018-07-24 10:44:15,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37282a51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:44:15, skipping insertion in model container [2018-07-24 10:44:15,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.07 10:44:15" (1/1) ... [2018-07-24 10:44:15,486 INFO L179 PRDispatcher]: Starting pre-run dispatcher in SV-COMP mode [2018-07-24 10:44:15,533 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 10:44:15,554 INFO L422 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-07-24 10:44:15,566 INFO L175 PostProcessor]: Settings: Checked method=main [2018-07-24 10:44:15,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:44:15 WrapperNode [2018-07-24 10:44:15,584 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-07-24 10:44:15,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-24 10:44:15,586 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-24 10:44:15,586 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-24 10:44:15,595 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:44:15" (1/1) ... [2018-07-24 10:44:15,603 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:44:15" (1/1) ... [2018-07-24 10:44:15,609 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-24 10:44:15,610 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-24 10:44:15,610 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-24 10:44:15,610 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-24 10:44:15,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:44:15" (1/1) ... [2018-07-24 10:44:15,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:44:15" (1/1) ... [2018-07-24 10:44:15,620 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:44:15" (1/1) ... [2018-07-24 10:44:15,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:44:15" (1/1) ... [2018-07-24 10:44:15,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:44:15" (1/1) ... [2018-07-24 10:44:15,630 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:44:15" (1/1) ... [2018-07-24 10:44:15,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:44:15" (1/1) ... [2018-07-24 10:44:15,634 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-24 10:44:15,634 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-24 10:44:15,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-24 10:44:15,634 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-24 10:44:15,637 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:44:15" (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-07-24 10:44:15,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-07-24 10:44:15,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-07-24 10:44:15,707 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort [2018-07-24 10:44:15,708 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort [2018-07-24 10:44:15,708 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-24 10:44:15,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-24 10:44:15,708 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-07-24 10:44:15,708 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-07-24 10:44:15,709 INFO L130 BoogieDeclarations]: Found specification of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assert [2018-07-24 10:44:15,711 INFO L138 BoogieDeclarations]: Found implementation of procedure __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assert [2018-07-24 10:44:16,189 INFO L261 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-24 10:44:16,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 10:44:16 BoogieIcfgContainer [2018-07-24 10:44:16,190 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-24 10:44:16,191 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-24 10:44:16,191 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-24 10:44:16,194 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-24 10:44:16,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.07 10:44:15" (1/3) ... [2018-07-24 10:44:16,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23414f08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 10:44:16, skipping insertion in model container [2018-07-24 10:44:16,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.07 10:44:15" (2/3) ... [2018-07-24 10:44:16,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23414f08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.07 10:44:16, skipping insertion in model container [2018-07-24 10:44:16,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.07 10:44:16" (3/3) ... [2018-07-24 10:44:16,198 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05_true-unreach-call_true-termination.i [2018-07-24 10:44:16,208 INFO L132 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-07-24 10:44:16,216 INFO L144 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-24 10:44:16,266 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-24 10:44:16,267 INFO L373 AbstractCegarLoop]: Interprodecural is true [2018-07-24 10:44:16,267 INFO L374 AbstractCegarLoop]: Hoare is true [2018-07-24 10:44:16,267 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-07-24 10:44:16,267 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-24 10:44:16,267 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-24 10:44:16,267 INFO L378 AbstractCegarLoop]: Difference is false [2018-07-24 10:44:16,267 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-24 10:44:16,268 INFO L384 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-24 10:44:16,284 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-07-24 10:44:16,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-07-24 10:44:16,291 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:44:16,292 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:44:16,292 INFO L414 AbstractCegarLoop]: === Iteration 1 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:44:16,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1318846397, now seen corresponding path program 1 times [2018-07-24 10:44:16,302 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:44:16,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:44:16,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:44:16,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:44:16,358 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:44:16,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:44:16,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:44:16,445 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 10:44:16,446 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-24 10:44:16,446 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 10:44:16,452 INFO L450 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-07-24 10:44:16,468 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-07-24 10:44:16,469 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-07-24 10:44:16,472 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-07-24 10:44:16,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:44:16,495 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2018-07-24 10:44:16,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-07-24 10:44:16,497 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-07-24 10:44:16,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:44:16,508 INFO L225 Difference]: With dead ends: 63 [2018-07-24 10:44:16,510 INFO L226 Difference]: Without dead ends: 32 [2018-07-24 10:44:16,516 INFO L573 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-07-24 10:44:16,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-07-24 10:44:16,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-07-24 10:44:16,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-07-24 10:44:16,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-07-24 10:44:16,553 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2018-07-24 10:44:16,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:44:16,553 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-07-24 10:44:16,553 INFO L472 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-07-24 10:44:16,553 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-07-24 10:44:16,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-07-24 10:44:16,555 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:44:16,555 INFO L353 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:44:16,555 INFO L414 AbstractCegarLoop]: === Iteration 2 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:44:16,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1884353144, now seen corresponding path program 1 times [2018-07-24 10:44:16,556 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:44:16,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:44:16,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:44:16,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:44:16,558 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:44:16,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:44:16,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-24 10:44:16,628 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 10:44:16,628 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-07-24 10:44:16,628 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 10:44:16,630 INFO L450 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-24 10:44:16,630 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-24 10:44:16,631 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-24 10:44:16,631 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 3 states. [2018-07-24 10:44:16,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:44:16,692 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-07-24 10:44:16,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-24 10:44:16,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-07-24 10:44:16,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:44:16,694 INFO L225 Difference]: With dead ends: 58 [2018-07-24 10:44:16,694 INFO L226 Difference]: Without dead ends: 35 [2018-07-24 10:44:16,695 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-07-24 10:44:16,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-24 10:44:16,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-07-24 10:44:16,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-07-24 10:44:16,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-07-24 10:44:16,704 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 21 [2018-07-24 10:44:16,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:44:16,704 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-07-24 10:44:16,704 INFO L472 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-24 10:44:16,705 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-07-24 10:44:16,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-24 10:44:16,706 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:44:16,706 INFO L353 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:44:16,706 INFO L414 AbstractCegarLoop]: === Iteration 3 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:44:16,706 INFO L82 PathProgramCache]: Analyzing trace with hash 362283247, now seen corresponding path program 1 times [2018-07-24 10:44:16,707 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:44:16,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:44:16,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:44:16,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:44:16,708 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:44:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:44:16,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-24 10:44:16,839 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-24 10:44:16,839 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-07-24 10:44:16,839 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 10:44:16,840 INFO L450 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-24 10:44:16,840 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-24 10:44:16,840 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-24 10:44:16,841 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2018-07-24 10:44:17,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:44:17,056 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-07-24 10:44:17,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-24 10:44:17,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-07-24 10:44:17,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:44:17,059 INFO L225 Difference]: With dead ends: 55 [2018-07-24 10:44:17,059 INFO L226 Difference]: Without dead ends: 42 [2018-07-24 10:44:17,059 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-07-24 10:44:17,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-07-24 10:44:17,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2018-07-24 10:44:17,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-07-24 10:44:17,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-07-24 10:44:17,067 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 24 [2018-07-24 10:44:17,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:44:17,067 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-07-24 10:44:17,068 INFO L472 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-24 10:44:17,068 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-07-24 10:44:17,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-24 10:44:17,069 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:44:17,069 INFO L353 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, 1, 1, 1, 1, 1, 1] [2018-07-24 10:44:17,069 INFO L414 AbstractCegarLoop]: === Iteration 4 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:44:17,070 INFO L82 PathProgramCache]: Analyzing trace with hash -314923675, now seen corresponding path program 1 times [2018-07-24 10:44:17,070 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:44:17,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:44:17,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:44:17,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:44:17,071 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:44:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:44:17,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-24 10:44:17,413 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:44:17,413 INFO L191 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-07-24 10:44:17,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:44:17,432 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:44:17,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:44:17,493 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:44:17,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-24 10:44:17,723 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:44:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-24 10:44:17,820 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:44:17,820 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 10:44:17,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:44:17,839 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:44:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:44:17,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:44:17,876 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-24 10:44:17,876 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:44:17,958 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-07-24 10:44:17,962 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:44:17,962 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 4, 4] total 11 [2018-07-24 10:44:17,962 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:44:17,963 INFO L450 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-24 10:44:17,963 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-24 10:44:17,964 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-07-24 10:44:17,965 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 9 states. [2018-07-24 10:44:18,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:44:18,340 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2018-07-24 10:44:18,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 10:44:18,342 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-07-24 10:44:18,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:44:18,344 INFO L225 Difference]: With dead ends: 75 [2018-07-24 10:44:18,344 INFO L226 Difference]: Without dead ends: 50 [2018-07-24 10:44:18,345 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-07-24 10:44:18,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-07-24 10:44:18,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2018-07-24 10:44:18,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-24 10:44:18,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-07-24 10:44:18,352 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 30 [2018-07-24 10:44:18,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:44:18,353 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-07-24 10:44:18,353 INFO L472 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-24 10:44:18,353 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-07-24 10:44:18,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-07-24 10:44:18,354 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:44:18,355 INFO L353 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:44:18,355 INFO L414 AbstractCegarLoop]: === Iteration 5 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:44:18,355 INFO L82 PathProgramCache]: Analyzing trace with hash -885797851, now seen corresponding path program 1 times [2018-07-24 10:44:18,355 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:44:18,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:44:18,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:44:18,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:44:18,357 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:44:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:44:18,555 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-07-24 10:44:18,558 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:44:18,558 INFO L191 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-07-24 10:44:18,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:44:18,576 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:44:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:44:18,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:44:18,849 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-07-24 10:44:18,849 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:44:18,927 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-07-24 10:44:18,948 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:44:18,948 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 10:44:18,963 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:44:18,964 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:44:18,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:44:18,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:44:19,158 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-07-24 10:44:19,159 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:44:19,305 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-07-24 10:44:19,307 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:44:19,307 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 6] total 17 [2018-07-24 10:44:19,308 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:44:19,308 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-24 10:44:19,308 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-24 10:44:19,309 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-07-24 10:44:19,310 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-07-24 10:44:19,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:44:19,532 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2018-07-24 10:44:19,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-24 10:44:19,533 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-07-24 10:44:19,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:44:19,534 INFO L225 Difference]: With dead ends: 78 [2018-07-24 10:44:19,535 INFO L226 Difference]: Without dead ends: 51 [2018-07-24 10:44:19,536 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 133 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2018-07-24 10:44:19,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-24 10:44:19,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-07-24 10:44:19,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-07-24 10:44:19,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-07-24 10:44:19,544 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 37 [2018-07-24 10:44:19,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:44:19,545 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-07-24 10:44:19,545 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-24 10:44:19,545 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-07-24 10:44:19,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-24 10:44:19,547 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:44:19,547 INFO L353 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:44:19,547 INFO L414 AbstractCegarLoop]: === Iteration 6 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:44:19,547 INFO L82 PathProgramCache]: Analyzing trace with hash 362380114, now seen corresponding path program 2 times [2018-07-24 10:44:19,548 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:44:19,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:44:19,549 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:44:19,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:44:19,549 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:44:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:44:19,722 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-07-24 10:44:19,722 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:44:19,722 INFO L191 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-07-24 10:44:19,732 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-24 10:44:19,732 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-24 10:44:19,766 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-24 10:44:19,767 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:44:19,771 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:44:19,858 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-07-24 10:44:19,859 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:44:19,923 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-07-24 10:44:19,945 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:44:19,946 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 10:44:19,961 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-24 10:44:19,961 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-24 10:44:20,005 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-24 10:44:20,006 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:44:20,012 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:44:20,282 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-07-24 10:44:20,282 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:44:20,463 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-07-24 10:44:20,465 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:44:20,465 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6, 6, 7] total 20 [2018-07-24 10:44:20,466 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:44:20,466 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-24 10:44:20,467 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-24 10:44:20,468 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2018-07-24 10:44:20,468 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 12 states. [2018-07-24 10:44:20,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:44:20,906 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2018-07-24 10:44:20,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-24 10:44:20,906 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-07-24 10:44:20,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:44:20,907 INFO L225 Difference]: With dead ends: 99 [2018-07-24 10:44:20,908 INFO L226 Difference]: Without dead ends: 66 [2018-07-24 10:44:20,909 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 167 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2018-07-24 10:44:20,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-07-24 10:44:20,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2018-07-24 10:44:20,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-24 10:44:20,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-07-24 10:44:20,919 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 46 [2018-07-24 10:44:20,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:44:20,920 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-07-24 10:44:20,920 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-24 10:44:20,920 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-07-24 10:44:20,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-07-24 10:44:20,922 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:44:20,922 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:44:20,922 INFO L414 AbstractCegarLoop]: === Iteration 7 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:44:20,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1400725330, now seen corresponding path program 3 times [2018-07-24 10:44:20,923 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:44:20,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:44:20,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 10:44:20,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:44:20,924 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:44:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:44:21,069 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-07-24 10:44:21,070 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:44:21,070 INFO L191 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-07-24 10:44:21,078 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-24 10:44:21,078 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-07-24 10:44:21,094 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-07-24 10:44:21,095 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:44:21,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:44:21,125 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 6 treesize of output 5 [2018-07-24 10:44:21,127 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:21,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:44:21,136 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-07-24 10:44:21,307 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-07-24 10:44:21,308 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:44:21,542 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-07-24 10:44:21,563 INFO L309 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-07-24 10:44:21,563 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [7] total 19 [2018-07-24 10:44:21,563 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 10:44:21,564 INFO L450 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-24 10:44:21,564 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-24 10:44:21,564 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-07-24 10:44:21,565 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 8 states. [2018-07-24 10:44:21,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:44:21,771 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-07-24 10:44:21,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-24 10:44:21,772 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-07-24 10:44:21,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:44:21,774 INFO L225 Difference]: With dead ends: 67 [2018-07-24 10:44:21,774 INFO L226 Difference]: Without dead ends: 65 [2018-07-24 10:44:21,775 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2018-07-24 10:44:21,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-24 10:44:21,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-07-24 10:44:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-07-24 10:44:21,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-07-24 10:44:21,787 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 53 [2018-07-24 10:44:21,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:44:21,788 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-07-24 10:44:21,788 INFO L472 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-24 10:44:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-07-24 10:44:21,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-07-24 10:44:21,789 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:44:21,789 INFO L353 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:44:21,790 INFO L414 AbstractCegarLoop]: === Iteration 8 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:44:21,790 INFO L82 PathProgramCache]: Analyzing trace with hash 389910769, now seen corresponding path program 1 times [2018-07-24 10:44:21,790 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:44:21,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:44:21,791 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 10:44:21,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:44:21,791 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:44:21,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:44:21,896 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-07-24 10:44:21,896 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:44:21,897 INFO L191 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-07-24 10:44:21,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:44:21,906 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:44:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:44:21,931 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:44:22,029 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-07-24 10:44:22,029 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:44:22,107 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-07-24 10:44:22,128 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:44:22,128 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 10:44:22,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:44:22,144 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:44:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:44:22,187 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:44:22,196 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-07-24 10:44:22,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:44:22,276 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-07-24 10:44:22,278 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:44:22,279 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 12 [2018-07-24 10:44:22,279 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:44:22,279 INFO L450 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-24 10:44:22,280 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-24 10:44:22,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-07-24 10:44:22,282 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 12 states. [2018-07-24 10:44:22,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:44:22,634 INFO L93 Difference]: Finished difference Result 134 states and 153 transitions. [2018-07-24 10:44:22,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-24 10:44:22,635 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-07-24 10:44:22,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:44:22,638 INFO L225 Difference]: With dead ends: 134 [2018-07-24 10:44:22,638 INFO L226 Difference]: Without dead ends: 90 [2018-07-24 10:44:22,639 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 232 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-07-24 10:44:22,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-07-24 10:44:22,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 77. [2018-07-24 10:44:22,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-24 10:44:22,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-07-24 10:44:22,656 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 61 [2018-07-24 10:44:22,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:44:22,657 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-07-24 10:44:22,657 INFO L472 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-24 10:44:22,657 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-07-24 10:44:22,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-24 10:44:22,658 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:44:22,658 INFO L353 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:44:22,659 INFO L414 AbstractCegarLoop]: === Iteration 9 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:44:22,659 INFO L82 PathProgramCache]: Analyzing trace with hash 962118901, now seen corresponding path program 2 times [2018-07-24 10:44:22,659 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:44:22,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:44:22,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:44:22,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:44:22,660 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:44:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:44:23,215 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-07-24 10:44:23,215 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:44:23,215 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 10:44:23,224 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-24 10:44:23,224 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-24 10:44:23,260 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-24 10:44:23,261 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:44:23,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:44:23,664 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-07-24 10:44:23,665 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:44:23,837 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-07-24 10:44:23,857 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:44:23,857 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 10:44:23,874 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-24 10:44:23,874 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-24 10:44:23,931 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-24 10:44:23,932 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:44:23,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:44:23,966 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-07-24 10:44:23,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:44:24,136 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-07-24 10:44:24,138 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:44:24,138 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8, 7, 8] total 18 [2018-07-24 10:44:24,138 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:44:24,139 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-24 10:44:24,139 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-24 10:44:24,140 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-07-24 10:44:24,140 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 13 states. [2018-07-24 10:44:24,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:44:24,483 INFO L93 Difference]: Finished difference Result 133 states and 152 transitions. [2018-07-24 10:44:24,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-24 10:44:24,485 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 74 [2018-07-24 10:44:24,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:44:24,493 INFO L225 Difference]: With dead ends: 133 [2018-07-24 10:44:24,494 INFO L226 Difference]: Without dead ends: 89 [2018-07-24 10:44:24,495 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 283 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2018-07-24 10:44:24,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-24 10:44:24,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2018-07-24 10:44:24,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-24 10:44:24,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2018-07-24 10:44:24,518 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 74 [2018-07-24 10:44:24,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:44:24,519 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2018-07-24 10:44:24,519 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-24 10:44:24,519 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2018-07-24 10:44:24,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-24 10:44:24,520 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:44:24,524 INFO L353 BasicCegarLoop]: trace histogram [7, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:44:24,525 INFO L414 AbstractCegarLoop]: === Iteration 10 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:44:24,525 INFO L82 PathProgramCache]: Analyzing trace with hash -341375796, now seen corresponding path program 3 times [2018-07-24 10:44:24,525 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:44:24,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:44:24,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 10:44:24,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:44:24,526 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:44:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:44:25,208 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 36 proven. 34 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-07-24 10:44:25,208 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:44:25,208 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 10:44:25,217 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-24 10:44:25,217 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-07-24 10:44:25,248 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-07-24 10:44:25,249 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:44:25,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:44:25,259 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 6 treesize of output 5 [2018-07-24 10:44:25,259 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:25,263 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:44:25,263 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-07-24 10:44:25,363 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:25,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 21 [2018-07-24 10:44:25,365 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:25,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:44:25,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-07-24 10:44:25,725 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 25 proven. 11 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-07-24 10:44:25,725 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:44:25,990 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-07-24 10:44:26,010 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:44:26,011 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 10:44:26,028 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-24 10:44:26,029 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-07-24 10:44:26,111 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-07-24 10:44:26,111 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:44:26,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:44:26,130 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 6 treesize of output 5 [2018-07-24 10:44:26,130 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:26,156 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:44:26,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-07-24 10:44:26,163 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:26,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 21 [2018-07-24 10:44:26,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:26,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:44:26,178 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-07-24 10:44:26,264 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-07-24 10:44:26,265 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:44:26,286 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-07-24 10:44:26,288 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:44:26,288 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 11, 11, 11] total 26 [2018-07-24 10:44:26,288 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:44:26,288 INFO L450 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-24 10:44:26,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-24 10:44:26,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2018-07-24 10:44:26,290 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 19 states. [2018-07-24 10:44:27,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:44:27,383 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2018-07-24 10:44:27,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-24 10:44:27,387 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2018-07-24 10:44:27,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:44:27,388 INFO L225 Difference]: With dead ends: 154 [2018-07-24 10:44:27,388 INFO L226 Difference]: Without dead ends: 110 [2018-07-24 10:44:27,390 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 302 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=265, Invalid=1627, Unknown=0, NotChecked=0, Total=1892 [2018-07-24 10:44:27,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-07-24 10:44:27,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2018-07-24 10:44:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-24 10:44:27,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2018-07-24 10:44:27,404 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 78 [2018-07-24 10:44:27,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:44:27,405 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2018-07-24 10:44:27,405 INFO L472 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-24 10:44:27,405 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2018-07-24 10:44:27,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-24 10:44:27,406 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:44:27,407 INFO L353 BasicCegarLoop]: trace histogram [10, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:44:27,407 INFO L414 AbstractCegarLoop]: === Iteration 11 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:44:27,407 INFO L82 PathProgramCache]: Analyzing trace with hash 109404623, now seen corresponding path program 4 times [2018-07-24 10:44:27,407 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:44:27,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:44:27,408 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 10:44:27,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:44:27,408 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:44:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:44:27,577 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 4 proven. 98 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-07-24 10:44:27,578 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:44:27,578 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 10:44:27,592 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-24 10:44:27,592 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-07-24 10:44:27,624 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-24 10:44:27,624 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:44:27,627 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:44:27,712 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 74 proven. 18 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-07-24 10:44:27,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:44:27,949 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 78 proven. 18 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-07-24 10:44:27,969 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:44:27,969 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 10:44:27,985 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-24 10:44:27,986 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-07-24 10:44:28,042 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-24 10:44:28,042 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:44:28,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:44:28,067 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 74 proven. 18 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-07-24 10:44:28,067 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:44:28,207 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 78 proven. 18 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-07-24 10:44:28,209 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:44:28,209 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9, 8, 9] total 20 [2018-07-24 10:44:28,209 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:44:28,209 INFO L450 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-24 10:44:28,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-24 10:44:28,210 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2018-07-24 10:44:28,210 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 15 states. [2018-07-24 10:44:28,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:44:28,657 INFO L93 Difference]: Finished difference Result 181 states and 207 transitions. [2018-07-24 10:44:28,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-24 10:44:28,658 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 100 [2018-07-24 10:44:28,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:44:28,659 INFO L225 Difference]: With dead ends: 181 [2018-07-24 10:44:28,659 INFO L226 Difference]: Without dead ends: 115 [2018-07-24 10:44:28,660 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 382 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2018-07-24 10:44:28,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-24 10:44:28,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2018-07-24 10:44:28,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-24 10:44:28,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2018-07-24 10:44:28,673 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 100 [2018-07-24 10:44:28,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:44:28,673 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2018-07-24 10:44:28,673 INFO L472 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-24 10:44:28,674 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2018-07-24 10:44:28,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-24 10:44:28,675 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:44:28,675 INFO L353 BasicCegarLoop]: trace histogram [11, 7, 7, 7, 6, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:44:28,675 INFO L414 AbstractCegarLoop]: === Iteration 12 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:44:28,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1770517222, now seen corresponding path program 5 times [2018-07-24 10:44:28,676 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:44:28,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:44:28,677 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 10:44:28,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:44:28,677 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:44:28,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:44:28,806 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 102 proven. 68 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-07-24 10:44:28,806 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:44:28,806 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 10:44:28,814 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-07-24 10:44:28,814 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-24 10:44:28,837 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-07-24 10:44:28,838 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:44:28,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:44:29,108 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:29,112 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:29,118 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:29,127 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:29,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 28 treesize of output 101 [2018-07-24 10:44:29,218 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:29,224 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:29,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 58 treesize of output 65 [2018-07-24 10:44:29,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:29,594 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:29,596 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:29,597 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:29,598 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:29,613 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 71 [2018-07-24 10:44:29,614 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:29,808 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:29,810 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:29,811 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:29,812 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:29,822 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 70 [2018-07-24 10:44:29,823 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:29,941 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:29,945 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-07-24 10:44:29,946 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:30,104 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:30,107 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:30,109 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:30,110 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:30,113 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:30,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 70 [2018-07-24 10:44:30,131 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-07-24 10:44:30,222 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:30,225 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:30,228 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:30,230 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:30,252 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 23 treesize of output 61 [2018-07-24 10:44:30,254 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-07-24 10:44:30,426 INFO L267 ElimStorePlain]: Start of recursive call 2: 10 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-07-24 10:44:30,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-07-24 10:44:30,464 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:36, output treesize:62 [2018-07-24 10:44:31,110 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:31,112 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:31,113 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:31,116 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:31,120 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:31,126 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:31,128 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:31,129 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:31,133 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:31,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 47 treesize of output 133 [2018-07-24 10:44:31,208 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 9 xjuncts. [2018-07-24 10:44:31,304 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:44:31,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:88, output treesize:13 [2018-07-24 10:44:31,340 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 111 proven. 55 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-07-24 10:44:31,340 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:44:32,604 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,605 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,605 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,606 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,606 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,607 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,608 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,612 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 100 [2018-07-24 10:44:32,749 WARN L169 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 39 [2018-07-24 10:44:32,758 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-07-24 10:44:32,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:32,761 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-07-24 10:44:32,761 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:32,764 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:32,764 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,764 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,765 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,765 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,765 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,766 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,767 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,767 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,768 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,769 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,770 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,771 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:32,772 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,773 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,774 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,774 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,775 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,775 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,777 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 132 [2018-07-24 10:44:32,779 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:32,784 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-07-24 10:44:32,784 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:32,787 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,789 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,789 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,790 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,790 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,792 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,793 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,794 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,801 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:32,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 99 [2018-07-24 10:44:32,813 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-07-24 10:44:32,818 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-07-24 10:44:32,818 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:32,825 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-07-24 10:44:32,825 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:32,833 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-07-24 10:44:32,834 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:32,836 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-07-24 10:44:32,837 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:32,893 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:44:32,904 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-07-24 10:44:32,905 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:94, output treesize:29 [2018-07-24 10:44:33,061 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 106 proven. 64 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-07-24 10:44:33,081 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:44:33,082 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 10:44:33,097 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-07-24 10:44:33,097 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-24 10:44:33,190 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-07-24 10:44:33,191 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:44:33,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:44:33,220 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:33,223 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:33,231 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:33,243 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:33,291 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 25 treesize of output 98 [2018-07-24 10:44:33,337 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:33,340 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 66 treesize of output 75 [2018-07-24 10:44:33,341 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:33,706 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:33,707 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:33,707 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:33,710 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:33,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 26 treesize of output 49 [2018-07-24 10:44:33,714 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:33,882 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:33,883 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:33,885 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:33,886 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:33,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 68 [2018-07-24 10:44:33,898 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:34,225 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:34,229 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:34,233 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:34,239 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:34,256 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 57 [2018-07-24 10:44:34,256 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:34,390 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:34,391 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:34,392 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:34,395 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:34,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 71 [2018-07-24 10:44:34,424 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-07-24 10:44:34,583 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:34,584 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:34,585 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:34,589 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:34,593 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 26 treesize of output 49 [2018-07-24 10:44:34,593 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:34,669 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:34,670 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:34,671 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:34,675 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:34,696 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 73 [2018-07-24 10:44:34,697 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-07-24 10:44:34,836 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, 10 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-07-24 10:44:34,875 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 3 xjuncts. [2018-07-24 10:44:34,875 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:33, output treesize:77 [2018-07-24 10:44:36,391 WARN L169 SmtUtils]: Spent 502.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-07-24 10:44:37,364 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 113 proven. 53 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-07-24 10:44:37,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:44:44,887 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:44,887 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:44,888 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:44,888 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:44,889 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:44,891 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:44,892 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:44,895 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:44,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 84 treesize of output 100 [2018-07-24 10:44:45,024 WARN L169 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 41 [2018-07-24 10:44:45,043 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-07-24 10:44:45,044 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:45,060 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-07-24 10:44:45,061 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:45,097 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:45,106 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:45,107 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:45,107 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:45,111 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:45,114 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:45,115 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:45,115 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:45,116 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:45,116 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:45,117 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:45,117 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:45,118 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:44:45,119 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:45,119 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:45,120 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:45,121 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:45,122 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:45,122 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:45,124 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 19 disjoint index pairs (out of 21 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 132 [2018-07-24 10:44:45,126 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:45,136 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-07-24 10:44:45,137 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:45,161 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:45,176 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:45,185 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:45,200 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:45,209 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:45,243 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:45,247 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:45,248 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:45,256 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:44:45,259 INFO L303 Elim1Store]: Index analysis took 121 ms [2018-07-24 10:44:45,267 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 99 [2018-07-24 10:44:45,269 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-07-24 10:44:45,285 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-07-24 10:44:45,285 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:45,287 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-07-24 10:44:45,287 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:45,290 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-07-24 10:44:45,291 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:45,292 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-07-24 10:44:45,292 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-07-24 10:44:45,347 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:44:45,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-07-24 10:44:45,360 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:94, output treesize:29 [2018-07-24 10:44:45,380 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 106 proven. 64 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-07-24 10:44:45,381 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:44:45,382 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 19, 19, 19] total 52 [2018-07-24 10:44:45,382 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:44:45,382 INFO L450 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-24 10:44:45,382 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-24 10:44:45,384 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=2347, Unknown=3, NotChecked=0, Total=2652 [2018-07-24 10:44:45,384 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand 26 states. [2018-07-24 10:44:49,330 WARN L169 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 27 [2018-07-24 10:44:52,121 WARN L169 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 37 [2018-07-24 10:44:52,525 WARN L169 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 32 [2018-07-24 10:44:54,378 WARN L169 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 29 [2018-07-24 10:44:55,142 WARN L169 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 37 [2018-07-24 10:44:55,537 WARN L169 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 32 [2018-07-24 10:44:56,228 WARN L169 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 65 [2018-07-24 10:44:58,815 WARN L169 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2018-07-24 10:44:59,167 WARN L169 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 68 [2018-07-24 10:44:59,564 WARN L169 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2018-07-24 10:44:59,812 WARN L169 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2018-07-24 10:45:00,099 WARN L169 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2018-07-24 10:45:00,434 WARN L169 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2018-07-24 10:45:01,832 WARN L169 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 63 [2018-07-24 10:45:02,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:45:02,076 INFO L93 Difference]: Finished difference Result 462 states and 561 transitions. [2018-07-24 10:45:02,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-07-24 10:45:02,077 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 104 [2018-07-24 10:45:02,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:45:02,079 INFO L225 Difference]: With dead ends: 462 [2018-07-24 10:45:02,080 INFO L226 Difference]: Without dead ends: 396 [2018-07-24 10:45:02,088 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 446 SyntacticMatches, 7 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9762 ImplicationChecksByTransitivity, 26.1s TimeCoverageRelationStatistics Valid=4211, Invalid=26586, Unknown=3, NotChecked=0, Total=30800 [2018-07-24 10:45:02,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-07-24 10:45:02,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 236. [2018-07-24 10:45:02,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-07-24 10:45:02,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 283 transitions. [2018-07-24 10:45:02,117 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 283 transitions. Word has length 104 [2018-07-24 10:45:02,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:45:02,117 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 283 transitions. [2018-07-24 10:45:02,117 INFO L472 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-24 10:45:02,118 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 283 transitions. [2018-07-24 10:45:02,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-24 10:45:02,119 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:45:02,119 INFO L353 BasicCegarLoop]: trace histogram [15, 10, 10, 9, 6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:45:02,120 INFO L414 AbstractCegarLoop]: === Iteration 13 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:45:02,120 INFO L82 PathProgramCache]: Analyzing trace with hash 136803491, now seen corresponding path program 1 times [2018-07-24 10:45:02,120 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:45:02,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:45:02,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 10:45:02,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:45:02,121 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:45:02,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:45:02,664 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 12 proven. 264 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-07-24 10:45:02,664 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:45:02,664 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 10:45:02,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:45:02,672 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:45:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:45:02,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:45:02,716 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 18 treesize of output 21 [2018-07-24 10:45:02,718 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-07-24 10:45:02,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-07-24 10:45:02,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-07-24 10:45:02,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-07-24 10:45:02,728 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-07-24 10:45:02,762 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:02,778 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:02,791 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:02,800 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:02,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:02,809 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-07-24 10:45:03,664 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2018-07-24 10:45:03,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:45:04,708 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-07-24 10:45:04,730 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-07-24 10:45:04,730 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [17, 13] total 38 [2018-07-24 10:45:04,730 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 10:45:04,730 INFO L450 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-24 10:45:04,731 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-24 10:45:04,731 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1153, Unknown=0, NotChecked=0, Total=1406 [2018-07-24 10:45:04,732 INFO L87 Difference]: Start difference. First operand 236 states and 283 transitions. Second operand 13 states. [2018-07-24 10:45:05,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:45:05,988 INFO L93 Difference]: Finished difference Result 484 states and 598 transitions. [2018-07-24 10:45:05,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-24 10:45:05,988 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 122 [2018-07-24 10:45:05,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:45:05,991 INFO L225 Difference]: With dead ends: 484 [2018-07-24 10:45:05,992 INFO L226 Difference]: Without dead ends: 275 [2018-07-24 10:45:05,993 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 504 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=380, Invalid=1782, Unknown=0, NotChecked=0, Total=2162 [2018-07-24 10:45:05,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-07-24 10:45:06,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 237. [2018-07-24 10:45:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-07-24 10:45:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 284 transitions. [2018-07-24 10:45:06,025 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 284 transitions. Word has length 122 [2018-07-24 10:45:06,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:45:06,026 INFO L471 AbstractCegarLoop]: Abstraction has 237 states and 284 transitions. [2018-07-24 10:45:06,026 INFO L472 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-24 10:45:06,026 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 284 transitions. [2018-07-24 10:45:06,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-24 10:45:06,027 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:45:06,028 INFO L353 BasicCegarLoop]: trace histogram [15, 10, 10, 8, 6, 6, 5, 5, 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, 1, 1, 1] [2018-07-24 10:45:06,028 INFO L414 AbstractCegarLoop]: === Iteration 14 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:45:06,028 INFO L82 PathProgramCache]: Analyzing trace with hash -921034587, now seen corresponding path program 2 times [2018-07-24 10:45:06,028 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:45:06,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:45:06,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:45:06,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:45:06,029 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:45:06,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:45:06,254 WARN L169 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-07-24 10:45:06,854 WARN L169 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 23 [2018-07-24 10:45:07,128 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 12 proven. 264 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-07-24 10:45:07,128 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:45:07,128 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 10:45:07,135 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-24 10:45:07,136 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-24 10:45:07,175 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-24 10:45:07,175 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:45:07,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:45:07,245 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 6 treesize of output 5 [2018-07-24 10:45:07,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:45:07,249 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:07,250 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-07-24 10:45:07,334 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:07,335 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 12 treesize of output 15 [2018-07-24 10:45:07,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:45:07,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:07,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-07-24 10:45:07,434 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-07-24 10:45:07,435 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:45:07,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:07,509 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-07-24 10:45:07,855 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 4 proven. 340 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-07-24 10:45:07,855 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:45:08,188 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 22 treesize of output 26 [2018-07-24 10:45:08,194 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:08,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 34 [2018-07-24 10:45:08,214 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:08,214 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:08,215 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:08,218 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 22 treesize of output 17 [2018-07-24 10:45:08,219 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-07-24 10:45:08,226 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:08,231 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:08,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:08,236 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:12 [2018-07-24 10:45:08,358 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 13 proven. 41 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-07-24 10:45:08,380 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:45:08,381 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 10:45:08,396 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-24 10:45:08,396 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-24 10:45:08,498 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-24 10:45:08,498 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:45:08,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:45:08,513 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 18 treesize of output 21 [2018-07-24 10:45:08,515 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-07-24 10:45:08,521 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-07-24 10:45:08,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-07-24 10:45:08,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-07-24 10:45:08,528 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-07-24 10:45:08,542 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:08,550 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:08,559 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:08,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:08,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:08,576 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-07-24 10:45:09,098 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-07-24 10:45:09,098 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:45:09,865 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-07-24 10:45:09,867 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2018-07-24 10:45:09,867 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [17, 20, 15, 11] total 65 [2018-07-24 10:45:09,867 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-07-24 10:45:09,867 INFO L450 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-24 10:45:09,868 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-24 10:45:09,869 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=3792, Unknown=0, NotChecked=0, Total=4160 [2018-07-24 10:45:09,869 INFO L87 Difference]: Start difference. First operand 237 states and 284 transitions. Second operand 11 states. [2018-07-24 10:45:10,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:45:10,921 INFO L93 Difference]: Finished difference Result 484 states and 597 transitions. [2018-07-24 10:45:10,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-24 10:45:10,922 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 122 [2018-07-24 10:45:10,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:45:10,924 INFO L225 Difference]: With dead ends: 484 [2018-07-24 10:45:10,925 INFO L226 Difference]: Without dead ends: 271 [2018-07-24 10:45:10,927 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 441 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1334 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=455, Invalid=4657, Unknown=0, NotChecked=0, Total=5112 [2018-07-24 10:45:10,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-07-24 10:45:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 233. [2018-07-24 10:45:10,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-07-24 10:45:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 279 transitions. [2018-07-24 10:45:10,954 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 279 transitions. Word has length 122 [2018-07-24 10:45:10,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:45:10,955 INFO L471 AbstractCegarLoop]: Abstraction has 233 states and 279 transitions. [2018-07-24 10:45:10,955 INFO L472 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-24 10:45:10,955 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 279 transitions. [2018-07-24 10:45:10,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-24 10:45:10,956 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:45:10,956 INFO L353 BasicCegarLoop]: trace histogram [15, 10, 10, 8, 6, 6, 5, 5, 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, 1, 1, 1] [2018-07-24 10:45:10,957 INFO L414 AbstractCegarLoop]: === Iteration 15 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:45:10,957 INFO L82 PathProgramCache]: Analyzing trace with hash 2013286309, now seen corresponding path program 3 times [2018-07-24 10:45:10,957 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:45:10,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:45:10,958 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 10:45:10,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:45:10,958 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:45:10,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:45:11,492 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 4 proven. 198 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-07-24 10:45:11,492 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:45:11,492 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 10:45:11,501 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-24 10:45:11,501 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-07-24 10:45:11,526 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-07-24 10:45:11,527 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:45:11,529 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:45:11,535 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 6 treesize of output 5 [2018-07-24 10:45:11,535 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:45:11,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:11,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-07-24 10:45:11,579 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:11,581 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 21 [2018-07-24 10:45:11,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:45:11,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:11,586 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-07-24 10:45:11,627 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:11,628 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:11,629 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:11,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 44 [2018-07-24 10:45:11,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:45:11,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:11,649 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:27 [2018-07-24 10:45:11,911 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 33 proven. 14 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-07-24 10:45:11,911 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:45:12,197 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-07-24 10:45:12,217 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:45:12,217 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 10:45:12,233 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-07-24 10:45:12,233 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-07-24 10:45:12,418 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-07-24 10:45:12,418 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:45:12,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:45:12,424 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 6 treesize of output 5 [2018-07-24 10:45:12,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:45:12,427 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:12,428 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-07-24 10:45:12,431 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:12,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 21 [2018-07-24 10:45:12,432 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:45:12,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:12,444 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-07-24 10:45:12,446 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:12,449 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:12,450 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:12,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 44 [2018-07-24 10:45:12,451 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:45:12,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:12,467 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:27 [2018-07-24 10:45:12,549 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 33 proven. 14 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-07-24 10:45:12,549 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:45:12,606 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-07-24 10:45:12,607 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:45:12,607 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13, 14, 13] total 34 [2018-07-24 10:45:12,607 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:45:12,608 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-24 10:45:12,608 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-24 10:45:12,608 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2018-07-24 10:45:12,609 INFO L87 Difference]: Start difference. First operand 233 states and 279 transitions. Second operand 25 states. [2018-07-24 10:45:14,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:45:14,240 INFO L93 Difference]: Finished difference Result 494 states and 606 transitions. [2018-07-24 10:45:14,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-24 10:45:14,241 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 122 [2018-07-24 10:45:14,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:45:14,244 INFO L225 Difference]: With dead ends: 494 [2018-07-24 10:45:14,244 INFO L226 Difference]: Without dead ends: 313 [2018-07-24 10:45:14,245 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 466 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=376, Invalid=2380, Unknown=0, NotChecked=0, Total=2756 [2018-07-24 10:45:14,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-07-24 10:45:14,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 238. [2018-07-24 10:45:14,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-07-24 10:45:14,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 284 transitions. [2018-07-24 10:45:14,283 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 284 transitions. Word has length 122 [2018-07-24 10:45:14,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:45:14,283 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 284 transitions. [2018-07-24 10:45:14,283 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-24 10:45:14,283 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 284 transitions. [2018-07-24 10:45:14,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-24 10:45:14,285 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:45:14,285 INFO L353 BasicCegarLoop]: trace histogram [15, 10, 10, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:45:14,285 INFO L414 AbstractCegarLoop]: === Iteration 16 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:45:14,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1161798588, now seen corresponding path program 4 times [2018-07-24 10:45:14,286 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:45:14,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:45:14,287 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 10:45:14,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:45:14,287 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:45:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:45:15,061 WARN L169 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 32 [2018-07-24 10:45:15,219 WARN L169 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 29 [2018-07-24 10:45:15,334 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 6 proven. 190 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2018-07-24 10:45:15,334 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:45:15,334 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 10:45:15,342 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-24 10:45:15,342 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-07-24 10:45:15,381 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-24 10:45:15,381 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:45:15,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:45:15,390 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 18 treesize of output 21 [2018-07-24 10:45:15,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-07-24 10:45:15,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-07-24 10:45:15,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-07-24 10:45:15,406 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-07-24 10:45:15,407 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-07-24 10:45:15,433 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:15,446 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:15,457 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:15,471 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:15,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:15,484 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-07-24 10:45:15,792 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2018-07-24 10:45:15,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:45:16,577 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 161 proven. 9 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2018-07-24 10:45:16,597 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:45:16,597 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 10:45:16,612 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-07-24 10:45:16,612 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-07-24 10:45:16,696 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-07-24 10:45:16,697 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:45:16,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:45:16,705 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 18 treesize of output 21 [2018-07-24 10:45:16,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-07-24 10:45:16,726 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-07-24 10:45:16,729 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-07-24 10:45:16,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-07-24 10:45:16,739 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-07-24 10:45:16,753 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:16,764 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:16,777 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:16,787 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:16,798 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:16,798 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-07-24 10:45:16,939 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2018-07-24 10:45:16,939 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:45:17,112 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 161 proven. 9 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2018-07-24 10:45:17,114 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:45:17,114 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12, 12, 12] total 32 [2018-07-24 10:45:17,114 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:45:17,114 INFO L450 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-24 10:45:17,115 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-24 10:45:17,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=822, Unknown=0, NotChecked=0, Total=992 [2018-07-24 10:45:17,115 INFO L87 Difference]: Start difference. First operand 238 states and 284 transitions. Second operand 23 states. [2018-07-24 10:45:17,847 WARN L169 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 32 [2018-07-24 10:45:18,043 WARN L169 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 32 [2018-07-24 10:45:19,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:45:19,932 INFO L93 Difference]: Finished difference Result 588 states and 726 transitions. [2018-07-24 10:45:19,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-24 10:45:19,932 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 130 [2018-07-24 10:45:19,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:45:19,935 INFO L225 Difference]: With dead ends: 588 [2018-07-24 10:45:19,935 INFO L226 Difference]: Without dead ends: 380 [2018-07-24 10:45:19,937 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 552 GetRequests, 502 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 520 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=474, Invalid=1878, Unknown=0, NotChecked=0, Total=2352 [2018-07-24 10:45:19,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-07-24 10:45:19,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 248. [2018-07-24 10:45:19,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-07-24 10:45:19,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 295 transitions. [2018-07-24 10:45:19,978 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 295 transitions. Word has length 130 [2018-07-24 10:45:19,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:45:19,978 INFO L471 AbstractCegarLoop]: Abstraction has 248 states and 295 transitions. [2018-07-24 10:45:19,978 INFO L472 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-24 10:45:19,978 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 295 transitions. [2018-07-24 10:45:19,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-24 10:45:19,980 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:45:19,980 INFO L353 BasicCegarLoop]: trace histogram [15, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:45:19,980 INFO L414 AbstractCegarLoop]: === Iteration 17 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:45:19,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1214970038, now seen corresponding path program 5 times [2018-07-24 10:45:19,981 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:45:19,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:45:19,981 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 10:45:19,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:45:19,982 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:45:19,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:45:20,201 WARN L169 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-07-24 10:45:20,648 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 6 proven. 256 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2018-07-24 10:45:20,648 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:45:20,648 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 10:45:20,656 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-07-24 10:45:20,656 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-24 10:45:20,689 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-07-24 10:45:20,689 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:45:20,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:45:20,815 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:20,816 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:20,817 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:20,819 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:20,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 56 [2018-07-24 10:45:20,828 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:20,829 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:20,829 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:20,831 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:20,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 27 treesize of output 50 [2018-07-24 10:45:20,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:45:20,845 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:20,850 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:20,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:13 [2018-07-24 10:45:20,975 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:20,976 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:20,976 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:20,980 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:20,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 58 [2018-07-24 10:45:20,987 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:20,988 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:20,989 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:20,995 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:20,996 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 27 treesize of output 50 [2018-07-24 10:45:20,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:45:21,007 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:21,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:21,013 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:13 [2018-07-24 10:45:21,108 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 225 proven. 83 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2018-07-24 10:45:21,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:45:22,481 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:22,482 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:22,492 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:22,545 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 78 treesize of output 124 [2018-07-24 10:45:23,319 WARN L169 SmtUtils]: Spent 763.00 ms on a formula simplification. DAG size of input: 280 DAG size of output: 203 [2018-07-24 10:45:23,323 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,323 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,323 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,325 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,330 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,332 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,335 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 66 treesize of output 127 [2018-07-24 10:45:23,375 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,376 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,377 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,377 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,378 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,378 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,379 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,380 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:23,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 166 [2018-07-24 10:45:23,451 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,451 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,452 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,453 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,453 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,454 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,454 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,455 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,456 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,456 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,461 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,469 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 87 [2018-07-24 10:45:23,470 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-07-24 10:45:23,491 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:23,602 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,604 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,604 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,605 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,605 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,606 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,607 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,607 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,612 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,612 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,613 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:23,614 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,620 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:23,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 169 [2018-07-24 10:45:24,087 WARN L169 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 64 [2018-07-24 10:45:24,090 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,091 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,093 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,093 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,094 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,096 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,097 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,097 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,098 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,098 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,101 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,101 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,107 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,109 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,129 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 126 [2018-07-24 10:45:24,131 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-07-24 10:45:24,251 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,252 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,254 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,254 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,255 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,257 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,257 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,258 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,259 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,259 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,263 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,268 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,297 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 48 treesize of output 132 [2018-07-24 10:45:24,300 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 8 xjuncts. [2018-07-24 10:45:24,373 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:24,396 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:24,400 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,401 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,403 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,404 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,404 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,406 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,408 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,414 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,425 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,429 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 69 treesize of output 141 [2018-07-24 10:45:24,477 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,478 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,478 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,481 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,481 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,504 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 16 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 124 treesize of output 129 [2018-07-24 10:45:24,570 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,571 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,571 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,572 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,572 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,573 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,575 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,577 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,578 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,579 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,579 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,580 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,587 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,589 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,615 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 125 [2018-07-24 10:45:24,619 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-07-24 10:45:24,691 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:24,829 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,830 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,832 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,832 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,833 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,834 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,836 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,838 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,844 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,854 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,857 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:24,897 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 141 [2018-07-24 10:45:25,137 WARN L169 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2018-07-24 10:45:25,141 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,142 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,144 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,144 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,145 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,146 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,146 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,149 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,152 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,153 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,157 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,158 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,159 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,160 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,169 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,172 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,178 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,185 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,220 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 63 treesize of output 171 [2018-07-24 10:45:25,237 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 20 xjuncts. [2018-07-24 10:45:25,535 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,536 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,537 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,538 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,539 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,540 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,542 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,548 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,549 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,556 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,557 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,558 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,706 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,731 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:25,783 INFO L303 Elim1Store]: Index analysis took 251 ms [2018-07-24 10:45:25,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 22 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 162 [2018-07-24 10:45:25,832 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 18 xjuncts. [2018-07-24 10:45:26,028 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,029 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,030 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,030 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,031 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,032 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,034 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,036 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,036 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,037 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,038 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,038 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,046 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,048 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,053 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,056 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,071 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 20 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 135 [2018-07-24 10:45:26,074 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 4 xjuncts. [2018-07-24 10:45:26,162 INFO L267 ElimStorePlain]: Start of recursive call 12: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-07-24 10:45:26,242 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-07-24 10:45:26,257 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,258 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,259 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,261 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,263 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,265 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,271 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,282 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,285 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 67 treesize of output 157 [2018-07-24 10:45:26,350 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,351 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,354 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,354 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 125 treesize of output 147 [2018-07-24 10:45:26,599 WARN L169 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2018-07-24 10:45:26,618 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,618 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,620 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,621 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,622 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,624 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,624 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,625 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,626 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,644 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,645 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,647 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,654 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:26,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 136 [2018-07-24 10:45:26,681 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 6 xjuncts. [2018-07-24 10:45:26,808 INFO L267 ElimStorePlain]: Start of recursive call 17: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:27,196 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,198 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,199 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,199 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,201 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,207 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,216 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,219 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,258 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 71 treesize of output 123 [2018-07-24 10:45:27,473 WARN L169 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2018-07-24 10:45:27,477 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,480 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,481 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,481 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,482 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,484 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,490 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,491 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,491 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,492 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,499 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,501 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,506 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,509 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,541 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 152 [2018-07-24 10:45:27,558 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 20 xjuncts. [2018-07-24 10:45:27,833 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,835 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,836 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,837 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,837 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,839 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,846 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,846 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,847 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,852 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,863 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:27,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 51 treesize of output 148 [2018-07-24 10:45:27,903 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-07-24 10:45:27,923 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 25 xjuncts. [2018-07-24 10:45:28,140 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,141 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,142 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,142 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,144 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,146 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,147 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,148 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,154 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,157 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 113 [2018-07-24 10:45:28,174 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 4 xjuncts. [2018-07-24 10:45:28,229 INFO L267 ElimStorePlain]: Start of recursive call 19: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:28,377 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,377 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,378 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,379 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,379 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,381 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,382 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,382 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,387 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,387 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,389 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:28,391 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,393 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 58 treesize of output 140 [2018-07-24 10:45:28,622 WARN L169 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2018-07-24 10:45:28,647 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,648 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,649 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,650 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,650 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,651 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,652 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,653 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,653 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,654 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,656 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,657 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,667 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,667 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,672 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 142 [2018-07-24 10:45:28,697 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 8 xjuncts. [2018-07-24 10:45:28,803 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,803 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,805 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,806 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,806 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,808 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,809 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,810 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,810 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,811 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,815 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,824 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,825 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:28,857 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 45 treesize of output 144 [2018-07-24 10:45:28,862 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 12 xjuncts. [2018-07-24 10:45:28,950 INFO L267 ElimStorePlain]: Start of recursive call 23: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:29,061 INFO L267 ElimStorePlain]: Start of recursive call 16: 9 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:29,587 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:29,588 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:29,595 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:29,596 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:29,596 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:29,600 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:29,609 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:29,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 124 [2018-07-24 10:45:29,651 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:29,652 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:29,654 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:29,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 93 treesize of output 111 [2018-07-24 10:45:29,893 WARN L169 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2018-07-24 10:45:29,897 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:29,898 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:29,898 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:29,900 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:29,900 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:29,902 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:29,905 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:29,905 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:29,906 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:29,913 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:29,920 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:29,943 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 115 [2018-07-24 10:45:29,948 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 6 xjuncts. [2018-07-24 10:45:30,287 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:30,288 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:30,289 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:30,291 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:30,294 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:30,294 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:30,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 83 [2018-07-24 10:45:30,320 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 4 xjuncts. [2018-07-24 10:45:30,441 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:30,444 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:30,445 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:30,448 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:30,449 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:30,452 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:30,454 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:30,458 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:30,467 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:30,518 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 59 treesize of output 114 [2018-07-24 10:45:30,523 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 9 xjuncts. [2018-07-24 10:45:30,670 INFO L267 ElimStorePlain]: Start of recursive call 27: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-07-24 10:45:30,861 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:30,862 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:30,863 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:30,864 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:30,866 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:30,869 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:30,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 96 [2018-07-24 10:45:31,012 WARN L169 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-07-24 10:45:31,016 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,016 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,017 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,017 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,019 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,029 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,031 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,031 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,034 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,035 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,044 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 87 [2018-07-24 10:45:31,045 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 2 xjuncts. [2018-07-24 10:45:31,119 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,119 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,123 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,126 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,126 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,127 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,128 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,130 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,131 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,131 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,136 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,137 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,139 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,142 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 104 [2018-07-24 10:45:31,160 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 3 xjuncts. [2018-07-24 10:45:31,229 INFO L267 ElimStorePlain]: Start of recursive call 31: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-07-24 10:45:31,375 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,401 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,410 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,421 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,492 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,495 INFO L303 Elim1Store]: Index analysis took 158 ms [2018-07-24 10:45:31,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 96 [2018-07-24 10:45:31,649 WARN L169 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 54 [2018-07-24 10:45:31,652 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,653 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,653 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,654 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,654 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,655 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,657 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,661 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,675 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 75 [2018-07-24 10:45:31,676 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 2 xjuncts. [2018-07-24 10:45:31,756 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,759 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,759 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,760 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,760 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,761 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,762 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,762 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,767 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,771 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,780 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 81 [2018-07-24 10:45:31,781 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 2 xjuncts. [2018-07-24 10:45:31,851 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,851 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,852 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:31,855 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 36 treesize of output 37 [2018-07-24 10:45:31,856 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-07-24 10:45:31,874 INFO L267 ElimStorePlain]: Start of recursive call 34: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:32,012 INFO L267 ElimStorePlain]: Start of recursive call 26: 6 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-07-24 10:45:32,368 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,368 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,371 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,375 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,375 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,377 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,379 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,392 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,401 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,403 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,463 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 70 treesize of output 154 [2018-07-24 10:45:32,473 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,473 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,476 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,478 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 2 new quantified variables, introduced 5 case distinctions, treesize of input 123 treesize of output 133 [2018-07-24 10:45:32,697 WARN L169 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 66 [2018-07-24 10:45:32,700 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,700 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,701 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,703 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,704 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,706 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,707 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,709 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,710 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,711 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,711 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,717 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,721 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:32,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 131 [2018-07-24 10:45:32,748 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 6 xjuncts. [2018-07-24 10:45:32,878 INFO L267 ElimStorePlain]: Start of recursive call 39: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:33,256 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,258 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,258 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,259 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,259 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,260 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,265 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,272 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,274 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,306 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 126 [2018-07-24 10:45:33,487 WARN L169 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2018-07-24 10:45:33,490 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,491 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,491 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,492 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,492 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,493 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,493 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,494 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,495 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,495 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,501 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,506 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 96 [2018-07-24 10:45:33,507 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 1 xjuncts. [2018-07-24 10:45:33,577 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,578 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,579 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,579 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,580 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,581 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,581 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,582 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,587 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,587 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,588 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,594 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,596 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:33,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 126 [2018-07-24 10:45:33,630 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 8 xjuncts. [2018-07-24 10:45:33,735 INFO L267 ElimStorePlain]: Start of recursive call 41: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-07-24 10:45:34,159 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,159 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,161 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,161 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,162 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,163 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,165 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,167 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,174 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,185 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,187 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,247 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 64 treesize of output 136 [2018-07-24 10:45:34,450 WARN L169 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 71 [2018-07-24 10:45:34,453 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,454 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,454 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,455 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,455 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,456 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,458 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,460 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,462 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,462 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,463 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,464 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,470 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,472 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,477 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,481 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 140 [2018-07-24 10:45:34,506 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 8 xjuncts. [2018-07-24 10:45:34,643 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,643 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,646 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,646 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,647 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,647 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,648 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,650 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,654 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,655 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,660 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,660 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,661 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,662 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,670 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,672 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,677 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,683 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:34,721 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 176 [2018-07-24 10:45:34,722 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-07-24 10:45:34,755 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 40 xjuncts. [2018-07-24 10:45:35,092 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:35,093 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:35,094 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:35,094 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:35,095 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:35,095 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:35,098 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:35,101 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:35,103 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:35,109 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:35,110 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:35,111 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:35,118 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:35,121 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:35,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 167 [2018-07-24 10:45:35,178 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-07-24 10:45:35,198 INFO L267 ElimStorePlain]: Start of recursive call 47: End of recursive call: and 36 xjuncts. [2018-07-24 10:45:35,440 INFO L267 ElimStorePlain]: Start of recursive call 44: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-07-24 10:45:35,986 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:35,986 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:35,988 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:35,990 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:35,991 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:35,993 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:35,995 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,002 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,004 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,010 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,060 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 3 new quantified variables, introduced 9 case distinctions, treesize of input 65 treesize of output 138 [2018-07-24 10:45:36,409 WARN L169 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 118 [2018-07-24 10:45:36,411 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,412 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,413 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,413 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,414 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,414 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,415 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,415 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,417 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,418 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,420 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,420 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,426 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,430 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,446 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 108 [2018-07-24 10:45:36,448 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 4 xjuncts. [2018-07-24 10:45:36,640 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,641 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,641 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,643 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,644 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,646 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,648 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,650 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,651 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,651 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,652 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,658 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,660 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,665 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,668 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,693 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 15 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 140 [2018-07-24 10:45:36,699 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 12 xjuncts. [2018-07-24 10:45:36,915 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,916 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,918 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,921 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,922 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,922 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,924 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,928 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,930 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,934 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,935 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,935 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,936 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,943 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,946 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,950 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:36,956 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:37,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 53 treesize of output 176 [2018-07-24 10:45:37,003 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-07-24 10:45:37,058 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 72 xjuncts. [2018-07-24 10:45:37,484 INFO L267 ElimStorePlain]: Start of recursive call 48: 6 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:37,578 INFO L267 ElimStorePlain]: Start of recursive call 38: 12 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-07-24 10:45:37,901 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:37,903 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:37,903 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:37,905 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:37,907 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:37,908 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:37,927 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:38,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 59 treesize of output 152 [2018-07-24 10:45:38,038 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:38,046 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:38,046 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:38,075 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 102 treesize of output 129 [2018-07-24 10:45:38,222 WARN L169 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2018-07-24 10:45:38,225 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:38,226 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:38,226 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:38,226 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:38,227 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:38,227 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:38,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 54 [2018-07-24 10:45:38,235 INFO L267 ElimStorePlain]: Start of recursive call 54: End of recursive call: and 1 xjuncts. [2018-07-24 10:45:38,286 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:38,287 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:38,287 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:38,288 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:38,288 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:38,289 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:38,290 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:38,291 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:38,292 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:38,308 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 11 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 77 [2018-07-24 10:45:38,309 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 2 xjuncts. [2018-07-24 10:45:38,363 INFO L267 ElimStorePlain]: Start of recursive call 53: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:39,137 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,139 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,139 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,140 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,141 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,141 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,144 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,152 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,184 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 55 treesize of output 119 [2018-07-24 10:45:39,343 WARN L169 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2018-07-24 10:45:39,346 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,348 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,349 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,349 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,350 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,351 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,351 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,352 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,354 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,355 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,355 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,356 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,362 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,368 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,385 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 121 [2018-07-24 10:45:39,388 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 4 xjuncts. [2018-07-24 10:45:39,473 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,475 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,476 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,476 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,477 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,477 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,478 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,479 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,482 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,483 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,483 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,489 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 120 [2018-07-24 10:45:39,523 INFO L267 ElimStorePlain]: Start of recursive call 58: End of recursive call: and 8 xjuncts. [2018-07-24 10:45:39,597 INFO L267 ElimStorePlain]: Start of recursive call 56: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:39,788 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,790 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,791 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,791 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,792 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,793 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,793 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,796 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,802 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,812 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:39,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 72 treesize of output 155 [2018-07-24 10:45:40,147 WARN L169 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 98 [2018-07-24 10:45:40,150 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,150 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,151 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,152 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,152 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,153 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,154 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,154 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,155 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,157 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,159 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,162 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,163 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,164 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,164 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,165 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,167 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,195 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 149 [2018-07-24 10:45:40,199 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 8 xjuncts. [2018-07-24 10:45:40,421 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,422 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,422 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,423 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,423 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,424 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,425 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,425 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,428 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,429 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,429 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,430 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,431 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:40,432 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 114 [2018-07-24 10:45:40,434 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 1 xjuncts. [2018-07-24 10:45:40,559 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,560 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,560 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,561 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,562 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,562 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,563 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,564 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,564 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,566 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,569 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,573 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,573 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,574 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,574 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:40,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 20 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 4 case distinctions, treesize of input 68 treesize of output 153 [2018-07-24 10:45:40,637 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 12 xjuncts. [2018-07-24 10:45:40,985 INFO L267 ElimStorePlain]: Start of recursive call 59: 4 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-07-24 10:45:41,535 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,536 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,536 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,537 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,538 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,538 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,540 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,541 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,542 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,551 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 143 [2018-07-24 10:45:41,774 WARN L169 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 71 [2018-07-24 10:45:41,777 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,778 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,778 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,779 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,780 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,780 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,781 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,782 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,782 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,784 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:41,784 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 95 [2018-07-24 10:45:41,786 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 1 xjuncts. [2018-07-24 10:45:41,870 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,871 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,872 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,872 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,874 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,875 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,876 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,876 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,877 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,877 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,878 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,879 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,879 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,880 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:41,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 16 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 129 [2018-07-24 10:45:41,903 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 2 xjuncts. [2018-07-24 10:45:42,036 INFO L267 ElimStorePlain]: Start of recursive call 63: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-07-24 10:45:43,356 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:43,358 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:43,359 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:43,361 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:43,363 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:43,365 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:43,382 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:43,447 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 12 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 11 case distinctions, treesize of input 69 treesize of output 138 [2018-07-24 10:45:43,774 WARN L169 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 105 [2018-07-24 10:45:43,778 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:43,779 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:43,780 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:43,780 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:43,782 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:43,785 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:43,785 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:43,786 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:43,788 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:43,791 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:43,793 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:43,803 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:43,806 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:43,814 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:43,862 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 21 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 7 case distinctions, treesize of input 68 treesize of output 178 [2018-07-24 10:45:43,862 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-07-24 10:45:43,915 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 48 xjuncts. [2018-07-24 10:45:44,592 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:44,595 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:44,595 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:44,596 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:44,598 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:44,600 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:44,602 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:44,605 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:44,607 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:44,610 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:44,620 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:44,633 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:44,695 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 63 treesize of output 185 [2018-07-24 10:45:44,695 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-07-24 10:45:44,896 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 158 xjuncts. [2018-07-24 10:45:46,305 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:46,306 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:46,306 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:46,307 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:46,309 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:46,311 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:46,313 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:46,315 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:46,321 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:46,332 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:46,409 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 17 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 63 treesize of output 179 [2018-07-24 10:45:46,409 WARN L136 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-07-24 10:45:46,576 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 192 xjuncts. [2018-07-24 10:45:48,445 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:48,445 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:48,446 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:48,446 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:48,447 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:48,447 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:48,447 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:48,449 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:48,449 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:48,450 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:48,450 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:48,452 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:48,462 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:48,472 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 117 [2018-07-24 10:45:48,473 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 2 xjuncts. [2018-07-24 10:45:48,674 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:48,674 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:48,675 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:48,675 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:48,675 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:48,677 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:48,679 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:48,680 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:48,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 100 [2018-07-24 10:45:48,704 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 4 xjuncts. [2018-07-24 10:45:48,828 INFO L267 ElimStorePlain]: Start of recursive call 66: 5 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-07-24 10:45:49,065 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,065 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,066 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,067 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,069 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,071 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,071 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,072 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,080 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 128 [2018-07-24 10:45:49,290 WARN L169 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2018-07-24 10:45:49,295 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,297 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,298 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,298 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,299 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,299 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,300 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,301 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,301 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,302 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,303 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,303 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,307 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,311 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,318 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,343 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 17 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 147 [2018-07-24 10:45:49,347 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 8 xjuncts. [2018-07-24 10:45:49,512 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,513 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,514 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,514 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,515 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,517 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,519 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,520 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,521 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,521 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,522 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,531 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,568 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 143 [2018-07-24 10:45:49,574 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 16 xjuncts. [2018-07-24 10:45:49,739 INFO L267 ElimStorePlain]: Start of recursive call 72: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-07-24 10:45:49,835 INFO L267 ElimStorePlain]: Start of recursive call 52: 2 dim-0 vars, 18 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-07-24 10:45:49,918 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,919 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,920 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,926 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 63 [2018-07-24 10:45:49,929 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 39 [2018-07-24 10:45:49,944 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,945 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,945 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:45:49,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-07-24 10:45:49,949 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 1 xjuncts. [2018-07-24 10:45:49,951 INFO L267 ElimStorePlain]: Start of recursive call 76: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:49,958 INFO L267 ElimStorePlain]: Start of recursive call 75: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:50,059 INFO L267 ElimStorePlain]: Start of recursive call 2: 10 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-07-24 10:45:50,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-07-24 10:45:50,088 INFO L202 ElimStorePlain]: Needed 77 recursive calls to eliminate 3 variables, input treesize:78, output treesize:41 [2018-07-24 10:45:50,196 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 231 proven. 82 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-07-24 10:45:50,216 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:45:50,217 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 10:45:50,232 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-07-24 10:45:50,232 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-24 10:45:50,511 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-07-24 10:45:50,511 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:45:50,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:45:50,529 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 17 [2018-07-24 10:45:50,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 18 [2018-07-24 10:45:50,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-07-24 10:45:50,560 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:50,561 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:50,561 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:11, output treesize:1 [2018-07-24 10:45:50,565 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:50,565 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:50,566 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:50,567 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:50,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 53 [2018-07-24 10:45:50,575 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:50,576 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:50,577 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:50,582 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 33 treesize of output 48 [2018-07-24 10:45:50,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:45:50,592 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:50,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:50,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:11 [2018-07-24 10:45:50,617 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:50,618 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:50,619 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:50,623 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:50,626 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 55 [2018-07-24 10:45:50,630 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:50,631 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:50,632 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:45:50,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 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 35 treesize of output 50 [2018-07-24 10:45:50,638 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-07-24 10:45:50,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:50,649 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:45:50,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:13 [2018-07-24 10:45:50,668 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 225 proven. 82 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-07-24 10:45:50,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:45:53,377 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 234 proven. 79 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-07-24 10:45:53,380 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:45:53,380 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 14, 14, 14] total 46 [2018-07-24 10:45:53,380 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:45:53,381 INFO L450 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-24 10:45:53,381 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-24 10:45:53,381 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1919, Unknown=1, NotChecked=0, Total=2070 [2018-07-24 10:45:53,381 INFO L87 Difference]: Start difference. First operand 248 states and 295 transitions. Second operand 25 states. [2018-07-24 10:46:00,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:46:00,709 INFO L93 Difference]: Finished difference Result 931 states and 1164 transitions. [2018-07-24 10:46:00,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-24 10:46:00,709 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 130 [2018-07-24 10:46:00,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:46:00,714 INFO L225 Difference]: With dead ends: 931 [2018-07-24 10:46:00,714 INFO L226 Difference]: Without dead ends: 742 [2018-07-24 10:46:00,716 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 492 SyntacticMatches, 5 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 2262 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=947, Invalid=9558, Unknown=1, NotChecked=0, Total=10506 [2018-07-24 10:46:00,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 742 states. [2018-07-24 10:46:00,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 742 to 441. [2018-07-24 10:46:00,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-07-24 10:46:00,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 540 transitions. [2018-07-24 10:46:00,800 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 540 transitions. Word has length 130 [2018-07-24 10:46:00,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:46:00,801 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 540 transitions. [2018-07-24 10:46:00,801 INFO L472 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-24 10:46:00,801 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 540 transitions. [2018-07-24 10:46:00,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-24 10:46:00,802 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:46:00,802 INFO L353 BasicCegarLoop]: trace histogram [15, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:46:00,802 INFO L414 AbstractCegarLoop]: === Iteration 18 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:46:00,802 INFO L82 PathProgramCache]: Analyzing trace with hash 851729354, now seen corresponding path program 6 times [2018-07-24 10:46:00,803 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:46:00,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:46:00,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 10:46:00,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:46:00,803 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:46:00,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:46:01,399 WARN L169 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-07-24 10:46:01,977 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 6 proven. 258 refuted. 0 times theorem prover too weak. 165 trivial. 0 not checked. [2018-07-24 10:46:01,977 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:46:01,977 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 10:46:01,993 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-07-24 10:46:01,993 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-07-24 10:46:02,027 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-07-24 10:46:02,028 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:46:02,031 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:46:02,048 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 18 treesize of output 21 [2018-07-24 10:46:02,062 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-07-24 10:46:02,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-07-24 10:46:02,076 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-07-24 10:46:02,084 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-07-24 10:46:02,085 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:02,092 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:02,102 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:02,110 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:02,120 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:02,130 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:02,130 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-07-24 10:46:02,353 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-07-24 10:46:02,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:46:02,813 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 187 proven. 16 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-07-24 10:46:02,835 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:46:02,835 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 10:46:02,850 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-07-24 10:46:02,850 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-07-24 10:46:03,081 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-07-24 10:46:03,081 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:46:03,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:46:03,088 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 18 treesize of output 21 [2018-07-24 10:46:03,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-07-24 10:46:03,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-07-24 10:46:03,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-07-24 10:46:03,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-07-24 10:46:03,098 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:03,110 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:03,140 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:03,149 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:03,159 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:03,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:03,167 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-07-24 10:46:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-07-24 10:46:03,245 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:46:03,535 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 187 proven. 16 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-07-24 10:46:03,537 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:46:03,537 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9, 10, 9] total 27 [2018-07-24 10:46:03,537 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:46:03,538 INFO L450 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-24 10:46:03,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-24 10:46:03,538 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=608, Unknown=2, NotChecked=0, Total=702 [2018-07-24 10:46:03,538 INFO L87 Difference]: Start difference. First operand 441 states and 540 transitions. Second operand 21 states. [2018-07-24 10:46:04,045 WARN L169 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 29 [2018-07-24 10:46:04,314 WARN L169 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 31 [2018-07-24 10:46:04,981 WARN L169 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 41 [2018-07-24 10:46:05,208 WARN L169 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 39 [2018-07-24 10:46:06,083 WARN L169 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 35 [2018-07-24 10:46:06,388 WARN L169 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 36 [2018-07-24 10:46:06,904 WARN L169 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 41 [2018-07-24 10:46:07,301 WARN L169 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2018-07-24 10:46:07,981 WARN L169 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 29 [2018-07-24 10:46:08,478 WARN L169 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 46 [2018-07-24 10:46:09,254 WARN L169 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 43 [2018-07-24 10:46:09,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:46:09,492 INFO L93 Difference]: Finished difference Result 1108 states and 1368 transitions. [2018-07-24 10:46:09,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-24 10:46:09,493 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 130 [2018-07-24 10:46:09,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:46:09,498 INFO L225 Difference]: With dead ends: 1108 [2018-07-24 10:46:09,498 INFO L226 Difference]: Without dead ends: 733 [2018-07-24 10:46:09,500 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 504 SyntacticMatches, 8 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1213 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=1062, Invalid=4034, Unknown=16, NotChecked=0, Total=5112 [2018-07-24 10:46:09,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2018-07-24 10:46:09,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 457. [2018-07-24 10:46:09,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 457 states. [2018-07-24 10:46:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 558 transitions. [2018-07-24 10:46:09,600 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 558 transitions. Word has length 130 [2018-07-24 10:46:09,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:46:09,600 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 558 transitions. [2018-07-24 10:46:09,600 INFO L472 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-24 10:46:09,600 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 558 transitions. [2018-07-24 10:46:09,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-24 10:46:09,602 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:46:09,602 INFO L353 BasicCegarLoop]: trace histogram [15, 10, 10, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:46:09,602 INFO L414 AbstractCegarLoop]: === Iteration 19 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:46:09,603 INFO L82 PathProgramCache]: Analyzing trace with hash 492680912, now seen corresponding path program 7 times [2018-07-24 10:46:09,603 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:46:09,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:46:09,604 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-07-24 10:46:09,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:46:09,604 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:46:09,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:46:09,856 WARN L169 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-07-24 10:46:10,236 WARN L169 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 36 [2018-07-24 10:46:10,360 WARN L169 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 39 [2018-07-24 10:46:10,487 WARN L169 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2018-07-24 10:46:10,638 WARN L169 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2018-07-24 10:46:10,771 WARN L169 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 37 [2018-07-24 10:46:11,164 WARN L169 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2018-07-24 10:46:11,340 WARN L169 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2018-07-24 10:46:11,611 WARN L169 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 37 [2018-07-24 10:46:11,845 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 10 proven. 296 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-07-24 10:46:11,845 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:46:11,846 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 10:46:11,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:46:11,853 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:46:11,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:46:11,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:46:11,915 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 18 treesize of output 21 [2018-07-24 10:46:11,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-07-24 10:46:11,935 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2018-07-24 10:46:11,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 27 [2018-07-24 10:46:11,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-07-24 10:46:11,939 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:11,951 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:11,963 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:11,973 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:11,982 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:11,992 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:11,993 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-07-24 10:46:12,950 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 334 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-07-24 10:46:12,950 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:46:13,692 WARN L169 SmtUtils]: Spent 608.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-07-24 10:46:13,907 WARN L169 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-07-24 10:46:14,028 WARN L169 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 22 [2018-07-24 10:46:16,902 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 98 proven. 202 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-07-24 10:46:16,923 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:46:16,923 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 10:46:16,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:46:16,938 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:46:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:46:17,055 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:46:17,273 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 6 treesize of output 5 [2018-07-24 10:46:17,273 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:17,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:17,277 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-07-24 10:46:17,385 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:17,386 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 12 treesize of output 15 [2018-07-24 10:46:17,386 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:17,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:17,393 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-07-24 10:46:17,520 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:17,521 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:17,522 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:17,522 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-07-24 10:46:17,523 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:17,538 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-07-24 10:46:17,538 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-07-24 10:46:17,686 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:17,686 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:17,687 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:17,688 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:17,689 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:17,690 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:17,691 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-07-24 10:46:17,691 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:17,718 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-07-24 10:46:17,718 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-07-24 10:46:18,647 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 13 proven. 54 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-07-24 10:46:18,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:46:19,499 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 5 treesize of output 3 [2018-07-24 10:46:19,499 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:19,501 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:19,501 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:3 [2018-07-24 10:46:19,559 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 12 proven. 43 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2018-07-24 10:46:19,561 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:46:19,561 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 16, 17, 12] total 76 [2018-07-24 10:46:19,561 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:46:19,562 INFO L450 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-24 10:46:19,562 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-24 10:46:19,563 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=5252, Unknown=10, NotChecked=0, Total=5700 [2018-07-24 10:46:19,563 INFO L87 Difference]: Start difference. First operand 457 states and 558 transitions. Second operand 40 states. [2018-07-24 10:46:20,539 WARN L169 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 32 [2018-07-24 10:46:20,780 WARN L169 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 31 [2018-07-24 10:46:21,740 WARN L169 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 29 [2018-07-24 10:46:22,515 WARN L169 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 33 [2018-07-24 10:46:23,127 WARN L169 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 29 [2018-07-24 10:46:23,415 WARN L169 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2018-07-24 10:46:23,746 WARN L169 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2018-07-24 10:46:24,135 WARN L169 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 36 [2018-07-24 10:46:24,371 WARN L169 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 42 [2018-07-24 10:46:24,629 WARN L169 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 35 [2018-07-24 10:46:24,953 WARN L169 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2018-07-24 10:46:25,834 WARN L169 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 35 [2018-07-24 10:46:26,185 WARN L169 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 31 [2018-07-24 10:46:27,127 WARN L169 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 36 [2018-07-24 10:46:27,503 WARN L169 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 44 [2018-07-24 10:46:27,739 WARN L169 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 36 [2018-07-24 10:46:28,053 WARN L169 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 34 [2018-07-24 10:46:28,320 WARN L169 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 34 [2018-07-24 10:46:28,547 WARN L169 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 38 [2018-07-24 10:46:29,004 WARN L169 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 38 [2018-07-24 10:46:29,218 WARN L169 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 31 [2018-07-24 10:46:29,492 WARN L169 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 34 [2018-07-24 10:46:30,068 WARN L169 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 40 [2018-07-24 10:46:30,777 WARN L169 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 41 [2018-07-24 10:46:31,339 WARN L169 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 41 [2018-07-24 10:46:31,798 WARN L169 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 41 [2018-07-24 10:46:32,076 WARN L169 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 36 [2018-07-24 10:46:32,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:46:32,531 INFO L93 Difference]: Finished difference Result 1243 states and 1543 transitions. [2018-07-24 10:46:32,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-24 10:46:32,531 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 130 [2018-07-24 10:46:32,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:46:32,536 INFO L225 Difference]: With dead ends: 1243 [2018-07-24 10:46:32,536 INFO L226 Difference]: Without dead ends: 843 [2018-07-24 10:46:32,538 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 606 GetRequests, 460 SyntacticMatches, 8 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6045 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=2503, Invalid=16917, Unknown=40, NotChecked=0, Total=19460 [2018-07-24 10:46:32,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 843 states. [2018-07-24 10:46:32,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 843 to 566. [2018-07-24 10:46:32,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 566 states. [2018-07-24 10:46:32,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 566 states to 566 states and 689 transitions. [2018-07-24 10:46:32,636 INFO L78 Accepts]: Start accepts. Automaton has 566 states and 689 transitions. Word has length 130 [2018-07-24 10:46:32,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:46:32,637 INFO L471 AbstractCegarLoop]: Abstraction has 566 states and 689 transitions. [2018-07-24 10:46:32,637 INFO L472 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-24 10:46:32,637 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 689 transitions. [2018-07-24 10:46:32,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-24 10:46:32,638 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:46:32,639 INFO L353 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:46:32,639 INFO L414 AbstractCegarLoop]: === Iteration 20 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:46:32,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1400509780, now seen corresponding path program 1 times [2018-07-24 10:46:32,639 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:46:32,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:46:32,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:46:32,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:46:32,640 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:46:32,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:46:33,176 WARN L169 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-07-24 10:46:33,540 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 63 proven. 54 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2018-07-24 10:46:33,540 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:46:33,541 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 10:46:33,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:46:33,550 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:46:33,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:46:33,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:46:33,800 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 6 treesize of output 5 [2018-07-24 10:46:33,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:33,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:33,804 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-07-24 10:46:33,842 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:33,843 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 12 treesize of output 15 [2018-07-24 10:46:33,844 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:33,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:33,851 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-07-24 10:46:33,900 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:33,901 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:33,901 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-07-24 10:46:33,902 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:33,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:33,913 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-07-24 10:46:33,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-07-24 10:46:33,977 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:33,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:33,984 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:21 [2018-07-24 10:46:34,288 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 6 proven. 339 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-07-24 10:46:34,288 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:46:34,680 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 33 [2018-07-24 10:46:34,682 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:34,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 41 [2018-07-24 10:46:34,684 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:34,684 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:34,685 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:34,685 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 56 [2018-07-24 10:46:34,711 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:34,712 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:34,713 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:34,713 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:34,714 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:34,715 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:34,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 34 [2018-07-24 10:46:34,720 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:34,730 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:34,738 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:34,746 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:34,753 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:34,753 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:29, output treesize:17 [2018-07-24 10:46:34,835 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 24 proven. 43 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-07-24 10:46:34,855 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:46:34,855 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 33 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 10:46:34,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:46:34,871 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-07-24 10:46:34,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:46:34,982 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:46:34,987 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 6 treesize of output 5 [2018-07-24 10:46:34,987 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:34,993 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:34,993 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-07-24 10:46:35,040 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:35,040 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 12 treesize of output 15 [2018-07-24 10:46:35,041 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:35,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:35,049 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-07-24 10:46:35,120 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:35,121 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:35,121 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:35,122 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-07-24 10:46:35,122 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:35,137 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-07-24 10:46:35,137 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-07-24 10:46:35,234 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:35,235 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:35,237 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:35,238 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:35,239 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:35,241 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:35,241 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-07-24 10:46:35,242 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:35,269 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-07-24 10:46:35,270 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-07-24 10:46:35,558 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 13 proven. 54 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-07-24 10:46:35,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:46:35,650 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 5 treesize of output 3 [2018-07-24 10:46:35,650 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:35,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:35,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:3 [2018-07-24 10:46:35,675 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 12 proven. 43 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2018-07-24 10:46:35,676 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:46:35,677 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 17, 17, 12] total 57 [2018-07-24 10:46:35,677 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:46:35,677 INFO L450 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-24 10:46:35,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-24 10:46:35,678 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=413, Invalid=2779, Unknown=0, NotChecked=0, Total=3192 [2018-07-24 10:46:35,678 INFO L87 Difference]: Start difference. First operand 566 states and 689 transitions. Second operand 38 states. [2018-07-24 10:46:38,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:46:38,399 INFO L93 Difference]: Finished difference Result 958 states and 1187 transitions. [2018-07-24 10:46:38,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-24 10:46:38,400 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 130 [2018-07-24 10:46:38,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:46:38,405 INFO L225 Difference]: With dead ends: 958 [2018-07-24 10:46:38,405 INFO L226 Difference]: Without dead ends: 956 [2018-07-24 10:46:38,406 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 481 SyntacticMatches, 15 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2738 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=946, Invalid=6886, Unknown=0, NotChecked=0, Total=7832 [2018-07-24 10:46:38,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2018-07-24 10:46:38,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 574. [2018-07-24 10:46:38,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2018-07-24 10:46:38,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 697 transitions. [2018-07-24 10:46:38,538 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 697 transitions. Word has length 130 [2018-07-24 10:46:38,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:46:38,538 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 697 transitions. [2018-07-24 10:46:38,539 INFO L472 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-24 10:46:38,539 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 697 transitions. [2018-07-24 10:46:38,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-24 10:46:38,541 INFO L345 BasicCegarLoop]: Found error trace [2018-07-24 10:46:38,541 INFO L353 BasicCegarLoop]: trace histogram [15, 10, 10, 10, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-07-24 10:46:38,541 INFO L414 AbstractCegarLoop]: === Iteration 21 === [__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION]=== [2018-07-24 10:46:38,541 INFO L82 PathProgramCache]: Analyzing trace with hash 715990259, now seen corresponding path program 2 times [2018-07-24 10:46:38,541 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-07-24 10:46:38,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:46:38,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-07-24 10:46:38,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-07-24 10:46:38,542 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-07-24 10:46:38,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-24 10:46:39,749 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 112 proven. 57 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-07-24 10:46:39,750 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:46:39,750 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-07-24 10:46:39,758 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-24 10:46:39,758 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-24 10:46:39,800 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-24 10:46:39,800 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:46:39,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:46:40,234 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 6 treesize of output 5 [2018-07-24 10:46:40,234 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:40,303 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:40,304 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-07-24 10:46:40,680 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:40,680 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 12 treesize of output 15 [2018-07-24 10:46:40,681 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:40,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:40,687 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-07-24 10:46:40,730 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:40,730 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:40,731 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 24 [2018-07-24 10:46:40,731 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:40,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:40,741 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-07-24 10:46:40,797 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:40,798 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:40,798 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:40,799 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:40,800 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:40,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 51 [2018-07-24 10:46:40,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:40,818 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:40,818 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:28 [2018-07-24 10:46:40,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2018-07-24 10:46:40,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:40,894 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:40,894 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2018-07-24 10:46:41,447 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 8 proven. 396 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-07-24 10:46:41,448 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:46:42,062 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 36 treesize of output 40 [2018-07-24 10:46:42,065 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:42,066 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 48 [2018-07-24 10:46:42,070 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:42,071 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:42,072 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:42,073 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 63 [2018-07-24 10:46:42,075 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:42,076 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:42,077 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:42,078 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:42,079 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:42,080 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:42,080 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 85 [2018-07-24 10:46:42,116 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:42,117 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:42,118 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:42,119 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:42,120 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:42,121 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:42,122 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:42,123 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:42,124 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:42,125 INFO L682 Elim1Store]: detected equality via solver [2018-07-24 10:46:42,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 58 [2018-07-24 10:46:42,134 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:42,168 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:42,184 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:42,199 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:42,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:42,225 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:42,226 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:36, output treesize:22 [2018-07-24 10:46:42,377 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 38 proven. 46 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2018-07-24 10:46:42,397 INFO L297 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-07-24 10:46:42,397 INFO L191 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 35 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-07-24 10:46:42,412 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-07-24 10:46:42,412 INFO L288 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-07-24 10:46:42,539 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-07-24 10:46:42,539 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-07-24 10:46:42,547 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-07-24 10:46:42,551 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 6 treesize of output 5 [2018-07-24 10:46:42,551 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:42,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:42,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-07-24 10:46:42,619 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:42,620 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 12 treesize of output 15 [2018-07-24 10:46:42,620 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:42,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:42,626 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-07-24 10:46:42,706 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:42,707 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:42,708 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:42,709 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 28 [2018-07-24 10:46:42,709 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:42,724 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-07-24 10:46:42,725 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-07-24 10:46:42,825 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:42,827 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:42,828 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:42,829 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:42,830 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:42,832 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:42,832 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 45 [2018-07-24 10:46:42,833 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:42,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-07-24 10:46:42,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:34 [2018-07-24 10:46:42,988 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:42,990 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:42,991 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:42,992 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:42,994 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:42,995 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:42,997 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:42,998 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:43,000 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:43,001 INFO L700 Elim1Store]: detected not equals via solver [2018-07-24 10:46:43,002 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 66 [2018-07-24 10:46:43,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:43,046 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-07-24 10:46:43,046 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-07-24 10:46:43,731 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 59 proven. 25 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2018-07-24 10:46:43,731 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-07-24 10:46:45,423 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 5 treesize of output 3 [2018-07-24 10:46:45,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-07-24 10:46:45,425 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-07-24 10:46:45,425 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:3 [2018-07-24 10:46:45,442 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 40 proven. 22 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2018-07-24 10:46:45,444 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-07-24 10:46:45,445 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 27, 19, 20, 13] total 81 [2018-07-24 10:46:45,445 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-07-24 10:46:45,445 INFO L450 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-24 10:46:45,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-24 10:46:45,446 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=847, Invalid=5630, Unknown=3, NotChecked=0, Total=6480 [2018-07-24 10:46:45,446 INFO L87 Difference]: Start difference. First operand 574 states and 697 transitions. Second operand 48 states. [2018-07-24 10:46:49,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-24 10:46:49,814 INFO L93 Difference]: Finished difference Result 1728 states and 2153 transitions. [2018-07-24 10:46:49,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-24 10:46:49,814 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 138 [2018-07-24 10:46:49,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-24 10:46:49,814 INFO L225 Difference]: With dead ends: 1728 [2018-07-24 10:46:49,814 INFO L226 Difference]: Without dead ends: 0 [2018-07-24 10:46:49,820 INFO L573 BasicCegarLoop]: 0 DeclaredPredicates, 625 GetRequests, 492 SyntacticMatches, 14 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5604 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=1519, Invalid=12998, Unknown=3, NotChecked=0, Total=14520 [2018-07-24 10:46:49,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-07-24 10:46:49,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-07-24 10:46:49,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-07-24 10:46:49,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-07-24 10:46:49,821 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2018-07-24 10:46:49,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-24 10:46:49,821 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-07-24 10:46:49,821 INFO L472 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-24 10:46:49,821 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-07-24 10:46:49,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-07-24 10:46:49,826 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-07-24 10:46:49,914 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:50,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:50,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:50,261 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:50,264 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:50,266 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:50,320 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:50,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:50,365 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:50,421 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:50,433 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:50,448 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:50,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:50,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:50,575 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:50,611 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:50,632 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:50,646 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:50,698 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:50,724 WARN L169 SmtUtils]: Spent 819.00 ms on a formula simplification. DAG size of input: 363 DAG size of output: 298 [2018-07-24 10:46:50,900 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:51,769 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:53,069 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:53,189 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:53,199 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:53,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:55,116 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:55,117 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:55,136 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:55,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:55,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:55,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:55,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:56,486 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:56,536 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:56,552 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:56,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:56,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:56,645 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:56,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:56,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:57,432 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:57,697 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:57,785 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:58,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:58,762 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:58,835 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:59,012 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:46:59,171 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:47:00,133 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:47:01,382 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:47:01,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:47:01,955 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:47:02,410 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:47:03,137 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:47:03,349 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-07-24 10:47:04,806 WARN L169 SmtUtils]: Spent 14.00 s on a formula simplification. DAG size of input: 1475 DAG size of output: 1327 [2018-07-24 10:47:05,682 WARN L169 SmtUtils]: Spent 821.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 78 [2018-07-24 10:47:08,017 WARN L169 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 310 DAG size of output: 42 [2018-07-24 10:47:08,791 WARN L169 SmtUtils]: Spent 771.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 65 [2018-07-24 10:47:09,000 WARN L169 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 64 [2018-07-24 10:48:01,061 WARN L169 SmtUtils]: Spent 52.05 s on a formula simplification. DAG size of input: 1333 DAG size of output: 57 [2018-07-24 10:48:01,686 WARN L169 SmtUtils]: Spent 528.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 77 [2018-07-24 10:48:01,807 WARN L169 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 1 [2018-07-24 10:48:01,845 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-07-24 10:48:01,846 INFO L417 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0) [2018-07-24 10:48:01,846 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-07-24 10:48:01,846 INFO L421 ceAbstractionStarter]: For program point L21(lines 21 22) no Hoare annotation was computed. [2018-07-24 10:48:01,846 INFO L421 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-07-24 10:48:01,846 INFO L421 ceAbstractionStarter]: For program point L19''(lines 19 26) no Hoare annotation was computed. [2018-07-24 10:48:01,846 INFO L421 ceAbstractionStarter]: For program point L19''''(lines 15 27) no Hoare annotation was computed. [2018-07-24 10:48:01,847 INFO L417 ceAbstractionStarter]: At program point L21'''(lines 21 22) the Hoare annotation is: (let ((.cse0 (= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~i~0 (+ __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~rh~0 1))) (.cse2 (<= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~i~0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0)) (.cse3 (<= (+ __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~lh~0 2) __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~i~0))) (or (< 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0) (let ((.cse1 (+ __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~lh~0 1))) (and .cse0 (= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~i~0 .cse1) (<= .cse1 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0))) (and .cse2 (<= (+ __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~lh~0 3) __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~i~0)) (and (< (select ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0 (+ __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~i~0 (- 1))) (select ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0 (+ __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~i~0 (- 2)))) .cse0 .cse3 .cse2) (and .cse3 (and (<= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~i~0 (+ __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~rh~0 2)) (<= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~rh~0 3))) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 0) 0)) (< ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0 5) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 2) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 4) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 1) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 3) 0)))) [2018-07-24 10:48:01,847 INFO L421 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSortEXIT(lines 15 27) no Hoare annotation was computed. [2018-07-24 10:48:01,847 INFO L421 ceAbstractionStarter]: For program point L21''(lines 21 22) no Hoare annotation was computed. [2018-07-24 10:48:01,847 INFO L417 ceAbstractionStarter]: At program point L19'''(lines 19 26) the Hoare annotation is: (let ((.cse0 (<= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~i~0 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0))) (or (and (<= (+ __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~lh~0 1) __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~i~0) .cse0) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 0) 0)) (< ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0 5) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 2) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 4) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 1) 0)) (and (= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~i~0 (+ __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~rh~0 1)) .cse0) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 3) 0)) (< 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0) (and (= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSort_~lh~0 0) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)))) [2018-07-24 10:48:01,847 INFO L417 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__SelectionSortENTRY(lines 15 27) the Hoare annotation is: (or (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 3) 0)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 0) 0)) (< ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0 5) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 4) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 1) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 2) 0)) (< 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0)) [2018-07-24 10:48:01,847 INFO L421 ceAbstractionStarter]: For program point L19(lines 19 26) no Hoare annotation was computed. [2018-07-24 10:48:01,847 INFO L421 ceAbstractionStarter]: For program point L21''''(lines 21 22) no Hoare annotation was computed. [2018-07-24 10:48:01,847 INFO L417 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0) (= (select ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0 4) 0) (= 0 (select ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0 2)) (= 0 (select ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0 3)) (<= ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0 5) (= (select ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0 0) 0) (= (select ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0 1) 0)) [2018-07-24 10:48:01,847 INFO L424 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-07-24 10:48:01,847 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-07-24 10:48:01,848 INFO L421 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-07-24 10:48:01,848 INFO L421 ceAbstractionStarter]: For program point L33''(lines 33 34) no Hoare annotation was computed. [2018-07-24 10:48:01,848 INFO L417 ceAbstractionStarter]: At program point L33'''(lines 33 34) the Hoare annotation is: (let ((.cse1 (+ main_~i~1 1)) (.cse2 (= 3 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 3))) (.cse3 (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)) (.cse0 (= 4 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 4)))) (or (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 3) 0)) (and .cse0 (= (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse1) .cse1) .cse2 (= main_~i~1 1) .cse3) (and (= main_~i~1 0) (let ((.cse4 (+ main_~i~1 2))) (= .cse4 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse4))) .cse0 .cse2 .cse3 (exists ((v_main_~i~1_87 Int)) (and (<= v_main_~i~1_87 (+ main_~i~1 1)) (let ((.cse5 (+ v_main_~i~1_87 1))) (= .cse5 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse5))) (<= 0 v_main_~i~1_87) (= v_main_~i~1_87 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 v_main_~i~1_87))))) (and .cse0 (= main_~i~1 2) .cse2 .cse3) (< ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0 5) (and (exists ((v_main_~i~1_159 Int)) (and (<= 0 v_main_~i~1_159) (let ((.cse6 (+ v_main_~i~1_159 2))) (= (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse6) .cse6)) (<= v_main_~i~1_159 (+ main_~i~1 1)) (= (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 v_main_~i~1_159) v_main_~i~1_159) (let ((.cse7 (+ v_main_~i~1_159 1))) (= (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse7) .cse7)))) (<= .cse1 0) .cse0 .cse2 .cse3) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 2) 0)) (< 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 0) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 4) 0)) (and (= main_~i~1 4) .cse3) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 1) 0)) (and .cse3 (= main_~i~1 3) .cse0))) [2018-07-24 10:48:01,848 INFO L421 ceAbstractionStarter]: For program point L39'(lines 38 39) no Hoare annotation was computed. [2018-07-24 10:48:01,848 INFO L417 ceAbstractionStarter]: At program point L38''(lines 38 39) the Hoare annotation is: (let ((.cse1 (= 4 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 4))) (.cse2 (= 3 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 3)))) (or (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 3) 0)) (< ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0 5) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 2) 0)) (< 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0) (and (and (exists ((v_main_~i~1_87 Int)) (and (let ((.cse0 (+ v_main_~i~1_87 1))) (= .cse0 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse0))) (<= v_main_~i~1_87 0) (<= 0 v_main_~i~1_87) (= v_main_~i~1_87 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 v_main_~i~1_87)))) (= main_~i~1 0)) (= 2 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 2)) .cse1 .cse2) (and .cse1 .cse2 (and (exists ((v_main_~i~1_159 Int)) (and (<= v_main_~i~1_159 0) (<= 0 v_main_~i~1_159) (let ((.cse3 (+ v_main_~i~1_159 2))) (= (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse3) .cse3)) (= (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 v_main_~i~1_159) v_main_~i~1_159) (let ((.cse4 (+ v_main_~i~1_159 1))) (= (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse4) .cse4)))) (<= 1 main_~i~1))) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 0) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 4) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 1) 0)))) [2018-07-24 10:48:01,848 INFO L421 ceAbstractionStarter]: For program point L33(lines 33 34) no Hoare annotation was computed. [2018-07-24 10:48:01,848 INFO L417 ceAbstractionStarter]: At program point L33''''(lines 33 34) the Hoare annotation is: (or (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 3) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 0) 0)) (< ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0 5) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 4) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 1) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 2) 0)) (and (or (<= (+ main_~i~1 1) 0) (= main_~i~1 0)) (= 4 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 4)) (exists ((v_main_~i~1_159 Int)) (and (<= v_main_~i~1_159 0) (<= 0 v_main_~i~1_159) (let ((.cse0 (+ v_main_~i~1_159 2))) (= (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse0) .cse0)) (= (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 v_main_~i~1_159) v_main_~i~1_159) (let ((.cse1 (+ v_main_~i~1_159 1))) (= (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse1) .cse1)))) (= 3 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 3)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0) (exists ((v_main_~i~1_87 Int)) (and (<= v_main_~i~1_87 (+ main_~i~1 1)) (let ((.cse2 (+ v_main_~i~1_87 1))) (= .cse2 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse2))) (<= 0 v_main_~i~1_87) (= v_main_~i~1_87 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 v_main_~i~1_87))))) (< 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0)) [2018-07-24 10:48:01,848 INFO L421 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-07-24 10:48:01,849 INFO L421 ceAbstractionStarter]: For program point L38'''(lines 29 41) no Hoare annotation was computed. [2018-07-24 10:48:01,849 INFO L421 ceAbstractionStarter]: For program point mainEXIT(lines 29 41) no Hoare annotation was computed. [2018-07-24 10:48:01,849 INFO L417 ceAbstractionStarter]: At program point mainENTRY(lines 29 41) the Hoare annotation is: (or (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 3) 0)) (= |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 0) 0)) (< ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0 5) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 4) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 1) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 2) 0)) (< 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0)) [2018-07-24 10:48:01,849 INFO L421 ceAbstractionStarter]: For program point L38(lines 38 39) no Hoare annotation was computed. [2018-07-24 10:48:01,849 INFO L417 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (let ((.cse4 (exists ((v_main_~i~1_159 Int)) (and (<= v_main_~i~1_159 0) (<= 0 v_main_~i~1_159) (let ((.cse6 (+ v_main_~i~1_159 2))) (= (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse6) .cse6)) (= (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 v_main_~i~1_159) v_main_~i~1_159) (let ((.cse7 (+ v_main_~i~1_159 1))) (= (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse7) .cse7)))))) (let ((.cse0 (= 2 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 2))) (.cse1 (= 4 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 4))) (.cse2 (= 3 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 3))) (.cse3 (and .cse4 (and (<= 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0) (<= 1 main_~i~1))))) (or (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 3) 0)) (and (= main_~i~1 1) (= 1 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 1)) .cse0 (= 0 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 0)) .cse1 .cse2) (and (= main_~i~1 4) .cse1 .cse2 .cse3) (and .cse1 .cse2 (and (= main_~i~1 2) .cse4)) (< ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0 5) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 2) 0)) (< 5 ~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n~0) (and (and (exists ((v_main_~i~1_87 Int)) (and (let ((.cse5 (+ v_main_~i~1_87 1))) (= .cse5 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 .cse5))) (<= v_main_~i~1_87 0) (<= 0 v_main_~i~1_87) (= v_main_~i~1_87 (select main_~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~1 v_main_~i~1_87)))) (= main_~i~1 0)) .cse0 .cse1 .cse2) (and (= main_~i~1 3) .cse1 .cse2 .cse3) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 0) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 4) 0)) (not (= (select |old(~__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array~0)| 1) 0))))) [2018-07-24 10:48:01,849 INFO L421 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-07-24 10:48:01,849 INFO L424 ceAbstractionStarter]: At program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-07-24 10:48:01,849 INFO L421 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-07-24 10:48:01,849 INFO L421 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-07-24 10:48:01,849 INFO L421 ceAbstractionStarter]: For program point __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i____VERIFIER_assertErr0AssertViolationERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-07-24 10:48:01,850 INFO L421 ceAbstractionStarter]: For program point L4''(lines 3 8) no Hoare annotation was computed. [2018-07-24 10:48:01,866 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,868 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,868 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,868 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,868 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,868 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,869 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,869 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,869 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,869 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,870 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,870 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,870 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,870 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,872 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,872 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,872 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,872 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,872 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,873 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,873 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,873 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,873 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,873 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,874 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,874 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,874 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,874 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,878 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,878 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,879 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,879 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,879 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,879 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,880 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,880 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,880 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,880 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,881 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,881 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,881 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,881 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,883 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,884 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,884 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,884 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,884 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,885 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,885 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,885 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,885 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,886 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,886 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,886 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,886 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,887 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.07 10:48:01 BoogieIcfgContainer [2018-07-24 10:48:01,891 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-24 10:48:01,892 INFO L168 Benchmark]: Toolchain (without parser) took 226614.31 ms. Allocated memory was 1.5 GB in the beginning and 3.1 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-07-24 10:48:01,892 INFO L168 Benchmark]: CDTParser took 0.23 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-07-24 10:48:01,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.37 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-07-24 10:48:01,893 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.21 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-07-24 10:48:01,893 INFO L168 Benchmark]: Boogie Preprocessor took 23.89 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-07-24 10:48:01,893 INFO L168 Benchmark]: RCFGBuilder took 555.94 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -773.2 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2018-07-24 10:48:01,894 INFO L168 Benchmark]: TraceAbstraction took 225699.63 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 858.8 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -295.8 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-07-24 10:48:01,896 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 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 305.37 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 24.21 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 23.89 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 555.94 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -773.2 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 225699.63 ms. Allocated memory was 2.3 GB in the beginning and 3.1 GB in the end (delta: 858.8 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -295.8 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((((((((lh + 1 <= i && i <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[0] == 0)) || __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n < 5) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[2] == 0)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[4] == 0)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[1] == 0)) || (i == rh + 1 && i <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[3] == 0)) || 5 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n) || (lh == 0 && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array) - InvariantResult [Line: 38]: Loop Invariant [2018-07-24 10:48:01,903 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,903 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,903 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,903 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,903 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,904 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,904 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,904 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,904 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,904 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,905 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,905 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,905 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,905 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,906 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,906 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,907 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,907 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,907 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,907 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,907 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,908 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,908 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,908 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,908 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,908 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,909 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,909 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] Derived loop invariant: (((((((!(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[3] == 0) || __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n < 5) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[2] == 0)) || 5 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n) || (((((\exists v_main_~i~1_87 : int :: ((v_main_~i~1_87 + 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[v_main_~i~1_87 + 1] && v_main_~i~1_87 <= 0) && 0 <= v_main_~i~1_87) && v_main_~i~1_87 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[v_main_~i~1_87]) && i == 0) && 2 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[2]) && 4 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[4]) && 3 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[3])) || ((4 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[4] && 3 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[3]) && (\exists v_main_~i~1_159 : int :: (((v_main_~i~1_159 <= 0 && 0 <= v_main_~i~1_159) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[v_main_~i~1_159 + 2] == v_main_~i~1_159 + 2) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[v_main_~i~1_159] == v_main_~i~1_159) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[v_main_~i~1_159 + 1] == v_main_~i~1_159 + 1) && 1 <= i)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[0] == 0)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[4] == 0)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[1] == 0) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((((((((5 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n || ((i == rh + 1 && i == lh + 1) && lh + 1 <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n)) || (i <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n && lh + 3 <= i)) || (((__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[i + -1] < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[i + -2] && i == rh + 1) && lh + 2 <= i) && i <= __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n)) || (lh + 2 <= i && i <= rh + 2 && rh <= 3)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[0] == 0)) || __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n < 5) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[2] == 0)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[4] == 0)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[1] == 0)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[3] == 0) - InvariantResult [Line: 33]: Loop Invariant [2018-07-24 10:48:01,912 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,912 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,912 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,912 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,912 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,913 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,913 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,913 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,913 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,914 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,914 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,914 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,914 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,914 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,916 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,916 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,917 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,917 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,917 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,917 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-07-24 10:48:01,917 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,918 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,918 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,918 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,918 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,919 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,919 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-07-24 10:48:01,919 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] Derived loop invariant: (((((((((((!(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[3] == 0) || ((((4 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[4] && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[i + 1] == i + 1) && 3 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[3]) && i == 1) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)) || (((((i == 0 && i + 2 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[i + 2]) && 4 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[4]) && 3 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[3]) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array) && (\exists v_main_~i~1_87 : int :: ((v_main_~i~1_87 <= i + 1 && v_main_~i~1_87 + 1 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[v_main_~i~1_87 + 1]) && 0 <= v_main_~i~1_87) && v_main_~i~1_87 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[v_main_~i~1_87]))) || (((4 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[4] && i == 2) && 3 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[3]) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)) || __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n < 5) || (((((\exists v_main_~i~1_159 : int :: (((0 <= v_main_~i~1_159 && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[v_main_~i~1_159 + 2] == v_main_~i~1_159 + 2) && v_main_~i~1_159 <= i + 1) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[v_main_~i~1_159] == v_main_~i~1_159) && __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[v_main_~i~1_159 + 1] == v_main_~i~1_159 + 1) && i + 1 <= 0) && 4 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[4]) && 3 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[3]) && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[2] == 0)) || 5 < __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__n) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[0] == 0)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[4] == 0)) || (i == 4 && \old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)) || !(\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array)[1] == 0)) || ((\old(__U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array) == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array && i == 3) && 4 == __U_MULTI_f_storage_repos_ultimate_trunk_examples_svcomp_loops_eureka____true_unreach_call_true_termination_i__array[4]) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 36 locations, 1 error locations. SAFE Result, 225.5s OverallTime, 21 OverallIterations, 15 TraceHistogramMax, 60.7s AutomataDifference, 0.0s DeadEndRemovalTime, 72.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 725 SDtfs, 3130 SDslu, 5545 SDs, 0 SdLazy, 10228 SolverSat, 1680 SolverUnsat, 91 SolverUnknown, 0 SolverNotchecked, 14.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7398 GetRequests, 6225 SyntacticMatches, 92 SemanticMatches, 1081 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 31685 ImplicationChecksByTransitivity, 90.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=574occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 21 MinimizatonAttempts, 1742 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 77 PreInvPairs, 632 NumberOfFragments, 998 HoareAnnotationTreeSize, 77 FomulaSimplifications, 184362920 FormulaSimplificationTreeSizeReduction, 15.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 31842510 FormulaSimplificationTreeSizeReductionInter, 56.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 87.9s InterpolantComputationTime, 5100 NumberOfCodeBlocks, 4575 NumberOfCodeBlocksAsserted, 120 NumberOfCheckSat, 8310 ConstructedInterpolants, 680 QuantifiedInterpolants, 9737595 SizeOfPredicates, 177 NumberOfNonLiveVariables, 5070 ConjunctsInSsa, 697 ConjunctsInUnsatCore, 89 InterpolantComputations, 7 PerfectInterpolantSequences, 16182/22290 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/eureka_05_true-unreach-call_true-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-Benchmark-0-2018-07-24_10-48-01-926.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/eureka_05_true-unreach-call_true-termination.i_svcomp-Reach-64bit-RubberTaipan_Default-OldIcfg.epf_AutomizerCInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-24_10-48-01-926.csv Received shutdown request...