java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -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-69f5bdd-m [2018-09-18 09:56:12,106 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-18 09:56:12,108 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-18 09:56:12,125 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-18 09:56:12,125 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-18 09:56:12,127 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-18 09:56:12,128 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-18 09:56:12,132 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-18 09:56:12,135 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-18 09:56:12,139 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-18 09:56:12,141 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-18 09:56:12,141 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-18 09:56:12,145 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-18 09:56:12,146 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-18 09:56:12,150 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-18 09:56:12,151 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-18 09:56:12,152 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-18 09:56:12,156 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-18 09:56:12,158 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-18 09:56:12,162 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-18 09:56:12,163 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-18 09:56:12,166 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-18 09:56:12,168 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-18 09:56:12,168 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-18 09:56:12,169 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-18 09:56:12,170 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-18 09:56:12,170 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-18 09:56:12,171 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-18 09:56:12,172 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-18 09:56:12,173 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-18 09:56:12,173 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-18 09:56:12,174 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-18 09:56:12,174 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-18 09:56:12,175 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-18 09:56:12,182 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-18 09:56:12,183 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-18 09:56:12,183 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-09-18 09:56:12,209 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-18 09:56:12,210 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-18 09:56:12,211 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-18 09:56:12,212 INFO L133 SettingsManager]: * User list type=DISABLED [2018-09-18 09:56:12,212 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-09-18 09:56:12,212 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-09-18 09:56:12,212 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-09-18 09:56:12,215 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-09-18 09:56:12,216 INFO L133 SettingsManager]: * Log string format=TERM [2018-09-18 09:56:12,216 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-09-18 09:56:12,216 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-09-18 09:56:12,216 INFO L133 SettingsManager]: * Interval Domain=false [2018-09-18 09:56:12,217 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-18 09:56:12,217 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-18 09:56:12,218 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-18 09:56:12,218 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-18 09:56:12,218 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-18 09:56:12,218 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-18 09:56:12,218 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-18 09:56:12,220 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-18 09:56:12,220 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-18 09:56:12,220 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-18 09:56:12,220 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-18 09:56:12,220 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-18 09:56:12,221 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-18 09:56:12,221 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-18 09:56:12,221 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-18 09:56:12,221 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-18 09:56:12,221 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-09-18 09:56:12,222 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-18 09:56:12,222 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-18 09:56:12,222 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-18 09:56:12,222 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-09-18 09:56:12,222 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-09-18 09:56:12,276 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-18 09:56:12,290 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-18 09:56:12,293 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-18 09:56:12,295 INFO L271 PluginConnector]: Initializing CDTParser... [2018-09-18 09:56:12,296 INFO L276 PluginConnector]: CDTParser initialized [2018-09-18 09:56:12,296 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-09-18 09:56:12,654 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68c70a5ef/9fc60a4f1fe34d7a90b51274be6b5b19/FLAGd96f468d1 [2018-09-18 09:56:12,871 INFO L277 CDTParser]: Found 1 translation units. [2018-09-18 09:56:12,872 INFO L159 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/eureka_05_true-unreach-call_true-termination.i [2018-09-18 09:56:12,880 INFO L325 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68c70a5ef/9fc60a4f1fe34d7a90b51274be6b5b19/FLAGd96f468d1 [2018-09-18 09:56:12,904 INFO L333 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68c70a5ef/9fc60a4f1fe34d7a90b51274be6b5b19 [2018-09-18 09:56:12,916 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-18 09:56:12,918 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-09-18 09:56:12,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-09-18 09:56:12,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-09-18 09:56:12,927 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-09-18 09:56:12,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 09:56:12" (1/1) ... [2018-09-18 09:56:12,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7add9a35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 09:56:12, skipping insertion in model container [2018-09-18 09:56:12,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.09 09:56:12" (1/1) ... [2018-09-18 09:56:12,945 INFO L160 ieTranslatorObserver]: Starting translation in SV-COMP mode [2018-09-18 09:56:13,187 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-18 09:56:13,215 INFO L424 MainDispatcher]: Starting main dispatcher in SV-COMP mode [2018-09-18 09:56:13,228 INFO L170 PostProcessor]: Settings: Checked method=main [2018-09-18 09:56:13,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 09:56:13 WrapperNode [2018-09-18 09:56:13,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-09-18 09:56:13,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-18 09:56:13,250 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-18 09:56:13,250 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-18 09:56:13,261 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 09:56:13" (1/1) ... [2018-09-18 09:56:13,270 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 09:56:13" (1/1) ... [2018-09-18 09:56:13,278 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-18 09:56:13,279 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-18 09:56:13,279 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-18 09:56:13,279 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-18 09:56:13,290 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 09:56:13" (1/1) ... [2018-09-18 09:56:13,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 09:56:13" (1/1) ... [2018-09-18 09:56:13,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 09:56:13" (1/1) ... [2018-09-18 09:56:13,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 09:56:13" (1/1) ... [2018-09-18 09:56:13,296 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 09:56:13" (1/1) ... [2018-09-18 09:56:13,304 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 09:56:13" (1/1) ... [2018-09-18 09:56:13,305 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 09:56:13" (1/1) ... [2018-09-18 09:56:13,312 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-18 09:56:13,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-18 09:56:13,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-18 09:56:13,313 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-18 09:56:13,314 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 09:56:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-18 09:56:13,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-09-18 09:56:13,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-09-18 09:56:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-18 09:56:13,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-18 09:56:13,400 INFO L130 BoogieDeclarations]: Found specification of procedure SelectionSort [2018-09-18 09:56:13,400 INFO L138 BoogieDeclarations]: Found implementation of procedure SelectionSort [2018-09-18 09:56:13,401 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-09-18 09:56:13,401 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-09-18 09:56:13,401 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-09-18 09:56:13,401 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-09-18 09:56:13,916 INFO L356 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-18 09:56:13,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 09:56:13 BoogieIcfgContainer [2018-09-18 09:56:13,916 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-18 09:56:13,917 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-18 09:56:13,918 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-18 09:56:13,921 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-18 09:56:13,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.09 09:56:12" (1/3) ... [2018-09-18 09:56:13,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b9e934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 09:56:13, skipping insertion in model container [2018-09-18 09:56:13,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.09 09:56:13" (2/3) ... [2018-09-18 09:56:13,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74b9e934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.09 09:56:13, skipping insertion in model container [2018-09-18 09:56:13,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.09 09:56:13" (3/3) ... [2018-09-18 09:56:13,925 INFO L112 eAbstractionObserver]: Analyzing ICFG eureka_05_true-unreach-call_true-termination.i [2018-09-18 09:56:13,935 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-18 09:56:13,944 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-18 09:56:13,995 INFO L130 ementStrategyFactory]: Using default assertion order modulation [2018-09-18 09:56:13,996 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-18 09:56:13,996 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-18 09:56:13,997 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-18 09:56:13,997 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-18 09:56:13,997 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-18 09:56:13,997 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-18 09:56:13,997 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-18 09:56:13,998 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-18 09:56:14,017 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-09-18 09:56:14,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-09-18 09:56:14,025 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:56:14,026 INFO L376 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 09:56:14,027 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:56:14,033 INFO L82 PathProgramCache]: Analyzing trace with hash 163297510, now seen corresponding path program 1 times [2018-09-18 09:56:14,036 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:56:14,086 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:14,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:56:14,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:14,087 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:56:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:14,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 09:56:14,174 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 09:56:14,174 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-18 09:56:14,174 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 09:56:14,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-09-18 09:56:14,196 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-09-18 09:56:14,197 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-18 09:56:14,200 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2018-09-18 09:56:14,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:56:14,235 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2018-09-18 09:56:14,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-09-18 09:56:14,237 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2018-09-18 09:56:14,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:56:14,247 INFO L225 Difference]: With dead ends: 63 [2018-09-18 09:56:14,247 INFO L226 Difference]: Without dead ends: 32 [2018-09-18 09:56:14,251 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-09-18 09:56:14,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-09-18 09:56:14,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-09-18 09:56:14,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-09-18 09:56:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-09-18 09:56:14,294 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2018-09-18 09:56:14,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:56:14,295 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-09-18 09:56:14,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-09-18 09:56:14,296 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-09-18 09:56:14,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-09-18 09:56:14,299 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:56:14,299 INFO L376 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-09-18 09:56:14,300 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:56:14,300 INFO L82 PathProgramCache]: Analyzing trace with hash -541222088, now seen corresponding path program 1 times [2018-09-18 09:56:14,300 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:56:14,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:14,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:56:14,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:14,303 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:56:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:14,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-18 09:56:14,433 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 09:56:14,433 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-18 09:56:14,437 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 09:56:14,439 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-18 09:56:14,439 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-18 09:56:14,439 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-18 09:56:14,443 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 3 states. [2018-09-18 09:56:14,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:56:14,578 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-09-18 09:56:14,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-18 09:56:14,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-09-18 09:56:14,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:56:14,581 INFO L225 Difference]: With dead ends: 58 [2018-09-18 09:56:14,581 INFO L226 Difference]: Without dead ends: 35 [2018-09-18 09:56:14,584 INFO L604 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-09-18 09:56:14,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-18 09:56:14,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-09-18 09:56:14,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-09-18 09:56:14,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-09-18 09:56:14,595 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 21 [2018-09-18 09:56:14,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:56:14,596 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-09-18 09:56:14,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-18 09:56:14,596 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-09-18 09:56:14,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-18 09:56:14,598 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:56:14,598 INFO L376 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-09-18 09:56:14,599 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:56:14,599 INFO L82 PathProgramCache]: Analyzing trace with hash -2063291985, now seen corresponding path program 1 times [2018-09-18 09:56:14,599 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:56:14,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:14,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:56:14,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:14,601 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:56:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:14,779 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-18 09:56:14,780 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-18 09:56:14,780 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-09-18 09:56:14,780 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 09:56:14,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-18 09:56:14,781 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-18 09:56:14,781 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-18 09:56:14,782 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 5 states. [2018-09-18 09:56:15,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:56:15,005 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-09-18 09:56:15,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-18 09:56:15,006 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-09-18 09:56:15,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:56:15,007 INFO L225 Difference]: With dead ends: 55 [2018-09-18 09:56:15,007 INFO L226 Difference]: Without dead ends: 42 [2018-09-18 09:56:15,008 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-09-18 09:56:15,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-09-18 09:56:15,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 36. [2018-09-18 09:56:15,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-09-18 09:56:15,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-09-18 09:56:15,016 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 24 [2018-09-18 09:56:15,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:56:15,016 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-09-18 09:56:15,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-18 09:56:15,016 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-09-18 09:56:15,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-18 09:56:15,017 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:56:15,018 INFO L376 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-09-18 09:56:15,018 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:56:15,018 INFO L82 PathProgramCache]: Analyzing trace with hash -1077618875, now seen corresponding path program 1 times [2018-09-18 09:56:15,018 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:56:15,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:15,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:56:15,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:15,020 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:56:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:15,386 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-18 09:56:15,386 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:15,387 INFO L197 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-09-18 09:56:15,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:56:15,402 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 09:56:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:15,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:15,504 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-18 09:56:15,504 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:15,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-18 09:56:15,621 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:15,621 INFO L197 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-09-18 09:56:15,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:56:15,639 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 09:56:15,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:15,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:15,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-18 09:56:15,674 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:15,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-09-18 09:56:15,729 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 09:56:15,729 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4, 4, 4] total 11 [2018-09-18 09:56:15,729 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 09:56:15,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-18 09:56:15,730 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-18 09:56:15,730 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-09-18 09:56:15,734 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 9 states. [2018-09-18 09:56:16,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:56:16,143 INFO L93 Difference]: Finished difference Result 75 states and 88 transitions. [2018-09-18 09:56:16,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-18 09:56:16,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 30 [2018-09-18 09:56:16,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:56:16,147 INFO L225 Difference]: With dead ends: 75 [2018-09-18 09:56:16,147 INFO L226 Difference]: Without dead ends: 50 [2018-09-18 09:56:16,148 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 116 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-09-18 09:56:16,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-09-18 09:56:16,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2018-09-18 09:56:16,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-18 09:56:16,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-09-18 09:56:16,157 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 30 [2018-09-18 09:56:16,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:56:16,158 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-09-18 09:56:16,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-18 09:56:16,158 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-09-18 09:56:16,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-09-18 09:56:16,159 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:56:16,159 INFO L376 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-09-18 09:56:16,160 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:56:16,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1996404421, now seen corresponding path program 1 times [2018-09-18 09:56:16,160 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:56:16,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:16,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:56:16,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:16,162 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:56:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:16,271 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-09-18 09:56:16,272 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:16,272 INFO L197 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) [2018-09-18 09:56:16,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:56:16,288 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-18 09:56:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:16,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-18 09:56:16,381 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:16,662 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-09-18 09:56:16,699 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:16,699 INFO L197 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-09-18 09:56:16,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:56:16,729 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 09:56:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:16,764 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:16,885 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-18 09:56:16,885 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:17,173 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-09-18 09:56:17,176 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 09:56:17,176 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5, 5, 6] total 17 [2018-09-18 09:56:17,176 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 09:56:17,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-18 09:56:17,177 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-18 09:56:17,179 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2018-09-18 09:56:17,179 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-09-18 09:56:17,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:56:17,430 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2018-09-18 09:56:17,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-18 09:56:17,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2018-09-18 09:56:17,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:56:17,432 INFO L225 Difference]: With dead ends: 78 [2018-09-18 09:56:17,432 INFO L226 Difference]: Without dead ends: 51 [2018-09-18 09:56:17,433 INFO L604 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-09-18 09:56:17,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-18 09:56:17,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-09-18 09:56:17,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-09-18 09:56:17,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2018-09-18 09:56:17,442 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 37 [2018-09-18 09:56:17,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:56:17,443 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2018-09-18 09:56:17,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-18 09:56:17,443 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-09-18 09:56:17,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-18 09:56:17,445 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:56:17,445 INFO L376 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-09-18 09:56:17,445 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:56:17,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1535047918, now seen corresponding path program 2 times [2018-09-18 09:56:17,446 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:56:17,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:17,447 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:56:17,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:17,447 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:56:17,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:17,625 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-18 09:56:17,625 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:17,625 INFO L197 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-09-18 09:56:17,634 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-18 09:56:17,635 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-18 09:56:17,672 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-18 09:56:17,673 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:56:17,676 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:17,796 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-18 09:56:17,797 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:17,856 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-09-18 09:56:17,878 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:17,879 INFO L197 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-09-18 09:56:17,894 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-18 09:56:17,895 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-18 09:56:17,933 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-18 09:56:17,934 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:56:17,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:18,080 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-18 09:56:18,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:18,235 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-09-18 09:56:18,237 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 09:56:18,237 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6, 6, 7] total 20 [2018-09-18 09:56:18,237 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 09:56:18,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-18 09:56:18,238 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-18 09:56:18,238 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=291, Unknown=0, NotChecked=0, Total=380 [2018-09-18 09:56:18,239 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand 12 states. [2018-09-18 09:56:18,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:56:18,673 INFO L93 Difference]: Finished difference Result 99 states and 115 transitions. [2018-09-18 09:56:18,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-18 09:56:18,674 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 46 [2018-09-18 09:56:18,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:56:18,675 INFO L225 Difference]: With dead ends: 99 [2018-09-18 09:56:18,675 INFO L226 Difference]: Without dead ends: 66 [2018-09-18 09:56:18,676 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 167 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=164, Invalid=538, Unknown=0, NotChecked=0, Total=702 [2018-09-18 09:56:18,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-09-18 09:56:18,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 57. [2018-09-18 09:56:18,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-18 09:56:18,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 63 transitions. [2018-09-18 09:56:18,685 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 63 transitions. Word has length 46 [2018-09-18 09:56:18,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:56:18,685 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 63 transitions. [2018-09-18 09:56:18,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-18 09:56:18,686 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2018-09-18 09:56:18,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-09-18 09:56:18,689 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:56:18,689 INFO L376 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-09-18 09:56:18,689 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:56:18,690 INFO L82 PathProgramCache]: Analyzing trace with hash 933606354, now seen corresponding path program 3 times [2018-09-18 09:56:18,690 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:56:18,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:18,691 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-18 09:56:18,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:18,691 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:56:18,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 10 proven. 12 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-09-18 09:56:18,821 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:18,821 INFO L197 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-09-18 09:56:18,830 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-18 09:56:18,831 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-18 09:56:18,848 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-09-18 09:56:18,848 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:56:18,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:18,879 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-09-18 09:56:18,881 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:18,891 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:56:18,892 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-09-18 09:56:19,070 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-09-18 09:56:19,071 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:19,291 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-09-18 09:56:19,313 INFO L313 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-09-18 09:56:19,313 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [7] total 19 [2018-09-18 09:56:19,313 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 09:56:19,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-18 09:56:19,314 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-18 09:56:19,314 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2018-09-18 09:56:19,314 INFO L87 Difference]: Start difference. First operand 57 states and 63 transitions. Second operand 8 states. [2018-09-18 09:56:19,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:56:19,573 INFO L93 Difference]: Finished difference Result 67 states and 73 transitions. [2018-09-18 09:56:19,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-18 09:56:19,577 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-09-18 09:56:19,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:56:19,579 INFO L225 Difference]: With dead ends: 67 [2018-09-18 09:56:19,579 INFO L226 Difference]: Without dead ends: 65 [2018-09-18 09:56:19,580 INFO L604 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-09-18 09:56:19,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-18 09:56:19,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-09-18 09:56:19,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-09-18 09:56:19,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2018-09-18 09:56:19,594 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 53 [2018-09-18 09:56:19,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:56:19,595 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2018-09-18 09:56:19,595 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-18 09:56:19,595 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2018-09-18 09:56:19,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-09-18 09:56:19,596 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:56:19,597 INFO L376 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-09-18 09:56:19,597 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:56:19,597 INFO L82 PathProgramCache]: Analyzing trace with hash -368482959, now seen corresponding path program 1 times [2018-09-18 09:56:19,597 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:56:19,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:19,600 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-18 09:56:19,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:19,600 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:56:19,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:19,831 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 12 proven. 12 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-09-18 09:56:19,832 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:19,832 INFO L197 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-09-18 09:56:19,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:56:19,845 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 09:56:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:19,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:19,965 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-09-18 09:56:19,965 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:20,085 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-09-18 09:56:20,117 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:20,117 INFO L197 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-09-18 09:56:20,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:56:20,145 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 09:56:20,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:20,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:20,210 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-09-18 09:56:20,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:20,548 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 26 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2018-09-18 09:56:20,550 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 09:56:20,550 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7, 7, 7] total 12 [2018-09-18 09:56:20,550 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 09:56:20,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-18 09:56:20,551 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-18 09:56:20,551 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-09-18 09:56:20,552 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand 12 states. [2018-09-18 09:56:20,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:56:20,876 INFO L93 Difference]: Finished difference Result 134 states and 153 transitions. [2018-09-18 09:56:20,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-18 09:56:20,878 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 61 [2018-09-18 09:56:20,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:56:20,880 INFO L225 Difference]: With dead ends: 134 [2018-09-18 09:56:20,881 INFO L226 Difference]: Without dead ends: 90 [2018-09-18 09:56:20,882 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 232 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-09-18 09:56:20,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-09-18 09:56:20,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 77. [2018-09-18 09:56:20,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-18 09:56:20,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2018-09-18 09:56:20,897 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 61 [2018-09-18 09:56:20,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:56:20,897 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2018-09-18 09:56:20,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-18 09:56:20,898 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2018-09-18 09:56:20,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-18 09:56:20,899 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:56:20,899 INFO L376 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-09-18 09:56:20,899 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:56:20,899 INFO L82 PathProgramCache]: Analyzing trace with hash -1636873387, now seen corresponding path program 2 times [2018-09-18 09:56:20,900 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:56:20,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:20,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:56:20,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:20,901 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:56:20,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:21,466 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 2 proven. 40 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2018-09-18 09:56:21,467 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:21,467 INFO L197 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-09-18 09:56:21,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-18 09:56:21,477 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-18 09:56:21,524 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-18 09:56:21,525 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:56:21,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-09-18 09:56:21,675 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:21,854 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-09-18 09:56:21,881 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:21,881 INFO L197 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-09-18 09:56:21,898 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-18 09:56:21,898 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-18 09:56:21,958 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-18 09:56:21,959 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:56:21,965 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:21,997 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 28 proven. 8 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2018-09-18 09:56:21,997 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:22,103 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 30 proven. 8 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2018-09-18 09:56:22,105 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 09:56:22,106 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8, 7, 8] total 18 [2018-09-18 09:56:22,106 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 09:56:22,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-18 09:56:22,107 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-18 09:56:22,107 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2018-09-18 09:56:22,108 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand 13 states. [2018-09-18 09:56:22,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:56:22,383 INFO L93 Difference]: Finished difference Result 133 states and 152 transitions. [2018-09-18 09:56:22,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-18 09:56:22,387 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 74 [2018-09-18 09:56:22,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:56:22,390 INFO L225 Difference]: With dead ends: 133 [2018-09-18 09:56:22,391 INFO L226 Difference]: Without dead ends: 89 [2018-09-18 09:56:22,392 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 283 SyntacticMatches, 4 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2018-09-18 09:56:22,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-18 09:56:22,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 81. [2018-09-18 09:56:22,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-18 09:56:22,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 90 transitions. [2018-09-18 09:56:22,404 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 90 transitions. Word has length 74 [2018-09-18 09:56:22,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:56:22,405 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 90 transitions. [2018-09-18 09:56:22,405 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-18 09:56:22,405 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 90 transitions. [2018-09-18 09:56:22,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-18 09:56:22,407 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:56:22,407 INFO L376 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-09-18 09:56:22,407 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:56:22,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1695857684, now seen corresponding path program 3 times [2018-09-18 09:56:22,408 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:56:22,408 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:22,409 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-18 09:56:22,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:22,409 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:56:22,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:22,677 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 36 proven. 34 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-09-18 09:56:22,678 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:22,678 INFO L197 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-09-18 09:56:22,687 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-18 09:56:22,687 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-18 09:56:22,716 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-18 09:56:22,717 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:56:22,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:22,726 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-09-18 09:56:22,726 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:22,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:56:22,727 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-09-18 09:56:22,799 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:22,800 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-09-18 09:56:22,801 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:22,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:56:22,813 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-09-18 09:56:23,234 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 25 proven. 11 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2018-09-18 09:56:23,234 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:23,445 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-09-18 09:56:23,467 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:23,467 INFO L197 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-09-18 09:56:23,484 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-18 09:56:23,484 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-18 09:56:23,571 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-09-18 09:56:23,571 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:56:23,576 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:23,581 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-09-18 09:56:23,581 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:23,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:56:23,584 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-09-18 09:56:23,591 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:23,592 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-09-18 09:56:23,593 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:23,609 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:56:23,610 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-09-18 09:56:23,711 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 25 proven. 5 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-09-18 09:56:23,712 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:23,773 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2018-09-18 09:56:23,775 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 09:56:23,775 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 11, 11, 11] total 26 [2018-09-18 09:56:23,775 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 09:56:23,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-18 09:56:23,776 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-18 09:56:23,776 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2018-09-18 09:56:23,776 INFO L87 Difference]: Start difference. First operand 81 states and 90 transitions. Second operand 19 states. [2018-09-18 09:56:25,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:56:25,038 INFO L93 Difference]: Finished difference Result 154 states and 176 transitions. [2018-09-18 09:56:25,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-18 09:56:25,042 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 78 [2018-09-18 09:56:25,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:56:25,043 INFO L225 Difference]: With dead ends: 154 [2018-09-18 09:56:25,043 INFO L226 Difference]: Without dead ends: 110 [2018-09-18 09:56:25,045 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 302 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 382 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=265, Invalid=1627, Unknown=0, NotChecked=0, Total=1892 [2018-09-18 09:56:25,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-09-18 09:56:25,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2018-09-18 09:56:25,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-18 09:56:25,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 115 transitions. [2018-09-18 09:56:25,060 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 115 transitions. Word has length 78 [2018-09-18 09:56:25,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:56:25,060 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 115 transitions. [2018-09-18 09:56:25,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-18 09:56:25,060 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 115 transitions. [2018-09-18 09:56:25,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-18 09:56:25,062 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:56:25,063 INFO L376 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-09-18 09:56:25,063 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:56:25,063 INFO L82 PathProgramCache]: Analyzing trace with hash 747975567, now seen corresponding path program 4 times [2018-09-18 09:56:25,063 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:56:25,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:25,064 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-18 09:56:25,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:25,065 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:56:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:25,257 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 4 proven. 98 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2018-09-18 09:56:25,258 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:25,258 INFO L197 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-09-18 09:56:25,266 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-18 09:56:25,266 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-18 09:56:25,294 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-18 09:56:25,294 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:56:25,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:25,371 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 74 proven. 18 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-09-18 09:56:25,372 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:25,565 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 78 proven. 18 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-09-18 09:56:25,585 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:25,586 INFO L197 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-09-18 09:56:25,601 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-18 09:56:25,601 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-18 09:56:25,655 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-18 09:56:25,656 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:56:25,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 74 proven. 18 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2018-09-18 09:56:25,689 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:25,794 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 78 proven. 18 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-09-18 09:56:25,796 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 09:56:25,796 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9, 8, 9] total 20 [2018-09-18 09:56:25,796 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 09:56:25,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-18 09:56:25,797 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-18 09:56:25,797 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2018-09-18 09:56:25,798 INFO L87 Difference]: Start difference. First operand 103 states and 115 transitions. Second operand 15 states. [2018-09-18 09:56:26,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:56:26,411 INFO L93 Difference]: Finished difference Result 181 states and 207 transitions. [2018-09-18 09:56:26,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-18 09:56:26,413 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 100 [2018-09-18 09:56:26,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:56:26,414 INFO L225 Difference]: With dead ends: 181 [2018-09-18 09:56:26,414 INFO L226 Difference]: Without dead ends: 115 [2018-09-18 09:56:26,415 INFO L604 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-09-18 09:56:26,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-18 09:56:26,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 107. [2018-09-18 09:56:26,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-18 09:56:26,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2018-09-18 09:56:26,433 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 100 [2018-09-18 09:56:26,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:56:26,433 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2018-09-18 09:56:26,434 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-18 09:56:26,434 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2018-09-18 09:56:26,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-18 09:56:26,435 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:56:26,436 INFO L376 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-09-18 09:56:26,436 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:56:26,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1940124314, now seen corresponding path program 5 times [2018-09-18 09:56:26,437 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:56:26,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:26,438 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-18 09:56:26,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:26,438 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:56:26,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:27,056 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 102 proven. 68 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-18 09:56:27,056 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:27,056 INFO L197 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-09-18 09:56:27,064 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-18 09:56:27,064 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-18 09:56:27,084 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-09-18 09:56:27,084 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:56:27,087 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:27,293 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:27,294 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:27,296 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:27,308 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:27,352 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-09-18 09:56:27,397 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:27,403 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:27,415 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 85 [2018-09-18 09:56:27,417 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-09-18 09:56:27,957 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:27,961 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 20 [2018-09-18 09:56:27,962 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:28,124 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:28,126 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:28,160 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:28,175 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:28,177 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:28,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, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 76 [2018-09-18 09:56:28,193 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-09-18 09:56:28,338 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:28,339 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:28,340 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:28,346 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:28,348 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 28 treesize of output 49 [2018-09-18 09:56:28,349 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:28,461 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:28,462 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:28,464 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:28,475 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:28,482 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 35 treesize of output 64 [2018-09-18 09:56:28,483 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:28,648 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:28,650 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:28,651 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:28,663 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:28,681 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 4 case distinctions, treesize of input 30 treesize of output 64 [2018-09-18 09:56:28,683 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-09-18 09:56:28,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 10 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-09-18 09:56:28,831 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-09-18 09:56:28,832 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 3 variables, input treesize:36, output treesize:62 [2018-09-18 09:56:29,361 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:29,362 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:29,364 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:29,368 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:29,370 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:29,377 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:29,379 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:29,385 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:29,386 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:29,423 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-09-18 09:56:29,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 9 xjuncts. [2018-09-18 09:56:29,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:56:29,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:88, output treesize:13 [2018-09-18 09:56:29,616 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 111 proven. 55 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-09-18 09:56:29,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:32,859 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:32,877 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:32,884 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:32,885 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:32,886 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:32,886 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:32,888 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:32,892 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:32,901 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-09-18 09:56:33,025 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 39 [2018-09-18 09:56:33,033 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-18 09:56:33,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:33,035 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-18 09:56:33,035 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:33,041 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-18 09:56:33,041 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:33,048 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,051 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,052 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,053 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,054 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,056 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,057 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,071 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,076 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,077 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,078 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,079 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:33,079 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,080 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:33,081 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,082 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,083 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,083 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,084 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,085 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,087 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 131 [2018-09-18 09:56:33,088 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:33,094 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,097 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,098 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,099 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,099 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,100 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,108 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,109 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,114 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:33,123 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 106 [2018-09-18 09:56:33,125 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-09-18 09:56:33,129 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-18 09:56:33,130 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:33,137 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-18 09:56:33,137 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:33,139 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-18 09:56:33,140 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:33,141 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-18 09:56:33,142 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:33,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:56:33,217 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:56:33,218 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:94, output treesize:30 [2018-09-18 09:56:33,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-09-18 09:56:33,401 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:33,402 INFO L197 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-09-18 09:56:33,420 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-18 09:56:33,420 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-18 09:56:33,523 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-09-18 09:56:33,523 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:56:33,528 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:33,556 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:33,559 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:33,564 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:33,585 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:33,648 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-09-18 09:56:33,695 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:33,710 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 64 treesize of output 61 [2018-09-18 09:56:33,712 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:33,959 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:33,960 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:33,961 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:33,962 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:33,964 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 30 treesize of output 49 [2018-09-18 09:56:33,965 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:34,143 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:34,144 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:34,145 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:34,145 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:34,147 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 30 treesize of output 49 [2018-09-18 09:56:34,148 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:34,316 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:34,318 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:34,319 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:34,328 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:34,332 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-09-18 09:56:34,333 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:34,482 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:34,483 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:34,484 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:34,495 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:34,499 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-09-18 09:56:34,500 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:34,648 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:34,649 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:34,650 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:34,655 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:34,656 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 47 [2018-09-18 09:56:34,657 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:34,830 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:34,832 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:34,835 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:34,851 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:34,854 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-09-18 09:56:34,855 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:35,017 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:35,021 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:35,022 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:35,025 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:35,028 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:35,029 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 66 [2018-09-18 09:56:35,029 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:35,160 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:35,163 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:35,166 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:35,178 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:35,186 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-09-18 09:56:35,186 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:35,331 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-0 vars, 10 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-09-18 09:56:35,378 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-09-18 09:56:35,379 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:33, output treesize:77 [2018-09-18 09:56:37,701 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 113 proven. 53 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2018-09-18 09:56:37,701 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:56:42,335 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,336 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,336 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,340 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,340 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,341 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,342 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,345 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,354 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-09-18 09:56:42,626 WARN L178 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2018-09-18 09:56:42,630 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,630 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,631 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,631 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,632 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,632 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,633 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,634 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,634 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,635 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,636 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,637 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:42,638 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:56:42,639 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,640 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,641 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,641 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,642 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,643 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,643 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,646 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 131 [2018-09-18 09:56:42,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:42,665 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-18 09:56:42,665 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:42,680 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-18 09:56:42,680 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:42,697 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-18 09:56:42,697 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:42,714 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-18 09:56:42,714 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:42,729 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-18 09:56:42,729 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:42,744 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-18 09:56:42,744 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:42,769 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,806 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,819 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,831 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,831 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,833 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,843 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,843 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,847 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:56:42,847 INFO L303 Elim1Store]: Index analysis took 102 ms [2018-09-18 09:56:42,854 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 106 [2018-09-18 09:56:42,856 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-09-18 09:56:42,859 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-09-18 09:56:42,859 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:42,918 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:56:42,928 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:56:42,929 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 3 variables, input treesize:94, output treesize:30 [2018-09-18 09:56:42,949 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 106 proven. 64 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2018-09-18 09:56:42,951 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 09:56:42,951 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 19, 19, 19, 19] total 52 [2018-09-18 09:56:42,951 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 09:56:42,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-18 09:56:42,952 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-18 09:56:42,953 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=2346, Unknown=3, NotChecked=0, Total=2652 [2018-09-18 09:56:42,953 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand 26 states. [2018-09-18 09:56:47,543 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 35 [2018-09-18 09:56:48,898 WARN L178 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 27 [2018-09-18 09:56:49,970 WARN L178 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 27 [2018-09-18 09:56:50,719 WARN L178 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 29 [2018-09-18 09:56:51,409 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 31 [2018-09-18 09:56:52,185 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 66 [2018-09-18 09:56:54,370 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 61 [2018-09-18 09:56:54,662 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 60 [2018-09-18 09:56:54,989 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 61 [2018-09-18 09:56:55,190 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2018-09-18 09:56:55,483 WARN L178 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2018-09-18 09:56:55,760 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 55 [2018-09-18 09:56:56,906 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2018-09-18 09:56:57,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:56:57,109 INFO L93 Difference]: Finished difference Result 462 states and 561 transitions. [2018-09-18 09:56:57,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-09-18 09:56:57,109 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 104 [2018-09-18 09:56:57,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:56:57,112 INFO L225 Difference]: With dead ends: 462 [2018-09-18 09:56:57,112 INFO L226 Difference]: Without dead ends: 396 [2018-09-18 09:56:57,120 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 446 SyntacticMatches, 7 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9762 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=4212, Invalid=26585, Unknown=3, NotChecked=0, Total=30800 [2018-09-18 09:56:57,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-09-18 09:56:57,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 236. [2018-09-18 09:56:57,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-09-18 09:56:57,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 283 transitions. [2018-09-18 09:56:57,147 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 283 transitions. Word has length 104 [2018-09-18 09:56:57,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:56:57,147 INFO L480 AbstractCegarLoop]: Abstraction has 236 states and 283 transitions. [2018-09-18 09:56:57,147 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-18 09:56:57,147 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 283 transitions. [2018-09-18 09:56:57,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-18 09:56:57,150 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:56:57,150 INFO L376 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-09-18 09:56:57,150 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:56:57,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1684566659, now seen corresponding path program 1 times [2018-09-18 09:56:57,151 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:56:57,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:57,151 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-18 09:56:57,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:56:57,152 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:56:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:58,197 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 32 [2018-09-18 09:56:59,273 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 196 proven. 120 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2018-09-18 09:56:59,273 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:56:59,273 INFO L197 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-09-18 09:56:59,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:56:59,282 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 09:56:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:56:59,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:56:59,319 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-09-18 09:56:59,322 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-09-18 09:56:59,329 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-09-18 09:56:59,331 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-09-18 09:56:59,335 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-09-18 09:56:59,336 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-18 09:56:59,349 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:56:59,364 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:56:59,373 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:56:59,382 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:56:59,392 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:56:59,392 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-09-18 09:57:00,109 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2018-09-18 09:57:00,109 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:57:01,197 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 168 proven. 0 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-09-18 09:57:01,218 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2018-09-18 09:57:01,218 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [26, 13] total 47 [2018-09-18 09:57:01,218 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 09:57:01,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-18 09:57:01,219 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-18 09:57:01,220 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=1873, Unknown=0, NotChecked=0, Total=2162 [2018-09-18 09:57:01,220 INFO L87 Difference]: Start difference. First operand 236 states and 283 transitions. Second operand 13 states. [2018-09-18 09:57:02,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:57:02,369 INFO L93 Difference]: Finished difference Result 484 states and 598 transitions. [2018-09-18 09:57:02,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-18 09:57:02,370 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 122 [2018-09-18 09:57:02,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:57:02,372 INFO L225 Difference]: With dead ends: 484 [2018-09-18 09:57:02,372 INFO L226 Difference]: Without dead ends: 275 [2018-09-18 09:57:02,375 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 224 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 543 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=406, Invalid=2674, Unknown=0, NotChecked=0, Total=3080 [2018-09-18 09:57:02,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-09-18 09:57:02,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 237. [2018-09-18 09:57:02,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-18 09:57:02,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 284 transitions. [2018-09-18 09:57:02,425 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 284 transitions. Word has length 122 [2018-09-18 09:57:02,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:57:02,426 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 284 transitions. [2018-09-18 09:57:02,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-18 09:57:02,426 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 284 transitions. [2018-09-18 09:57:02,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-18 09:57:02,428 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:57:02,428 INFO L376 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-09-18 09:57:02,429 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:57:02,429 INFO L82 PathProgramCache]: Analyzing trace with hash 626728581, now seen corresponding path program 2 times [2018-09-18 09:57:02,429 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:57:02,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:57:02,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:57:02,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:57:02,430 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:57:02,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:57:03,065 WARN L178 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 11 [2018-09-18 09:57:04,010 WARN L178 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 41 [2018-09-18 09:57:04,349 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 27 [2018-09-18 09:57:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 204 proven. 126 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2018-09-18 09:57:04,962 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:57:04,962 INFO L197 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-09-18 09:57:04,976 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-18 09:57:04,976 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-18 09:57:05,034 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-18 09:57:05,035 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:57:05,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:57:05,143 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-09-18 09:57:05,143 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:05,147 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:05,147 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-09-18 09:57:05,206 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:05,207 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-09-18 09:57:05,207 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:05,214 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:05,215 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-18 09:57:05,285 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-09-18 09:57:05,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:05,291 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:05,291 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-18 09:57:05,944 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 4 proven. 340 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2018-09-18 09:57:05,945 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:57:06,474 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-09-18 09:57:06,491 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:06,492 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-09-18 09:57:06,516 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:06,517 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:06,518 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:06,521 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-09-18 09:57:06,522 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:06,531 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:06,537 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:06,542 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:06,542 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:12 [2018-09-18 09:57:06,686 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 13 proven. 41 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2018-09-18 09:57:06,707 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:57:06,707 INFO L197 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-09-18 09:57:06,729 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-18 09:57:06,730 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-18 09:57:06,824 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-18 09:57:06,824 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:57:06,832 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:57:06,840 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-09-18 09:57:06,842 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-09-18 09:57:06,844 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-09-18 09:57:06,849 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-09-18 09:57:06,855 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-09-18 09:57:06,855 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:06,869 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:06,879 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:06,888 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:06,898 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:06,907 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:06,907 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-09-18 09:57:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 0 proven. 129 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2018-09-18 09:57:07,434 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:57:08,459 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 133 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2018-09-18 09:57:08,461 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 4 imperfect interpolant sequences. [2018-09-18 09:57:08,462 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [27, 20, 15, 11] total 75 [2018-09-18 09:57:08,462 INFO L265 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-09-18 09:57:08,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-18 09:57:08,463 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-18 09:57:08,464 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=401, Invalid=5149, Unknown=0, NotChecked=0, Total=5550 [2018-09-18 09:57:08,465 INFO L87 Difference]: Start difference. First operand 237 states and 284 transitions. Second operand 11 states. [2018-09-18 09:57:09,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:57:09,445 INFO L93 Difference]: Finished difference Result 484 states and 597 transitions. [2018-09-18 09:57:09,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-18 09:57:09,446 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 122 [2018-09-18 09:57:09,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:57:09,448 INFO L225 Difference]: With dead ends: 484 [2018-09-18 09:57:09,448 INFO L226 Difference]: Without dead ends: 271 [2018-09-18 09:57:09,451 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 527 GetRequests, 441 SyntacticMatches, 6 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1613 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=478, Invalid=6164, Unknown=0, NotChecked=0, Total=6642 [2018-09-18 09:57:09,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-09-18 09:57:09,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 233. [2018-09-18 09:57:09,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-18 09:57:09,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 279 transitions. [2018-09-18 09:57:09,480 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 279 transitions. Word has length 122 [2018-09-18 09:57:09,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:57:09,481 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 279 transitions. [2018-09-18 09:57:09,481 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-18 09:57:09,481 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 279 transitions. [2018-09-18 09:57:09,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-18 09:57:09,482 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:57:09,482 INFO L376 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-09-18 09:57:09,483 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:57:09,483 INFO L82 PathProgramCache]: Analyzing trace with hash -733917819, now seen corresponding path program 3 times [2018-09-18 09:57:09,483 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:57:09,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:57:09,484 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-18 09:57:09,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:57:09,484 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:57:09,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:57:10,093 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 4 proven. 198 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2018-09-18 09:57:10,093 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:57:10,093 INFO L197 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-09-18 09:57:10,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-18 09:57:10,101 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-18 09:57:10,124 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-09-18 09:57:10,124 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:57:10,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:57:10,133 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-09-18 09:57:10,133 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:10,135 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:10,135 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-09-18 09:57:10,184 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:10,184 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-09-18 09:57:10,184 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:10,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:10,190 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-09-18 09:57:10,230 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:10,231 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:10,232 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:10,233 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-09-18 09:57:10,233 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:10,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:10,245 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:27 [2018-09-18 09:57:10,492 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 33 proven. 14 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-09-18 09:57:10,492 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:57:10,894 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-09-18 09:57:10,915 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:57:10,915 INFO L197 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-09-18 09:57:10,931 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-18 09:57:10,931 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-09-18 09:57:11,110 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-09-18 09:57:11,110 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:57:11,115 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:57:11,117 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-09-18 09:57:11,117 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:11,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:11,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-09-18 09:57:11,130 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:11,131 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-09-18 09:57:11,131 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:11,140 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:11,140 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:15 [2018-09-18 09:57:11,153 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:11,154 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:11,155 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:11,155 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-09-18 09:57:11,156 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:11,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:11,168 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:28, output treesize:27 [2018-09-18 09:57:11,246 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 33 proven. 14 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-09-18 09:57:11,246 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:57:11,303 INFO L134 CoverageAnalysis]: Checked inductivity of 408 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2018-09-18 09:57:11,305 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 09:57:11,306 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 13, 14, 13] total 34 [2018-09-18 09:57:11,306 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 09:57:11,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-18 09:57:11,306 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-18 09:57:11,307 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=966, Unknown=0, NotChecked=0, Total=1122 [2018-09-18 09:57:11,307 INFO L87 Difference]: Start difference. First operand 233 states and 279 transitions. Second operand 25 states. [2018-09-18 09:57:12,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:57:12,793 INFO L93 Difference]: Finished difference Result 494 states and 606 transitions. [2018-09-18 09:57:12,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-18 09:57:12,794 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 122 [2018-09-18 09:57:12,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:57:12,796 INFO L225 Difference]: With dead ends: 494 [2018-09-18 09:57:12,796 INFO L226 Difference]: Without dead ends: 313 [2018-09-18 09:57:12,798 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 466 SyntacticMatches, 3 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 614 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=380, Invalid=2376, Unknown=0, NotChecked=0, Total=2756 [2018-09-18 09:57:12,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-09-18 09:57:12,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 238. [2018-09-18 09:57:12,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-09-18 09:57:12,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 284 transitions. [2018-09-18 09:57:12,832 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 284 transitions. Word has length 122 [2018-09-18 09:57:12,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:57:12,832 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 284 transitions. [2018-09-18 09:57:12,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-18 09:57:12,833 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 284 transitions. [2018-09-18 09:57:12,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-18 09:57:12,834 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:57:12,834 INFO L376 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-09-18 09:57:12,834 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:57:12,835 INFO L82 PathProgramCache]: Analyzing trace with hash 882211364, now seen corresponding path program 4 times [2018-09-18 09:57:12,835 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:57:12,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:57:12,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-18 09:57:12,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:57:12,836 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:57:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:57:13,327 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 6 proven. 190 refuted. 0 times theorem prover too weak. 233 trivial. 0 not checked. [2018-09-18 09:57:13,327 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:57:13,327 INFO L197 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-09-18 09:57:13,335 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-18 09:57:13,335 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-18 09:57:13,368 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-18 09:57:13,368 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:57:13,371 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:57:13,377 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-09-18 09:57:13,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-09-18 09:57:13,388 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-09-18 09:57:13,391 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-09-18 09:57:13,397 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-09-18 09:57:13,398 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:13,412 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:13,424 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:13,433 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:13,441 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:13,451 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:13,451 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-09-18 09:57:13,838 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2018-09-18 09:57:13,838 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:57:14,302 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 161 proven. 9 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2018-09-18 09:57:14,324 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:57:14,324 INFO L197 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-09-18 09:57:14,341 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-18 09:57:14,341 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-09-18 09:57:14,422 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-18 09:57:14,422 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:57:14,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:57:14,430 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-09-18 09:57:14,432 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-09-18 09:57:14,435 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-09-18 09:57:14,443 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-09-18 09:57:14,445 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-09-18 09:57:14,446 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:14,459 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:14,471 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:14,482 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:14,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:14,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:14,504 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-09-18 09:57:14,603 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2018-09-18 09:57:14,604 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:57:14,748 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 161 proven. 9 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2018-09-18 09:57:14,750 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 09:57:14,751 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12, 12, 12] total 32 [2018-09-18 09:57:14,751 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 09:57:14,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-18 09:57:14,752 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-18 09:57:14,752 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=830, Unknown=0, NotChecked=0, Total=992 [2018-09-18 09:57:14,752 INFO L87 Difference]: Start difference. First operand 238 states and 284 transitions. Second operand 23 states. [2018-09-18 09:57:17,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:57:17,367 INFO L93 Difference]: Finished difference Result 560 states and 692 transitions. [2018-09-18 09:57:17,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-18 09:57:17,367 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 130 [2018-09-18 09:57:17,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:57:17,370 INFO L225 Difference]: With dead ends: 560 [2018-09-18 09:57:17,370 INFO L226 Difference]: Without dead ends: 352 [2018-09-18 09:57:17,372 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 549 GetRequests, 501 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 544 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=407, Invalid=1755, Unknown=0, NotChecked=0, Total=2162 [2018-09-18 09:57:17,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-09-18 09:57:17,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 234. [2018-09-18 09:57:17,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-09-18 09:57:17,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 279 transitions. [2018-09-18 09:57:17,411 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 279 transitions. Word has length 130 [2018-09-18 09:57:17,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:57:17,412 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 279 transitions. [2018-09-18 09:57:17,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-18 09:57:17,412 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 279 transitions. [2018-09-18 09:57:17,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-18 09:57:17,413 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:57:17,413 INFO L376 BasicCegarLoop]: trace histogram [15, 10, 10, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 09:57:17,414 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:57:17,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1712548904, now seen corresponding path program 5 times [2018-09-18 09:57:17,414 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:57:17,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:57:17,415 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-18 09:57:17,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:57:17,415 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:57:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:57:17,903 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 6 proven. 193 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2018-09-18 09:57:17,903 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:57:17,903 INFO L197 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-09-18 09:57:17,911 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-18 09:57:17,911 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-18 09:57:17,946 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-09-18 09:57:17,946 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:57:17,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:57:18,202 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:18,203 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:18,204 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:18,205 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:18,213 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-09-18 09:57:18,216 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:18,217 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:18,218 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:18,222 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:18,225 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-09-18 09:57:18,225 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:18,236 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:18,245 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:18,245 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:24 [2018-09-18 09:57:18,421 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:18,422 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:18,423 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:18,425 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:18,429 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-09-18 09:57:18,434 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:18,435 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:18,436 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:18,440 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:18,443 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-09-18 09:57:18,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:18,455 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:18,464 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:18,465 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:24 [2018-09-18 09:57:18,605 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-09-18 09:57:18,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:18,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:18,606 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:29, output treesize:1 [2018-09-18 09:57:18,630 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 223 proven. 99 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2018-09-18 09:57:18,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:57:21,480 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:21,482 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:21,493 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:21,550 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-09-18 09:57:22,380 WARN L178 SmtUtils]: Spent 819.00 ms on a formula simplification. DAG size of input: 278 DAG size of output: 205 [2018-09-18 09:57:22,390 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,390 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,390 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,391 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,397 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,400 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 0 case distinctions, treesize of input 65 treesize of output 98 [2018-09-18 09:57:22,404 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,405 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,405 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,406 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:22,413 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 46 treesize of output 77 [2018-09-18 09:57:22,441 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,442 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,442 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,443 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,443 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,443 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,451 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 55 [2018-09-18 09:57:22,452 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:22,455 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:22,471 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:22,475 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,475 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,476 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,476 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,476 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,478 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,479 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,493 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,503 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 1 case distinctions, treesize of input 68 treesize of output 116 [2018-09-18 09:57:22,507 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,507 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,508 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,525 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 49 treesize of output 79 [2018-09-18 09:57:22,639 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 29 [2018-09-18 09:57:22,643 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,643 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,643 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,644 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,644 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,647 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,647 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,652 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,673 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 35 treesize of output 88 [2018-09-18 09:57:22,676 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-09-18 09:57:22,690 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:22,712 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:22,716 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,717 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,717 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,718 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,721 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,722 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,737 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,762 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 66 treesize of output 132 [2018-09-18 09:57:22,769 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,770 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,770 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,789 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 107 [2018-09-18 09:57:22,845 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,846 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,846 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,847 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,847 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,847 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,848 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,850 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,855 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,855 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:22,876 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 35 treesize of output 91 [2018-09-18 09:57:22,878 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 4 xjuncts. [2018-09-18 09:57:22,923 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:23,036 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,036 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,037 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,037 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,040 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,041 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,047 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,071 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 111 [2018-09-18 09:57:23,184 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-09-18 09:57:23,187 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,188 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,188 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,189 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,189 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,189 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,190 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,191 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,191 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,192 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,196 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,204 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 45 treesize of output 86 [2018-09-18 09:57:23,205 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:23,259 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,260 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,260 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,260 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,261 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,263 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,265 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,267 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,268 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,268 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,274 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,275 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,278 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:23,305 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 3 case distinctions, treesize of input 55 treesize of output 135 [2018-09-18 09:57:23,309 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 6 xjuncts. [2018-09-18 09:57:23,380 INFO L267 ElimStorePlain]: Start of recursive call 12: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:23,417 INFO L267 ElimStorePlain]: Start of recursive call 9: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:24,035 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,036 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,037 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,043 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,048 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,049 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,050 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,051 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,057 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,077 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,131 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 64 treesize of output 154 [2018-09-18 09:57:24,146 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,146 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,147 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,147 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,148 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:24,148 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 113 treesize of output 124 [2018-09-18 09:57:24,208 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,209 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,210 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,210 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,211 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,211 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,212 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,213 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,213 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,214 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,214 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,222 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,225 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 5 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 85 [2018-09-18 09:57:24,227 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:24,250 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:24,705 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,705 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,706 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,711 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,713 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,714 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,714 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,715 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,717 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,722 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,732 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,769 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 140 [2018-09-18 09:57:24,950 WARN L178 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 71 [2018-09-18 09:57:24,956 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,957 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,957 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,958 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,960 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,965 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,965 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,966 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,967 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,971 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,971 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,972 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,974 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:24,986 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:25,038 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-09-18 09:57:25,039 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-09-18 09:57:25,067 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 36 xjuncts. [2018-09-18 09:57:25,398 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:25,399 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:25,400 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:25,400 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:25,401 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:25,402 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:25,402 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:25,403 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:25,404 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:25,404 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:25,405 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:25,409 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:25,412 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:25,414 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:25,416 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:25,419 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:25,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, 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-09-18 09:57:25,452 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 8 xjuncts. [2018-09-18 09:57:25,683 INFO L267 ElimStorePlain]: Start of recursive call 18: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-09-18 09:57:26,035 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,036 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,036 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,039 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,041 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,042 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,046 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,046 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,050 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,057 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,100 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 2 new quantified variables, introduced 8 case distinctions, treesize of input 55 treesize of output 140 [2018-09-18 09:57:26,540 WARN L178 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 138 [2018-09-18 09:57:26,544 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,545 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,545 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,546 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,546 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,547 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,550 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,550 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,551 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,551 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,552 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,553 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,553 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,555 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,558 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,575 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 6 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 115 [2018-09-18 09:57:26,578 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 2 xjuncts. [2018-09-18 09:57:26,772 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,773 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,773 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,774 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,776 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,779 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,781 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,782 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,783 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,784 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,785 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,785 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,789 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,792 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,795 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,800 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,803 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:26,848 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 6 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 171 [2018-09-18 09:57:26,848 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-09-18 09:57:26,878 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 36 xjuncts. [2018-09-18 09:57:27,313 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,314 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,315 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,315 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,320 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,321 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,324 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,324 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,325 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,326 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,327 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,327 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,329 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,334 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,335 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 54 treesize of output 143 [2018-09-18 09:57:27,385 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 10 xjuncts. [2018-09-18 09:57:27,572 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,573 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,573 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,573 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,574 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,574 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,577 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,579 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,592 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,593 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,593 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,593 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,596 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:27,622 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 52 treesize of output 121 [2018-09-18 09:57:27,626 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 6 xjuncts. [2018-09-18 09:57:27,773 INFO L267 ElimStorePlain]: Start of recursive call 21: 7 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:28,247 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,251 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,252 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,253 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,253 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,254 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,254 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,257 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,260 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,293 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-09-18 09:57:28,468 WARN L178 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2018-09-18 09:57:28,473 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,476 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,476 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,477 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,477 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,478 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,479 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,479 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,480 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,480 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,481 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,486 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,490 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,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 51 treesize of output 126 [2018-09-18 09:57:28,523 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 8 xjuncts. [2018-09-18 09:57:28,647 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,647 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,648 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,649 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,649 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,650 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,650 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,651 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,652 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,652 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,653 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,653 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,658 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,659 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,662 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,663 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,689 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 3 case distinctions, treesize of input 51 treesize of output 135 [2018-09-18 09:57:28,694 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 8 xjuncts. [2018-09-18 09:57:28,792 INFO L267 ElimStorePlain]: Start of recursive call 26: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-18 09:57:28,857 INFO L267 ElimStorePlain]: Start of recursive call 15: 12 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-18 09:57:28,862 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,862 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,863 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,865 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,868 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,869 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,869 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,870 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,880 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,898 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 66 treesize of output 127 [2018-09-18 09:57:28,902 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,903 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,903 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,903 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,904 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,905 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:28,915 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 142 [2018-09-18 09:57:28,967 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,967 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,968 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,969 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,969 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,970 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,970 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,971 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,971 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,972 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,973 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:28,984 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 34 treesize of output 79 [2018-09-18 09:57:28,985 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:29,008 INFO L267 ElimStorePlain]: Start of recursive call 30: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:29,060 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,061 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,062 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,062 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,063 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,065 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,065 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,066 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,071 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,072 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:29,073 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,074 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,108 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 61 treesize of output 154 [2018-09-18 09:57:29,279 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 64 [2018-09-18 09:57:29,303 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,319 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,328 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,343 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,351 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,366 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,366 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,367 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,369 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,370 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,371 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,371 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,386 INFO L303 Elim1Store]: Index analysis took 105 ms [2018-09-18 09:57:29,399 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 2 case distinctions, treesize of input 56 treesize of output 122 [2018-09-18 09:57:29,402 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 4 xjuncts. [2018-09-18 09:57:29,510 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,511 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,512 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,512 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,513 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,513 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,514 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,515 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,515 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,516 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,517 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,524 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,527 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 94 [2018-09-18 09:57:29,528 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:29,555 INFO L267 ElimStorePlain]: Start of recursive call 32: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:29,568 INFO L267 ElimStorePlain]: Start of recursive call 29: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:29,861 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,864 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,867 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,868 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,869 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,876 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,910 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 6 case distinctions, treesize of input 62 treesize of output 112 [2018-09-18 09:57:29,915 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,921 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,922 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:29,960 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 95 treesize of output 114 [2018-09-18 09:57:30,154 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2018-09-18 09:57:30,157 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,158 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,158 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,159 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,159 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,159 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,162 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,164 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,166 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 89 [2018-09-18 09:57:30,182 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 2 xjuncts. [2018-09-18 09:57:30,301 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,301 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,302 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,304 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,305 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,305 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,306 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,306 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,307 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,312 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,313 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,345 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-09-18 09:57:30,348 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 4 xjuncts. [2018-09-18 09:57:30,528 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,537 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,547 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,586 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,643 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,651 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,664 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,687 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,689 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,704 INFO L303 Elim1Store]: Index analysis took 233 ms [2018-09-18 09:57:30,727 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-09-18 09:57:30,733 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 6 xjuncts. [2018-09-18 09:57:30,792 INFO L267 ElimStorePlain]: Start of recursive call 36: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:30,856 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,858 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,859 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,859 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,863 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:30,890 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 60 treesize of output 105 [2018-09-18 09:57:31,085 WARN L178 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2018-09-18 09:57:31,088 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,089 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,092 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,093 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 64 [2018-09-18 09:57:31,117 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 2 xjuncts. [2018-09-18 09:57:31,231 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,238 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,239 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,239 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,242 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,245 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,285 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 3 case distinctions, treesize of input 56 treesize of output 92 [2018-09-18 09:57:31,288 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 6 xjuncts. [2018-09-18 09:57:31,370 INFO L267 ElimStorePlain]: Start of recursive call 40: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:31,440 INFO L267 ElimStorePlain]: Start of recursive call 35: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-18 09:57:31,586 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,588 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,590 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,593 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,596 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,599 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,602 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,603 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,608 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 64 treesize of output 161 [2018-09-18 09:57:31,702 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,702 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,706 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,707 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,711 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,749 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 5 case distinctions, treesize of input 117 treesize of output 140 [2018-09-18 09:57:31,967 WARN L178 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2018-09-18 09:57:31,971 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,973 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,973 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,975 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,976 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,977 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,977 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,980 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,983 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,984 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,984 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,985 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,987 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:31,989 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:32,030 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 71 treesize of output 153 [2018-09-18 09:57:32,039 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 12 xjuncts. [2018-09-18 09:57:32,386 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:32,387 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:32,389 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:32,389 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:32,392 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:32,392 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:32,393 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:32,393 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:32,396 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:32,428 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 5 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 122 [2018-09-18 09:57:32,432 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 8 xjuncts. [2018-09-18 09:57:32,553 INFO L267 ElimStorePlain]: Start of recursive call 44: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-09-18 09:57:33,838 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,839 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,840 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,840 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,841 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,843 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,844 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,845 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,845 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,846 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:33,847 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,848 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,868 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 118 [2018-09-18 09:57:33,925 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,925 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,926 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,926 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,926 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,927 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,927 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,927 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,928 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,928 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,931 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,932 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,932 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,933 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,933 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,937 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,943 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:33,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 120 [2018-09-18 09:57:33,956 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 2 xjuncts. [2018-09-18 09:57:34,022 INFO L267 ElimStorePlain]: Start of recursive call 47: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:34,292 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,293 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,293 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,295 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,295 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,296 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,297 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,297 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,298 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,300 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,318 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 1 case distinctions, treesize of input 72 treesize of output 115 [2018-09-18 09:57:34,380 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,381 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,382 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,383 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,383 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,384 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,384 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,385 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,385 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,386 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,387 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,387 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,388 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,392 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,394 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,399 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,404 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,413 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 119 [2018-09-18 09:57:34,415 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 2 xjuncts. [2018-09-18 09:57:34,485 INFO L267 ElimStorePlain]: Start of recursive call 49: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:34,964 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,966 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,967 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,968 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,973 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,974 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,974 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,975 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,978 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:34,978 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:35,031 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 76 treesize of output 137 [2018-09-18 09:57:35,243 WARN L178 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2018-09-18 09:57:35,247 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:35,249 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:35,250 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:35,251 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:35,251 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:35,255 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:35,256 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:35,257 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:35,257 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:35,261 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:35,262 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:35,262 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:35,263 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:35,318 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 71 treesize of output 162 [2018-09-18 09:57:35,330 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 18 xjuncts. [2018-09-18 09:57:35,605 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:35,606 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:35,606 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:35,607 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:35,608 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:35,608 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:35,609 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:35,613 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:35,613 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:35,614 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:35,650 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 60 treesize of output 126 [2018-09-18 09:57:35,654 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 8 xjuncts. [2018-09-18 09:57:35,863 INFO L267 ElimStorePlain]: Start of recursive call 51: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-09-18 09:57:36,768 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:36,769 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:36,771 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:36,773 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:36,774 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:36,774 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:36,775 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:36,776 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:36,776 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:36,778 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:36,807 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 3 case distinctions, treesize of input 65 treesize of output 139 [2018-09-18 09:57:37,017 WARN L178 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 65 [2018-09-18 09:57:37,020 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,021 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,022 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,022 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,023 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,023 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,024 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,025 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,025 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,026 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,035 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 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 86 [2018-09-18 09:57:37,036 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:37,105 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,106 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,107 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,108 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,109 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,109 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,110 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,110 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,111 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,111 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,112 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,113 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,113 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,114 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,114 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,116 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,117 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 18 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 118 [2018-09-18 09:57:37,128 INFO L267 ElimStorePlain]: Start of recursive call 56: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:37,190 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,191 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,191 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,192 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,194 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,195 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,195 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,196 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,197 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,197 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,198 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,198 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,199 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,199 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,202 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,219 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 56 treesize of output 117 [2018-09-18 09:57:37,221 INFO L267 ElimStorePlain]: Start of recursive call 57: End of recursive call: and 2 xjuncts. [2018-09-18 09:57:37,284 INFO L267 ElimStorePlain]: Start of recursive call 54: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:37,642 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,643 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,644 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,647 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,648 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,677 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 100 [2018-09-18 09:57:37,809 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-09-18 09:57:37,811 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,812 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,812 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,812 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,813 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,813 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,820 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-09-18 09:57:37,821 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:37,873 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,874 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,874 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,875 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,876 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,878 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,878 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,879 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,879 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:37,895 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 77 [2018-09-18 09:57:37,896 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 2 xjuncts. [2018-09-18 09:57:37,945 INFO L267 ElimStorePlain]: Start of recursive call 58: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:38,023 INFO L267 ElimStorePlain]: Start of recursive call 43: 18 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-18 09:57:38,402 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,403 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,406 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,411 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,412 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,417 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,427 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,501 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-09-18 09:57:38,522 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,522 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,523 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,523 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,524 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,525 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,565 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 102 treesize of output 137 [2018-09-18 09:57:38,721 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2018-09-18 09:57:38,723 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,724 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,725 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,725 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,726 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,726 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,733 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 40 treesize of output 62 [2018-09-18 09:57:38,734 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:38,790 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,794 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,795 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,796 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,796 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,797 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,798 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,798 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,799 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,799 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,800 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,800 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,801 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,806 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,806 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,833 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 49 treesize of output 124 [2018-09-18 09:57:38,836 INFO L267 ElimStorePlain]: Start of recursive call 64: End of recursive call: and 4 xjuncts. [2018-09-18 09:57:38,921 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,923 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,927 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,928 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,928 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,929 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,929 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,930 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,931 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,931 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,932 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,932 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,936 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:38,969 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 44 treesize of output 123 [2018-09-18 09:57:38,973 INFO L267 ElimStorePlain]: Start of recursive call 65: End of recursive call: and 8 xjuncts. [2018-09-18 09:57:39,042 INFO L267 ElimStorePlain]: Start of recursive call 62: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:39,406 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,407 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,407 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,413 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,414 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,421 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,430 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,496 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 67 treesize of output 143 [2018-09-18 09:57:39,795 WARN L178 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 106 [2018-09-18 09:57:39,801 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,801 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,804 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,808 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,809 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,811 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,811 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,812 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,813 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,815 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,815 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,828 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,829 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:39,885 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 7 case distinctions, treesize of input 68 treesize of output 175 [2018-09-18 09:57:39,885 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-09-18 09:57:39,942 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 56 xjuncts. [2018-09-18 09:57:40,587 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,588 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,588 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,589 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,591 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,592 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,592 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,593 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,614 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 4 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 100 [2018-09-18 09:57:40,616 INFO L267 ElimStorePlain]: Start of recursive call 68: End of recursive call: and 4 xjuncts. [2018-09-18 09:57:40,808 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,809 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,809 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,812 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,815 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,815 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,816 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,821 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,822 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,824 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,825 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,834 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,836 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,845 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:40,896 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 6 new quantified variables, introduced 8 case distinctions, treesize of input 63 treesize of output 183 [2018-09-18 09:57:40,897 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 8 [2018-09-18 09:57:41,009 INFO L267 ElimStorePlain]: Start of recursive call 69: End of recursive call: and 58 xjuncts. [2018-09-18 09:57:41,486 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:41,487 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:41,488 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:41,488 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:41,489 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:41,489 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:41,492 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:41,493 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:41,494 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:41,496 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:41,497 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:41,504 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:41,549 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 57 treesize of output 106 [2018-09-18 09:57:41,550 INFO L267 ElimStorePlain]: Start of recursive call 70: End of recursive call: and 2 xjuncts. [2018-09-18 09:57:41,700 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:41,700 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:41,701 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:41,702 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:41,707 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:41,708 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:41,716 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:41,717 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:41,717 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:41,726 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:41,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 15 disjoint index pairs (out of 21 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 58 treesize of output 184 [2018-09-18 09:57:41,805 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 10 [2018-09-18 09:57:42,233 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 234 xjuncts. [2018-09-18 09:57:44,149 INFO L267 ElimStorePlain]: Start of recursive call 66: 5 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-09-18 09:57:44,531 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,532 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,532 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,533 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,534 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,534 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,535 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,536 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,536 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,542 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,575 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 150 [2018-09-18 09:57:44,760 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 72 [2018-09-18 09:57:44,763 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,764 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,764 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,764 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,765 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,766 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,767 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:44,768 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,768 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,769 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 81 [2018-09-18 09:57:44,770 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:44,859 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,859 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,860 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,860 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,860 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,861 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,861 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,861 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,862 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,863 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,864 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,864 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,865 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,865 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,867 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,868 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,874 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 19 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 133 [2018-09-18 09:57:44,876 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:44,943 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,944 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,944 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,944 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,945 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,945 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,946 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,947 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,947 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,948 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,950 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,951 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,951 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,953 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:44,972 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 65 treesize of output 129 [2018-09-18 09:57:44,973 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 2 xjuncts. [2018-09-18 09:57:45,047 INFO L267 ElimStorePlain]: Start of recursive call 72: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-18 09:57:45,347 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,348 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,348 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,349 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,349 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,350 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,351 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,353 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,359 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,396 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 58 treesize of output 133 [2018-09-18 09:57:45,554 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2018-09-18 09:57:45,557 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,558 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,558 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,559 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,559 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,559 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,560 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,564 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,564 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,565 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,566 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,566 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,567 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,568 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,598 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 56 treesize of output 138 [2018-09-18 09:57:45,601 INFO L267 ElimStorePlain]: Start of recursive call 77: End of recursive call: and 4 xjuncts. [2018-09-18 09:57:45,714 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,715 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,715 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,715 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,716 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,716 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,718 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:45,718 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,719 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:45,727 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 47 treesize of output 77 [2018-09-18 09:57:45,728 INFO L267 ElimStorePlain]: Start of recursive call 78: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:45,787 INFO L267 ElimStorePlain]: Start of recursive call 76: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-09-18 09:57:46,606 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:46,606 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:46,607 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:46,611 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:46,611 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:46,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 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 104 [2018-09-18 09:57:46,788 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2018-09-18 09:57:46,791 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:46,792 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:46,792 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:46,793 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:46,793 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:46,794 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:46,801 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-09-18 09:57:46,802 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:46,855 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:46,856 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:46,857 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:46,857 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:46,858 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:46,859 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:46,859 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:46,860 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:46,861 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:46,877 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 77 [2018-09-18 09:57:46,878 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 2 xjuncts. [2018-09-18 09:57:46,928 INFO L267 ElimStorePlain]: Start of recursive call 79: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:46,996 INFO L267 ElimStorePlain]: Start of recursive call 61: 2 dim-0 vars, 18 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-09-18 09:57:47,124 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:47,124 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:47,125 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:47,131 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 63 [2018-09-18 09:57:47,135 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:47,138 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-09-18 09:57:47,149 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:47,150 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:47,151 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:57:47,154 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-09-18 09:57:47,155 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:47,158 INFO L267 ElimStorePlain]: Start of recursive call 83: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:47,165 INFO L267 ElimStorePlain]: Start of recursive call 82: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:47,198 INFO L267 ElimStorePlain]: Start of recursive call 2: 10 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-09-18 09:57:47,227 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-09-18 09:57:47,228 INFO L202 ElimStorePlain]: Needed 84 recursive calls to eliminate 3 variables, input treesize:88, output treesize:67 [2018-09-18 09:57:49,360 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 231 proven. 79 refuted. 3 times theorem prover too weak. 116 trivial. 0 not checked. [2018-09-18 09:57:49,380 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:57:49,381 INFO L197 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-09-18 09:57:49,397 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-18 09:57:49,398 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder INSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-18 09:57:49,667 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2018-09-18 09:57:49,668 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:57:49,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:57:49,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, 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-09-18 09:57:49,704 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-09-18 09:57:49,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-09-18 09:57:49,710 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:49,711 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:49,712 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:11, output treesize:1 [2018-09-18 09:57:49,758 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:49,759 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:49,760 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:49,760 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:49,766 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-09-18 09:57:49,769 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:49,770 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:49,771 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:49,777 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-09-18 09:57:49,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:49,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:49,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:49,815 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:11 [2018-09-18 09:57:50,047 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:50,048 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:50,049 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:50,051 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:50,056 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-09-18 09:57:50,059 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:50,060 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:50,061 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:57:50,065 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-09-18 09:57:50,066 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:57:50,075 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:50,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:57:50,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:27, output treesize:11 [2018-09-18 09:57:50,220 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 225 proven. 82 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2018-09-18 09:57:50,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:57:52,747 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 234 proven. 79 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2018-09-18 09:57:52,749 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 09:57:52,749 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20, 17, 14, 14] total 65 [2018-09-18 09:57:52,749 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 09:57:52,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-18 09:57:52,750 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-18 09:57:52,750 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=3863, Unknown=3, NotChecked=0, Total=4160 [2018-09-18 09:57:52,751 INFO L87 Difference]: Start difference. First operand 234 states and 279 transitions. Second operand 33 states. [2018-09-18 09:57:59,321 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-09-18 09:58:00,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:58:00,912 INFO L93 Difference]: Finished difference Result 730 states and 915 transitions. [2018-09-18 09:58:00,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-18 09:58:00,912 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 130 [2018-09-18 09:58:00,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:58:00,916 INFO L225 Difference]: With dead ends: 730 [2018-09-18 09:58:00,916 INFO L226 Difference]: Without dead ends: 541 [2018-09-18 09:58:00,918 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 604 GetRequests, 470 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 4801 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=1639, Invalid=16448, Unknown=3, NotChecked=0, Total=18090 [2018-09-18 09:58:00,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-09-18 09:58:00,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 301. [2018-09-18 09:58:00,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-18 09:58:00,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 359 transitions. [2018-09-18 09:58:00,982 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 359 transitions. Word has length 130 [2018-09-18 09:58:00,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:58:00,982 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 359 transitions. [2018-09-18 09:58:00,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-18 09:58:00,983 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 359 transitions. [2018-09-18 09:58:00,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-18 09:58:00,984 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:58:00,984 INFO L376 BasicCegarLoop]: trace histogram [15, 10, 10, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-09-18 09:58:00,984 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:58:00,984 INFO L82 PathProgramCache]: Analyzing trace with hash 475951532, now seen corresponding path program 6 times [2018-09-18 09:58:00,984 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:58:00,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:58:00,985 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-18 09:58:00,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:58:00,985 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:58:01,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:58:01,542 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 6 proven. 256 refuted. 0 times theorem prover too weak. 167 trivial. 0 not checked. [2018-09-18 09:58:01,542 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:58:01,542 INFO L197 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-09-18 09:58:01,552 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-18 09:58:01,552 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-09-18 09:58:01,582 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-09-18 09:58:01,583 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:58:01,585 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:58:01,587 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-09-18 09:58:01,589 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-09-18 09:58:01,591 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-09-18 09:58:01,594 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-09-18 09:58:01,597 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-09-18 09:58:01,597 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:01,613 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:01,625 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:01,635 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:01,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:01,653 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:01,653 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-09-18 09:58:01,919 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-09-18 09:58:01,920 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:58:02,401 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 187 proven. 16 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-09-18 09:58:02,422 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:58:02,422 INFO L197 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-09-18 09:58:02,438 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-18 09:58:02,438 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder MIX_INSIDE_OUTSIDE (IT: FPandBP) [2018-09-18 09:58:02,653 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2018-09-18 09:58:02,654 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:58:02,659 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:58:02,665 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-09-18 09:58:02,667 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-09-18 09:58:02,668 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-09-18 09:58:02,669 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-09-18 09:58:02,672 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-09-18 09:58:02,672 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:02,688 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:02,699 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:02,708 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:02,718 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:02,727 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:02,728 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-09-18 09:58:02,793 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2018-09-18 09:58:02,793 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:58:03,139 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 187 proven. 16 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2018-09-18 09:58:03,141 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 09:58:03,141 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10, 9, 10, 9] total 27 [2018-09-18 09:58:03,141 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 09:58:03,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-18 09:58:03,142 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-18 09:58:03,142 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=611, Unknown=2, NotChecked=0, Total=702 [2018-09-18 09:58:03,142 INFO L87 Difference]: Start difference. First operand 301 states and 359 transitions. Second operand 21 states. [2018-09-18 09:58:06,744 WARN L178 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2018-09-18 09:58:06,914 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2018-09-18 09:58:08,538 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 46 [2018-09-18 09:58:08,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:58:08,796 INFO L93 Difference]: Finished difference Result 868 states and 1067 transitions. [2018-09-18 09:58:08,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-18 09:58:08,797 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 130 [2018-09-18 09:58:08,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:58:08,801 INFO L225 Difference]: With dead ends: 868 [2018-09-18 09:58:08,801 INFO L226 Difference]: Without dead ends: 630 [2018-09-18 09:58:08,802 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 582 GetRequests, 503 SyntacticMatches, 9 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1217 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1028, Invalid=4068, Unknown=16, NotChecked=0, Total=5112 [2018-09-18 09:58:08,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2018-09-18 09:58:08,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 355. [2018-09-18 09:58:08,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-09-18 09:58:08,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 424 transitions. [2018-09-18 09:58:08,876 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 424 transitions. Word has length 130 [2018-09-18 09:58:08,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:58:08,876 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 424 transitions. [2018-09-18 09:58:08,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-18 09:58:08,876 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 424 transitions. [2018-09-18 09:58:08,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-18 09:58:08,877 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:58:08,878 INFO L376 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-09-18 09:58:08,878 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:58:08,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1758276432, now seen corresponding path program 7 times [2018-09-18 09:58:08,878 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:58:08,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:58:08,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-18 09:58:08,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:58:08,879 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:58:08,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:58:09,280 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 41 [2018-09-18 09:58:09,487 WARN L178 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2018-09-18 09:58:09,802 WARN L178 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 42 [2018-09-18 09:58:09,927 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 28 [2018-09-18 09:58:10,558 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 32 [2018-09-18 09:58:10,765 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 12 proven. 294 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2018-09-18 09:58:10,765 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:58:10,765 INFO L197 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-09-18 09:58:10,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:58:10,773 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 09:58:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:58:10,810 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:58:10,827 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-09-18 09:58:10,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 23 [2018-09-18 09:58:10,845 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-09-18 09:58:10,847 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-09-18 09:58:10,850 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-09-18 09:58:10,851 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:10,864 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:10,908 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:10,916 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:10,925 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:10,935 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:10,935 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:18, output treesize:26 [2018-09-18 09:58:11,763 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 0 proven. 334 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2018-09-18 09:58:11,764 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:58:18,296 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 98 proven. 202 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2018-09-18 09:58:18,317 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:58:18,317 INFO L197 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-09-18 09:58:18,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:58:18,332 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 09:58:18,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:58:18,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:58:18,548 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-09-18 09:58:18,548 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:18,551 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:18,551 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-09-18 09:58:18,652 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:18,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-09-18 09:58:18,653 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:18,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:18,660 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-18 09:58:18,783 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:18,784 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:18,785 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:18,786 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-09-18 09:58:18,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:18,802 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-09-18 09:58:18,802 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-09-18 09:58:18,943 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:18,944 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:18,945 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:18,946 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:18,947 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:18,949 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:18,949 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-09-18 09:58:18,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:18,977 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-09-18 09:58:18,978 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-18 09:58:19,882 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 13 proven. 54 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-09-18 09:58:19,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:58:20,906 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-09-18 09:58:20,906 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:20,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:20,908 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:3 [2018-09-18 09:58:20,962 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 12 proven. 43 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2018-09-18 09:58:20,963 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 09:58:20,964 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 17, 17, 12] total 77 [2018-09-18 09:58:20,964 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 09:58:20,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-18 09:58:20,965 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-18 09:58:20,966 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=419, Invalid=5421, Unknown=12, NotChecked=0, Total=5852 [2018-09-18 09:58:20,966 INFO L87 Difference]: Start difference. First operand 355 states and 424 transitions. Second operand 40 states. [2018-09-18 09:58:22,002 WARN L178 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 33 [2018-09-18 09:58:22,251 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 38 [2018-09-18 09:58:23,195 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 35 [2018-09-18 09:58:23,873 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2018-09-18 09:58:24,261 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 35 [2018-09-18 09:58:24,896 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 45 [2018-09-18 09:58:25,080 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 35 [2018-09-18 09:58:25,450 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 33 [2018-09-18 09:58:25,797 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2018-09-18 09:58:25,983 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 39 [2018-09-18 09:58:26,328 WARN L178 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 34 [2018-09-18 09:58:26,755 WARN L178 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 35 [2018-09-18 09:58:26,958 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 31 [2018-09-18 09:58:27,557 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 33 [2018-09-18 09:58:28,096 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 49 [2018-09-18 09:58:28,636 WARN L178 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 39 [2018-09-18 09:58:29,564 WARN L178 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 39 [2018-09-18 09:58:30,250 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 38 [2018-09-18 09:58:30,465 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 44 [2018-09-18 09:58:30,768 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 40 [2018-09-18 09:58:31,047 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 45 [2018-09-18 09:58:31,421 WARN L178 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 61 [2018-09-18 09:58:31,668 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 44 [2018-09-18 09:58:31,952 WARN L178 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 42 [2018-09-18 09:58:32,177 WARN L178 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 40 [2018-09-18 09:58:32,488 WARN L178 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 55 [2018-09-18 09:58:32,996 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2018-09-18 09:58:33,277 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 36 [2018-09-18 09:58:33,658 WARN L178 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 38 [2018-09-18 09:58:34,109 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 54 [2018-09-18 09:58:34,474 WARN L178 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 44 [2018-09-18 09:58:34,688 WARN L178 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 35 [2018-09-18 09:58:35,479 WARN L178 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 39 [2018-09-18 09:58:35,721 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 36 [2018-09-18 09:58:36,049 WARN L178 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 38 [2018-09-18 09:58:36,579 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 33 [2018-09-18 09:58:36,936 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 41 [2018-09-18 09:58:37,630 WARN L178 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 29 [2018-09-18 09:58:37,922 WARN L178 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 33 [2018-09-18 09:58:38,887 WARN L178 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 44 [2018-09-18 09:58:39,300 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 41 [2018-09-18 09:58:39,584 WARN L178 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 27 [2018-09-18 09:58:39,959 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 33 [2018-09-18 09:58:40,627 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 29 [2018-09-18 09:58:40,992 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2018-09-18 09:58:41,483 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 37 [2018-09-18 09:58:42,160 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 37 [2018-09-18 09:58:43,480 WARN L178 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2018-09-18 09:58:43,783 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 39 [2018-09-18 09:58:44,158 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 30 [2018-09-18 09:58:44,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:58:44,354 INFO L93 Difference]: Finished difference Result 1150 states and 1412 transitions. [2018-09-18 09:58:44,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-09-18 09:58:44,362 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 130 [2018-09-18 09:58:44,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:58:44,365 INFO L225 Difference]: With dead ends: 1150 [2018-09-18 09:58:44,366 INFO L226 Difference]: Without dead ends: 853 [2018-09-18 09:58:44,369 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 460 SyntacticMatches, 9 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 13139 ImplicationChecksByTransitivity, 32.2s TimeCoverageRelationStatistics Valid=5056, Invalid=34677, Unknown=67, NotChecked=0, Total=39800 [2018-09-18 09:58:44,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 853 states. [2018-09-18 09:58:44,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 853 to 502. [2018-09-18 09:58:44,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-09-18 09:58:44,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 604 transitions. [2018-09-18 09:58:44,478 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 604 transitions. Word has length 130 [2018-09-18 09:58:44,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:58:44,478 INFO L480 AbstractCegarLoop]: Abstraction has 502 states and 604 transitions. [2018-09-18 09:58:44,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-18 09:58:44,478 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 604 transitions. [2018-09-18 09:58:44,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-18 09:58:44,480 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:58:44,480 INFO L376 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-09-18 09:58:44,480 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:58:44,480 INFO L82 PathProgramCache]: Analyzing trace with hash -850447564, now seen corresponding path program 1 times [2018-09-18 09:58:44,480 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:58:44,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:58:44,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:58:44,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:58:44,481 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:58:44,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:58:44,797 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-09-18 09:58:45,057 WARN L178 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2018-09-18 09:58:45,477 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 86 proven. 67 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2018-09-18 09:58:45,477 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:58:45,477 INFO L197 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-09-18 09:58:45,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:58:45,487 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 09:58:45,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:58:45,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:58:45,834 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-09-18 09:58:45,835 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:45,838 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:45,838 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-09-18 09:58:45,872 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:45,872 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-09-18 09:58:45,872 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:45,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:45,880 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:18, output treesize:17 [2018-09-18 09:58:45,936 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:45,937 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:45,938 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:45,939 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 21 treesize of output 36 [2018-09-18 09:58:45,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:45,952 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:45,952 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2018-09-18 09:58:46,022 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:46,023 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:46,023 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:46,025 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:46,026 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:46,027 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:46,028 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 30 treesize of output 65 [2018-09-18 09:58:46,028 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:46,050 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-09-18 09:58:46,051 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:36, output treesize:35 [2018-09-18 09:58:46,558 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 6 proven. 339 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2018-09-18 09:58:46,558 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:58:46,887 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-09-18 09:58:46,890 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:46,891 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-09-18 09:58:46,893 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:46,894 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:46,894 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:46,895 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-09-18 09:58:46,922 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:46,923 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:46,924 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:46,924 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:46,925 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:46,926 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:46,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 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-09-18 09:58:46,931 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:46,940 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:46,949 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:46,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:46,964 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:46,964 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:29, output treesize:17 [2018-09-18 09:58:47,052 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 24 proven. 43 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-09-18 09:58:47,092 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:58:47,092 INFO L197 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-09-18 09:58:47,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:58:47,109 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-09-18 09:58:47,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:58:47,211 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:58:47,213 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-09-18 09:58:47,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:47,222 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:47,222 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-09-18 09:58:47,285 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:47,285 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-09-18 09:58:47,286 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:47,293 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:47,293 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-18 09:58:47,375 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:47,377 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:47,378 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:47,379 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-09-18 09:58:47,379 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:47,394 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-09-18 09:58:47,395 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-09-18 09:58:47,501 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:47,502 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:47,503 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:47,504 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:47,505 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:47,506 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:47,507 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-09-18 09:58:47,507 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:47,531 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-09-18 09:58:47,532 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:34 [2018-09-18 09:58:47,858 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 13 proven. 54 refuted. 0 times theorem prover too weak. 362 trivial. 0 not checked. [2018-09-18 09:58:47,858 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:58:48,015 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-09-18 09:58:48,015 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:48,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:48,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:3 [2018-09-18 09:58:48,041 INFO L134 CoverageAnalysis]: Checked inductivity of 429 backedges. 12 proven. 43 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2018-09-18 09:58:48,043 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 09:58:48,043 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 17, 17, 12] total 60 [2018-09-18 09:58:48,043 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 09:58:48,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-18 09:58:48,044 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-18 09:58:48,044 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=3100, Unknown=0, NotChecked=0, Total=3540 [2018-09-18 09:58:48,044 INFO L87 Difference]: Start difference. First operand 502 states and 604 transitions. Second operand 38 states. [2018-09-18 09:58:51,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:58:51,111 INFO L93 Difference]: Finished difference Result 999 states and 1229 transitions. [2018-09-18 09:58:51,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-18 09:58:51,112 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 130 [2018-09-18 09:58:51,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:58:51,117 INFO L225 Difference]: With dead ends: 999 [2018-09-18 09:58:51,117 INFO L226 Difference]: Without dead ends: 997 [2018-09-18 09:58:51,119 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 589 GetRequests, 487 SyntacticMatches, 12 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2862 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=895, Invalid=7477, Unknown=0, NotChecked=0, Total=8372 [2018-09-18 09:58:51,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2018-09-18 09:58:51,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 510. [2018-09-18 09:58:51,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510 states. [2018-09-18 09:58:51,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 612 transitions. [2018-09-18 09:58:51,271 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 612 transitions. Word has length 130 [2018-09-18 09:58:51,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:58:51,272 INFO L480 AbstractCegarLoop]: Abstraction has 510 states and 612 transitions. [2018-09-18 09:58:51,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-18 09:58:51,272 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 612 transitions. [2018-09-18 09:58:51,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-18 09:58:51,273 INFO L368 BasicCegarLoop]: Found error trace [2018-09-18 09:58:51,273 INFO L376 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-09-18 09:58:51,273 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-09-18 09:58:51,273 INFO L82 PathProgramCache]: Analyzing trace with hash 2079744723, now seen corresponding path program 2 times [2018-09-18 09:58:51,274 INFO L69 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-09-18 09:58:51,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:58:51,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-18 09:58:51,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-18 09:58:51,274 INFO L295 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-09-18 09:58:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-18 09:58:51,627 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 31 proven. 62 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2018-09-18 09:58:51,628 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:58:51,628 INFO L197 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-09-18 09:58:51,636 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-18 09:58:51,636 INFO L295 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-18 09:58:51,691 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-18 09:58:51,692 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:58:51,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:58:51,712 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-09-18 09:58:51,712 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:51,781 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:51,782 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-09-18 09:58:52,193 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:52,193 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-09-18 09:58:52,194 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:52,294 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:52,294 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-18 09:58:52,501 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:52,501 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:52,502 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-09-18 09:58:52,502 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:52,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:52,513 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:19 [2018-09-18 09:58:52,554 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:52,555 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:52,556 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:52,556 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:52,557 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:52,557 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-09-18 09:58:52,558 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:52,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:52,576 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:28 [2018-09-18 09:58:52,630 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-09-18 09:58:52,630 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:52,640 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:52,640 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:26 [2018-09-18 09:58:53,110 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 8 proven. 396 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-09-18 09:58:53,111 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:58:53,635 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-09-18 09:58:53,637 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:53,638 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-09-18 09:58:53,641 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:53,641 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:53,642 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:53,643 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-09-18 09:58:53,646 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:53,646 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:53,647 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:53,647 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:53,648 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:53,649 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:53,650 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-09-18 09:58:53,683 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:53,684 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:53,685 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:53,685 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:53,686 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:53,687 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:53,687 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:53,688 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:53,689 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:53,689 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:53,695 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-09-18 09:58:53,696 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:53,713 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:53,733 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:53,743 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:53,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:53,761 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:53,762 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:36, output treesize:22 [2018-09-18 09:58:53,820 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 38 proven. 46 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2018-09-18 09:58:53,842 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-18 09:58:53,842 INFO L197 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-09-18 09:58:53,857 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-18 09:58:53,857 INFO L295 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-09-18 09:58:53,981 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-18 09:58:53,982 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-18 09:58:53,989 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-18 09:58:53,991 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-09-18 09:58:53,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:54,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:54,000 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-09-18 09:58:54,007 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:54,007 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-09-18 09:58:54,007 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:54,017 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:54,017 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-18 09:58:54,095 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:54,097 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:54,098 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:54,099 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 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-09-18 09:58:54,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:54,114 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-09-18 09:58:54,115 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:25, output treesize:24 [2018-09-18 09:58:54,209 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:54,210 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:54,211 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:54,213 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:54,214 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:54,215 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:54,216 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-09-18 09:58:54,217 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:54,241 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-09-18 09:58:54,242 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:35, output treesize:34 [2018-09-18 09:58:54,361 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:54,362 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:54,363 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:54,364 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:54,365 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:54,367 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:54,368 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:54,370 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:54,371 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:54,373 INFO L700 Elim1Store]: detected not equals via solver [2018-09-18 09:58:54,374 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-09-18 09:58:54,374 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:54,415 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-09-18 09:58:54,415 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:45, output treesize:44 [2018-09-18 09:58:55,006 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 59 proven. 25 refuted. 0 times theorem prover too weak. 374 trivial. 0 not checked. [2018-09-18 09:58:55,006 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-09-18 09:58:56,052 WARN L979 $PredicateComparison]: unable to prove that (forall ((v_main_~i~1_324 Int)) (or (< c_main_~i~1 (+ v_main_~i~1_324 1)) (= (select (store c_main_~array~1 v_main_~i~1_324 v_main_~i~1_324) 4) 4))) is different from false [2018-09-18 09:58:56,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 15 [2018-09-18 09:58:56,072 INFO L682 Elim1Store]: detected equality via solver [2018-09-18 09:58:56,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-09-18 09:58:56,075 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-09-18 09:58:56,082 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:56,089 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-18 09:58:56,089 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:3 [2018-09-18 09:58:56,106 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 40 proven. 22 refuted. 0 times theorem prover too weak. 392 trivial. 4 not checked. [2018-09-18 09:58:56,108 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-09-18 09:58:56,108 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 27, 19, 20, 14] total 73 [2018-09-18 09:58:56,108 INFO L258 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-09-18 09:58:56,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-18 09:58:56,109 INFO L147 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-18 09:58:56,110 INFO L148 InterpolantAutomaton]: CoverageRelationStatistics Valid=863, Invalid=4252, Unknown=1, NotChecked=140, Total=5256 [2018-09-18 09:58:56,110 INFO L87 Difference]: Start difference. First operand 510 states and 612 transitions. Second operand 40 states. [2018-09-18 09:58:57,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-18 09:58:57,446 INFO L93 Difference]: Finished difference Result 1317 states and 1622 transitions. [2018-09-18 09:58:57,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-18 09:58:57,447 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 138 [2018-09-18 09:58:57,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-18 09:58:57,447 INFO L225 Difference]: With dead ends: 1317 [2018-09-18 09:58:57,447 INFO L226 Difference]: Without dead ends: 0 [2018-09-18 09:58:57,451 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 576 GetRequests, 491 SyntacticMatches, 11 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2825 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=919, Invalid=4634, Unknown=1, NotChecked=146, Total=5700 [2018-09-18 09:58:57,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-09-18 09:58:57,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-09-18 09:58:57,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-09-18 09:58:57,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-09-18 09:58:57,452 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 138 [2018-09-18 09:58:57,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-18 09:58:57,452 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-09-18 09:58:57,452 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-18 09:58:57,452 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-09-18 09:58:57,452 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-09-18 09:58:57,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-09-18 09:58:57,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:58:57,991 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:58:58,029 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:58:58,034 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:58:58,074 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:58:58,131 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:58:58,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:58:58,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:58:58,556 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:58:58,608 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:58:58,922 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:58:59,312 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:58:59,437 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:58:59,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:58:59,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:00,953 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:01,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:02,308 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:02,325 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:02,342 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:02,897 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:03,850 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:05,240 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:05,305 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:05,476 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:05,592 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:05,717 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:05,764 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:05,801 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:05,848 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:06,054 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:06,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:06,873 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:07,115 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:07,194 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:07,212 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:07,229 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:07,787 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:07,847 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:08,246 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:08,479 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:08,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:09,468 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:09,511 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:09,730 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:09,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:10,014 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:10,296 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:10,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:11,723 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:11,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:11,912 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:12,134 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:12,561 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:13,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:14,402 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:14,506 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:14,607 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:15,255 WARN L178 SmtUtils]: Spent 17.76 s on a formula simplification. DAG size of input: 1392 DAG size of output: 1193 [2018-09-18 09:59:15,272 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:15,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:15,376 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:15,377 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:15,510 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:15,515 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:15,526 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:15,563 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:15,564 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:15,568 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:15,571 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:15,609 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:15,622 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:15,625 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-09-18 09:59:15,642 WARN L178 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 344 DAG size of output: 287 [2018-09-18 09:59:57,098 WARN L178 SmtUtils]: Spent 41.27 s on a formula simplification. DAG size of input: 1190 DAG size of output: 41 [2018-09-18 09:59:57,235 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 57 [2018-09-18 09:59:57,858 WARN L178 SmtUtils]: Spent 588.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 78 [2018-09-18 09:59:58,409 WARN L178 SmtUtils]: Spent 548.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 79 [2018-09-18 09:59:58,514 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 1 [2018-09-18 09:59:59,038 WARN L178 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 65 [2018-09-18 10:00:00,816 WARN L178 SmtUtils]: Spent 1.77 s on a formula simplification. DAG size of input: 299 DAG size of output: 42 [2018-09-18 10:00:00,819 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-09-18 10:00:00,819 INFO L422 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~array~0 |old(~array~0)|) [2018-09-18 10:00:00,819 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-09-18 10:00:00,819 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-09-18 10:00:00,820 INFO L422 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 (select ~array~0 3)) (<= ~n~0 5) (= 0 (select ~array~0 1)) (= 0 (select ~array~0 4)) (= 0 (select ~array~0 2)) (<= 5 ~n~0) (= (select ~array~0 0) 0)) [2018-09-18 10:00:00,820 INFO L429 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-09-18 10:00:00,820 INFO L426 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-09-18 10:00:00,820 INFO L426 ceAbstractionStarter]: For program point SelectionSortEXIT(lines 15 27) no Hoare annotation was computed. [2018-09-18 10:00:00,820 INFO L426 ceAbstractionStarter]: For program point L21-1(lines 21 22) no Hoare annotation was computed. [2018-09-18 10:00:00,820 INFO L426 ceAbstractionStarter]: For program point L19-1(lines 19 26) no Hoare annotation was computed. [2018-09-18 10:00:00,820 INFO L426 ceAbstractionStarter]: For program point L21-3(lines 21 22) no Hoare annotation was computed. [2018-09-18 10:00:00,820 INFO L422 ceAbstractionStarter]: At program point L21-4(lines 21 22) the Hoare annotation is: (or (not (= 0 (select |old(~array~0)| 0))) (not (= 0 (select |old(~array~0)| 4))) (not (= (select |old(~array~0)| 1) 0)) (not (= 0 (select |old(~array~0)| 3))) (let ((.cse0 (+ SelectionSort_~lh~0 1))) (and (= SelectionSort_~i~0 (+ SelectionSort_~rh~0 1)) (<= .cse0 ~n~0) (= .cse0 SelectionSort_~i~0))) (not (= (select |old(~array~0)| 2) 0)) (and (<= (+ SelectionSort_~lh~0 2) SelectionSort_~i~0) (<= SelectionSort_~i~0 ~n~0)) (< 5 ~n~0) (< ~n~0 5)) [2018-09-18 10:00:00,820 INFO L426 ceAbstractionStarter]: For program point L21-5(lines 21 22) no Hoare annotation was computed. [2018-09-18 10:00:00,820 INFO L426 ceAbstractionStarter]: For program point L19-3(lines 19 26) no Hoare annotation was computed. [2018-09-18 10:00:00,821 INFO L422 ceAbstractionStarter]: At program point L19-4(lines 19 26) the Hoare annotation is: (let ((.cse0 (<= SelectionSort_~i~0 ~n~0))) (or (not (= (select |old(~array~0)| 2) 0)) (not (= 0 (select |old(~array~0)| 4))) (and (= ~array~0 |old(~array~0)|) (= 0 SelectionSort_~lh~0)) (not (= (select |old(~array~0)| 1) 0)) (not (= 0 (select |old(~array~0)| 3))) (and (<= (+ SelectionSort_~lh~0 1) SelectionSort_~i~0) .cse0) (< ~n~0 5) (not (= 0 (select |old(~array~0)| 0))) (and (= SelectionSort_~i~0 (+ SelectionSort_~rh~0 1)) .cse0) (< 5 ~n~0))) [2018-09-18 10:00:00,821 INFO L426 ceAbstractionStarter]: For program point L19-5(lines 15 27) no Hoare annotation was computed. [2018-09-18 10:00:00,821 INFO L422 ceAbstractionStarter]: At program point SelectionSortENTRY(lines 15 27) the Hoare annotation is: (or (< ~n~0 5) (= ~array~0 |old(~array~0)|) (not (= (select |old(~array~0)| 2) 0)) (not (= 0 (select |old(~array~0)| 4))) (< 5 ~n~0) (not (= 0 (select |old(~array~0)| 0))) (not (= (select |old(~array~0)| 1) 0)) (not (= 0 (select |old(~array~0)| 3)))) [2018-09-18 10:00:00,821 INFO L426 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-09-18 10:00:00,821 INFO L426 ceAbstractionStarter]: For program point L33-1(lines 33 34) no Hoare annotation was computed. [2018-09-18 10:00:00,821 INFO L426 ceAbstractionStarter]: For program point L33-3(lines 33 34) no Hoare annotation was computed. [2018-09-18 10:00:00,821 INFO L422 ceAbstractionStarter]: At program point L33-4(lines 33 34) the Hoare annotation is: (let ((.cse6 (select main_~array~1 4))) (let ((.cse2 (let ((.cse9 (+ main_~i~1 2))) (= .cse9 (select main_~array~1 .cse9)))) (.cse4 (= 4 .cse6)) (.cse1 (= 3 (select main_~array~1 3))) (.cse0 (= ~array~0 |old(~array~0)|))) (or (and (= main_~i~1 4) .cse0) (< ~n~0 5) (and .cse1 .cse0 (<= main_~i~1 2) .cse2 (<= 2 main_~i~1)) (and (= main_~i~1 0) .cse1 (exists ((v_main_~i~1_87 Int)) (and (<= v_main_~i~1_87 (+ main_~i~1 1)) (= v_main_~i~1_87 (select main_~array~1 v_main_~i~1_87)) (let ((.cse3 (+ v_main_~i~1_87 1))) (= .cse3 (select main_~array~1 .cse3))) (<= 0 v_main_~i~1_87))) .cse4 .cse0 .cse2) (and (let ((.cse5 (+ main_~i~1 1))) (= .cse5 (select main_~array~1 .cse5))) .cse4 (= main_~i~1 1) .cse0 .cse2) (not (= 0 (select |old(~array~0)| 0))) (and .cse4 .cse0 (= main_~i~1 3)) (not (= (select |old(~array~0)| 2) 0)) (not (= 0 (select |old(~array~0)| 4))) (and .cse1 (exists ((v_main_~i~1_45 Int)) (and (<= v_main_~i~1_45 (+ main_~i~1 1)) (= v_main_~i~1_45 (select main_~array~1 v_main_~i~1_45)) (<= 0 v_main_~i~1_45))) (<= main_~i~1 1) (= .cse6 4) (exists ((main_~i~1 Int)) (and (= (select main_~array~1 main_~i~1) main_~i~1) (<= main_~i~1 0) (<= 0 main_~i~1) (let ((.cse7 (+ main_~i~1 2))) (= .cse7 (select main_~array~1 .cse7))) (let ((.cse8 (+ main_~i~1 1))) (= .cse8 (select main_~array~1 .cse8))))) .cse0) (< 5 ~n~0) (not (= (select |old(~array~0)| 1) 0)) (not (= 0 (select |old(~array~0)| 3)))))) [2018-09-18 10:00:00,821 INFO L422 ceAbstractionStarter]: At program point L33-5(lines 33 34) the Hoare annotation is: (or (< ~n~0 5) (not (= (select |old(~array~0)| 2) 0)) (not (= 0 (select |old(~array~0)| 4))) (< 5 ~n~0) (and (= 3 (select main_~array~1 3)) (exists ((v_main_~i~1_45 Int)) (and (<= v_main_~i~1_45 (+ main_~i~1 1)) (= v_main_~i~1_45 (select main_~array~1 v_main_~i~1_45)) (<= 0 v_main_~i~1_45))) (<= main_~i~1 1) (= (select main_~array~1 4) 4) (exists ((main_~i~1 Int)) (and (= (select main_~array~1 main_~i~1) main_~i~1) (<= main_~i~1 0) (<= 0 main_~i~1) (let ((.cse0 (+ main_~i~1 2))) (= .cse0 (select main_~array~1 .cse0))) (let ((.cse1 (+ main_~i~1 1))) (= .cse1 (select main_~array~1 .cse1))))) (= ~array~0 |old(~array~0)|)) (not (= 0 (select |old(~array~0)| 0))) (not (= (select |old(~array~0)| 1) 0)) (not (= 0 (select |old(~array~0)| 3)))) [2018-09-18 10:00:00,821 INFO L426 ceAbstractionStarter]: For program point mainEXIT(lines 29 41) no Hoare annotation was computed. [2018-09-18 10:00:00,822 INFO L426 ceAbstractionStarter]: For program point L38-1(lines 38 39) no Hoare annotation was computed. [2018-09-18 10:00:00,822 INFO L426 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-09-18 10:00:00,822 INFO L422 ceAbstractionStarter]: At program point L38-3(lines 38 39) the Hoare annotation is: (let ((.cse3 (= 3 (select main_~array~1 3))) (.cse0 (= 4 (select main_~array~1 4)))) (or (< ~n~0 5) (and .cse0 (and (exists ((v_main_~i~1_159 Int)) (and (= (select main_~array~1 v_main_~i~1_159) v_main_~i~1_159) (let ((.cse1 (+ v_main_~i~1_159 1))) (= .cse1 (select main_~array~1 .cse1))) (<= v_main_~i~1_159 0) (<= 0 v_main_~i~1_159) (let ((.cse2 (+ v_main_~i~1_159 2))) (= (select main_~array~1 .cse2) .cse2)))) (<= 1 main_~i~1)) .cse3) (not (= 0 (select |old(~array~0)| 0))) (not (= (select |old(~array~0)| 2) 0)) (not (= 0 (select |old(~array~0)| 4))) (< 5 ~n~0) (and (= main_~i~1 0) .cse3 .cse0 (exists ((v_prenex_123 Int)) (and (let ((.cse4 (+ v_prenex_123 1))) (= .cse4 (select main_~array~1 .cse4))) (<= 0 v_prenex_123) (<= v_prenex_123 0) (= (select main_~array~1 v_prenex_123) v_prenex_123) (let ((.cse5 (+ v_prenex_123 2))) (= .cse5 (select main_~array~1 .cse5)))))) (not (= (select |old(~array~0)| 1) 0)) (not (= 0 (select |old(~array~0)| 3))))) [2018-09-18 10:00:00,822 INFO L426 ceAbstractionStarter]: For program point L38-4(lines 29 41) no Hoare annotation was computed. [2018-09-18 10:00:00,822 INFO L422 ceAbstractionStarter]: At program point mainENTRY(lines 29 41) the Hoare annotation is: (or (< ~n~0 5) (= ~array~0 |old(~array~0)|) (not (= (select |old(~array~0)| 2) 0)) (not (= 0 (select |old(~array~0)| 4))) (< 5 ~n~0) (not (= 0 (select |old(~array~0)| 0))) (not (= (select |old(~array~0)| 1) 0)) (not (= 0 (select |old(~array~0)| 3)))) [2018-09-18 10:00:00,822 INFO L422 ceAbstractionStarter]: At program point L39(line 39) the Hoare annotation is: (let ((.cse2 (exists ((v_prenex_123 Int)) (and (let ((.cse6 (+ v_prenex_123 1))) (= .cse6 (select main_~array~1 .cse6))) (<= 0 v_prenex_123) (<= v_prenex_123 0) (= (select main_~array~1 v_prenex_123) v_prenex_123) (let ((.cse7 (+ v_prenex_123 2))) (= .cse7 (select main_~array~1 .cse7)))))) (.cse0 (= 4 (select main_~array~1 4))) (.cse3 (exists ((v_main_~i~1_159 Int)) (and (= (select main_~array~1 v_main_~i~1_159) v_main_~i~1_159) (let ((.cse4 (+ v_main_~i~1_159 1))) (= .cse4 (select main_~array~1 .cse4))) (<= v_main_~i~1_159 0) (<= 0 v_main_~i~1_159) (let ((.cse5 (+ v_main_~i~1_159 2))) (= (select main_~array~1 .cse5) .cse5))))) (.cse1 (= 3 (select main_~array~1 3)))) (or (and (= 2 (select main_~array~1 2)) .cse0 (= main_~i~1 4) (= 1 (select main_~array~1 1)) (= (select main_~array~1 0) 0) .cse1) (< ~n~0 5) (and .cse0 .cse2 (= main_~i~1 3) .cse1) (not (= 0 (select |old(~array~0)| 0))) (not (= (select |old(~array~0)| 2) 0)) (not (= 0 (select |old(~array~0)| 4))) (and .cse0 (and .cse3 (= main_~i~1 1)) .cse1) (< 5 ~n~0) (and (= main_~i~1 0) .cse1 .cse0 .cse2) (not (= (select |old(~array~0)| 1) 0)) (not (= 0 (select |old(~array~0)| 3))) (and .cse0 (and (= main_~i~1 2) .cse3) .cse1))) [2018-09-18 10:00:00,822 INFO L426 ceAbstractionStarter]: For program point L39-1(lines 38 39) no Hoare annotation was computed. [2018-09-18 10:00:00,822 INFO L429 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-09-18 10:00:00,822 INFO L426 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-09-18 10:00:00,823 INFO L426 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-09-18 10:00:00,823 INFO L426 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-09-18 10:00:00,823 INFO L426 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-09-18 10:00:00,823 INFO L426 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-09-18 10:00:00,838 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-18 10:00:00,840 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-18 10:00:00,840 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-18 10:00:00,840 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-18 10:00:00,840 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-18 10:00:00,841 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-18 10:00:00,841 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-18 10:00:00,841 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-18 10:00:00,841 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-18 10:00:00,842 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-18 10:00:00,842 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,842 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,842 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,842 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,843 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,843 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,843 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,843 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,847 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-18 10:00:00,847 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-18 10:00:00,848 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-18 10:00:00,848 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-18 10:00:00,848 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-18 10:00:00,848 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-18 10:00:00,849 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-18 10:00:00,849 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-18 10:00:00,849 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-18 10:00:00,850 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-18 10:00:00,850 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,850 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,850 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,850 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,851 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,851 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,851 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,851 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,854 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,855 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,855 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,855 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,855 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,855 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,856 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,856 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,856 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,857 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,857 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,857 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,857 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,857 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,858 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,858 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,860 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,860 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,860 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,860 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,861 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,861 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,861 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,861 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,862 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,862 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,862 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,862 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,862 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,863 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,863 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,863 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.09 10:00:00 BoogieIcfgContainer [2018-09-18 10:00:00,867 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-18 10:00:00,868 INFO L168 Benchmark]: Toolchain (without parser) took 227951.62 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.6 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2018-09-18 10:00:00,868 INFO L168 Benchmark]: CDTParser took 0.24 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-09-18 10:00:00,869 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.94 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-09-18 10:00:00,869 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-09-18 10:00:00,869 INFO L168 Benchmark]: Boogie Preprocessor took 33.84 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-09-18 10:00:00,870 INFO L168 Benchmark]: RCFGBuilder took 603.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.7 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. [2018-09-18 10:00:00,870 INFO L168 Benchmark]: TraceAbstraction took 226949.56 ms. Allocated memory was 2.3 GB in the beginning and 3.2 GB in the end (delta: 900.7 MB). Free memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: -446.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2018-09-18 10:00:00,872 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.24 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 329.94 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 28.71 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.84 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 603.87 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 742.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.7 MB). Peak memory consumption was 26.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 226949.56 ms. Allocated memory was 2.3 GB in the beginning and 3.2 GB in the end (delta: 900.7 MB). Free memory was 2.2 GB in the beginning and 2.7 GB in the end (delta: -446.9 MB). Peak memory consumption was 1.6 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_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,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_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,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_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,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_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,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: 21]: Loop Invariant Derived loop invariant: (((((((!(0 == \old(array)[0]) || !(0 == \old(array)[4])) || !(\old(array)[1] == 0)) || !(0 == \old(array)[3])) || ((i == rh + 1 && lh + 1 <= n) && lh + 1 == i)) || !(\old(array)[2] == 0)) || (lh + 2 <= i && i <= n)) || 5 < n) || n < 5 - InvariantResult [Line: 33]: Loop Invariant [2018-09-18 10:00:00,880 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-18 10:00:00,880 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-18 10:00:00,881 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-18 10:00:00,881 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-18 10:00:00,881 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-18 10:00:00,881 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-18 10:00:00,882 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-18 10:00:00,882 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-18 10:00:00,882 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-18 10:00:00,882 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-18 10:00:00,882 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,882 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,883 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,883 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,883 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,883 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,883 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,884 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,886 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-18 10:00:00,887 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-18 10:00:00,887 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-18 10:00:00,887 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-18 10:00:00,887 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-18 10:00:00,887 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_87,QUANTIFIED] [2018-09-18 10:00:00,888 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-18 10:00:00,888 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-18 10:00:00,888 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-18 10:00:00,888 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_45,QUANTIFIED] [2018-09-18 10:00:00,889 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,889 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,889 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,889 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,889 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,889 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,890 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] [2018-09-18 10:00:00,890 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[main_~i~1,QUANTIFIED] Derived loop invariant: ((((((((((((i == 4 && array == \old(array)) || n < 5) || ((((3 == array[3] && array == \old(array)) && i <= 2) && i + 2 == array[i + 2]) && 2 <= i)) || (((((i == 0 && 3 == array[3]) && (\exists v_main_~i~1_87 : int :: ((v_main_~i~1_87 <= i + 1 && v_main_~i~1_87 == array[v_main_~i~1_87]) && v_main_~i~1_87 + 1 == array[v_main_~i~1_87 + 1]) && 0 <= v_main_~i~1_87)) && 4 == array[4]) && array == \old(array)) && i + 2 == array[i + 2])) || ((((i + 1 == array[i + 1] && 4 == array[4]) && i == 1) && array == \old(array)) && i + 2 == array[i + 2])) || !(0 == \old(array)[0])) || ((4 == array[4] && array == \old(array)) && i == 3)) || !(\old(array)[2] == 0)) || !(0 == \old(array)[4])) || (((((3 == array[3] && (\exists v_main_~i~1_45 : int :: (v_main_~i~1_45 <= i + 1 && v_main_~i~1_45 == array[v_main_~i~1_45]) && 0 <= v_main_~i~1_45)) && i <= 1) && array[4] == 4) && (\exists main_~i~1 : int :: (((array[main_~i~1] == main_~i~1 && main_~i~1 <= 0) && 0 <= main_~i~1) && main_~i~1 + 2 == array[main_~i~1 + 2]) && main_~i~1 + 1 == array[main_~i~1 + 1])) && array == \old(array))) || 5 < n) || !(\old(array)[1] == 0)) || !(0 == \old(array)[3]) - InvariantResult [Line: 38]: Loop Invariant [2018-09-18 10:00:00,892 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,892 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,893 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,893 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,893 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,893 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,893 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,894 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,894 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,894 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,894 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,894 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,895 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,895 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,895 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,895 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,897 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,897 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,897 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,897 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,898 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,898 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,898 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,898 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~i~1_159,QUANTIFIED] [2018-09-18 10:00:00,898 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,899 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,899 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,899 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,899 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,899 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,899 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] [2018-09-18 10:00:00,900 WARN L389 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_123,QUANTIFIED] Derived loop invariant: (((((((n < 5 || ((4 == array[4] && (\exists v_main_~i~1_159 : int :: (((array[v_main_~i~1_159] == v_main_~i~1_159 && v_main_~i~1_159 + 1 == array[v_main_~i~1_159 + 1]) && v_main_~i~1_159 <= 0) && 0 <= v_main_~i~1_159) && array[v_main_~i~1_159 + 2] == v_main_~i~1_159 + 2) && 1 <= i) && 3 == array[3])) || !(0 == \old(array)[0])) || !(\old(array)[2] == 0)) || !(0 == \old(array)[4])) || 5 < n) || (((i == 0 && 3 == array[3]) && 4 == array[4]) && (\exists v_prenex_123 : int :: (((v_prenex_123 + 1 == array[v_prenex_123 + 1] && 0 <= v_prenex_123) && v_prenex_123 <= 0) && array[v_prenex_123] == v_prenex_123) && v_prenex_123 + 2 == array[v_prenex_123 + 2]))) || !(\old(array)[1] == 0)) || !(0 == \old(array)[3]) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((((((((!(\old(array)[2] == 0) || !(0 == \old(array)[4])) || (array == \old(array) && 0 == lh)) || !(\old(array)[1] == 0)) || !(0 == \old(array)[3])) || (lh + 1 <= i && i <= n)) || n < 5) || !(0 == \old(array)[0])) || (i == rh + 1 && i <= n)) || 5 < n - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 36 locations, 1 error locations. SAFE Result, 226.8s OverallTime, 21 OverallIterations, 15 TraceHistogramMax, 66.3s AutomataDifference, 0.0s DeadEndRemovalTime, 63.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 727 SDtfs, 3289 SDslu, 5696 SDs, 0 SdLazy, 9202 SolverSat, 1818 SolverUnsat, 110 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 7445 GetRequests, 6205 SyntacticMatches, 92 SemanticMatches, 1148 ConstructedPredicates, 1 IntricatePredicates, 4 DeprecatedPredicates, 39009 ImplicationChecksByTransitivity, 103.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=510occurred 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, 1845 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 78 PreInvPairs, 547 NumberOfFragments, 956 HoareAnnotationTreeSize, 78 FomulaSimplifications, 391409254 FormulaSimplificationTreeSizeReduction, 18.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 40757473 FormulaSimplificationTreeSizeReductionInter, 45.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 92.1s InterpolantComputationTime, 5100 NumberOfCodeBlocks, 4575 NumberOfCodeBlocksAsserted, 120 NumberOfCheckSat, 8310 ConstructedInterpolants, 701 QuantifiedInterpolants, 9752235 SizeOfPredicates, 180 NumberOfNonLiveVariables, 5074 ConjunctsInSsa, 709 ConjunctsInUnsatCore, 89 InterpolantComputations, 7 PerfectInterpolantSequences, 16493/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-09-18_10-00-00-907.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-09-18_10-00-00-907.csv Received shutdown request...