java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/ldv-regression/test10_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:07:28,247 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:07:28,249 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:07:28,262 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:07:28,262 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:07:28,263 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:07:28,264 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:07:28,266 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:07:28,268 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:07:28,269 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:07:28,269 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:07:28,270 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:07:28,271 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:07:28,272 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:07:28,273 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:07:28,274 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:07:28,274 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:07:28,281 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:07:28,287 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:07:28,288 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:07:28,292 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:07:28,293 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:07:28,296 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:07:28,296 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:07:28,297 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:07:28,299 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:07:28,300 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:07:28,304 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:07:28,304 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:07:28,306 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:07:28,308 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:07:28,309 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:07:28,309 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:07:28,309 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:07:28,312 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:07:28,313 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:07:28,313 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:07:28,341 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:07:28,342 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:07:28,342 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:07:28,343 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:07:28,343 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:07:28,344 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:07:28,344 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:07:28,344 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:07:28,344 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:07:28,344 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:07:28,345 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:07:28,345 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:07:28,345 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:07:28,345 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:07:28,345 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:07:28,345 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:07:28,346 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:07:28,346 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:07:28,346 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:07:28,346 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:07:28,346 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:07:28,347 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:07:28,347 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:07:28,347 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:07:28,347 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:07:28,347 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:07:28,348 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:07:28,348 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:07:28,348 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:07:28,348 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:07:28,348 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:07:28,349 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:07:28,349 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:07:28,401 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:07:28,420 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:07:28,424 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:07:28,426 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:07:28,427 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:07:28,428 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test10_true-unreach-call_true-termination.c [2018-11-23 11:07:28,494 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15764b589/5409b1d6c7894e3aab918fb87de44378/FLAG9135ad0c5 [2018-11-23 11:07:28,982 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:07:28,983 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test10_true-unreach-call_true-termination.c [2018-11-23 11:07:28,990 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15764b589/5409b1d6c7894e3aab918fb87de44378/FLAG9135ad0c5 [2018-11-23 11:07:29,343 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/15764b589/5409b1d6c7894e3aab918fb87de44378 [2018-11-23 11:07:29,357 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:07:29,359 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:07:29,360 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:07:29,360 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:07:29,364 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:07:29,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:07:29" (1/1) ... [2018-11-23 11:07:29,369 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@423b3e41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:29, skipping insertion in model container [2018-11-23 11:07:29,369 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:07:29" (1/1) ... [2018-11-23 11:07:29,380 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:07:29,407 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:07:29,644 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:07:29,672 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:07:29,694 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:07:29,718 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:07:29,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:29 WrapperNode [2018-11-23 11:07:29,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:07:29,720 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:07:29,720 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:07:29,720 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:07:29,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:29" (1/1) ... [2018-11-23 11:07:29,743 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:29" (1/1) ... [2018-11-23 11:07:29,750 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:07:29,750 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:07:29,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:07:29,751 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:07:29,758 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:29" (1/1) ... [2018-11-23 11:07:29,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:29" (1/1) ... [2018-11-23 11:07:29,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:29" (1/1) ... [2018-11-23 11:07:29,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:29" (1/1) ... [2018-11-23 11:07:29,777 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:29" (1/1) ... [2018-11-23 11:07:29,780 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:29" (1/1) ... [2018-11-23 11:07:29,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:29" (1/1) ... [2018-11-23 11:07:29,785 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:07:29,786 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:07:29,786 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:07:29,786 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:07:29,787 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:07:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:07:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2018-11-23 11:07:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-23 11:07:29,917 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-23 11:07:29,917 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:07:29,917 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:07:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2018-11-23 11:07:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:07:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:07:29,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:07:29,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:07:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:07:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:07:29,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:07:29,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:07:30,954 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:07:30,955 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-23 11:07:30,955 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:30 BoogieIcfgContainer [2018-11-23 11:07:30,955 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:07:30,956 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:07:30,957 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:07:30,960 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:07:30,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:07:29" (1/3) ... [2018-11-23 11:07:30,961 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ba0297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:07:30, skipping insertion in model container [2018-11-23 11:07:30,961 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:29" (2/3) ... [2018-11-23 11:07:30,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41ba0297 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:07:30, skipping insertion in model container [2018-11-23 11:07:30,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:30" (3/3) ... [2018-11-23 11:07:30,964 INFO L112 eAbstractionObserver]: Analyzing ICFG test10_true-unreach-call_true-termination.c [2018-11-23 11:07:30,975 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:07:30,983 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:07:30,998 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:07:31,030 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:07:31,030 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:07:31,031 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:07:31,031 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:07:31,033 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:07:31,033 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:07:31,033 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:07:31,034 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:07:31,034 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:07:31,052 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 11:07:31,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:07:31,059 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:31,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:07:31,063 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:31,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:31,070 INFO L82 PathProgramCache]: Analyzing trace with hash -1020605804, now seen corresponding path program 1 times [2018-11-23 11:07:31,076 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:31,077 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:07:31,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:31,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:31,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:31,508 INFO L478 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 43 treesize of output 39 [2018-11-23 11:07:31,800 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:31,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 49 [2018-11-23 11:07:32,564 WARN L180 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 41 [2018-11-23 11:07:32,646 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:32,650 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:32,654 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:07:32,671 INFO L478 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 51 [2018-11-23 11:07:33,194 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2018-11-23 11:07:33,256 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:33,258 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:33,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:33,277 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:33,279 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:33,282 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 28 [2018-11-23 11:07:33,285 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:33,382 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:33,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:33,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:33,419 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:33,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:33,426 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:33,431 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:33,434 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 33 [2018-11-23 11:07:33,452 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:33,521 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:07:33,604 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:33,607 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:33,610 INFO L478 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 44 [2018-11-23 11:07:33,731 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:33,732 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:33,735 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:33,736 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:07:33,739 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2018-11-23 11:07:33,766 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:33,881 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:33,923 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:33,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:34,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:34,000 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 1 variables, input treesize:49, output treesize:31 [2018-11-23 11:07:35,925 INFO L303 Elim1Store]: Index analysis took 1661 ms [2018-11-23 11:07:35,926 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 40 [2018-11-23 11:07:36,042 INFO L303 Elim1Store]: Index analysis took 111 ms [2018-11-23 11:07:36,043 INFO L478 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 8 treesize of output 7 [2018-11-23 11:07:36,045 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:37,537 INFO L303 Elim1Store]: Index analysis took 821 ms [2018-11-23 11:07:37,539 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2018-11-23 11:07:37,634 INFO L478 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 8 treesize of output 7 [2018-11-23 11:07:37,635 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:39,004 INFO L303 Elim1Store]: Index analysis took 782 ms [2018-11-23 11:07:39,005 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 39 [2018-11-23 11:07:39,060 INFO L478 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 12 treesize of output 15 [2018-11-23 11:07:39,062 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:39,452 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:39,680 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:39,975 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:41,831 INFO L303 Elim1Store]: Index analysis took 174 ms [2018-11-23 11:07:41,832 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 40 [2018-11-23 11:07:41,880 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:07:41,883 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:42,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:42,419 INFO L303 Elim1Store]: Index analysis took 250 ms [2018-11-23 11:07:42,421 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2018-11-23 11:07:42,464 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-11-23 11:07:42,467 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:42,851 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:43,076 INFO L303 Elim1Store]: Index analysis took 338 ms [2018-11-23 11:07:43,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 47 [2018-11-23 11:07:43,123 INFO L478 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 12 treesize of output 15 [2018-11-23 11:07:43,125 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:43,352 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:43,479 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:43,600 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:44,273 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:44,299 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:44,667 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:44,682 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:44,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:44,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 30 treesize of output 43 [2018-11-23 11:07:44,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 19 [2018-11-23 11:07:44,967 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:45,002 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:45,177 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:45,180 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:45,204 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 47 [2018-11-23 11:07:45,227 INFO L478 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 12 treesize of output 15 [2018-11-23 11:07:45,230 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:45,256 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:45,331 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:45,332 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 6 variables, input treesize:223, output treesize:61 [2018-11-23 11:07:49,421 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:07:49,422 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_32|, |v_#memory_$Pointer$.base_27|, |v_#memory_$Pointer$.offset_27|, |v_#memory_$Pointer$.base_26|, |v_#memory_$Pointer$.offset_26|, |v_#memory_$Pointer$.offset_32|]. (let ((.cse0 (select |v_#memory_$Pointer$.offset_27| |~#a~0.base|)) (.cse3 (select |v_#memory_$Pointer$.base_26| |~#a~0.base|))) (and (not (= ~pp2~0.base |~#p1~0.base|)) (= (store |v_#memory_$Pointer$.offset_27| |~#a~0.base| (store .cse0 |~#a~0.offset| (select (select |#memory_$Pointer$.offset| |~#a~0.base|) |~#a~0.offset|))) |#memory_$Pointer$.offset|) (= (_ bv0 32) ~pp2~0.offset) (not (= |~#p1~0.base| |~#a~0.base|)) (not (= |~#b~0.base| ~pp2~0.base)) (= |~#p1~0.offset| ~pp1~0.offset) (not (= ~pp2~0.base |~#a~0.base|)) (= (_ bv0 32) |~#p1~0.offset|) (= |v_#memory_$Pointer$.base_27| (let ((.cse1 (let ((.cse2 (store |v_#memory_$Pointer$.base_32| |~#p1~0.base| (store (select |v_#memory_$Pointer$.base_32| |~#p1~0.base|) |~#p1~0.offset| |~#a~0.base|)))) (store .cse2 ~pp2~0.base (store (select .cse2 ~pp2~0.base) (_ bv0 32) |~#b~0.base|))))) (store .cse1 |~#b~0.base| (store (select .cse1 |~#b~0.base|) |~#b~0.offset| (select (select |v_#memory_$Pointer$.base_27| |~#b~0.base|) |~#b~0.offset|))))) (= |~#p1~0.base| ~pp1~0.base) (not (= |~#b~0.base| |~#a~0.base|)) (= |v_#memory_$Pointer$.base_26| (store |v_#memory_$Pointer$.base_27| |~#a~0.base| (store (select |v_#memory_$Pointer$.base_27| |~#a~0.base|) |~#a~0.offset| (select .cse3 |~#a~0.offset|)))) (= (store |v_#memory_$Pointer$.offset_26| |~#a~0.base| (store (select |v_#memory_$Pointer$.offset_26| |~#a~0.base|) |~#a~0.offset| (select .cse0 |~#a~0.offset|))) |v_#memory_$Pointer$.offset_27|) (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_26| |~#a~0.base| (store .cse3 |~#a~0.offset| (select (select |#memory_$Pointer$.base| |~#a~0.base|) |~#a~0.offset|)))) (not (= |~#b~0.base| |~#p1~0.base|)) (= |v_#memory_$Pointer$.offset_26| (let ((.cse4 (let ((.cse5 (store |v_#memory_$Pointer$.offset_32| |~#p1~0.base| (store (select |v_#memory_$Pointer$.offset_32| |~#p1~0.base|) |~#p1~0.offset| |~#a~0.offset|)))) (store .cse5 ~pp2~0.base (store (select .cse5 ~pp2~0.base) (_ bv0 32) |~#b~0.offset|))))) (store .cse4 |~#b~0.base| (store (select .cse4 |~#b~0.base|) |~#b~0.offset| (select (select |v_#memory_$Pointer$.offset_26| |~#b~0.base|) |~#b~0.offset|))))))) [2018-11-23 11:07:49,422 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= |~#a~0.base| (select (select |#memory_$Pointer$.base| |~#p1~0.base|) ~pp1~0.offset)) (= (_ bv0 32) ~pp2~0.offset) (not (= |~#p1~0.base| |~#a~0.base|)) (not (= |~#b~0.base| ~pp2~0.base)) (= |~#p1~0.offset| ~pp1~0.offset) (= (select (select |#memory_$Pointer$.offset| ~pp2~0.base) (_ bv0 32)) |~#b~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#p1~0.base|) ~pp1~0.offset) |~#a~0.offset|) (not (= ~pp2~0.base |~#a~0.base|)) (= (_ bv0 32) |~#p1~0.offset|) (= |~#p1~0.base| ~pp1~0.base) (not (= |~#b~0.base| |~#a~0.base|)) (= |~#b~0.base| (select (select |#memory_$Pointer$.base| ~pp2~0.base) (_ bv0 32))) (not (= |~#b~0.base| |~#p1~0.base|))) [2018-11-23 11:07:49,653 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:49,659 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2018-11-23 11:07:49,680 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 11:07:49,681 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:49,715 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 11:07:49,717 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:49,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:49,806 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:49,808 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:49,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2018-11-23 11:07:49,837 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10 treesize of output 15 [2018-11-23 11:07:49,841 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:49,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-23 11:07:49,867 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:49,873 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:49,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:49,945 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:70, output treesize:34 [2018-11-23 11:07:49,954 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:07:49,955 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_BEFORE_CALL_1|, |v_#memory_$Pointer$.offset_BEFORE_CALL_1|, v_~pp2~0.base_BEFORE_CALL_1]. (and (not (= |~#p1~0.base| |~#a~0.base|)) (= ~pp2~0.base |old(~pp2~0.base)|) (= |~#p1~0.offset| ~pp1~0.offset) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_1| v_~pp2~0.base_BEFORE_CALL_1) (_ bv0 32)) |~#b~0.offset|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (_ bv0 32) |~#p1~0.offset|) (= |~#a~0.base| (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_1| |~#p1~0.base|) ~pp1~0.offset)) (= |~#p1~0.base| ~pp1~0.base) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (not (= |~#b~0.base| |~#a~0.base|)) (= (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_1| |~#p1~0.base|) ~pp1~0.offset) |~#a~0.offset|) (= |old(~pp2~0.offset)| ~pp2~0.offset) (not (= |~#b~0.base| v_~pp2~0.base_BEFORE_CALL_1)) (= |~#b~0.base| (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_1| v_~pp2~0.base_BEFORE_CALL_1) (_ bv0 32))) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#a~0.base| v_~pp2~0.base_BEFORE_CALL_1))) [2018-11-23 11:07:49,955 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= |~#p1~0.base| |~#a~0.base|)) (= |old(~pp2~0.offset)| ~pp2~0.offset) (= ~pp2~0.base |old(~pp2~0.base)|) (= |~#p1~0.offset| ~pp1~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (_ bv0 32) |~#p1~0.offset|) (= |~#p1~0.base| ~pp1~0.base) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#a~0.base|))) [2018-11-23 11:07:50,255 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:50,258 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:50,262 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:07:50,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 45 [2018-11-23 11:07:50,331 INFO L478 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 34 treesize of output 47 [2018-11-23 11:07:50,345 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-23 11:07:50,401 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:50,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 29 [2018-11-23 11:07:50,529 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2018-11-23 11:07:50,530 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:07:50,547 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:07:50,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:07:50,604 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:82, output treesize:64 [2018-11-23 11:07:52,654 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:07:52,655 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_BEFORE_CALL_2|, v_~pp2~0.base_BEFORE_CALL_2, |v_#memory_$Pointer$.offset_BEFORE_CALL_2|]. (let ((.cse2 (select |v_#memory_$Pointer$.base_BEFORE_CALL_2| |~#p1~0.base|)) (.cse3 (select (select |v_#memory_$Pointer$.base_BEFORE_CALL_2| v_~pp2~0.base_BEFORE_CALL_2) (_ bv0 32))) (.cse1 (select |v_#memory_$Pointer$.offset_BEFORE_CALL_2| |~#p1~0.base|)) (.cse0 (select (select |v_#memory_$Pointer$.offset_BEFORE_CALL_2| v_~pp2~0.base_BEFORE_CALL_2) (_ bv0 32)))) (and (= .cse0 |~#b~0.offset|) (not (= |~#a~0.base| v_~pp2~0.base_BEFORE_CALL_2)) (not (= |~#p1~0.base| |~#a~0.base|)) (= |~#a~0.offset| (select .cse1 |~#p1~0.offset|)) (= |~#a~0.base| (select .cse2 |~#p1~0.offset|)) (= (_ bv0 32) |~#p1~0.offset|) (not (= |~#b~0.base| v_~pp2~0.base_BEFORE_CALL_2)) (not (= |~#b~0.base| |~#p1~0.base|)) (= (store |v_#memory_$Pointer$.base_BEFORE_CALL_2| |~#p1~0.base| (store .cse2 |~#p1~0.offset| .cse3)) |#memory_$Pointer$.base|) (not (= |~#b~0.base| |~#a~0.base|)) (= |~#b~0.base| .cse3) (= (store |v_#memory_$Pointer$.offset_BEFORE_CALL_2| |~#p1~0.base| (store .cse1 |~#p1~0.offset| .cse0)) |#memory_$Pointer$.offset|))) [2018-11-23 11:07:52,655 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_~pp2~0.base_BEFORE_CALL_2]. (let ((.cse0 (select (select |#memory_$Pointer$.base| v_~pp2~0.base_BEFORE_CALL_2) (_ bv0 32))) (.cse1 (select (select |#memory_$Pointer$.offset| v_~pp2~0.base_BEFORE_CALL_2) (_ bv0 32)))) (and (not (= |~#a~0.base| v_~pp2~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| |~#p1~0.base|) |~#p1~0.offset|) .cse0) (not (= |~#p1~0.base| |~#a~0.base|)) (= |~#b~0.base| .cse0) (not (= |~#p1~0.base| v_~pp2~0.base_BEFORE_CALL_2)) (= .cse1 (select (select |#memory_$Pointer$.offset| |~#p1~0.base|) |~#p1~0.offset|)) (= (_ bv0 32) |~#p1~0.offset|) (= .cse1 |~#b~0.offset|) (not (= |~#b~0.base| v_~pp2~0.base_BEFORE_CALL_2)) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#a~0.base|)))) [2018-11-23 11:07:53,245 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-23 11:07:53,252 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4bv32);call write~init~intINTTYPE4(0bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(4bv32);call write~init~intINTTYPE4(0bv32, ~#b~0.base, ~#b~0.offset, 4bv32);call ~#p1~0.base, ~#p1~0.offset := #Ultimate.alloc(4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#p1~0.base, ~#p1~0.offset, 4bv32);call ~#p2~0.base, ~#p2~0.offset := #Ultimate.alloc(4bv32);call write~init~$Pointer$(0bv32, 0bv32, ~#p2~0.base, ~#p2~0.offset, 4bv32);~pp1~0.base, ~pp1~0.offset := 0bv32, 0bv32;~pp2~0.base, ~pp2~0.offset := 0bv32, 0bv32; {30#(and (not (= |~#p1~0.base| |~#a~0.base|)) (not (= |~#b~0.base| |~#p2~0.base|)) (not (= |~#p1~0.base| |~#p2~0.base|)) (= (_ bv0 32) |~#p2~0.offset|) (= (_ bv0 32) |~#p1~0.offset|) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#a~0.base|)) (not (= |~#p2~0.base| |~#a~0.base|)))} is VALID [2018-11-23 11:07:53,253 INFO L273 TraceCheckUtils]: 2: Hoare triple {30#(and (not (= |~#p1~0.base| |~#a~0.base|)) (not (= |~#b~0.base| |~#p2~0.base|)) (not (= |~#p1~0.base| |~#p2~0.base|)) (= (_ bv0 32) |~#p2~0.offset|) (= (_ bv0 32) |~#p1~0.offset|) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#a~0.base|)) (not (= |~#p2~0.base| |~#a~0.base|)))} assume true; {30#(and (not (= |~#p1~0.base| |~#a~0.base|)) (not (= |~#b~0.base| |~#p2~0.base|)) (not (= |~#p1~0.base| |~#p2~0.base|)) (= (_ bv0 32) |~#p2~0.offset|) (= (_ bv0 32) |~#p1~0.offset|) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#a~0.base|)) (not (= |~#p2~0.base| |~#a~0.base|)))} is VALID [2018-11-23 11:07:53,257 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30#(and (not (= |~#p1~0.base| |~#a~0.base|)) (not (= |~#b~0.base| |~#p2~0.base|)) (not (= |~#p1~0.base| |~#p2~0.base|)) (= (_ bv0 32) |~#p2~0.offset|) (= (_ bv0 32) |~#p1~0.offset|) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#a~0.base|)) (not (= |~#p2~0.base| |~#a~0.base|)))} {22#true} #25#return; {30#(and (not (= |~#p1~0.base| |~#a~0.base|)) (not (= |~#b~0.base| |~#p2~0.base|)) (not (= |~#p1~0.base| |~#p2~0.base|)) (= (_ bv0 32) |~#p2~0.offset|) (= (_ bv0 32) |~#p1~0.offset|) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#a~0.base|)) (not (= |~#p2~0.base| |~#a~0.base|)))} is VALID [2018-11-23 11:07:53,258 INFO L256 TraceCheckUtils]: 4: Hoare triple {30#(and (not (= |~#p1~0.base| |~#a~0.base|)) (not (= |~#b~0.base| |~#p2~0.base|)) (not (= |~#p1~0.base| |~#p2~0.base|)) (= (_ bv0 32) |~#p2~0.offset|) (= (_ bv0 32) |~#p1~0.offset|) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#a~0.base|)) (not (= |~#p2~0.base| |~#a~0.base|)))} call #t~ret10 := main(); {30#(and (not (= |~#p1~0.base| |~#a~0.base|)) (not (= |~#b~0.base| |~#p2~0.base|)) (not (= |~#p1~0.base| |~#p2~0.base|)) (= (_ bv0 32) |~#p2~0.offset|) (= (_ bv0 32) |~#p1~0.offset|) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#a~0.base|)) (not (= |~#p2~0.base| |~#a~0.base|)))} is VALID [2018-11-23 11:07:53,263 INFO L273 TraceCheckUtils]: 5: Hoare triple {30#(and (not (= |~#p1~0.base| |~#a~0.base|)) (not (= |~#b~0.base| |~#p2~0.base|)) (not (= |~#p1~0.base| |~#p2~0.base|)) (= (_ bv0 32) |~#p2~0.offset|) (= (_ bv0 32) |~#p1~0.offset|) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#a~0.base|)) (not (= |~#p2~0.base| |~#a~0.base|)))} havoc ~px~0.base, ~px~0.offset;call write~$Pointer$(~#a~0.base, ~#a~0.offset, ~#p1~0.base, ~#p1~0.offset, 4bv32);call write~$Pointer$(~#b~0.base, ~#b~0.offset, ~#p2~0.base, ~#p2~0.offset, 4bv32);~pp1~0.base, ~pp1~0.offset := ~#p1~0.base, ~#p1~0.offset;~pp2~0.base, ~pp2~0.offset := ~#p2~0.base, ~#p2~0.offset;call write~intINTTYPE4(1bv32, ~#b~0.base, ~#b~0.offset, 4bv32);call write~intINTTYPE4(5bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~#a~0.offset, 4bv32);#t~post3 := #t~mem2;call write~intINTTYPE4(~bvsub32(#t~post3, 1bv32), ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~post3;havoc #t~mem2; {43#(and (= |~#a~0.base| (select (select |#memory_$Pointer$.base| |~#p1~0.base|) ~pp1~0.offset)) (not (= |~#p1~0.base| |~#a~0.base|)) (= (_ bv0 32) ~pp2~0.offset) (not (= |~#b~0.base| ~pp2~0.base)) (= (select (select |#memory_$Pointer$.offset| |~#p1~0.base|) ~pp1~0.offset) |~#a~0.offset|) (= |~#p1~0.offset| ~pp1~0.offset) (= (select (select |#memory_$Pointer$.offset| ~pp2~0.base) (_ bv0 32)) |~#b~0.offset|) (not (= ~pp2~0.base |~#a~0.base|)) (= (_ bv0 32) |~#p1~0.offset|) (= |~#p1~0.base| ~pp1~0.base) (not (= |~#b~0.base| |~#a~0.base|)) (= |~#b~0.base| (select (select |#memory_$Pointer$.base| ~pp2~0.base) (_ bv0 32))) (not (= |~#b~0.base| |~#p1~0.base|)))} is VALID [2018-11-23 11:07:53,265 INFO L256 TraceCheckUtils]: 6: Hoare triple {43#(and (= |~#a~0.base| (select (select |#memory_$Pointer$.base| |~#p1~0.base|) ~pp1~0.offset)) (not (= |~#p1~0.base| |~#a~0.base|)) (= (_ bv0 32) ~pp2~0.offset) (not (= |~#b~0.base| ~pp2~0.base)) (= (select (select |#memory_$Pointer$.offset| |~#p1~0.base|) ~pp1~0.offset) |~#a~0.offset|) (= |~#p1~0.offset| ~pp1~0.offset) (= (select (select |#memory_$Pointer$.offset| ~pp2~0.base) (_ bv0 32)) |~#b~0.offset|) (not (= ~pp2~0.base |~#a~0.base|)) (= (_ bv0 32) |~#p1~0.offset|) (= |~#p1~0.base| ~pp1~0.base) (not (= |~#b~0.base| |~#a~0.base|)) (= |~#b~0.base| (select (select |#memory_$Pointer$.base| ~pp2~0.base) (_ bv0 32))) (not (= |~#b~0.base| |~#p1~0.base|)))} call #t~ret4 := f(); {47#(and (not (= |~#p1~0.base| |~#a~0.base|)) (= |old(~pp2~0.offset)| ~pp2~0.offset) (= ~pp2~0.base |old(~pp2~0.base)|) (= |~#p1~0.offset| ~pp1~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (_ bv0 32) |~#p1~0.offset|) (= |~#p1~0.base| ~pp1~0.base) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#a~0.base|)))} is VALID [2018-11-23 11:07:53,269 INFO L273 TraceCheckUtils]: 7: Hoare triple {47#(and (not (= |~#p1~0.base| |~#a~0.base|)) (= |old(~pp2~0.offset)| ~pp2~0.offset) (= ~pp2~0.base |old(~pp2~0.base)|) (= |~#p1~0.offset| ~pp1~0.offset) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= (_ bv0 32) |~#p1~0.offset|) (= |~#p1~0.base| ~pp1~0.base) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#a~0.base|)))} ~v~0 := #t~nondet0;havoc #t~nondet0;call #t~mem1.base, #t~mem1.offset := read~$Pointer$(~pp2~0.base, ~pp2~0.offset, 4bv32);call write~$Pointer$(#t~mem1.base, #t~mem1.offset, ~pp1~0.base, ~pp1~0.offset, 4bv32);havoc #t~mem1.base, #t~mem1.offset;~pp2~0.base, ~pp2~0.offset := ~pp1~0.base, ~pp1~0.offset;#res := ~v~0; {51#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| ~pp1~0.base (store (select |old(#memory_$Pointer$.base)| ~pp1~0.base) ~pp1~0.offset (select (select |old(#memory_$Pointer$.base)| |old(~pp2~0.base)|) |old(~pp2~0.offset)|)))) (not (= |~#p1~0.base| |~#a~0.base|)) (= (store |old(#memory_$Pointer$.offset)| ~pp1~0.base (store (select |old(#memory_$Pointer$.offset)| ~pp1~0.base) ~pp1~0.offset (select (select |old(#memory_$Pointer$.offset)| |old(~pp2~0.base)|) |old(~pp2~0.offset)|))) |#memory_$Pointer$.offset|) (= |~#p1~0.offset| ~pp1~0.offset) (= (_ bv0 32) |~#p1~0.offset|) (= ~pp2~0.base ~pp1~0.base) (= |~#p1~0.base| ~pp1~0.base) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#a~0.base|)))} is VALID [2018-11-23 11:07:53,271 INFO L273 TraceCheckUtils]: 8: Hoare triple {51#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| ~pp1~0.base (store (select |old(#memory_$Pointer$.base)| ~pp1~0.base) ~pp1~0.offset (select (select |old(#memory_$Pointer$.base)| |old(~pp2~0.base)|) |old(~pp2~0.offset)|)))) (not (= |~#p1~0.base| |~#a~0.base|)) (= (store |old(#memory_$Pointer$.offset)| ~pp1~0.base (store (select |old(#memory_$Pointer$.offset)| ~pp1~0.base) ~pp1~0.offset (select (select |old(#memory_$Pointer$.offset)| |old(~pp2~0.base)|) |old(~pp2~0.offset)|))) |#memory_$Pointer$.offset|) (= |~#p1~0.offset| ~pp1~0.offset) (= (_ bv0 32) |~#p1~0.offset|) (= ~pp2~0.base ~pp1~0.base) (= |~#p1~0.base| ~pp1~0.base) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#a~0.base|)))} assume true; {51#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| ~pp1~0.base (store (select |old(#memory_$Pointer$.base)| ~pp1~0.base) ~pp1~0.offset (select (select |old(#memory_$Pointer$.base)| |old(~pp2~0.base)|) |old(~pp2~0.offset)|)))) (not (= |~#p1~0.base| |~#a~0.base|)) (= (store |old(#memory_$Pointer$.offset)| ~pp1~0.base (store (select |old(#memory_$Pointer$.offset)| ~pp1~0.base) ~pp1~0.offset (select (select |old(#memory_$Pointer$.offset)| |old(~pp2~0.base)|) |old(~pp2~0.offset)|))) |#memory_$Pointer$.offset|) (= |~#p1~0.offset| ~pp1~0.offset) (= (_ bv0 32) |~#p1~0.offset|) (= ~pp2~0.base ~pp1~0.base) (= |~#p1~0.base| ~pp1~0.base) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#a~0.base|)))} is VALID [2018-11-23 11:07:53,279 INFO L268 TraceCheckUtils]: 9: Hoare quadruple {51#(and (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| ~pp1~0.base (store (select |old(#memory_$Pointer$.base)| ~pp1~0.base) ~pp1~0.offset (select (select |old(#memory_$Pointer$.base)| |old(~pp2~0.base)|) |old(~pp2~0.offset)|)))) (not (= |~#p1~0.base| |~#a~0.base|)) (= (store |old(#memory_$Pointer$.offset)| ~pp1~0.base (store (select |old(#memory_$Pointer$.offset)| ~pp1~0.base) ~pp1~0.offset (select (select |old(#memory_$Pointer$.offset)| |old(~pp2~0.base)|) |old(~pp2~0.offset)|))) |#memory_$Pointer$.offset|) (= |~#p1~0.offset| ~pp1~0.offset) (= (_ bv0 32) |~#p1~0.offset|) (= ~pp2~0.base ~pp1~0.base) (= |~#p1~0.base| ~pp1~0.base) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#a~0.base|)))} {43#(and (= |~#a~0.base| (select (select |#memory_$Pointer$.base| |~#p1~0.base|) ~pp1~0.offset)) (not (= |~#p1~0.base| |~#a~0.base|)) (= (_ bv0 32) ~pp2~0.offset) (not (= |~#b~0.base| ~pp2~0.base)) (= (select (select |#memory_$Pointer$.offset| |~#p1~0.base|) ~pp1~0.offset) |~#a~0.offset|) (= |~#p1~0.offset| ~pp1~0.offset) (= (select (select |#memory_$Pointer$.offset| ~pp2~0.base) (_ bv0 32)) |~#b~0.offset|) (not (= ~pp2~0.base |~#a~0.base|)) (= (_ bv0 32) |~#p1~0.offset|) (= |~#p1~0.base| ~pp1~0.base) (not (= |~#b~0.base| |~#a~0.base|)) (= |~#b~0.base| (select (select |#memory_$Pointer$.base| ~pp2~0.base) (_ bv0 32))) (not (= |~#b~0.base| |~#p1~0.base|)))} #29#return; {58#(and (not (= |~#p1~0.base| |~#a~0.base|)) (= (_ bv0 32) |~#p1~0.offset|) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#a~0.base|)) (exists ((v_~pp2~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (not (= |~#a~0.base| v_~pp2~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| |~#p1~0.base|) |~#p1~0.offset|) (select (select |#memory_$Pointer$.base| v_~pp2~0.base_BEFORE_CALL_2) (_ bv0 32))) (= |~#b~0.base| (select (select |#memory_$Pointer$.base| v_~pp2~0.base_BEFORE_CALL_2) (_ bv0 32))) (not (= |~#p1~0.base| v_~pp2~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.offset| v_~pp2~0.base_BEFORE_CALL_2) (_ bv0 32)) (select (select |#memory_$Pointer$.offset| |~#p1~0.base|) |~#p1~0.offset|)) (= (select (select |#memory_$Pointer$.offset| v_~pp2~0.base_BEFORE_CALL_2) (_ bv0 32)) |~#b~0.offset|) (not (= |~#b~0.base| v_~pp2~0.base_BEFORE_CALL_2)))))} is VALID [2018-11-23 11:07:53,285 INFO L273 TraceCheckUtils]: 10: Hoare triple {58#(and (not (= |~#p1~0.base| |~#a~0.base|)) (= (_ bv0 32) |~#p1~0.offset|) (not (= |~#b~0.base| |~#p1~0.base|)) (not (= |~#b~0.base| |~#a~0.base|)) (exists ((v_~pp2~0.base_BEFORE_CALL_2 (_ BitVec 32))) (and (not (= |~#a~0.base| v_~pp2~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.base| |~#p1~0.base|) |~#p1~0.offset|) (select (select |#memory_$Pointer$.base| v_~pp2~0.base_BEFORE_CALL_2) (_ bv0 32))) (= |~#b~0.base| (select (select |#memory_$Pointer$.base| v_~pp2~0.base_BEFORE_CALL_2) (_ bv0 32))) (not (= |~#p1~0.base| v_~pp2~0.base_BEFORE_CALL_2)) (= (select (select |#memory_$Pointer$.offset| v_~pp2~0.base_BEFORE_CALL_2) (_ bv0 32)) (select (select |#memory_$Pointer$.offset| |~#p1~0.base|) |~#p1~0.offset|)) (= (select (select |#memory_$Pointer$.offset| v_~pp2~0.base_BEFORE_CALL_2) (_ bv0 32)) |~#b~0.offset|) (not (= |~#b~0.base| v_~pp2~0.base_BEFORE_CALL_2)))))} call write~intINTTYPE4(#t~ret4, ~#a~0.base, ~#a~0.offset, 4bv32);havoc #t~ret4;call write~intINTTYPE4(0bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call write~intINTTYPE4(0bv32, ~#b~0.base, ~#b~0.offset, 4bv32);call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~pp2~0.base, ~pp2~0.offset, 4bv32);~px~0.base, ~px~0.offset := #t~mem5.base, #t~mem5.offset;havoc #t~mem5.base, #t~mem5.offset;call write~intINTTYPE4(7bv32, ~#a~0.base, ~#a~0.offset, 4bv32);call write~intINTTYPE4(8bv32, ~#b~0.base, ~#b~0.offset, 4bv32);call #t~mem6.base, #t~mem6.offset := read~$Pointer$(~#p1~0.base, ~#p1~0.offset, 4bv32);call #t~mem7 := read~intINTTYPE4(#t~mem6.base, #t~mem6.offset, 4bv32);#t~short9 := 8bv32 != #t~mem7; {62#(not |main_#t~short9|)} is VALID [2018-11-23 11:07:53,286 INFO L273 TraceCheckUtils]: 11: Hoare triple {62#(not |main_#t~short9|)} assume #t~short9; {23#false} is VALID [2018-11-23 11:07:53,286 INFO L273 TraceCheckUtils]: 12: Hoare triple {23#false} assume #t~short9;havoc #t~mem6.base, #t~mem6.offset;havoc #t~mem8;havoc #t~short9;havoc #t~mem7; {23#false} is VALID [2018-11-23 11:07:53,286 INFO L273 TraceCheckUtils]: 13: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-23 11:07:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:07:53,291 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:07:53,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:07:53,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 11:07:53,304 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-11-23 11:07:53,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:53,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:07:53,368 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:53,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:07:53,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:07:53,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:07:53,380 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 8 states. [2018-11-23 11:08:00,369 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 49 [2018-11-23 11:08:00,664 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2018-11-23 11:08:01,210 WARN L180 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2018-11-23 11:08:08,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:08,064 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 11:08:08,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:08:08,065 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-11-23 11:08:08,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:08:08,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:08:08,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2018-11-23 11:08:08,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:08:08,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 27 transitions. [2018-11-23 11:08:08,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 27 transitions. [2018-11-23 11:08:08,923 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:08,934 INFO L225 Difference]: With dead ends: 26 [2018-11-23 11:08:08,934 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 11:08:08,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:08:08,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 11:08:09,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 11:08:09,030 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:08:09,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2018-11-23 11:08:09,032 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:08:09,032 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:08:09,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:09,036 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2018-11-23 11:08:09,036 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2018-11-23 11:08:09,037 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:09,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:09,037 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2018-11-23 11:08:09,038 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2018-11-23 11:08:09,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:09,041 INFO L93 Difference]: Finished difference Result 15 states and 14 transitions. [2018-11-23 11:08:09,041 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2018-11-23 11:08:09,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:09,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:09,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:08:09,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:08:09,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:08:09,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 14 transitions. [2018-11-23 11:08:09,045 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 14 transitions. Word has length 14 [2018-11-23 11:08:09,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:08:09,046 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 14 transitions. [2018-11-23 11:08:09,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:08:09,046 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 14 transitions. [2018-11-23 11:08:09,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:08:09,047 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:08:09,047 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:08:09,047 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:08:09,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:08:09,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1020603882, now seen corresponding path program 1 times [2018-11-23 11:08:09,048 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:08:09,048 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 (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 [2018-11-23 11:08:09,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:08:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:09,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:08:09,190 INFO L478 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 26 treesize of output 25 [2018-11-23 11:08:09,233 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:09,253 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 38 [2018-11-23 11:08:09,412 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 30 [2018-11-23 11:08:09,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:09,442 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:09,445 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:09,446 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 17 [2018-11-23 11:08:09,449 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:09,495 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:09,496 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:09,498 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 13 [2018-11-23 11:08:09,500 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:09,518 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:09,531 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:09,546 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:09,547 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:29, output treesize:16 [2018-11-23 11:08:09,976 INFO L303 Elim1Store]: Index analysis took 137 ms [2018-11-23 11:08:10,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 28 [2018-11-23 11:08:10,279 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2018-11-23 11:08:10,319 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:10,409 INFO L478 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 12 treesize of output 11 [2018-11-23 11:08:10,411 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:10,429 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:10,554 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 28 [2018-11-23 11:08:10,569 INFO L478 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 17 treesize of output 16 [2018-11-23 11:08:10,572 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:10,616 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:10,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:08:10,675 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:58, output treesize:50 [2018-11-23 11:08:12,508 INFO L303 Elim1Store]: Index analysis took 1414 ms [2018-11-23 11:08:12,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 317 treesize of output 261 [2018-11-23 11:08:12,933 INFO L303 Elim1Store]: Index analysis took 417 ms [2018-11-23 11:08:12,934 INFO L478 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 8 treesize of output 7 [2018-11-23 11:08:12,935 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:25,495 INFO L303 Elim1Store]: Index analysis took 1983 ms [2018-11-23 11:08:25,496 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 47 [2018-11-23 11:08:25,752 INFO L303 Elim1Store]: Index analysis took 253 ms [2018-11-23 11:08:25,753 INFO L478 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 8 treesize of output 7 [2018-11-23 11:08:25,756 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:28,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:28,896 INFO L303 Elim1Store]: Index analysis took 1195 ms [2018-11-23 11:08:28,897 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 42 [2018-11-23 11:08:29,048 INFO L303 Elim1Store]: Index analysis took 146 ms [2018-11-23 11:08:29,049 INFO L478 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 20 treesize of output 7 [2018-11-23 11:08:29,050 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:30,988 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:31,274 INFO L303 Elim1Store]: Index analysis took 785 ms [2018-11-23 11:08:31,275 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 31 [2018-11-23 11:08:31,411 INFO L303 Elim1Store]: Index analysis took 119 ms [2018-11-23 11:08:31,412 INFO L478 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 20 treesize of output 7 [2018-11-23 11:08:31,413 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:32,355 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:33,209 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:33,989 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:39,168 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.