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/list-ext2-properties/simple_and_skiplist_2lvl_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:10:14,511 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:10:14,513 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:10:14,531 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:10:14,532 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:10:14,533 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:10:14,534 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:10:14,536 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:10:14,538 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:10:14,539 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:10:14,540 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:10:14,540 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:10:14,541 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:10:14,542 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:10:14,543 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:10:14,544 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:10:14,545 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:10:14,547 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:10:14,549 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:10:14,550 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:10:14,552 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:10:14,553 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:10:14,555 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:10:14,556 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:10:14,556 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:10:14,557 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:10:14,558 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:10:14,559 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:10:14,559 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:10:14,561 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:10:14,561 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:10:14,562 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:10:14,562 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:10:14,562 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:10:14,563 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:10:14,564 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:10:14,564 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:10:14,584 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:10:14,585 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:10:14,586 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:10:14,586 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:10:14,587 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:10:14,587 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:10:14,587 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:10:14,587 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:10:14,587 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:10:14,590 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:10:14,590 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:10:14,590 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:10:14,590 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:10:14,590 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:10:14,591 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:10:14,591 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:10:14,591 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:10:14,591 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:10:14,591 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:10:14,592 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:10:14,592 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:10:14,592 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:10:14,592 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:10:14,592 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:10:14,593 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:10:14,594 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:10:14,594 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:10:14,594 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:10:14,595 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:10:14,595 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:10:14,595 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:10:14,595 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:10:14,595 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:10:14,641 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:10:14,656 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:10:14,660 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:10:14,662 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:10:14,662 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:10:14,663 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/simple_and_skiplist_2lvl_true-unreach-call.i [2018-11-23 11:10:14,732 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98ffec564/b7863597f40c4106b26e838227b404a5/FLAG6f00e5689 [2018-11-23 11:10:15,297 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:10:15,298 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_and_skiplist_2lvl_true-unreach-call.i [2018-11-23 11:10:15,313 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98ffec564/b7863597f40c4106b26e838227b404a5/FLAG6f00e5689 [2018-11-23 11:10:15,579 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98ffec564/b7863597f40c4106b26e838227b404a5 [2018-11-23 11:10:15,591 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:10:15,593 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:10:15,594 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:10:15,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:10:15,599 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:10:15,601 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:10:15" (1/1) ... [2018-11-23 11:10:15,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@363968c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:15, skipping insertion in model container [2018-11-23 11:10:15,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:10:15" (1/1) ... [2018-11-23 11:10:15,617 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:10:15,682 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:10:16,058 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:10:16,074 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:10:16,252 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:10:16,331 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:10:16,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:16 WrapperNode [2018-11-23 11:10:16,332 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:10:16,333 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:10:16,333 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:10:16,333 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:10:16,344 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:10:16" (1/1) ... [2018-11-23 11:10:16,364 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:10:16" (1/1) ... [2018-11-23 11:10:16,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:10:16,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:10:16,375 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:10:16,375 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:10:16,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:16" (1/1) ... [2018-11-23 11:10:16,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:16" (1/1) ... [2018-11-23 11:10:16,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:16" (1/1) ... [2018-11-23 11:10:16,391 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:16" (1/1) ... [2018-11-23 11:10:16,423 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:16" (1/1) ... [2018-11-23 11:10:16,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:16" (1/1) ... [2018-11-23 11:10:16,438 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:16" (1/1) ... [2018-11-23 11:10:16,443 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:10:16,444 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:10:16,444 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:10:16,444 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:10:16,445 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:16" (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:10:16,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:10:16,515 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:10:16,515 INFO L130 BoogieDeclarations]: Found specification of procedure sl_random_insert [2018-11-23 11:10:16,515 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_random_insert [2018-11-23 11:10:16,515 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 11:10:16,516 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 11:10:16,516 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:10:16,516 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:10:16,516 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:10:16,516 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:10:16,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:10:16,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:10:16,517 INFO L130 BoogieDeclarations]: Found specification of procedure create_sl_with_head_and_tail [2018-11-23 11:10:16,517 INFO L138 BoogieDeclarations]: Found implementation of procedure create_sl_with_head_and_tail [2018-11-23 11:10:16,517 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_sl [2018-11-23 11:10:16,517 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_sl [2018-11-23 11:10:16,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:10:16,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:10:16,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:10:16,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:10:20,100 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:10:20,101 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 11:10:20,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:10:20 BoogieIcfgContainer [2018-11-23 11:10:20,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:10:20,103 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:10:20,103 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:10:20,106 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:10:20,107 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:10:15" (1/3) ... [2018-11-23 11:10:20,107 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d7a11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:10:20, skipping insertion in model container [2018-11-23 11:10:20,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:10:16" (2/3) ... [2018-11-23 11:10:20,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17d7a11d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:10:20, skipping insertion in model container [2018-11-23 11:10:20,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:10:20" (3/3) ... [2018-11-23 11:10:20,110 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_and_skiplist_2lvl_true-unreach-call.i [2018-11-23 11:10:20,121 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:10:20,130 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:10:20,148 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:10:20,183 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:10:20,183 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:10:20,183 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:10:20,184 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:10:20,184 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:10:20,184 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:10:20,184 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:10:20,184 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:10:20,184 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:10:20,201 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states. [2018-11-23 11:10:20,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:10:20,208 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:20,209 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:10:20,210 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:20,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:20,216 INFO L82 PathProgramCache]: Analyzing trace with hash -2136685355, now seen corresponding path program 1 times [2018-11-23 11:10:20,220 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:20,221 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:10:20,238 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:20,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:20,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:20,393 INFO L256 TraceCheckUtils]: 0: Hoare triple {53#true} call ULTIMATE.init(); {53#true} is VALID [2018-11-23 11:10:20,397 INFO L273 TraceCheckUtils]: 1: Hoare triple {53#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {53#true} is VALID [2018-11-23 11:10:20,397 INFO L273 TraceCheckUtils]: 2: Hoare triple {53#true} assume true; {53#true} is VALID [2018-11-23 11:10:20,398 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {53#true} {53#true} #145#return; {53#true} is VALID [2018-11-23 11:10:20,398 INFO L256 TraceCheckUtils]: 4: Hoare triple {53#true} call #t~ret36 := main(); {53#true} is VALID [2018-11-23 11:10:20,398 INFO L273 TraceCheckUtils]: 5: Hoare triple {53#true} call #t~malloc28.base, #t~malloc28.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc28.base, #t~malloc28.offset; {53#true} is VALID [2018-11-23 11:10:20,398 INFO L273 TraceCheckUtils]: 6: Hoare triple {53#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {53#true} is VALID [2018-11-23 11:10:20,399 INFO L273 TraceCheckUtils]: 7: Hoare triple {53#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {53#true} is VALID [2018-11-23 11:10:20,417 INFO L273 TraceCheckUtils]: 8: Hoare triple {53#true} assume !true; {54#false} is VALID [2018-11-23 11:10:20,418 INFO L273 TraceCheckUtils]: 9: Hoare triple {54#false} call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {54#false} is VALID [2018-11-23 11:10:20,418 INFO L273 TraceCheckUtils]: 10: Hoare triple {54#false} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem32 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {54#false} is VALID [2018-11-23 11:10:20,418 INFO L273 TraceCheckUtils]: 11: Hoare triple {54#false} assume 1bv32 != #t~mem32;havoc #t~mem32; {54#false} is VALID [2018-11-23 11:10:20,419 INFO L273 TraceCheckUtils]: 12: Hoare triple {54#false} assume !false; {54#false} is VALID [2018-11-23 11:10:20,423 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:10:20,423 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:10:20,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:10:20,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:10:20,438 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:10:20,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:20,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:10:20,487 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:20,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:10:20,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:10:20,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:10:20,502 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 2 states. [2018-11-23 11:10:22,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:22,811 INFO L93 Difference]: Finished difference Result 85 states and 113 transitions. [2018-11-23 11:10:22,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:10:22,812 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 11:10:22,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:22,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:10:22,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 113 transitions. [2018-11-23 11:10:22,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:10:22,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 113 transitions. [2018-11-23 11:10:22,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 113 transitions. [2018-11-23 11:10:23,690 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:23,702 INFO L225 Difference]: With dead ends: 85 [2018-11-23 11:10:23,703 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 11:10:23,707 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:10:23,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 11:10:23,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-11-23 11:10:23,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:10:23,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand 17 states. [2018-11-23 11:10:23,819 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:10:23,819 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:10:23,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:23,826 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-23 11:10:23,826 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:10:23,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:23,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:23,827 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 17 states. [2018-11-23 11:10:23,827 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 17 states. [2018-11-23 11:10:23,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:23,831 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-11-23 11:10:23,831 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:10:23,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:23,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:23,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:10:23,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:10:23,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:10:23,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-11-23 11:10:23,842 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 13 [2018-11-23 11:10:23,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:10:23,842 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-11-23 11:10:23,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:10:23,842 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-11-23 11:10:23,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 11:10:23,852 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:23,852 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:10:23,852 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:23,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:23,853 INFO L82 PathProgramCache]: Analyzing trace with hash 2147199689, now seen corresponding path program 1 times [2018-11-23 11:10:23,853 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:23,853 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:10:23,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:23,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:23,954 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:24,184 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 15 [2018-11-23 11:10:24,192 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 15 treesize of output 18 [2018-11-23 11:10:24,204 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 18 treesize of output 7 [2018-11-23 11:10:24,210 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:24,213 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:24,221 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:24,229 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:24,229 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:22, output treesize:11 [2018-11-23 11:10:24,393 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 17 treesize of output 13 [2018-11-23 11:10:24,409 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 13 treesize of output 5 [2018-11-23 11:10:24,410 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:24,412 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:24,415 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:24,415 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:17, output treesize:5 [2018-11-23 11:10:24,420 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:24,420 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) (_ bv0 32)))) (and (= |main_#t~mem32| .cse0) (= (bvadd .cse0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-23 11:10:24,421 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (bvadd |main_#t~mem32| (_ bv4294967295 32)) (_ bv0 32)) [2018-11-23 11:10:24,442 INFO L256 TraceCheckUtils]: 0: Hoare triple {266#true} call ULTIMATE.init(); {266#true} is VALID [2018-11-23 11:10:24,442 INFO L273 TraceCheckUtils]: 1: Hoare triple {266#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {266#true} is VALID [2018-11-23 11:10:24,443 INFO L273 TraceCheckUtils]: 2: Hoare triple {266#true} assume true; {266#true} is VALID [2018-11-23 11:10:24,443 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {266#true} {266#true} #145#return; {266#true} is VALID [2018-11-23 11:10:24,443 INFO L256 TraceCheckUtils]: 4: Hoare triple {266#true} call #t~ret36 := main(); {266#true} is VALID [2018-11-23 11:10:24,448 INFO L273 TraceCheckUtils]: 5: Hoare triple {266#true} call #t~malloc28.base, #t~malloc28.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc28.base, #t~malloc28.offset; {286#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:10:24,449 INFO L273 TraceCheckUtils]: 6: Hoare triple {286#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {286#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:10:24,450 INFO L273 TraceCheckUtils]: 7: Hoare triple {286#(= main_~a~0.offset (_ bv0 32))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {293#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:10:24,450 INFO L273 TraceCheckUtils]: 8: Hoare triple {293#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet29);havoc #t~nondet29; {293#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:10:24,469 INFO L273 TraceCheckUtils]: 9: Hoare triple {293#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {300#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:24,481 INFO L273 TraceCheckUtils]: 10: Hoare triple {300#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem32 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {304#(= (bvadd |main_#t~mem32| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:10:24,482 INFO L273 TraceCheckUtils]: 11: Hoare triple {304#(= (bvadd |main_#t~mem32| (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != #t~mem32;havoc #t~mem32; {267#false} is VALID [2018-11-23 11:10:24,483 INFO L273 TraceCheckUtils]: 12: Hoare triple {267#false} assume !false; {267#false} is VALID [2018-11-23 11:10:24,484 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:10:24,484 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:10:24,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:10:24,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:10:24,489 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 11:10:24,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:24,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:10:24,528 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:24,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:10:24,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:10:24,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:10:24,530 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 6 states. [2018-11-23 11:10:25,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:25,324 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 11:10:25,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:10:25,324 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 11:10:25,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:25,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:10:25,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2018-11-23 11:10:25,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:10:25,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2018-11-23 11:10:25,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 33 transitions. [2018-11-23 11:10:25,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:25,406 INFO L225 Difference]: With dead ends: 31 [2018-11-23 11:10:25,406 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 11:10:25,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:10:25,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 11:10:25,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2018-11-23 11:10:25,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:10:25,428 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 21 states. [2018-11-23 11:10:25,429 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 21 states. [2018-11-23 11:10:25,429 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 21 states. [2018-11-23 11:10:25,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:25,432 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 11:10:25,432 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 11:10:25,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:25,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:25,433 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 29 states. [2018-11-23 11:10:25,433 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 29 states. [2018-11-23 11:10:25,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:25,436 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 11:10:25,436 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2018-11-23 11:10:25,437 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:25,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:25,437 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:10:25,437 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:10:25,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:10:25,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-23 11:10:25,439 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 13 [2018-11-23 11:10:25,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:10:25,440 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 11:10:25,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:10:25,440 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 11:10:25,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:10:25,441 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:25,441 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:10:25,441 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:25,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:25,442 INFO L82 PathProgramCache]: Analyzing trace with hash -2012129499, now seen corresponding path program 1 times [2018-11-23 11:10:25,443 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:25,443 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 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 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:10:25,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:25,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:25,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:25,506 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:25,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 8 [2018-11-23 11:10:25,615 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:10:25,618 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:25,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:25,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 8 [2018-11-23 11:10:25,659 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:10:25,664 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:25,667 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:25,678 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:25,679 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-23 11:10:25,828 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-11-23 11:10:25,892 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 11 treesize of output 3 [2018-11-23 11:10:25,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:25,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:25,916 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-11-23 11:10:25,922 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 11 treesize of output 3 [2018-11-23 11:10:25,923 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:25,925 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:25,932 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:10:25,932 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 11:10:25,938 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:25,938 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.offset|, v_main_~p~0.base_13, |#memory_$Pointer$.base|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_13) (_ bv4 32))) (.cse1 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_13) (_ bv4 32)))) (and (= .cse0 (_ bv0 32)) (= main_~p~0.offset .cse1) (= .cse0 main_~p~0.base) (= (_ bv0 32) .cse1))) [2018-11-23 11:10:25,938 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base)) [2018-11-23 11:10:25,967 INFO L256 TraceCheckUtils]: 0: Hoare triple {441#true} call ULTIMATE.init(); {441#true} is VALID [2018-11-23 11:10:25,967 INFO L273 TraceCheckUtils]: 1: Hoare triple {441#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {441#true} is VALID [2018-11-23 11:10:25,968 INFO L273 TraceCheckUtils]: 2: Hoare triple {441#true} assume true; {441#true} is VALID [2018-11-23 11:10:25,968 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {441#true} {441#true} #145#return; {441#true} is VALID [2018-11-23 11:10:25,968 INFO L256 TraceCheckUtils]: 4: Hoare triple {441#true} call #t~ret36 := main(); {441#true} is VALID [2018-11-23 11:10:25,970 INFO L273 TraceCheckUtils]: 5: Hoare triple {441#true} call #t~malloc28.base, #t~malloc28.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc28.base, #t~malloc28.offset; {461#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:10:25,970 INFO L273 TraceCheckUtils]: 6: Hoare triple {461#(= main_~a~0.offset (_ bv0 32))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {461#(= main_~a~0.offset (_ bv0 32))} is VALID [2018-11-23 11:10:25,971 INFO L273 TraceCheckUtils]: 7: Hoare triple {461#(= main_~a~0.offset (_ bv0 32))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {468#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:10:25,971 INFO L273 TraceCheckUtils]: 8: Hoare triple {468#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} assume !(0bv32 != #t~nondet29);havoc #t~nondet29; {468#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:10:25,974 INFO L273 TraceCheckUtils]: 9: Hoare triple {468#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset))} call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {475#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:25,976 INFO L273 TraceCheckUtils]: 10: Hoare triple {475#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem32 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {475#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:25,977 INFO L273 TraceCheckUtils]: 11: Hoare triple {475#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)))} assume !(1bv32 != #t~mem32);havoc #t~mem32; {475#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:25,979 INFO L273 TraceCheckUtils]: 12: Hoare triple {475#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)))} call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {485#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} is VALID [2018-11-23 11:10:25,988 INFO L273 TraceCheckUtils]: 13: Hoare triple {485#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem32 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {442#false} is VALID [2018-11-23 11:10:25,988 INFO L273 TraceCheckUtils]: 14: Hoare triple {442#false} assume 1bv32 != #t~mem32;havoc #t~mem32; {442#false} is VALID [2018-11-23 11:10:25,989 INFO L273 TraceCheckUtils]: 15: Hoare triple {442#false} assume !false; {442#false} is VALID [2018-11-23 11:10:25,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:10:25,990 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:10:26,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 13 treesize of output 11 [2018-11-23 11:10:26,203 INFO L478 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 7 treesize of output 3 [2018-11-23 11:10:26,206 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:26,208 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:26,215 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 11 [2018-11-23 11:10:26,223 INFO L478 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 7 treesize of output 3 [2018-11-23 11:10:26,225 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:26,227 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:26,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:26,276 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:39, output treesize:7 [2018-11-23 11:10:26,290 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:26,290 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_$Pointer$.base_39|, |v_#memory_$Pointer$.offset_39|]. (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32))) (.cse1 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= (select (select (store |v_#memory_$Pointer$.base_39| main_~p~0.base (store (select |v_#memory_$Pointer$.base_39| main_~p~0.base) .cse0 (_ bv0 32))) main_~a~0.base) .cse1) (_ bv0 32)) (= (select (select (store |v_#memory_$Pointer$.offset_39| main_~p~0.base (store (select |v_#memory_$Pointer$.offset_39| main_~p~0.base) .cse0 (_ bv0 32))) main_~a~0.base) .cse1) (_ bv0 32)))) [2018-11-23 11:10:26,291 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset)) [2018-11-23 11:10:26,329 INFO L273 TraceCheckUtils]: 15: Hoare triple {442#false} assume !false; {442#false} is VALID [2018-11-23 11:10:26,330 INFO L273 TraceCheckUtils]: 14: Hoare triple {442#false} assume 1bv32 != #t~mem32;havoc #t~mem32; {442#false} is VALID [2018-11-23 11:10:26,331 INFO L273 TraceCheckUtils]: 13: Hoare triple {485#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem32 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {442#false} is VALID [2018-11-23 11:10:26,331 INFO L273 TraceCheckUtils]: 12: Hoare triple {504#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {485#(and (= main_~p~0.offset (_ bv0 32)) (= (_ bv0 32) main_~p~0.base))} is VALID [2018-11-23 11:10:26,332 INFO L273 TraceCheckUtils]: 11: Hoare triple {504#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume !(1bv32 != #t~mem32);havoc #t~mem32; {504#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:10:26,333 INFO L273 TraceCheckUtils]: 10: Hoare triple {504#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem32 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {504#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:10:26,336 INFO L273 TraceCheckUtils]: 9: Hoare triple {514#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {504#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.base| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)))) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32))) (_ bv0 32)))} is VALID [2018-11-23 11:10:26,337 INFO L273 TraceCheckUtils]: 8: Hoare triple {514#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} assume !(0bv32 != #t~nondet29);havoc #t~nondet29; {514#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-23 11:10:26,338 INFO L273 TraceCheckUtils]: 7: Hoare triple {441#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {514#(and (= main_~p~0.base main_~a~0.base) (= main_~p~0.offset main_~a~0.offset))} is VALID [2018-11-23 11:10:26,339 INFO L273 TraceCheckUtils]: 6: Hoare triple {441#true} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {441#true} is VALID [2018-11-23 11:10:26,339 INFO L273 TraceCheckUtils]: 5: Hoare triple {441#true} call #t~malloc28.base, #t~malloc28.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc28.base, #t~malloc28.offset; {441#true} is VALID [2018-11-23 11:10:26,343 INFO L256 TraceCheckUtils]: 4: Hoare triple {441#true} call #t~ret36 := main(); {441#true} is VALID [2018-11-23 11:10:26,343 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {441#true} {441#true} #145#return; {441#true} is VALID [2018-11-23 11:10:26,343 INFO L273 TraceCheckUtils]: 2: Hoare triple {441#true} assume true; {441#true} is VALID [2018-11-23 11:10:26,344 INFO L273 TraceCheckUtils]: 1: Hoare triple {441#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {441#true} is VALID [2018-11-23 11:10:26,344 INFO L256 TraceCheckUtils]: 0: Hoare triple {441#true} call ULTIMATE.init(); {441#true} is VALID [2018-11-23 11:10:26,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:10:26,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:10:26,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2018-11-23 11:10:26,348 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-11-23 11:10:26,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:26,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:10:26,399 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:26,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:10:26,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:10:26,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:10:26,401 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 8 states. [2018-11-23 11:10:27,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:27,086 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 11:10:27,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:10:27,086 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 16 [2018-11-23 11:10:27,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:10:27,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:10:27,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-11-23 11:10:27,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:10:27,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 37 transitions. [2018-11-23 11:10:27,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 37 transitions. [2018-11-23 11:10:27,162 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:27,163 INFO L225 Difference]: With dead ends: 35 [2018-11-23 11:10:27,164 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 11:10:27,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:10:27,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 11:10:27,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 18. [2018-11-23 11:10:27,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:10:27,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 18 states. [2018-11-23 11:10:27,175 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 18 states. [2018-11-23 11:10:27,175 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 18 states. [2018-11-23 11:10:27,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:27,179 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 11:10:27,179 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 11:10:27,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:27,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:27,180 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 25 states. [2018-11-23 11:10:27,180 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 25 states. [2018-11-23 11:10:27,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:10:27,183 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 11:10:27,183 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-11-23 11:10:27,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:10:27,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:10:27,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:10:27,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:10:27,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:10:27,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 11:10:27,186 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2018-11-23 11:10:27,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:10:27,186 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 11:10:27,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:10:27,186 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 11:10:27,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:10:27,187 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:10:27,187 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:10:27,187 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:10:27,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:10:27,188 INFO L82 PathProgramCache]: Analyzing trace with hash 42062238, now seen corresponding path program 1 times [2018-11-23 11:10:27,188 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:10:27,188 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 (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 [2018-11-23 11:10:27,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:10:27,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:10:27,291 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:10:27,430 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 6 treesize of output 5 [2018-11-23 11:10:27,436 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:27,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:27,482 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:10:27,497 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:27,498 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_30|]. (and (= main_~a~0.offset (_ bv0 32)) (= |#valid| (store |v_#valid_30| main_~a~0.base (_ bv1 1)))) [2018-11-23 11:10:27,498 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~a~0.offset (_ bv0 32)) (= (select |#valid| main_~a~0.base) (_ bv1 1))) [2018-11-23 11:10:27,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:27,614 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:27,615 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 11:10:27,617 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:27,651 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 8 [2018-11-23 11:10:27,663 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:10:27,664 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:27,669 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:27,685 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:27,686 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:33, output treesize:21 [2018-11-23 11:10:27,695 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:27,696 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_41|, |v_#valid_31|]. (and (= (store |v_#memory_int_41| main_~p~0.base (store (select |v_#memory_int_41| main_~p~0.base) main_~p~0.offset (_ bv1 32))) |#memory_int|) (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (select |v_#valid_31| main_~t~0.base) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset) (= (_ bv0 1) (bvadd (select |v_#valid_31| main_~a~0.base) (_ bv1 1)))) [2018-11-23 11:10:27,696 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset))) [2018-11-23 11:10:27,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 27 treesize of output 22 [2018-11-23 11:10:27,810 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:27,815 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 22 treesize of output 14 [2018-11-23 11:10:27,817 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:27,825 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:27,836 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:27,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-11-23 11:10:27,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-23 11:10:27,947 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 19 treesize of output 22 [2018-11-23 11:10:27,956 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:10:27,964 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 22 treesize of output 14 [2018-11-23 11:10:27,973 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:27,982 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:27,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:28,012 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:28,013 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2018-11-23 11:10:28,043 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:28,043 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_43|, v_main_~p~0.base_18, v_main_~p~0.offset_18]. (and (= main_~p~0.offset (_ bv0 32)) (not (= v_main_~p~0.base_18 main_~p~0.base)) (= (store |v_#memory_int_43| v_main_~p~0.base_18 (let ((.cse0 (bvadd v_main_~p~0.offset_18 (_ bv4 32)))) (store (store (select |v_#memory_int_43| v_main_~p~0.base_18) v_main_~p~0.offset_18 (_ bv1 32)) .cse0 (select (select |#memory_int| v_main_~p~0.base_18) .cse0)))) |#memory_int|) (= (_ bv1 32) (select (select |v_#memory_int_43| main_~p~0.base) (_ bv0 32)))) [2018-11-23 11:10:28,044 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_18, v_main_~p~0.offset_18]. (and (= main_~p~0.offset (_ bv0 32)) (not (= v_main_~p~0.base_18 main_~p~0.base)) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18)) (= (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv1 32))) [2018-11-23 11:10:28,119 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-23 11:10:28,139 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:10:28,143 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:28,159 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 13 treesize of output 5 [2018-11-23 11:10:28,163 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:28,166 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:28,174 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:28,174 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:28, output treesize:5 [2018-11-23 11:10:28,179 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:28,179 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, v_main_~p~0.base_18, v_main_~p~0.offset_18]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) (_ bv0 32)))) (and (= |main_#t~mem32| .cse0) (not (= v_main_~p~0.base_18 main_~p~0.base)) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18)) (= (bvadd .cse0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-23 11:10:28,179 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= (bvadd |main_#t~mem32| (_ bv4294967295 32)) (_ bv0 32)) [2018-11-23 11:10:28,198 INFO L256 TraceCheckUtils]: 0: Hoare triple {669#true} call ULTIMATE.init(); {669#true} is VALID [2018-11-23 11:10:28,199 INFO L273 TraceCheckUtils]: 1: Hoare triple {669#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {669#true} is VALID [2018-11-23 11:10:28,199 INFO L273 TraceCheckUtils]: 2: Hoare triple {669#true} assume true; {669#true} is VALID [2018-11-23 11:10:28,200 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {669#true} {669#true} #145#return; {669#true} is VALID [2018-11-23 11:10:28,200 INFO L256 TraceCheckUtils]: 4: Hoare triple {669#true} call #t~ret36 := main(); {669#true} is VALID [2018-11-23 11:10:28,203 INFO L273 TraceCheckUtils]: 5: Hoare triple {669#true} call #t~malloc28.base, #t~malloc28.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc28.base, #t~malloc28.offset; {689#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:10:28,204 INFO L273 TraceCheckUtils]: 6: Hoare triple {689#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {689#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:10:28,205 INFO L273 TraceCheckUtils]: 7: Hoare triple {689#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {696#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:10:28,208 INFO L273 TraceCheckUtils]: 8: Hoare triple {696#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0bv32 != #t~nondet29);havoc #t~nondet29;call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc30.base, #t~malloc30.offset; {700#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:10:28,209 INFO L273 TraceCheckUtils]: 9: Hoare triple {700#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {700#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:10:28,212 INFO L273 TraceCheckUtils]: 10: Hoare triple {700#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem31.base, #t~mem31.offset;havoc #t~mem31.base, #t~mem31.offset; {707#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:10:28,214 INFO L273 TraceCheckUtils]: 11: Hoare triple {707#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0bv32 != #t~nondet29);havoc #t~nondet29; {707#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 11:10:28,219 INFO L273 TraceCheckUtils]: 12: Hoare triple {707#(and (not (= main_~p~0.base main_~a~0.base)) (= main_~a~0.offset (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {714#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_main_~p~0.base_18 (_ BitVec 32)) (v_main_~p~0.offset_18 (_ BitVec 32))) (and (not (= v_main_~p~0.base_18 main_~p~0.base)) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18)))))} is VALID [2018-11-23 11:10:28,220 INFO L273 TraceCheckUtils]: 13: Hoare triple {714#(and (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) (_ bv0 32)) (_ bv4294967295 32)) (_ bv0 32)) (exists ((v_main_~p~0.base_18 (_ BitVec 32)) (v_main_~p~0.offset_18 (_ BitVec 32))) (and (not (= v_main_~p~0.base_18 main_~p~0.base)) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_18) v_main_~p~0.offset_18)))))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem32 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {718#(= (bvadd |main_#t~mem32| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:10:28,221 INFO L273 TraceCheckUtils]: 14: Hoare triple {718#(= (bvadd |main_#t~mem32| (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != #t~mem32;havoc #t~mem32; {670#false} is VALID [2018-11-23 11:10:28,221 INFO L273 TraceCheckUtils]: 15: Hoare triple {670#false} assume !false; {670#false} is VALID [2018-11-23 11:10:28,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:10:28,223 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:10:28,306 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:28,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:28,323 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:28,323 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:22 [2018-11-23 11:10:28,437 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:28,438 WARN L384 uantifierElimination]: Input elimination task: ∀ [main_~p~0.offset, |v_#memory_int_44|]. (or (not (= |v_#memory_int_44| (store |#memory_int| main_~p~0.base (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32)))) (store (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv1 32)) .cse0 (select (select |v_#memory_int_44| main_~p~0.base) .cse0)))))) (= (_ bv1 32) (select (select |v_#memory_int_44| main_~a~0.base) main_~a~0.offset))) [2018-11-23 11:10:28,438 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [main_~p~0.offset, v_DerPreprocessor_2]. (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv1 32)) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)) [2018-11-23 11:10:29,469 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:29,493 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:29,512 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:29,552 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:29,580 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:29,602 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:10:29,702 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 7 dim-0 vars, and 3 xjuncts. [2018-11-23 11:10:29,702 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:43, output treesize:97 [2018-11-23 11:10:29,717 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:29,717 WARN L384 uantifierElimination]: Input elimination task: ∀ [|v_#memory_int_45|, v_subst_1, v_DerPreprocessor_2]. (or (not (= (store |#memory_int| main_~p~0.base (let ((.cse0 (bvadd main_~p~0.offset (_ bv4 32)))) (store (select |#memory_int| main_~p~0.base) .cse0 (select (select |v_#memory_int_45| main_~p~0.base) .cse0)))) |v_#memory_int_45|)) (= (bvadd (select (select (store |v_#memory_int_45| main_~t~0.base (store (store (select |v_#memory_int_45| main_~t~0.base) v_subst_1 (_ bv1 32)) (bvadd v_subst_1 (_ bv4 32)) v_DerPreprocessor_2)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 11:10:29,718 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_DerPreprocessor_8, v_prenex_1, v_prenex_2, v_DerPreprocessor_4, v_DerPreprocessor_6, v_subst_1, v_DerPreprocessor_2]. (let ((.cse2 (= main_~t~0.base main_~a~0.base)) (.cse0 (select |#memory_int| main_~p~0.base)) (.cse1 (bvadd main_~p~0.offset (_ bv4 32)))) (and (or (= (_ bv1 32) (select (select (store |#memory_int| main_~p~0.base (store .cse0 .cse1 v_DerPreprocessor_4)) main_~a~0.base) main_~a~0.offset)) .cse2) (let ((.cse3 (store |#memory_int| main_~p~0.base (store .cse0 .cse1 v_DerPreprocessor_8)))) (or (= (bvadd (select (select .cse3 main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv1 32) (select (store (store (select .cse3 main_~t~0.base) v_prenex_1 (_ bv1 32)) (bvadd v_prenex_1 (_ bv4 32)) v_prenex_2) main_~a~0.offset)))) (or (not .cse2) (= (_ bv1 32) (select (store (store (select (store |#memory_int| main_~p~0.base (store .cse0 .cse1 v_DerPreprocessor_6)) main_~t~0.base) v_subst_1 (_ bv1 32)) (bvadd v_subst_1 (_ bv4 32)) v_DerPreprocessor_2) main_~a~0.offset))))) [2018-11-23 11:10:29,938 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 32 [2018-11-23 11:10:30,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 91 [2018-11-23 11:10:30,968 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:30,970 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:30,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 61 treesize of output 70 [2018-11-23 11:10:31,198 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-11-23 11:10:31,209 INFO L478 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 14 treesize of output 9 [2018-11-23 11:10:31,211 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:31,292 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 13 treesize of output 6 [2018-11-23 11:10:31,294 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:31,302 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-11-23 11:10:31,304 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:31,357 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:10:33,136 INFO L267 ElimStorePlain]: Start of recursive call 2: 13 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:10:33,263 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 63 [2018-11-23 11:10:33,304 INFO L478 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 53 treesize of output 51 [2018-11-23 11:10:33,308 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:33,484 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 46 treesize of output 49 [2018-11-23 11:10:33,572 INFO L478 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-11-23 11:10:33,574 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:33,581 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 13 treesize of output 6 [2018-11-23 11:10:33,582 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:33,639 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:33,859 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 39 treesize of output 42 [2018-11-23 11:10:34,030 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 13 treesize of output 6 [2018-11-23 11:10:34,040 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:34,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 14 treesize of output 9 [2018-11-23 11:10:34,094 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:34,156 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:34,166 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 39 treesize of output 42 [2018-11-23 11:10:34,259 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 7 [2018-11-23 11:10:34,261 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:34,287 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 15 treesize of output 6 [2018-11-23 11:10:34,289 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:34,340 INFO L267 ElimStorePlain]: Start of recursive call 15: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:34,706 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 48 treesize of output 51 [2018-11-23 11:10:34,832 INFO L478 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-11-23 11:10:34,834 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:34,874 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 13 treesize of output 6 [2018-11-23 11:10:34,876 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:34,952 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:35,440 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 50 treesize of output 53 [2018-11-23 11:10:35,529 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 15 treesize of output 6 [2018-11-23 11:10:35,530 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:35,537 INFO L478 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 14 treesize of output 7 [2018-11-23 11:10:35,539 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:35,596 INFO L267 ElimStorePlain]: Start of recursive call 21: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:36,021 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:36,022 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 49 [2018-11-23 11:10:36,149 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2018-11-23 11:10:36,206 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2018-11-23 11:10:36,238 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:36,298 INFO L267 ElimStorePlain]: Start of recursive call 24: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:36,321 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:36,323 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 49 [2018-11-23 11:10:36,465 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 34 [2018-11-23 11:10:36,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 12 treesize of output 7 [2018-11-23 11:10:36,495 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:36,540 INFO L267 ElimStorePlain]: Start of recursive call 26: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:36,838 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:36,838 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:36,843 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 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 43 treesize of output 55 [2018-11-23 11:10:37,021 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-11-23 11:10:37,048 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 13 treesize of output 6 [2018-11-23 11:10:37,049 INFO L267 ElimStorePlain]: Start of recursive call 29: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:37,056 INFO L478 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-11-23 11:10:37,060 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:37,170 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-11-23 11:10:37,172 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:37,224 INFO L267 ElimStorePlain]: Start of recursive call 28: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:10:37,499 INFO L267 ElimStorePlain]: Start of recursive call 7: 8 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:10:37,528 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 43 [2018-11-23 11:10:37,545 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 38 treesize of output 41 [2018-11-23 11:10:37,626 INFO L478 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-11-23 11:10:37,628 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:37,656 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 13 treesize of output 6 [2018-11-23 11:10:37,657 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:37,707 INFO L267 ElimStorePlain]: Start of recursive call 33: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:37,864 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:37,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 41 [2018-11-23 11:10:38,125 INFO L478 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 14 treesize of output 9 [2018-11-23 11:10:38,130 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:38,164 INFO L267 ElimStorePlain]: Start of recursive call 36: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:38,275 INFO L267 ElimStorePlain]: Start of recursive call 32: 3 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:38,304 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 72 [2018-11-23 11:10:38,315 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 67 treesize of output 67 [2018-11-23 11:10:38,453 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 42 [2018-11-23 11:10:38,461 INFO L478 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 14 treesize of output 9 [2018-11-23 11:10:38,463 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:38,469 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 13 treesize of output 6 [2018-11-23 11:10:38,470 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:38,518 INFO L267 ElimStorePlain]: Start of recursive call 39: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:38,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 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 39 treesize of output 45 [2018-11-23 11:10:38,749 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 15 treesize of output 6 [2018-11-23 11:10:38,752 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:38,761 INFO L478 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 16 treesize of output 9 [2018-11-23 11:10:38,763 INFO L267 ElimStorePlain]: Start of recursive call 44: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:38,857 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 13 treesize of output 6 [2018-11-23 11:10:38,860 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:38,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 7 [2018-11-23 11:10:38,869 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:38,927 INFO L267 ElimStorePlain]: Start of recursive call 42: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:10:39,234 INFO L267 ElimStorePlain]: Start of recursive call 38: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:10:39,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-11-23 11:10:39,255 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 15 treesize of output 19 [2018-11-23 11:10:39,303 INFO L478 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 16 treesize of output 9 [2018-11-23 11:10:39,306 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:39,312 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 15 treesize of output 6 [2018-11-23 11:10:39,313 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:39,344 INFO L267 ElimStorePlain]: Start of recursive call 48: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:39,403 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 15 treesize of output 19 [2018-11-23 11:10:39,460 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 13 treesize of output 6 [2018-11-23 11:10:39,463 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:39,512 INFO L478 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 14 treesize of output 9 [2018-11-23 11:10:39,551 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:39,744 INFO L267 ElimStorePlain]: Start of recursive call 51: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:39,926 INFO L267 ElimStorePlain]: Start of recursive call 47: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:10:39,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2018-11-23 11:10:39,945 INFO L478 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 7 treesize of output 5 [2018-11-23 11:10:39,948 INFO L267 ElimStorePlain]: Start of recursive call 55: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:39,973 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 23 treesize of output 27 [2018-11-23 11:10:39,988 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:39,992 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 35 [2018-11-23 11:10:40,006 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:40,194 INFO L478 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 2 case distinctions, treesize of input 30 treesize of output 45 [2018-11-23 11:10:40,348 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:40,367 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 29 [2018-11-23 11:10:40,373 INFO L267 ElimStorePlain]: Start of recursive call 59: End of recursive call: and 2 xjuncts. [2018-11-23 11:10:40,475 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:40,513 INFO L478 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 42 [2018-11-23 11:10:40,525 INFO L267 ElimStorePlain]: Start of recursive call 60: End of recursive call: and 4 xjuncts. [2018-11-23 11:10:40,542 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:40,588 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 42 [2018-11-23 11:10:40,594 INFO L267 ElimStorePlain]: Start of recursive call 61: End of recursive call: and 4 xjuncts. [2018-11-23 11:10:40,892 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:40,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 24 [2018-11-23 11:10:40,897 INFO L267 ElimStorePlain]: Start of recursive call 62: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:40,925 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 12 [2018-11-23 11:10:40,930 INFO L267 ElimStorePlain]: Start of recursive call 63: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:41,158 INFO L267 ElimStorePlain]: Start of recursive call 58: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:10:41,256 INFO L267 ElimStorePlain]: Start of recursive call 57: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:10:41,318 INFO L267 ElimStorePlain]: Start of recursive call 56: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:10:41,411 INFO L267 ElimStorePlain]: Start of recursive call 54: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:10:41,465 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 71 [2018-11-23 11:10:41,484 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:41,485 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 62 [2018-11-23 11:10:41,630 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 36 [2018-11-23 11:10:41,642 INFO L478 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 14 treesize of output 9 [2018-11-23 11:10:41,644 INFO L267 ElimStorePlain]: Start of recursive call 66: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:41,674 INFO L267 ElimStorePlain]: Start of recursive call 65: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:10:41,833 INFO L478 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 58 treesize of output 56 [2018-11-23 11:10:41,839 INFO L267 ElimStorePlain]: Start of recursive call 67: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:41,983 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 34 treesize of output 37 [2018-11-23 11:10:41,992 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:41,995 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2018-11-23 11:10:42,003 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:42,082 INFO L478 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 2 case distinctions, treesize of input 28 treesize of output 43 [2018-11-23 11:10:42,220 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:42,246 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2018-11-23 11:10:42,263 INFO L267 ElimStorePlain]: Start of recursive call 71: End of recursive call: and 2 xjuncts. [2018-11-23 11:10:42,276 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:42,319 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 40 [2018-11-23 11:10:42,326 INFO L267 ElimStorePlain]: Start of recursive call 72: End of recursive call: and 4 xjuncts. [2018-11-23 11:10:42,361 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:42,403 INFO L478 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 42 [2018-11-23 11:10:42,416 INFO L267 ElimStorePlain]: Start of recursive call 73: End of recursive call: and 4 xjuncts. [2018-11-23 11:10:42,719 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:42,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 31 treesize of output 24 [2018-11-23 11:10:42,723 INFO L267 ElimStorePlain]: Start of recursive call 74: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:42,745 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2018-11-23 11:10:42,750 INFO L267 ElimStorePlain]: Start of recursive call 75: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:42,878 INFO L267 ElimStorePlain]: Start of recursive call 70: 2 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:10:42,977 INFO L267 ElimStorePlain]: Start of recursive call 69: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:10:43,069 INFO L267 ElimStorePlain]: Start of recursive call 68: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:10:43,452 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 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 48 treesize of output 54 [2018-11-23 11:10:43,622 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2018-11-23 11:10:43,629 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:43,634 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 33 [2018-11-23 11:10:43,648 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:43,844 INFO L478 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 2 case distinctions, treesize of input 28 treesize of output 43 [2018-11-23 11:10:44,067 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:44,089 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 27 [2018-11-23 11:10:44,092 INFO L267 ElimStorePlain]: Start of recursive call 79: End of recursive call: and 2 xjuncts. [2018-11-23 11:10:44,129 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:44,173 INFO L478 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 40 [2018-11-23 11:10:44,180 INFO L267 ElimStorePlain]: Start of recursive call 80: End of recursive call: and 3 xjuncts. [2018-11-23 11:10:44,200 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:44,245 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2018-11-23 11:10:44,253 INFO L267 ElimStorePlain]: Start of recursive call 81: End of recursive call: and 3 xjuncts. [2018-11-23 11:10:44,591 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:44,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 33 treesize of output 26 [2018-11-23 11:10:44,596 INFO L267 ElimStorePlain]: Start of recursive call 82: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:44,665 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 10 [2018-11-23 11:10:44,669 INFO L267 ElimStorePlain]: Start of recursive call 83: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:44,776 INFO L267 ElimStorePlain]: Start of recursive call 78: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:10:44,846 INFO L267 ElimStorePlain]: Start of recursive call 77: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:10:44,983 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 13 treesize of output 6 [2018-11-23 11:10:44,986 INFO L267 ElimStorePlain]: Start of recursive call 84: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:44,993 INFO L478 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-11-23 11:10:44,999 INFO L267 ElimStorePlain]: Start of recursive call 85: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:45,089 INFO L267 ElimStorePlain]: Start of recursive call 76: 2 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:10:45,593 INFO L267 ElimStorePlain]: Start of recursive call 64: 8 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 11:10:45,625 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 64 [2018-11-23 11:10:45,639 INFO L478 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 59 treesize of output 57 [2018-11-23 11:10:45,660 INFO L267 ElimStorePlain]: Start of recursive call 87: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:45,814 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:45,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 59 [2018-11-23 11:10:46,004 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:46,171 INFO L478 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 56 [2018-11-23 11:10:46,189 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:46,206 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:46,210 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:46,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 44 treesize of output 59 [2018-11-23 11:10:48,467 WARN L180 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2018-11-23 11:10:48,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2018-11-23 11:10:48,496 INFO L267 ElimStorePlain]: Start of recursive call 91: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:48,537 INFO L267 ElimStorePlain]: Start of recursive call 90: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:48,643 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:48,644 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:48,843 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 3 case distinctions, treesize of input 37 treesize of output 56 [2018-11-23 11:10:49,084 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2018-11-23 11:10:49,119 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:49,162 INFO L478 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 40 [2018-11-23 11:10:49,169 INFO L267 ElimStorePlain]: Start of recursive call 93: End of recursive call: and 3 xjuncts. [2018-11-23 11:10:49,177 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:49,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2018-11-23 11:10:49,231 INFO L267 ElimStorePlain]: Start of recursive call 94: End of recursive call: and 3 xjuncts. [2018-11-23 11:10:49,457 INFO L478 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 25 treesize of output 15 [2018-11-23 11:10:49,459 INFO L267 ElimStorePlain]: Start of recursive call 95: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:49,468 INFO L478 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 23 treesize of output 13 [2018-11-23 11:10:49,470 INFO L267 ElimStorePlain]: Start of recursive call 96: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:49,524 INFO L267 ElimStorePlain]: Start of recursive call 92: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:49,599 INFO L267 ElimStorePlain]: Start of recursive call 89: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:49,670 INFO L267 ElimStorePlain]: Start of recursive call 88: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:10:49,985 INFO L267 ElimStorePlain]: Start of recursive call 86: 3 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:10:49,995 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 57 treesize of output 53 [2018-11-23 11:10:50,004 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 39 treesize of output 39 [2018-11-23 11:10:50,106 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:50,170 INFO L478 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 54 [2018-11-23 11:10:50,193 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:50,208 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:50,217 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:50,219 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 44 treesize of output 61 [2018-11-23 11:10:52,425 WARN L180 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 39 DAG size of output: 32 [2018-11-23 11:10:52,437 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 18 [2018-11-23 11:10:52,439 INFO L267 ElimStorePlain]: Start of recursive call 101: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:52,478 INFO L267 ElimStorePlain]: Start of recursive call 100: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:52,583 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:52,584 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:53,607 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 3 case distinctions, treesize of input 37 treesize of output 58 [2018-11-23 11:10:53,803 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2018-11-23 11:10:53,827 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:53,828 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 26 [2018-11-23 11:10:53,831 INFO L267 ElimStorePlain]: Start of recursive call 103: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:53,876 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:53,878 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 33 treesize of output 26 [2018-11-23 11:10:53,880 INFO L267 ElimStorePlain]: Start of recursive call 104: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:54,055 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:54,111 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 42 [2018-11-23 11:10:54,120 INFO L267 ElimStorePlain]: Start of recursive call 105: End of recursive call: and 4 xjuncts. [2018-11-23 11:10:54,149 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:54,193 INFO L478 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 42 [2018-11-23 11:10:54,201 INFO L267 ElimStorePlain]: Start of recursive call 106: End of recursive call: and 4 xjuncts. [2018-11-23 11:10:54,275 INFO L267 ElimStorePlain]: Start of recursive call 102: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:54,357 INFO L267 ElimStorePlain]: Start of recursive call 99: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:54,362 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:54,362 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:54,364 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 50 [2018-11-23 11:10:54,407 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:54,408 INFO L478 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 39 treesize of output 50 [2018-11-23 11:10:56,757 WARN L180 SmtUtils]: Spent 2.29 s on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2018-11-23 11:10:56,791 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:56,792 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:10:56,793 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 17 [2018-11-23 11:10:56,795 INFO L267 ElimStorePlain]: Start of recursive call 109: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:56,826 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2018-11-23 11:10:56,834 INFO L267 ElimStorePlain]: Start of recursive call 110: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:56,873 INFO L267 ElimStorePlain]: Start of recursive call 108: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:56,911 INFO L267 ElimStorePlain]: Start of recursive call 107: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 11:10:56,981 INFO L267 ElimStorePlain]: Start of recursive call 98: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:10:57,099 INFO L267 ElimStorePlain]: Start of recursive call 97: 1 dim-1 vars, End of recursive call: and 4 xjuncts. [2018-11-23 11:10:57,398 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 5 xjuncts. [2018-11-23 11:10:57,398 INFO L202 ElimStorePlain]: Needed 110 recursive calls to eliminate 5 variables, input treesize:64, output treesize:55 [2018-11-23 11:10:57,419 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:10:57,419 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, v_DerPreprocessor_8, v_main_~t~0.base_7, v_prenex_1, v_prenex_2]. (and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (let ((.cse0 (store |#memory_int| main_~p~0.base (store (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv1 32)) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_8)))) (or (= (_ bv1 32) (select (store (store (select .cse0 v_main_~t~0.base_7) v_prenex_1 (_ bv1 32)) (bvadd v_prenex_1 (_ bv4 32)) v_prenex_2) main_~a~0.offset)) (= (bvadd (select (select .cse0 main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_7)))))) [2018-11-23 11:10:57,419 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_prenex_33, v_prenex_35, v_prenex_34, v_main_~t~0.base_7]. (let ((.cse0 (= main_~a~0.offset main_~p~0.offset)) (.cse1 (= main_~p~0.base main_~a~0.base))) (and (or (= (bvadd main_~p~0.offset (_ bv4 32)) main_~a~0.offset) .cse0 (not (= (_ bv0 1) (select |#valid| v_prenex_33)))) (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or .cse0 (not (= (_ bv0 1) (select |#valid| v_prenex_35)))) (or .cse1 (not (= (_ bv0 1) (select |#valid| v_prenex_34)))) (or .cse1 (= v_main_~t~0.base_7 main_~p~0.base) (not (= (_ bv0 1) (select |#valid| v_main_~t~0.base_7)))))) [2018-11-23 11:10:59,589 INFO L273 TraceCheckUtils]: 15: Hoare triple {670#false} assume !false; {670#false} is VALID [2018-11-23 11:10:59,590 INFO L273 TraceCheckUtils]: 14: Hoare triple {718#(= (bvadd |main_#t~mem32| (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != #t~mem32;havoc #t~mem32; {670#false} is VALID [2018-11-23 11:10:59,591 INFO L273 TraceCheckUtils]: 13: Hoare triple {731#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem32 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {718#(= (bvadd |main_#t~mem32| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:10:59,595 INFO L273 TraceCheckUtils]: 12: Hoare triple {735#(forall ((v_DerPreprocessor_2 (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv1 32)) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {731#(= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:10:59,596 INFO L273 TraceCheckUtils]: 11: Hoare triple {735#(forall ((v_DerPreprocessor_2 (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv1 32)) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume !(0bv32 != #t~nondet29);havoc #t~nondet29; {735#(forall ((v_DerPreprocessor_2 (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv1 32)) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:59,621 INFO L273 TraceCheckUtils]: 10: Hoare triple {742#(and (not (= main_~t~0.base main_~a~0.base)) (forall ((v_prenex_2 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (or (= (_ bv1 32) (select (store (store (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_8)) main_~t~0.base) v_prenex_1 (_ bv1 32)) (bvadd v_prenex_1 (_ bv4 32)) v_prenex_2) main_~a~0.offset)) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_8)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem31.base, #t~mem31.offset;havoc #t~mem31.base, #t~mem31.offset; {735#(forall ((v_DerPreprocessor_2 (_ BitVec 32)) (main_~p~0.offset (_ BitVec 32))) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (store (select |#memory_int| main_~p~0.base) main_~p~0.offset (_ bv1 32)) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_2)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:10:59,622 INFO L273 TraceCheckUtils]: 9: Hoare triple {742#(and (not (= main_~t~0.base main_~a~0.base)) (forall ((v_prenex_2 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (or (= (_ bv1 32) (select (store (store (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_8)) main_~t~0.base) v_prenex_1 (_ bv1 32)) (bvadd v_prenex_1 (_ bv4 32)) v_prenex_2) main_~a~0.offset)) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_8)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {742#(and (not (= main_~t~0.base main_~a~0.base)) (forall ((v_prenex_2 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (or (= (_ bv1 32) (select (store (store (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_8)) main_~t~0.base) v_prenex_1 (_ bv1 32)) (bvadd v_prenex_1 (_ bv4 32)) v_prenex_2) main_~a~0.offset)) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_8)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:10:59,630 INFO L273 TraceCheckUtils]: 8: Hoare triple {749#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_34 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_34))))) (or (forall ((v_prenex_35 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_35)))) (= main_~a~0.offset main_~p~0.offset)))} assume !!(0bv32 != #t~nondet29);havoc #t~nondet29;call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc30.base, #t~malloc30.offset; {742#(and (not (= main_~t~0.base main_~a~0.base)) (forall ((v_prenex_2 (_ BitVec 32)) (v_DerPreprocessor_8 (_ BitVec 32)) (v_prenex_1 (_ BitVec 32))) (or (= (_ bv1 32) (select (store (store (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_8)) main_~t~0.base) v_prenex_1 (_ bv1 32)) (bvadd v_prenex_1 (_ bv4 32)) v_prenex_2) main_~a~0.offset)) (= (bvadd (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) (bvadd main_~p~0.offset (_ bv4 32)) v_DerPreprocessor_8)) main_~a~0.base) main_~a~0.offset) (_ bv4294967295 32)) (_ bv0 32)))))} is VALID [2018-11-23 11:10:59,631 INFO L273 TraceCheckUtils]: 7: Hoare triple {753#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {749#(and (not (= (select |#valid| main_~a~0.base) (_ bv0 1))) (or (= main_~p~0.base main_~a~0.base) (forall ((v_prenex_34 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_34))))) (or (forall ((v_prenex_35 (_ BitVec 32))) (not (= (_ bv0 1) (select |#valid| v_prenex_35)))) (= main_~a~0.offset main_~p~0.offset)))} is VALID [2018-11-23 11:10:59,632 INFO L273 TraceCheckUtils]: 6: Hoare triple {753#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {753#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:10:59,633 INFO L273 TraceCheckUtils]: 5: Hoare triple {669#true} call #t~malloc28.base, #t~malloc28.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc28.base, #t~malloc28.offset; {753#(not (= (select |#valid| main_~a~0.base) (_ bv0 1)))} is VALID [2018-11-23 11:10:59,633 INFO L256 TraceCheckUtils]: 4: Hoare triple {669#true} call #t~ret36 := main(); {669#true} is VALID [2018-11-23 11:10:59,633 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {669#true} {669#true} #145#return; {669#true} is VALID [2018-11-23 11:10:59,634 INFO L273 TraceCheckUtils]: 2: Hoare triple {669#true} assume true; {669#true} is VALID [2018-11-23 11:10:59,634 INFO L273 TraceCheckUtils]: 1: Hoare triple {669#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {669#true} is VALID [2018-11-23 11:10:59,634 INFO L256 TraceCheckUtils]: 0: Hoare triple {669#true} call ULTIMATE.init(); {669#true} is VALID [2018-11-23 11:10:59,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:10:59,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:10:59,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-23 11:10:59,638 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-11-23 11:10:59,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:10:59,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:10:59,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:10:59,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:10:59,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:10:59,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=123, Unknown=1, NotChecked=0, Total=156 [2018-11-23 11:10:59,699 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 13 states. [2018-11-23 11:11:01,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:01,340 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-11-23 11:11:01,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:11:01,340 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 16 [2018-11-23 11:11:01,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:11:01,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:11:01,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2018-11-23 11:11:01,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:11:01,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 26 transitions. [2018-11-23 11:11:01,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 26 transitions. [2018-11-23 11:11:01,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:11:01,399 INFO L225 Difference]: With dead ends: 25 [2018-11-23 11:11:01,400 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 11:11:01,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=81, Invalid=224, Unknown=1, NotChecked=0, Total=306 [2018-11-23 11:11:01,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 11:11:01,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-11-23 11:11:01,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:11:01,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 20 states. [2018-11-23 11:11:01,432 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 20 states. [2018-11-23 11:11:01,432 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 20 states. [2018-11-23 11:11:01,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:01,433 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-23 11:11:01,433 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 11:11:01,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:01,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:01,434 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 23 states. [2018-11-23 11:11:01,434 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 23 states. [2018-11-23 11:11:01,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:11:01,435 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2018-11-23 11:11:01,436 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 11:11:01,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:11:01,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:11:01,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:11:01,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:11:01,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:11:01,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 11:11:01,438 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2018-11-23 11:11:01,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:11:01,438 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 11:11:01,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:11:01,438 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 11:11:01,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:11:01,439 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:11:01,439 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:11:01,439 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:11:01,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:11:01,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1049476048, now seen corresponding path program 1 times [2018-11-23 11:11:01,440 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:11:01,440 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 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 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:11:01,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:11:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:11:01,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:11:01,551 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 6 treesize of output 5 [2018-11-23 11:11:01,553 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:01,560 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:01,561 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 11:11:01,564 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:01,564 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_37|]. (and (= main_~a~0.offset (_ bv0 32)) (= |#valid| (store |v_#valid_37| main_~a~0.base (_ bv1 1)))) [2018-11-23 11:11:01,565 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= main_~a~0.offset (_ bv0 32)) (= (select |#valid| main_~a~0.base) (_ bv1 1))) [2018-11-23 11:11:01,619 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:01,620 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:01,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 4 [2018-11-23 11:11:01,624 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:01,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:01,638 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:17 [2018-11-23 11:11:01,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 10 [2018-11-23 11:11:01,916 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 10 treesize of output 9 [2018-11-23 11:11:01,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:01,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:02,188 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 13 treesize of output 10 [2018-11-23 11:11:02,192 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2018-11-23 11:11:02,194 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:02,197 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:02,221 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:11:02,222 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:52, output treesize:41 [2018-11-23 11:11:02,304 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:02,304 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_46|, main_~t~0.base, |v_#memory_$Pointer$.offset_45|]. (let ((.cse0 (bvadd main_~a~0.offset (_ bv4 32)))) (and (= main_~a~0.offset (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse0) main_~p~0.base) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse0)) (= (store |v_#memory_$Pointer$.offset_45| main_~a~0.base (store (select |v_#memory_$Pointer$.offset_45| main_~a~0.base) .cse0 (_ bv0 32))) |#memory_$Pointer$.offset|) (not (= main_~t~0.base main_~a~0.base)) (= (store |v_#memory_$Pointer$.base_46| main_~a~0.base (store (select |v_#memory_$Pointer$.base_46| main_~a~0.base) .cse0 main_~t~0.base)) |#memory_$Pointer$.base|))) [2018-11-23 11:11:02,304 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse2 (bvadd main_~a~0.offset (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~a~0.base) .cse2)) (.cse1 (select (select |#memory_$Pointer$.offset| main_~a~0.base) .cse2))) (and (= main_~a~0.offset (_ bv0 32)) (not (= .cse0 main_~a~0.base)) (= .cse0 main_~p~0.base) (= (_ bv0 32) .cse1) (= main_~p~0.offset .cse1)))) [2018-11-23 11:11:02,483 INFO L303 Elim1Store]: Index analysis took 115 ms [2018-11-23 11:11:02,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 175 [2018-11-23 11:11:02,502 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 28 treesize of output 1 [2018-11-23 11:11:02,503 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:02,673 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:02,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 46 treesize of output 39 [2018-11-23 11:11:02,981 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 39 treesize of output 42 [2018-11-23 11:11:02,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:11:03,005 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 42 treesize of output 30 [2018-11-23 11:11:03,007 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:03,034 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:03,046 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:03,172 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 109 [2018-11-23 11:11:03,181 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 18 treesize of output 17 [2018-11-23 11:11:03,183 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:03,228 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:03,315 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 101 treesize of output 97 [2018-11-23 11:11:03,329 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 28 treesize of output 1 [2018-11-23 11:11:03,330 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:03,353 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:03,396 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2018-11-23 11:11:03,403 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 18 treesize of output 17 [2018-11-23 11:11:03,405 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:03,420 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:03,443 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:03,444 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:185, output treesize:68 [2018-11-23 11:11:05,450 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:05,450 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_47|, |v_#memory_$Pointer$.offset_44|, |v_#memory_$Pointer$.offset_46|, |v_#memory_int_47|, |v_#memory_$Pointer$.base_45|]. (let ((.cse0 (select (select |v_#memory_$Pointer$.base_47| main_~p~0.base) (_ bv4 32))) (.cse3 (select (select |v_#memory_$Pointer$.offset_46| main_~p~0.base) (_ bv4 32)))) (let ((.cse2 (bvadd .cse3 (_ bv4 32))) (.cse4 (select |v_#memory_$Pointer$.base_45| .cse0)) (.cse1 (select |v_#memory_$Pointer$.offset_44| .cse0))) (and (= main_~p~0.offset (_ bv0 32)) (= (store |v_#memory_$Pointer$.offset_44| .cse0 (store .cse1 .cse2 (_ bv0 32))) |#memory_$Pointer$.offset|) (= (store |v_#memory_int_47| .cse0 (store (store (select |v_#memory_int_47| .cse0) .cse3 (_ bv1 32)) .cse2 (select (select |#memory_int| .cse0) .cse2))) |#memory_int|) (= (store |v_#memory_$Pointer$.base_45| .cse0 (store .cse4 .cse2 (_ bv0 32))) |#memory_$Pointer$.base|) (= (store |v_#memory_$Pointer$.base_47| .cse0 (store (select |v_#memory_$Pointer$.base_47| .cse0) .cse3 (select .cse4 .cse3))) |v_#memory_$Pointer$.base_45|) (= |v_#memory_$Pointer$.offset_44| (store |v_#memory_$Pointer$.offset_46| .cse0 (store (select |v_#memory_$Pointer$.offset_46| .cse0) .cse3 (select .cse1 .cse3)))) (= (_ bv0 32) .cse3) (not (= .cse0 main_~p~0.base))))) [2018-11-23 11:11:05,451 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse2 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (.cse1 (bvadd .cse2 (_ bv4 32)))) (and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse0) .cse1)) (= main_~p~0.offset (_ bv0 32)) (= .cse2 (_ bv0 32)) (= (select (select |#memory_int| .cse0) .cse2) (_ bv1 32)) (not (= .cse0 main_~p~0.base)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| .cse0) .cse1))))) [2018-11-23 11:11:05,728 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2018-11-23 11:11:05,735 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 9 treesize of output 1 [2018-11-23 11:11:05,740 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:05,760 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 41 treesize of output 30 [2018-11-23 11:11:05,762 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:05,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:05,808 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 30 [2018-11-23 11:11:05,820 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 7 treesize of output 1 [2018-11-23 11:11:05,821 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:05,837 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 14 [2018-11-23 11:11:05,838 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:05,845 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:05,864 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:11:05,865 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:88, output treesize:24 [2018-11-23 11:11:05,872 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:05,873 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_24, |#memory_$Pointer$.offset|]. (let ((.cse2 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_24) (_ bv4 32)))) (let ((.cse0 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_24) (_ bv4 32))) (.cse1 (bvadd .cse2 (_ bv4 32)))) (and (= .cse0 main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| .cse0) .cse1)) (= (_ bv0 32) .cse2) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_24) (_ bv0 32))) (not (= v_main_~p~0.base_24 .cse0)) (= (_ bv0 32) (bvadd (select (select |#memory_int| .cse0) .cse2) (_ bv4294967295 32))) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| .cse0) .cse1)) (= main_~p~0.offset .cse2)))) [2018-11-23 11:11:05,873 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_24]. (and (= main_~p~0.offset (_ bv0 32)) (not (= v_main_~p~0.base_24 main_~p~0.base)) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_24) (_ bv0 32))) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 11:11:05,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-23 11:11:05,948 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 11 treesize of output 3 [2018-11-23 11:11:05,949 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:05,956 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:05,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:05,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:26, output treesize:3 [2018-11-23 11:11:05,965 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:11:05,965 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~p~0.base, v_main_~p~0.base_24]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) (_ bv0 32)))) (and (= |main_#t~mem32| .cse0) (not (= v_main_~p~0.base_24 main_~p~0.base)) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_24) (_ bv0 32))) (= (_ bv1 32) .cse0))) [2018-11-23 11:11:05,965 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem32| (_ bv1 32)) [2018-11-23 11:11:05,987 INFO L256 TraceCheckUtils]: 0: Hoare triple {894#true} call ULTIMATE.init(); {894#true} is VALID [2018-11-23 11:11:05,988 INFO L273 TraceCheckUtils]: 1: Hoare triple {894#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {894#true} is VALID [2018-11-23 11:11:05,988 INFO L273 TraceCheckUtils]: 2: Hoare triple {894#true} assume true; {894#true} is VALID [2018-11-23 11:11:05,989 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {894#true} {894#true} #145#return; {894#true} is VALID [2018-11-23 11:11:05,989 INFO L256 TraceCheckUtils]: 4: Hoare triple {894#true} call #t~ret36 := main(); {894#true} is VALID [2018-11-23 11:11:05,990 INFO L273 TraceCheckUtils]: 5: Hoare triple {894#true} call #t~malloc28.base, #t~malloc28.offset := #Ultimate.alloc(8bv32);~a~0.base, ~a~0.offset := #t~malloc28.base, #t~malloc28.offset; {914#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:11:05,991 INFO L273 TraceCheckUtils]: 6: Hoare triple {914#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} assume !(~a~0.base == 0bv32 && ~a~0.offset == 0bv32); {914#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} is VALID [2018-11-23 11:11:05,991 INFO L273 TraceCheckUtils]: 7: Hoare triple {914#(and (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {921#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 11:11:05,993 INFO L273 TraceCheckUtils]: 8: Hoare triple {921#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= (bvadd (select |#valid| main_~a~0.base) (_ bv1 1)) (_ bv0 1)) (= main_~a~0.offset main_~p~0.offset))} assume !!(0bv32 != #t~nondet29);havoc #t~nondet29;call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8bv32);~t~0.base, ~t~0.offset := #t~malloc30.base, #t~malloc30.offset; {925#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:11:05,994 INFO L273 TraceCheckUtils]: 9: Hoare triple {925#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} assume !(~t~0.base == 0bv32 && ~t~0.offset == 0bv32); {925#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} is VALID [2018-11-23 11:11:05,996 INFO L273 TraceCheckUtils]: 10: Hoare triple {925#(and (= main_~p~0.base main_~a~0.base) (= main_~a~0.offset (_ bv0 32)) (= main_~t~0.offset (_ bv0 32)) (= main_~a~0.offset main_~p~0.offset) (not (= main_~t~0.base main_~a~0.base)))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);call #t~mem31.base, #t~mem31.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem31.base, #t~mem31.offset;havoc #t~mem31.base, #t~mem31.offset; {932#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:11:05,997 INFO L273 TraceCheckUtils]: 11: Hoare triple {932#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} assume !(0bv32 != #t~nondet29);havoc #t~nondet29; {932#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} is VALID [2018-11-23 11:11:06,002 INFO L273 TraceCheckUtils]: 12: Hoare triple {932#(and (= main_~a~0.offset (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~a~0.base)) (= (select (select |#memory_$Pointer$.base| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32))) main_~p~0.base) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))) (= main_~p~0.offset (select (select |#memory_$Pointer$.offset| main_~a~0.base) (bvadd main_~a~0.offset (_ bv4 32)))))} call write~intINTTYPE4(1bv32, ~p~0.base, ~p~0.offset, 4bv32);call write~$Pointer$(0bv32, 0bv32, ~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {939#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:11:06,002 INFO L273 TraceCheckUtils]: 13: Hoare triple {939#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem32 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {943#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem32|) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:11:06,003 INFO L273 TraceCheckUtils]: 14: Hoare triple {943#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) |main_#t~mem32|) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} assume !(1bv32 != #t~mem32);havoc #t~mem32; {947#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} is VALID [2018-11-23 11:11:06,010 INFO L273 TraceCheckUtils]: 15: Hoare triple {947#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (= main_~p~0.offset (_ bv0 32)) (= (bvadd (select (select |#memory_int| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32))) (bvadd (select (select |#memory_$Pointer$.offset| main_~p~0.base) (_ bv4 32)) (_ bv4 32)))) (not (= (select (select |#memory_$Pointer$.base| main_~p~0.base) (_ bv4 32)) main_~p~0.base)))} call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~bvadd32(4bv32, ~p~0.offset), 4bv32);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {951#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_24 (_ BitVec 32))) (and (not (= v_main_~p~0.base_24 main_~p~0.base)) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_24) (_ bv0 32))))) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:11:06,011 INFO L273 TraceCheckUtils]: 16: Hoare triple {951#(and (= main_~p~0.offset (_ bv0 32)) (exists ((v_main_~p~0.base_24 (_ BitVec 32))) (and (not (= v_main_~p~0.base_24 main_~p~0.base)) (= (_ bv1 32) (select (select |#memory_int| v_main_~p~0.base_24) (_ bv0 32))))) (= (bvadd (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) (_ bv4294967295 32)) (_ bv0 32)))} assume !!(~p~0.base != 0bv32 || ~p~0.offset != 0bv32);call #t~mem32 := read~intINTTYPE4(~p~0.base, ~p~0.offset, 4bv32); {955#(= (bvadd |main_#t~mem32| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:11:06,012 INFO L273 TraceCheckUtils]: 17: Hoare triple {955#(= (bvadd |main_#t~mem32| (_ bv4294967295 32)) (_ bv0 32))} assume 1bv32 != #t~mem32;havoc #t~mem32; {895#false} is VALID [2018-11-23 11:11:06,012 INFO L273 TraceCheckUtils]: 18: Hoare triple {895#false} assume !false; {895#false} is VALID [2018-11-23 11:11:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:11:06,014 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:11:09,289 WARN L180 SmtUtils]: Spent 490.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2018-11-23 11:11:09,305 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:09,322 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:09,329 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:09,400 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:09,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 23 treesize of output 20 [2018-11-23 11:11:09,591 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 20 treesize of output 24 [2018-11-23 11:11:09,601 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:11:09,611 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 24 treesize of output 14 [2018-11-23 11:11:09,613 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:09,633 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:09,643 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:09,768 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:09,778 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:11:09,785 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:09,796 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:11:10,076 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 61 treesize of output 129 [2018-11-23 11:11:10,077 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-11-23 11:11:10,764 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 64 treesize of output 58 [2018-11-23 11:11:10,771 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:11:32,171 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 91 [2018-11-23 11:11:32,177 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 2 xjuncts. [2018-11-23 11:11:55,425 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 74 [2018-11-23 11:11:55,431 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-11-23 11:12:32,861 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 76 [2018-11-23 11:12:32,868 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 2 xjuncts. [2018-11-23 11:12:48,335 INFO L478 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 96 treesize of output 80 [2018-11-23 11:12:48,337 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:04,118 INFO L478 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 95 treesize of output 79 [2018-11-23 11:13:04,158 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 11:13:19,724 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 77 treesize of output 71 [2018-11-23 11:13:19,726 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts.