java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/ldv-regression/test27_true-unreach-call_true-termination.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:07:55,210 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:07:55,212 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:07:55,224 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:07:55,225 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:07:55,226 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:07:55,227 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:07:55,229 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:07:55,232 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:07:55,234 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:07:55,235 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:07:55,235 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:07:55,236 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:07:55,237 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:07:55,238 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:07:55,239 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:07:55,240 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:07:55,242 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:07:55,244 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:07:55,246 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:07:55,247 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:07:55,248 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:07:55,251 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:07:55,251 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:07:55,251 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:07:55,252 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:07:55,253 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:07:55,254 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:07:55,255 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:07:55,256 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:07:55,256 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:07:55,257 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:07:55,257 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:07:55,257 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:07:55,258 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:07:55,259 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:07:55,259 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:07:55,291 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:07:55,291 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:07:55,294 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:07:55,295 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:07:55,295 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:07:55,295 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:07:55,299 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:07:55,300 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:07:55,300 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:07:55,300 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:07:55,300 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:07:55,301 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:07:55,301 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:07:55,301 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:07:55,301 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:07:55,302 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:07:55,302 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:07:55,302 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:07:55,302 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:07:55,302 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:07:55,303 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:07:55,303 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:07:55,303 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:07:55,303 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:07:55,304 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:07:55,305 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:07:55,305 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:07:55,305 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:07:55,306 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:07:55,306 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:07:55,306 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:07:55,306 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:07:55,306 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:07:55,374 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:07:55,392 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:07:55,396 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:07:55,398 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:07:55,398 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:07:55,399 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test27_true-unreach-call_true-termination.c [2018-11-23 11:07:55,466 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68f7c44e/e54a90ba90794be9b7edc0748b885936/FLAG2425f8852 [2018-11-23 11:07:55,923 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:07:55,924 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test27_true-unreach-call_true-termination.c [2018-11-23 11:07:55,931 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68f7c44e/e54a90ba90794be9b7edc0748b885936/FLAG2425f8852 [2018-11-23 11:07:56,302 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d68f7c44e/e54a90ba90794be9b7edc0748b885936 [2018-11-23 11:07:56,312 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:07:56,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:07:56,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:07:56,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:07:56,318 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:07:56,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:07:56" (1/1) ... [2018-11-23 11:07:56,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fa72238 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:56, skipping insertion in model container [2018-11-23 11:07:56,325 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:07:56" (1/1) ... [2018-11-23 11:07:56,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:07:56,364 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:07:56,637 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:07:56,655 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:07:56,684 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:07:56,706 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:07:56,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:56 WrapperNode [2018-11-23 11:07:56,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:07:56,708 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:07:56,708 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:07:56,708 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:07:56,716 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:56" (1/1) ... [2018-11-23 11:07:56,727 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:56" (1/1) ... [2018-11-23 11:07:56,734 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:07:56,734 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:07:56,734 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:07:56,734 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:07:56,743 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:56" (1/1) ... [2018-11-23 11:07:56,743 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:56" (1/1) ... [2018-11-23 11:07:56,747 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:56" (1/1) ... [2018-11-23 11:07:56,747 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:56" (1/1) ... [2018-11-23 11:07:56,770 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:56" (1/1) ... [2018-11-23 11:07:56,862 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:56" (1/1) ... [2018-11-23 11:07:56,865 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:56" (1/1) ... [2018-11-23 11:07:56,868 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:07:56,869 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:07:56,869 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:07:56,869 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:07:56,870 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:07:56,930 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 11:07:56,930 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:07:56,930 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:07:56,930 INFO L130 BoogieDeclarations]: Found specification of procedure check [2018-11-23 11:07:56,930 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2018-11-23 11:07:56,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 11:07:56,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:07:56,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:07:56,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:07:56,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 11:07:56,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:07:56,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:07:56,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:07:56,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 11:07:59,211 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:07:59,212 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 11:07:59,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:59 BoogieIcfgContainer [2018-11-23 11:07:59,212 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:07:59,213 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:07:59,213 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:07:59,217 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:07:59,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:07:56" (1/3) ... [2018-11-23 11:07:59,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bdb4732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:07:59, skipping insertion in model container [2018-11-23 11:07:59,218 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:07:56" (2/3) ... [2018-11-23 11:07:59,218 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bdb4732 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:07:59, skipping insertion in model container [2018-11-23 11:07:59,219 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:07:59" (3/3) ... [2018-11-23 11:07:59,221 INFO L112 eAbstractionObserver]: Analyzing ICFG test27_true-unreach-call_true-termination.c [2018-11-23 11:07:59,231 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:07:59,240 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:07:59,259 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:07:59,290 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:07:59,291 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:07:59,291 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:07:59,291 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:07:59,291 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:07:59,292 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:07:59,292 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:07:59,292 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:07:59,292 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:07:59,309 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 11:07:59,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 11:07:59,316 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:07:59,317 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:07:59,320 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:07:59,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:07:59,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1170433446, now seen corresponding path program 1 times [2018-11-23 11:07:59,332 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:07:59,333 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:07:59,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:07:59,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:59,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:07:59,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:07:59,506 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 11:07:59,510 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {27#true} is VALID [2018-11-23 11:07:59,511 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 11:07:59,511 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #57#return; {27#true} is VALID [2018-11-23 11:07:59,512 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret18 := main(); {27#true} is VALID [2018-11-23 11:07:59,512 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4bv32);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4bv32);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40bv32);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40bv32);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0bv32; {27#true} is VALID [2018-11-23 11:07:59,513 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-23 11:07:59,514 INFO L273 TraceCheckUtils]: 7: Hoare triple {28#false} assume ~bvsgt32(~i~0, 0bv32) && ~bvslt32(~i~0, 9bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), ~#dummy~0.base, ~#dummy~0.offset, 4bv32);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);call write~$Pointer$(~#dummies~0.base, ~bvadd32(4bv32, ~#dummies~0.offset), ~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, ~bvadd32(#t~mem8.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4bv32);~pa~0.base, ~pa~0.offset := #t~mem10.base, ~bvadd32(4bv32, #t~mem10.offset);havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem10.base, #t~mem10.offset;call #t~mem11 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {28#false} is VALID [2018-11-23 11:07:59,514 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} assume ~bvsgt32(#t~mem11, 0bv32);havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4bv32);call #t~mem14 := read~intINTTYPE4(#t~mem13.base, ~bvadd32(4bv32, #t~mem13.offset), 4bv32);~i~0 := ~bvsub32(#t~mem14, 10bv32);havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset;havoc #t~mem14; {28#false} is VALID [2018-11-23 11:07:59,515 INFO L273 TraceCheckUtils]: 9: Hoare triple {28#false} assume !true; {28#false} is VALID [2018-11-23 11:07:59,515 INFO L256 TraceCheckUtils]: 10: Hoare triple {28#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {28#false} is VALID [2018-11-23 11:07:59,515 INFO L273 TraceCheckUtils]: 11: Hoare triple {28#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4bv32);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, ~bvadd32(#t~mem0.offset, ~bvmul32(4bv32, ~i)), 4bv32);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4bv32);call #t~mem3 := read~intINTTYPE4(#t~mem2.base, ~bvadd32(4bv32, #t~mem2.offset), 4bv32);#res := (if #t~mem3 == ~i then 1bv32 else 0bv32);havoc #t~mem3;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem2.base, #t~mem2.offset; {28#false} is VALID [2018-11-23 11:07:59,516 INFO L273 TraceCheckUtils]: 12: Hoare triple {28#false} assume true; {28#false} is VALID [2018-11-23 11:07:59,516 INFO L268 TraceCheckUtils]: 13: Hoare quadruple {28#false} {28#false} #61#return; {28#false} is VALID [2018-11-23 11:07:59,516 INFO L273 TraceCheckUtils]: 14: Hoare triple {28#false} assume 0bv32 == #t~ret17;havoc #t~ret17; {28#false} is VALID [2018-11-23 11:07:59,517 INFO L273 TraceCheckUtils]: 15: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 11:07:59,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:07:59,521 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:07:59,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:07:59,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:07:59,539 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 11:07:59,542 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:07:59,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:07:59,758 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:07:59,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:07:59,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:07:59,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:07:59,772 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-23 11:08:00,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:00,310 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2018-11-23 11:08:00,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:08:00,311 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-23 11:08:00,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:08:00,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:08:00,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2018-11-23 11:08:00,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:08:00,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions. [2018-11-23 11:08:00,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions. [2018-11-23 11:08:00,725 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:00,736 INFO L225 Difference]: With dead ends: 40 [2018-11-23 11:08:00,736 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 11:08:00,740 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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:08:00,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 11:08:00,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 11:08:00,792 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:08:00,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 11:08:00,793 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 11:08:00,793 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 11:08:00,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:00,797 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 11:08:00,797 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 11:08:00,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:00,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:00,798 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 11:08:00,799 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 11:08:00,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:00,803 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 11:08:00,803 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 11:08:00,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:00,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:00,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:08:00,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:08:00,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:08:00,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-23 11:08:00,809 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-11-23 11:08:00,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:08:00,809 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-23 11:08:00,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:08:00,810 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 11:08:00,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 11:08:00,811 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:08:00,811 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:08:00,811 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:08:00,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:08:00,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1596126575, now seen corresponding path program 1 times [2018-11-23 11:08:00,812 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:08:00,813 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:08:00,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:08:00,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:00,929 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:08:01,259 INFO L256 TraceCheckUtils]: 0: Hoare triple {195#true} call ULTIMATE.init(); {195#true} is VALID [2018-11-23 11:08:01,260 INFO L273 TraceCheckUtils]: 1: Hoare triple {195#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {195#true} is VALID [2018-11-23 11:08:01,260 INFO L273 TraceCheckUtils]: 2: Hoare triple {195#true} assume true; {195#true} is VALID [2018-11-23 11:08:01,261 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {195#true} {195#true} #57#return; {195#true} is VALID [2018-11-23 11:08:01,261 INFO L256 TraceCheckUtils]: 4: Hoare triple {195#true} call #t~ret18 := main(); {195#true} is VALID [2018-11-23 11:08:01,277 INFO L273 TraceCheckUtils]: 5: Hoare triple {195#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4bv32);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4bv32);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40bv32);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40bv32);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0bv32; {215#(= main_~j~0 (_ bv0 32))} is VALID [2018-11-23 11:08:01,286 INFO L273 TraceCheckUtils]: 6: Hoare triple {215#(= main_~j~0 (_ bv0 32))} assume !~bvslt32(~j~0, 10bv32); {196#false} is VALID [2018-11-23 11:08:01,287 INFO L273 TraceCheckUtils]: 7: Hoare triple {196#false} assume ~bvsgt32(~i~0, 0bv32) && ~bvslt32(~i~0, 9bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), ~#dummy~0.base, ~#dummy~0.offset, 4bv32);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);call write~$Pointer$(~#dummies~0.base, ~bvadd32(4bv32, ~#dummies~0.offset), ~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, ~bvadd32(#t~mem8.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4bv32);~pa~0.base, ~pa~0.offset := #t~mem10.base, ~bvadd32(4bv32, #t~mem10.offset);havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem10.base, #t~mem10.offset;call #t~mem11 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {196#false} is VALID [2018-11-23 11:08:01,287 INFO L273 TraceCheckUtils]: 8: Hoare triple {196#false} assume ~bvsgt32(#t~mem11, 0bv32);havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4bv32);call #t~mem14 := read~intINTTYPE4(#t~mem13.base, ~bvadd32(4bv32, #t~mem13.offset), 4bv32);~i~0 := ~bvsub32(#t~mem14, 10bv32);havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset;havoc #t~mem14; {196#false} is VALID [2018-11-23 11:08:01,288 INFO L273 TraceCheckUtils]: 9: Hoare triple {196#false} call #t~mem15 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {196#false} is VALID [2018-11-23 11:08:01,288 INFO L273 TraceCheckUtils]: 10: Hoare triple {196#false} assume !~bvslt32(~i~0, #t~mem15);havoc #t~mem15; {196#false} is VALID [2018-11-23 11:08:01,288 INFO L256 TraceCheckUtils]: 11: Hoare triple {196#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {196#false} is VALID [2018-11-23 11:08:01,289 INFO L273 TraceCheckUtils]: 12: Hoare triple {196#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4bv32);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, ~bvadd32(#t~mem0.offset, ~bvmul32(4bv32, ~i)), 4bv32);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4bv32);call #t~mem3 := read~intINTTYPE4(#t~mem2.base, ~bvadd32(4bv32, #t~mem2.offset), 4bv32);#res := (if #t~mem3 == ~i then 1bv32 else 0bv32);havoc #t~mem3;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem2.base, #t~mem2.offset; {196#false} is VALID [2018-11-23 11:08:01,289 INFO L273 TraceCheckUtils]: 13: Hoare triple {196#false} assume true; {196#false} is VALID [2018-11-23 11:08:01,289 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {196#false} {196#false} #61#return; {196#false} is VALID [2018-11-23 11:08:01,290 INFO L273 TraceCheckUtils]: 15: Hoare triple {196#false} assume 0bv32 == #t~ret17;havoc #t~ret17; {196#false} is VALID [2018-11-23 11:08:01,290 INFO L273 TraceCheckUtils]: 16: Hoare triple {196#false} assume !false; {196#false} is VALID [2018-11-23 11:08:01,292 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:08:01,292 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:08:01,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:08:01,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:08:01,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 11:08:01,303 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:08:01,303 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:08:01,379 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:01,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:08:01,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:08:01,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:08:01,380 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 3 states. [2018-11-23 11:08:03,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:03,243 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2018-11-23 11:08:03,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:08:03,243 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 11:08:03,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:08:03,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:08:03,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 11:08:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:08:03,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 34 transitions. [2018-11-23 11:08:03,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 34 transitions. [2018-11-23 11:08:03,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:03,389 INFO L225 Difference]: With dead ends: 32 [2018-11-23 11:08:03,390 INFO L226 Difference]: Without dead ends: 21 [2018-11-23 11:08:03,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:08:03,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-23 11:08:03,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-11-23 11:08:03,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:08:03,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 20 states. [2018-11-23 11:08:03,399 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 20 states. [2018-11-23 11:08:03,399 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 20 states. [2018-11-23 11:08:03,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:03,403 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 11:08:03,403 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 11:08:03,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:03,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:03,404 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 21 states. [2018-11-23 11:08:03,404 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 21 states. [2018-11-23 11:08:03,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:03,407 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-11-23 11:08:03,407 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-11-23 11:08:03,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:03,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:03,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:08:03,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:08:03,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:08:03,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 11:08:03,410 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2018-11-23 11:08:03,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:08:03,410 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 11:08:03,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:08:03,411 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 11:08:03,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 11:08:03,411 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:08:03,412 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:08:03,412 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:08:03,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:08:03,412 INFO L82 PathProgramCache]: Analyzing trace with hash -450230899, now seen corresponding path program 1 times [2018-11-23 11:08:03,413 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:08:03,413 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:08:03,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:08:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:03,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:03,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:08:03,558 INFO L256 TraceCheckUtils]: 0: Hoare triple {366#true} call ULTIMATE.init(); {366#true} is VALID [2018-11-23 11:08:03,559 INFO L273 TraceCheckUtils]: 1: Hoare triple {366#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {366#true} is VALID [2018-11-23 11:08:03,559 INFO L273 TraceCheckUtils]: 2: Hoare triple {366#true} assume true; {366#true} is VALID [2018-11-23 11:08:03,559 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {366#true} {366#true} #57#return; {366#true} is VALID [2018-11-23 11:08:03,560 INFO L256 TraceCheckUtils]: 4: Hoare triple {366#true} call #t~ret18 := main(); {366#true} is VALID [2018-11-23 11:08:03,561 INFO L273 TraceCheckUtils]: 5: Hoare triple {366#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4bv32);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4bv32);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40bv32);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40bv32);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0bv32; {386#(= main_~j~0 (_ bv0 32))} is VALID [2018-11-23 11:08:03,561 INFO L273 TraceCheckUtils]: 6: Hoare triple {386#(= main_~j~0 (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet6, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet7.base, #t~nondet7.offset; {386#(= main_~j~0 (_ bv0 32))} is VALID [2018-11-23 11:08:03,562 INFO L273 TraceCheckUtils]: 7: Hoare triple {386#(= main_~j~0 (_ bv0 32))} #t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {393#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:08:03,563 INFO L273 TraceCheckUtils]: 8: Hoare triple {393#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~j~0, 10bv32); {367#false} is VALID [2018-11-23 11:08:03,563 INFO L273 TraceCheckUtils]: 9: Hoare triple {367#false} assume ~bvsgt32(~i~0, 0bv32) && ~bvslt32(~i~0, 9bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), ~#dummy~0.base, ~#dummy~0.offset, 4bv32);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);call write~$Pointer$(~#dummies~0.base, ~bvadd32(4bv32, ~#dummies~0.offset), ~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, ~bvadd32(#t~mem8.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4bv32);~pa~0.base, ~pa~0.offset := #t~mem10.base, ~bvadd32(4bv32, #t~mem10.offset);havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem10.base, #t~mem10.offset;call #t~mem11 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {367#false} is VALID [2018-11-23 11:08:03,563 INFO L273 TraceCheckUtils]: 10: Hoare triple {367#false} assume ~bvsgt32(#t~mem11, 0bv32);havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4bv32);call #t~mem14 := read~intINTTYPE4(#t~mem13.base, ~bvadd32(4bv32, #t~mem13.offset), 4bv32);~i~0 := ~bvsub32(#t~mem14, 10bv32);havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset;havoc #t~mem14; {367#false} is VALID [2018-11-23 11:08:03,564 INFO L273 TraceCheckUtils]: 11: Hoare triple {367#false} call #t~mem15 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {367#false} is VALID [2018-11-23 11:08:03,564 INFO L273 TraceCheckUtils]: 12: Hoare triple {367#false} assume !~bvslt32(~i~0, #t~mem15);havoc #t~mem15; {367#false} is VALID [2018-11-23 11:08:03,565 INFO L256 TraceCheckUtils]: 13: Hoare triple {367#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {367#false} is VALID [2018-11-23 11:08:03,566 INFO L273 TraceCheckUtils]: 14: Hoare triple {367#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4bv32);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, ~bvadd32(#t~mem0.offset, ~bvmul32(4bv32, ~i)), 4bv32);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4bv32);call #t~mem3 := read~intINTTYPE4(#t~mem2.base, ~bvadd32(4bv32, #t~mem2.offset), 4bv32);#res := (if #t~mem3 == ~i then 1bv32 else 0bv32);havoc #t~mem3;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem2.base, #t~mem2.offset; {367#false} is VALID [2018-11-23 11:08:03,566 INFO L273 TraceCheckUtils]: 15: Hoare triple {367#false} assume true; {367#false} is VALID [2018-11-23 11:08:03,566 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {367#false} {367#false} #61#return; {367#false} is VALID [2018-11-23 11:08:03,567 INFO L273 TraceCheckUtils]: 17: Hoare triple {367#false} assume 0bv32 == #t~ret17;havoc #t~ret17; {367#false} is VALID [2018-11-23 11:08:03,567 INFO L273 TraceCheckUtils]: 18: Hoare triple {367#false} assume !false; {367#false} is VALID [2018-11-23 11:08:03,569 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:08:03,569 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:08:03,720 INFO L273 TraceCheckUtils]: 18: Hoare triple {367#false} assume !false; {367#false} is VALID [2018-11-23 11:08:03,720 INFO L273 TraceCheckUtils]: 17: Hoare triple {367#false} assume 0bv32 == #t~ret17;havoc #t~ret17; {367#false} is VALID [2018-11-23 11:08:03,721 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {366#true} {367#false} #61#return; {367#false} is VALID [2018-11-23 11:08:03,721 INFO L273 TraceCheckUtils]: 15: Hoare triple {366#true} assume true; {366#true} is VALID [2018-11-23 11:08:03,722 INFO L273 TraceCheckUtils]: 14: Hoare triple {366#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4bv32);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, ~bvadd32(#t~mem0.offset, ~bvmul32(4bv32, ~i)), 4bv32);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4bv32);call #t~mem3 := read~intINTTYPE4(#t~mem2.base, ~bvadd32(4bv32, #t~mem2.offset), 4bv32);#res := (if #t~mem3 == ~i then 1bv32 else 0bv32);havoc #t~mem3;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem2.base, #t~mem2.offset; {366#true} is VALID [2018-11-23 11:08:03,722 INFO L256 TraceCheckUtils]: 13: Hoare triple {367#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {366#true} is VALID [2018-11-23 11:08:03,723 INFO L273 TraceCheckUtils]: 12: Hoare triple {367#false} assume !~bvslt32(~i~0, #t~mem15);havoc #t~mem15; {367#false} is VALID [2018-11-23 11:08:03,723 INFO L273 TraceCheckUtils]: 11: Hoare triple {367#false} call #t~mem15 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {367#false} is VALID [2018-11-23 11:08:03,723 INFO L273 TraceCheckUtils]: 10: Hoare triple {367#false} assume ~bvsgt32(#t~mem11, 0bv32);havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4bv32);call #t~mem14 := read~intINTTYPE4(#t~mem13.base, ~bvadd32(4bv32, #t~mem13.offset), 4bv32);~i~0 := ~bvsub32(#t~mem14, 10bv32);havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset;havoc #t~mem14; {367#false} is VALID [2018-11-23 11:08:03,724 INFO L273 TraceCheckUtils]: 9: Hoare triple {367#false} assume ~bvsgt32(~i~0, 0bv32) && ~bvslt32(~i~0, 9bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), ~#dummy~0.base, ~#dummy~0.offset, 4bv32);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);call write~$Pointer$(~#dummies~0.base, ~bvadd32(4bv32, ~#dummies~0.offset), ~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, ~bvadd32(#t~mem8.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4bv32);~pa~0.base, ~pa~0.offset := #t~mem10.base, ~bvadd32(4bv32, #t~mem10.offset);havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem10.base, #t~mem10.offset;call #t~mem11 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {367#false} is VALID [2018-11-23 11:08:03,727 INFO L273 TraceCheckUtils]: 8: Hoare triple {457#(bvslt main_~j~0 (_ bv10 32))} assume !~bvslt32(~j~0, 10bv32); {367#false} is VALID [2018-11-23 11:08:03,730 INFO L273 TraceCheckUtils]: 7: Hoare triple {461#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} #t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {457#(bvslt main_~j~0 (_ bv10 32))} is VALID [2018-11-23 11:08:03,731 INFO L273 TraceCheckUtils]: 6: Hoare triple {461#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet6, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet7.base, #t~nondet7.offset; {461#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-23 11:08:03,732 INFO L273 TraceCheckUtils]: 5: Hoare triple {366#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4bv32);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4bv32);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40bv32);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40bv32);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0bv32; {461#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-23 11:08:03,732 INFO L256 TraceCheckUtils]: 4: Hoare triple {366#true} call #t~ret18 := main(); {366#true} is VALID [2018-11-23 11:08:03,732 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {366#true} {366#true} #57#return; {366#true} is VALID [2018-11-23 11:08:03,733 INFO L273 TraceCheckUtils]: 2: Hoare triple {366#true} assume true; {366#true} is VALID [2018-11-23 11:08:03,733 INFO L273 TraceCheckUtils]: 1: Hoare triple {366#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {366#true} is VALID [2018-11-23 11:08:03,735 INFO L256 TraceCheckUtils]: 0: Hoare triple {366#true} call ULTIMATE.init(); {366#true} is VALID [2018-11-23 11:08:03,737 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:08:03,740 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:08:03,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 11:08:03,741 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 11:08:03,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:08:03,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:08:03,817 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:03,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:08:03,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:08:03,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:08:03,818 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 6 states. [2018-11-23 11:08:09,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:09,570 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 11:08:09,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:08:09,571 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-23 11:08:09,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:08:09,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:08:09,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2018-11-23 11:08:09,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:08:09,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2018-11-23 11:08:09,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2018-11-23 11:08:09,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:09,680 INFO L225 Difference]: With dead ends: 37 [2018-11-23 11:08:09,680 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 11:08:09,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:08:09,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 11:08:09,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 11:08:09,694 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:08:09,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 11:08:09,695 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 11:08:09,695 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 11:08:09,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:09,697 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 11:08:09,697 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 11:08:09,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:09,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:09,698 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 11:08:09,699 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 11:08:09,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:09,701 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2018-11-23 11:08:09,701 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 11:08:09,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:09,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:09,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:08:09,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:08:09,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:08:09,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-23 11:08:09,703 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 19 [2018-11-23 11:08:09,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:08:09,704 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-23 11:08:09,704 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:08:09,704 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-23 11:08:09,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 11:08:09,705 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:08:09,705 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:08:09,705 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:08:09,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:08:09,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1321818343, now seen corresponding path program 2 times [2018-11-23 11:08:09,706 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:08:09,706 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:08:09,728 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:08:09,976 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 11:08:09,976 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:08:10,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:10,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:08:10,261 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:10,268 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 31 treesize of output 40 [2018-11-23 11:08:10,432 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:10,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:10,434 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:08:10,436 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 46 [2018-11-23 11:08:10,546 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:10,547 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:08:10,548 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:08:10,550 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 25 [2018-11-23 11:08:10,564 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:10,585 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:10,605 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:10,639 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:10,639 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:40, output treesize:31 [2018-11-23 11:08:11,846 INFO L303 Elim1Store]: Index analysis took 952 ms [2018-11-23 11:08:11,848 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 26 [2018-11-23 11:08:12,022 INFO L303 Elim1Store]: Index analysis took 168 ms [2018-11-23 11:08:12,023 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:08:12,031 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:14,391 INFO L303 Elim1Store]: Index analysis took 760 ms [2018-11-23 11:08:14,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-11-23 11:08:14,524 INFO L303 Elim1Store]: Index analysis took 125 ms [2018-11-23 11:08:14,525 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-23 11:08:14,526 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:15,084 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:15,377 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:20,726 INFO L303 Elim1Store]: Index analysis took 769 ms [2018-11-23 11:08:20,727 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 36 [2018-11-23 11:08:20,858 INFO L303 Elim1Store]: Index analysis took 124 ms [2018-11-23 11:08:20,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 1 [2018-11-23 11:08:20,860 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:21,393 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:24,769 INFO L303 Elim1Store]: Index analysis took 263 ms [2018-11-23 11:08:24,770 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 52 [2018-11-23 11:08:24,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 11:08:24,838 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:25,491 INFO L303 Elim1Store]: Index analysis took 304 ms [2018-11-23 11:08:25,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2018-11-23 11:08:25,543 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 13 treesize of output 12 [2018-11-23 11:08:25,545 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:26,385 INFO L303 Elim1Store]: Index analysis took 447 ms [2018-11-23 11:08:26,388 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2018-11-23 11:08:26,435 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:08:26,437 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:26,753 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:26,969 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:27,266 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:28,138 INFO L303 Elim1Store]: Index analysis took 218 ms [2018-11-23 11:08:28,140 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 26 [2018-11-23 11:08:28,189 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-23 11:08:28,191 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:28,285 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:28,929 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 46 [2018-11-23 11:08:28,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:08:28,976 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:29,104 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-11-23 11:08:29,143 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-23 11:08:29,145 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:29,287 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 40 [2018-11-23 11:08:29,306 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:08:29,308 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:29,384 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:29,429 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:29,479 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:29,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 5 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:08:29,675 INFO L202 ElimStorePlain]: Needed 21 recursive calls to eliminate 8 variables, input treesize:342, output treesize:247 [2018-11-23 11:08:31,690 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:31,690 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_17|, |main_~#dummy~0.base|, |main_~#a~0.base|, |main_~#cont~0.offset|, |v_#memory_int_18|, |v_#memory_int_19|, |v_#memory_int_20|, |v_#memory_$Pointer$.offset_17|]. (let ((.cse4 (bvmul (_ bv4 32) main_~i~0))) (let ((.cse9 (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (.cse10 (bvadd .cse4 (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (let ((.cse0 (bvadd .cse4 |main_~#dummies~0.offset| (_ bv4 32))) (.cse1 (select (select |#memory_$Pointer$.base| .cse9) .cse10)) (.cse2 (select (select |#memory_$Pointer$.offset| .cse9) .cse10))) (and (= (store |v_#memory_int_18| |main_~#cont~0.base| (store (select |v_#memory_int_18| |main_~#cont~0.base|) |main_~#cont~0.offset| (select (select |#memory_int| |main_~#cont~0.base|) |main_~#cont~0.offset|))) |#memory_int|) (bvsgt main_~i~0 (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (bvslt main_~i~0 (_ bv9 32)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (= (store |v_#memory_int_19| |main_~#dummies~0.base| (store (select |v_#memory_int_19| |main_~#dummies~0.base|) .cse0 (select (select |v_#memory_int_18| |main_~#dummies~0.base|) .cse0))) |v_#memory_int_18|) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= (bvadd (select (select |#memory_$Pointer$.offset| .cse1) .cse2) (_ bv4 32)) main_~pa~0.offset) (= |v_#memory_int_19| (let ((.cse3 (store |v_#memory_int_20| |main_~#a~0.base| (store (select |v_#memory_int_20| |main_~#a~0.base|) .cse4 main_~i~0)))) (store .cse3 |main_~#dummy~0.base| (store (select .cse3 |main_~#dummy~0.base|) (_ bv0 32) (select (select |v_#memory_int_19| |main_~#dummy~0.base|) (_ bv0 32)))))) (= (let ((.cse5 (let ((.cse6 (store |v_#memory_$Pointer$.offset_17| |main_~#dummy~0.base| (store (select |v_#memory_$Pointer$.offset_17| |main_~#dummy~0.base|) (_ bv0 32) (bvadd .cse4 (_ bv4294967292 32)))))) (store .cse6 |main_~#dummies~0.base| (store (select .cse6 |main_~#dummies~0.base|) .cse0 (_ bv0 32)))))) (store .cse5 |main_~#cont~0.base| (store (select .cse5 |main_~#cont~0.base|) |main_~#cont~0.offset| (bvadd |main_~#dummies~0.offset| (_ bv4 32))))) |#memory_$Pointer$.offset|) (not (= |main_~#a~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (= (let ((.cse7 (let ((.cse8 (store |v_#memory_$Pointer$.base_17| |main_~#dummy~0.base| (store (select |v_#memory_$Pointer$.base_17| |main_~#dummy~0.base|) (_ bv0 32) |main_~#a~0.base|)))) (store .cse8 |main_~#dummies~0.base| (store (select .cse8 |main_~#dummies~0.base|) .cse0 |main_~#dummy~0.base|))))) (store .cse7 |main_~#cont~0.base| (store (select .cse7 |main_~#cont~0.base|) |main_~#cont~0.offset| |main_~#dummies~0.base|))) |#memory_$Pointer$.base|) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= main_~pa~0.base (select (select |#memory_$Pointer$.base| .cse1) .cse2)))))) [2018-11-23 11:08:31,691 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#cont~0.offset|]. (let ((.cse4 (bvmul (_ bv4 32) main_~i~0))) (let ((.cse5 (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (.cse6 (bvadd .cse4 |main_~#dummies~0.offset| (_ bv4 32)))) (let ((.cse3 (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) .cse6)) (.cse7 (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (.cse8 (bvadd .cse4 .cse5))) (let ((.cse1 (select (select |#memory_$Pointer$.base| .cse7) .cse8)) (.cse2 (select (select |#memory_$Pointer$.offset| .cse7) .cse8)) (.cse0 (select (select |#memory_$Pointer$.base| .cse3) (_ bv0 32)))) (and (not (= |main_~#dummies~0.base| .cse0)) (bvsgt main_~i~0 (_ bv0 32)) (bvslt main_~i~0 (_ bv9 32)) (= (bvadd (select (select |#memory_$Pointer$.offset| .cse1) .cse2) (_ bv4 32)) main_~pa~0.offset) (not (= .cse3 .cse0)) (= (bvadd .cse4 (_ bv4294967292 32)) (select (select |#memory_$Pointer$.offset| .cse3) (_ bv0 32))) (= .cse5 (bvadd |main_~#dummies~0.offset| (_ bv4 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#dummies~0.base|) .cse6) (_ bv0 32)) (not (= .cse0 |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= .cse3 |main_~#cont~0.base|)) (= .cse7 |main_~#dummies~0.base|) (not (= .cse3 |main_~#dummies~0.base|)) (= main_~pa~0.base (select (select |#memory_$Pointer$.base| .cse1) .cse2)) (= (select (select |#memory_int| .cse0) .cse4) main_~i~0)))))) [2018-11-23 11:08:31,955 WARN L180 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 66 [2018-11-23 11:08:32,233 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 375 treesize of output 288 [2018-11-23 11:08:32,276 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 72 treesize of output 56 [2018-11-23 11:08:32,280 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:32,384 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 227 treesize of output 203 [2018-11-23 11:08:32,392 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:08:32,527 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 66 treesize of output 45 [2018-11-23 11:08:32,529 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:32,624 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:08:32,777 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 190 treesize of output 96 [2018-11-23 11:08:32,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 39 [2018-11-23 11:08:32,839 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:32,903 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 25 treesize of output 19 [2018-11-23 11:08:32,909 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:32,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2018-11-23 11:08:32,950 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:32,965 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:33,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:08:33,000 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 4 variables, input treesize:389, output treesize:38 [2018-11-23 11:08:33,022 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:33,022 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.offset|, |main_~#cont~0.offset|, v_main_~i~0_14, |#memory_$Pointer$.base|]. (let ((.cse5 (bvmul (_ bv4 32) v_main_~i~0_14))) (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (.cse9 (bvadd .cse5 (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (let ((.cse1 (select (select |#memory_$Pointer$.base| .cse0) .cse9))) (let ((.cse8 (select |#memory_$Pointer$.base| .cse1)) (.cse6 (select |#memory_$Pointer$.offset| .cse1)) (.cse7 (select (select |#memory_$Pointer$.offset| .cse0) .cse9))) (let ((.cse4 (bvadd (select .cse6 .cse7) (_ bv4 32))) (.cse2 (select .cse8 (_ bv0 32))) (.cse3 (select .cse8 .cse7))) (and (not (= .cse0 .cse1)) (not (= .cse2 .cse0)) (not (= .cse2 .cse1)) (not (= .cse0 |main_~#cont~0.base|)) (= (bvadd (select (select |#memory_int| .cse3) .cse4) (_ bv4294967286 32)) main_~i~0) (= (bvadd .cse5 (_ bv4294967292 32)) (select .cse6 (_ bv0 32))) (= main_~pa~0.offset .cse4) (not (= .cse2 |main_~#cont~0.base|)) (= (_ bv0 32) .cse7) (= (select (select |#memory_int| .cse2) .cse5) v_main_~i~0_14) (bvslt v_main_~i~0_14 (_ bv9 32)) (bvsgt v_main_~i~0_14 (_ bv0 32)) (not (= .cse1 |main_~#cont~0.base|)) (= .cse3 main_~pa~0.base))))))) [2018-11-23 11:08:33,022 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~i~0_14]. (let ((.cse0 (select |#memory_int| main_~pa~0.base)) (.cse1 (bvmul (_ bv4 32) v_main_~i~0_14))) (and (= main_~i~0 (bvadd (select .cse0 main_~pa~0.offset) (_ bv4294967286 32))) (bvslt v_main_~i~0_14 (_ bv9 32)) (= (bvadd main_~pa~0.offset (_ bv4294967292 32)) (bvadd .cse1 (_ bv4294967292 32))) (bvsgt v_main_~i~0_14 (_ bv0 32)) (not (= main_~pa~0.base |main_~#cont~0.base|)) (= (select .cse0 .cse1) v_main_~i~0_14))) [2018-11-23 11:08:33,313 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 30 treesize of output 24 [2018-11-23 11:08:33,369 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 24 treesize of output 11 [2018-11-23 11:08:33,370 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:08:33,379 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:08:33,401 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:08:33,401 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:16 [2018-11-23 11:08:33,414 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:08:33,414 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~pa~0.base, v_main_~i~0_14]. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) (bvmul (_ bv4 32) v_main_~i~0_14)))) (and (= .cse0 |main_#t~mem15|) (bvslt v_main_~i~0_14 (_ bv9 32)) (bvsgt v_main_~i~0_14 (_ bv0 32)) (not (= main_~pa~0.base |main_~#cont~0.base|)) (= .cse0 v_main_~i~0_14) (= (bvadd .cse0 (_ bv4294967286 32)) main_~i~0))) [2018-11-23 11:08:33,415 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse0 (bvadd main_~i~0 (_ bv10 32)))) (and (bvsgt .cse0 (_ bv0 32)) (bvslt .cse0 (_ bv9 32)) (= |main_#t~mem15| .cse0))) [2018-11-23 11:08:33,496 INFO L256 TraceCheckUtils]: 0: Hoare triple {632#true} call ULTIMATE.init(); {632#true} is VALID [2018-11-23 11:08:33,496 INFO L273 TraceCheckUtils]: 1: Hoare triple {632#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {632#true} is VALID [2018-11-23 11:08:33,497 INFO L273 TraceCheckUtils]: 2: Hoare triple {632#true} assume true; {632#true} is VALID [2018-11-23 11:08:33,497 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {632#true} {632#true} #57#return; {632#true} is VALID [2018-11-23 11:08:33,497 INFO L256 TraceCheckUtils]: 4: Hoare triple {632#true} call #t~ret18 := main(); {632#true} is VALID [2018-11-23 11:08:33,499 INFO L273 TraceCheckUtils]: 5: Hoare triple {632#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4bv32);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4bv32);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40bv32);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40bv32);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0bv32; {652#(and (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:08:33,501 INFO L273 TraceCheckUtils]: 6: Hoare triple {652#(and (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet6, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet7.base, #t~nondet7.offset; {652#(and (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:08:33,502 INFO L273 TraceCheckUtils]: 7: Hoare triple {652#(and (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} #t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {652#(and (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:08:33,504 INFO L273 TraceCheckUtils]: 8: Hoare triple {652#(and (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet6, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet7.base, #t~nondet7.offset; {652#(and (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:08:33,506 INFO L273 TraceCheckUtils]: 9: Hoare triple {652#(and (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} #t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {652#(and (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:08:33,508 INFO L273 TraceCheckUtils]: 10: Hoare triple {652#(and (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet6, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet7.base, #t~nondet7.offset; {652#(and (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:08:33,509 INFO L273 TraceCheckUtils]: 11: Hoare triple {652#(and (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} #t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {652#(and (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:08:33,511 INFO L273 TraceCheckUtils]: 12: Hoare triple {652#(and (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet6, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet7.base, #t~nondet7.offset; {652#(and (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:08:33,513 INFO L273 TraceCheckUtils]: 13: Hoare triple {652#(and (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} #t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {652#(and (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:08:33,514 INFO L273 TraceCheckUtils]: 14: Hoare triple {652#(and (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} assume !~bvslt32(~j~0, 10bv32); {652#(and (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:08:33,538 INFO L273 TraceCheckUtils]: 15: Hoare triple {652#(and (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} assume ~bvsgt32(~i~0, 0bv32) && ~bvslt32(~i~0, 9bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), ~#dummy~0.base, ~#dummy~0.offset, 4bv32);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);call write~$Pointer$(~#dummies~0.base, ~bvadd32(4bv32, ~#dummies~0.offset), ~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, ~bvadd32(#t~mem8.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4bv32);~pa~0.base, ~pa~0.offset := #t~mem10.base, ~bvadd32(4bv32, #t~mem10.offset);havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem10.base, #t~mem10.offset;call #t~mem11 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {683#(and (= (select (select |#memory_$Pointer$.offset| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32)))) (_ bv0 32)) |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (exists ((|main_~#cont~0.offset| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (bvmul (_ bv4 32) main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (bvmul (_ bv4 32) main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (_ bv4 32)) main_~pa~0.offset) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_~#dummies~0.base|) (= (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4294967292 32)) |main_~#dummies~0.offset|) (= main_~pa~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (bvmul (_ bv4 32) main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (bvmul (_ bv4 32) main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))))))) (bvsgt main_~i~0 (_ bv0 32)) (not (= |main_~#dummies~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32)))) (_ bv0 32)))) (bvslt main_~i~0 (_ bv9 32)) (not (= (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32))) |main_~#cont~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32)))) (_ bv0 32)))) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32))) |main_~#dummies~0.base|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32)))) (_ bv0 32))) (bvmul (_ bv4 32) main_~i~0)) main_~i~0))} is VALID [2018-11-23 11:08:35,542 INFO L273 TraceCheckUtils]: 16: Hoare triple {683#(and (= (select (select |#memory_$Pointer$.offset| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32)))) (_ bv0 32)) |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (exists ((|main_~#cont~0.offset| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (bvmul (_ bv4 32) main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (bvmul (_ bv4 32) main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (_ bv4 32)) main_~pa~0.offset) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|) |main_~#dummies~0.base|) (= (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) (_ bv4294967292 32)) |main_~#dummies~0.offset|) (= main_~pa~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (bvmul (_ bv4 32) main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (bvadd (bvmul (_ bv4 32) main_~i~0) (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|))))))) (bvsgt main_~i~0 (_ bv0 32)) (not (= |main_~#dummies~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32)))) (_ bv0 32)))) (bvslt main_~i~0 (_ bv9 32)) (not (= (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32))) |main_~#cont~0.base|)) (not (= (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32)))) (_ bv0 32)))) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32)))) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32))) |main_~#dummies~0.base|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32)))) (_ bv0 32))) (bvmul (_ bv4 32) main_~i~0)) main_~i~0))} assume ~bvsgt32(#t~mem11, 0bv32);havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4bv32);call #t~mem14 := read~intINTTYPE4(#t~mem13.base, ~bvadd32(4bv32, #t~mem13.offset), 4bv32);~i~0 := ~bvsub32(#t~mem14, 10bv32);havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset;havoc #t~mem14; {687#(and (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (= main_~pa~0.base |main_~#cont~0.base|)) (exists ((v_main_~i~0_14 (_ BitVec 32))) (and (= main_~pa~0.offset (bvmul (_ bv4 32) v_main_~i~0_14)) (bvslt v_main_~i~0_14 (_ bv9 32)) (bvsgt v_main_~i~0_14 (_ bv0 32)) (= (select (select |#memory_int| main_~pa~0.base) (bvmul (_ bv4 32) v_main_~i~0_14)) v_main_~i~0_14))))} is UNKNOWN [2018-11-23 11:08:35,548 INFO L273 TraceCheckUtils]: 17: Hoare triple {687#(and (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (= main_~pa~0.base |main_~#cont~0.base|)) (exists ((v_main_~i~0_14 (_ BitVec 32))) (and (= main_~pa~0.offset (bvmul (_ bv4 32) v_main_~i~0_14)) (bvslt v_main_~i~0_14 (_ bv9 32)) (bvsgt v_main_~i~0_14 (_ bv0 32)) (= (select (select |#memory_int| main_~pa~0.base) (bvmul (_ bv4 32) v_main_~i~0_14)) v_main_~i~0_14))))} call #t~mem15 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {691#(and (bvsgt (bvadd main_~i~0 (_ bv10 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv9 32)) (= (bvadd |main_#t~mem15| (_ bv4294967286 32)) main_~i~0))} is VALID [2018-11-23 11:08:35,550 INFO L273 TraceCheckUtils]: 18: Hoare triple {691#(and (bvsgt (bvadd main_~i~0 (_ bv10 32)) (_ bv0 32)) (bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv9 32)) (= (bvadd |main_#t~mem15| (_ bv4294967286 32)) main_~i~0))} assume !~bvslt32(~i~0, #t~mem15);havoc #t~mem15; {633#false} is VALID [2018-11-23 11:08:35,550 INFO L256 TraceCheckUtils]: 19: Hoare triple {633#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {633#false} is VALID [2018-11-23 11:08:35,551 INFO L273 TraceCheckUtils]: 20: Hoare triple {633#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4bv32);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, ~bvadd32(#t~mem0.offset, ~bvmul32(4bv32, ~i)), 4bv32);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4bv32);call #t~mem3 := read~intINTTYPE4(#t~mem2.base, ~bvadd32(4bv32, #t~mem2.offset), 4bv32);#res := (if #t~mem3 == ~i then 1bv32 else 0bv32);havoc #t~mem3;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem2.base, #t~mem2.offset; {633#false} is VALID [2018-11-23 11:08:35,551 INFO L273 TraceCheckUtils]: 21: Hoare triple {633#false} assume true; {633#false} is VALID [2018-11-23 11:08:35,551 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {633#false} {633#false} #61#return; {633#false} is VALID [2018-11-23 11:08:35,552 INFO L273 TraceCheckUtils]: 23: Hoare triple {633#false} assume 0bv32 == #t~ret17;havoc #t~ret17; {633#false} is VALID [2018-11-23 11:08:35,552 INFO L273 TraceCheckUtils]: 24: Hoare triple {633#false} assume !false; {633#false} is VALID [2018-11-23 11:08:35,558 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 11:08:35,559 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:08:35,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:08:35,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 11:08:35,562 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-23 11:08:35,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:08:35,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:08:37,763 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 18 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:37,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:08:37,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:08:37,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:08:37,764 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 6 states. [2018-11-23 11:08:45,217 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2018-11-23 11:08:45,832 WARN L180 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 48 [2018-11-23 11:08:46,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:46,329 INFO L93 Difference]: Finished difference Result 35 states and 36 transitions. [2018-11-23 11:08:46,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:08:46,330 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2018-11-23 11:08:46,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:08:46,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:08:46,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-23 11:08:46,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:08:46,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 29 transitions. [2018-11-23 11:08:46,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 29 transitions. [2018-11-23 11:08:48,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 28 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:48,522 INFO L225 Difference]: With dead ends: 35 [2018-11-23 11:08:48,523 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 11:08:48,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:08:48,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 11:08:48,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-23 11:08:48,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:08:48,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-23 11:08:48,732 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 11:08:48,732 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 11:08:48,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:48,734 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 11:08:48,734 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 11:08:48,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:48,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:48,735 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-23 11:08:48,735 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-23 11:08:48,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:48,737 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-11-23 11:08:48,738 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 11:08:48,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:48,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:48,738 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:08:48,739 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:08:48,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:08:48,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2018-11-23 11:08:48,740 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 25 [2018-11-23 11:08:48,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:08:48,741 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2018-11-23 11:08:48,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:08:48,741 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2018-11-23 11:08:48,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:08:48,742 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:08:48,742 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:08:48,742 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:08:48,742 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:08:48,743 INFO L82 PathProgramCache]: Analyzing trace with hash -763481844, now seen corresponding path program 1 times [2018-11-23 11:08:48,743 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:08:48,743 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:08:48,769 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:08:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:48,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:08:48,856 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:08:49,211 INFO L256 TraceCheckUtils]: 0: Hoare triple {868#true} call ULTIMATE.init(); {868#true} is VALID [2018-11-23 11:08:49,212 INFO L273 TraceCheckUtils]: 1: Hoare triple {868#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {868#true} is VALID [2018-11-23 11:08:49,212 INFO L273 TraceCheckUtils]: 2: Hoare triple {868#true} assume true; {868#true} is VALID [2018-11-23 11:08:49,212 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {868#true} {868#true} #57#return; {868#true} is VALID [2018-11-23 11:08:49,212 INFO L256 TraceCheckUtils]: 4: Hoare triple {868#true} call #t~ret18 := main(); {868#true} is VALID [2018-11-23 11:08:49,213 INFO L273 TraceCheckUtils]: 5: Hoare triple {868#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4bv32);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4bv32);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40bv32);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40bv32);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0bv32; {888#(= main_~j~0 (_ bv0 32))} is VALID [2018-11-23 11:08:49,217 INFO L273 TraceCheckUtils]: 6: Hoare triple {888#(= main_~j~0 (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet6, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet7.base, #t~nondet7.offset; {888#(= main_~j~0 (_ bv0 32))} is VALID [2018-11-23 11:08:49,217 INFO L273 TraceCheckUtils]: 7: Hoare triple {888#(= main_~j~0 (_ bv0 32))} #t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {895#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:08:49,223 INFO L273 TraceCheckUtils]: 8: Hoare triple {895#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet6, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet7.base, #t~nondet7.offset; {895#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:08:49,223 INFO L273 TraceCheckUtils]: 9: Hoare triple {895#(= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {902#(= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:08:49,225 INFO L273 TraceCheckUtils]: 10: Hoare triple {902#(= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet6, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet7.base, #t~nondet7.offset; {902#(= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 11:08:49,225 INFO L273 TraceCheckUtils]: 11: Hoare triple {902#(= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {909#(= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:08:49,226 INFO L273 TraceCheckUtils]: 12: Hoare triple {909#(= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet6, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet7.base, #t~nondet7.offset; {909#(= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 11:08:49,226 INFO L273 TraceCheckUtils]: 13: Hoare triple {909#(= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {916#(= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 11:08:49,227 INFO L273 TraceCheckUtils]: 14: Hoare triple {916#(= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~j~0, 10bv32); {869#false} is VALID [2018-11-23 11:08:49,227 INFO L273 TraceCheckUtils]: 15: Hoare triple {869#false} assume ~bvsgt32(~i~0, 0bv32) && ~bvslt32(~i~0, 9bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), ~#dummy~0.base, ~#dummy~0.offset, 4bv32);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);call write~$Pointer$(~#dummies~0.base, ~bvadd32(4bv32, ~#dummies~0.offset), ~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, ~bvadd32(#t~mem8.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4bv32);~pa~0.base, ~pa~0.offset := #t~mem10.base, ~bvadd32(4bv32, #t~mem10.offset);havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem10.base, #t~mem10.offset;call #t~mem11 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {869#false} is VALID [2018-11-23 11:08:49,227 INFO L273 TraceCheckUtils]: 16: Hoare triple {869#false} assume ~bvsgt32(#t~mem11, 0bv32);havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4bv32);call #t~mem14 := read~intINTTYPE4(#t~mem13.base, ~bvadd32(4bv32, #t~mem13.offset), 4bv32);~i~0 := ~bvsub32(#t~mem14, 10bv32);havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset;havoc #t~mem14; {869#false} is VALID [2018-11-23 11:08:49,227 INFO L273 TraceCheckUtils]: 17: Hoare triple {869#false} call #t~mem15 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {869#false} is VALID [2018-11-23 11:08:49,228 INFO L273 TraceCheckUtils]: 18: Hoare triple {869#false} assume !!~bvslt32(~i~0, #t~mem15);havoc #t~mem15;#t~pre16 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre16; {869#false} is VALID [2018-11-23 11:08:49,228 INFO L273 TraceCheckUtils]: 19: Hoare triple {869#false} call #t~mem15 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {869#false} is VALID [2018-11-23 11:08:49,228 INFO L273 TraceCheckUtils]: 20: Hoare triple {869#false} assume !~bvslt32(~i~0, #t~mem15);havoc #t~mem15; {869#false} is VALID [2018-11-23 11:08:49,229 INFO L256 TraceCheckUtils]: 21: Hoare triple {869#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {869#false} is VALID [2018-11-23 11:08:49,229 INFO L273 TraceCheckUtils]: 22: Hoare triple {869#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4bv32);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, ~bvadd32(#t~mem0.offset, ~bvmul32(4bv32, ~i)), 4bv32);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4bv32);call #t~mem3 := read~intINTTYPE4(#t~mem2.base, ~bvadd32(4bv32, #t~mem2.offset), 4bv32);#res := (if #t~mem3 == ~i then 1bv32 else 0bv32);havoc #t~mem3;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem2.base, #t~mem2.offset; {869#false} is VALID [2018-11-23 11:08:49,229 INFO L273 TraceCheckUtils]: 23: Hoare triple {869#false} assume true; {869#false} is VALID [2018-11-23 11:08:49,229 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {869#false} {869#false} #61#return; {869#false} is VALID [2018-11-23 11:08:49,230 INFO L273 TraceCheckUtils]: 25: Hoare triple {869#false} assume 0bv32 == #t~ret17;havoc #t~ret17; {869#false} is VALID [2018-11-23 11:08:49,230 INFO L273 TraceCheckUtils]: 26: Hoare triple {869#false} assume !false; {869#false} is VALID [2018-11-23 11:08:49,232 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:08:49,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:08:49,485 INFO L273 TraceCheckUtils]: 26: Hoare triple {869#false} assume !false; {869#false} is VALID [2018-11-23 11:08:49,486 INFO L273 TraceCheckUtils]: 25: Hoare triple {869#false} assume 0bv32 == #t~ret17;havoc #t~ret17; {869#false} is VALID [2018-11-23 11:08:49,486 INFO L268 TraceCheckUtils]: 24: Hoare quadruple {868#true} {869#false} #61#return; {869#false} is VALID [2018-11-23 11:08:49,486 INFO L273 TraceCheckUtils]: 23: Hoare triple {868#true} assume true; {868#true} is VALID [2018-11-23 11:08:49,487 INFO L273 TraceCheckUtils]: 22: Hoare triple {868#true} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4bv32);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, ~bvadd32(#t~mem0.offset, ~bvmul32(4bv32, ~i)), 4bv32);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4bv32);call #t~mem3 := read~intINTTYPE4(#t~mem2.base, ~bvadd32(4bv32, #t~mem2.offset), 4bv32);#res := (if #t~mem3 == ~i then 1bv32 else 0bv32);havoc #t~mem3;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem2.base, #t~mem2.offset; {868#true} is VALID [2018-11-23 11:08:49,487 INFO L256 TraceCheckUtils]: 21: Hoare triple {869#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {868#true} is VALID [2018-11-23 11:08:49,487 INFO L273 TraceCheckUtils]: 20: Hoare triple {869#false} assume !~bvslt32(~i~0, #t~mem15);havoc #t~mem15; {869#false} is VALID [2018-11-23 11:08:49,487 INFO L273 TraceCheckUtils]: 19: Hoare triple {869#false} call #t~mem15 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {869#false} is VALID [2018-11-23 11:08:49,488 INFO L273 TraceCheckUtils]: 18: Hoare triple {869#false} assume !!~bvslt32(~i~0, #t~mem15);havoc #t~mem15;#t~pre16 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre16; {869#false} is VALID [2018-11-23 11:08:49,488 INFO L273 TraceCheckUtils]: 17: Hoare triple {869#false} call #t~mem15 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {869#false} is VALID [2018-11-23 11:08:49,488 INFO L273 TraceCheckUtils]: 16: Hoare triple {869#false} assume ~bvsgt32(#t~mem11, 0bv32);havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4bv32);call #t~mem14 := read~intINTTYPE4(#t~mem13.base, ~bvadd32(4bv32, #t~mem13.offset), 4bv32);~i~0 := ~bvsub32(#t~mem14, 10bv32);havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset;havoc #t~mem14; {869#false} is VALID [2018-11-23 11:08:49,488 INFO L273 TraceCheckUtils]: 15: Hoare triple {869#false} assume ~bvsgt32(~i~0, 0bv32) && ~bvslt32(~i~0, 9bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), ~#dummy~0.base, ~#dummy~0.offset, 4bv32);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);call write~$Pointer$(~#dummies~0.base, ~bvadd32(4bv32, ~#dummies~0.offset), ~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, ~bvadd32(#t~mem8.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4bv32);~pa~0.base, ~pa~0.offset := #t~mem10.base, ~bvadd32(4bv32, #t~mem10.offset);havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem10.base, #t~mem10.offset;call #t~mem11 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {869#false} is VALID [2018-11-23 11:08:49,491 INFO L273 TraceCheckUtils]: 14: Hoare triple {992#(bvslt main_~j~0 (_ bv10 32))} assume !~bvslt32(~j~0, 10bv32); {869#false} is VALID [2018-11-23 11:08:49,493 INFO L273 TraceCheckUtils]: 13: Hoare triple {996#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} #t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {992#(bvslt main_~j~0 (_ bv10 32))} is VALID [2018-11-23 11:08:49,493 INFO L273 TraceCheckUtils]: 12: Hoare triple {996#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet6, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet7.base, #t~nondet7.offset; {996#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-23 11:08:49,496 INFO L273 TraceCheckUtils]: 11: Hoare triple {1003#(bvslt (bvadd main_~j~0 (_ bv2 32)) (_ bv10 32))} #t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {996#(bvslt (bvadd main_~j~0 (_ bv1 32)) (_ bv10 32))} is VALID [2018-11-23 11:08:49,513 INFO L273 TraceCheckUtils]: 10: Hoare triple {1003#(bvslt (bvadd main_~j~0 (_ bv2 32)) (_ bv10 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet6, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet7.base, #t~nondet7.offset; {1003#(bvslt (bvadd main_~j~0 (_ bv2 32)) (_ bv10 32))} is VALID [2018-11-23 11:08:49,530 INFO L273 TraceCheckUtils]: 9: Hoare triple {1010#(bvslt (bvadd main_~j~0 (_ bv3 32)) (_ bv10 32))} #t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1003#(bvslt (bvadd main_~j~0 (_ bv2 32)) (_ bv10 32))} is VALID [2018-11-23 11:08:49,538 INFO L273 TraceCheckUtils]: 8: Hoare triple {1010#(bvslt (bvadd main_~j~0 (_ bv3 32)) (_ bv10 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet6, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet7.base, #t~nondet7.offset; {1010#(bvslt (bvadd main_~j~0 (_ bv3 32)) (_ bv10 32))} is VALID [2018-11-23 11:08:49,543 INFO L273 TraceCheckUtils]: 7: Hoare triple {1017#(bvslt (bvadd main_~j~0 (_ bv4 32)) (_ bv10 32))} #t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1010#(bvslt (bvadd main_~j~0 (_ bv3 32)) (_ bv10 32))} is VALID [2018-11-23 11:08:49,544 INFO L273 TraceCheckUtils]: 6: Hoare triple {1017#(bvslt (bvadd main_~j~0 (_ bv4 32)) (_ bv10 32))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet6, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet7.base, #t~nondet7.offset; {1017#(bvslt (bvadd main_~j~0 (_ bv4 32)) (_ bv10 32))} is VALID [2018-11-23 11:08:49,545 INFO L273 TraceCheckUtils]: 5: Hoare triple {868#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4bv32);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4bv32);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40bv32);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40bv32);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0bv32; {1017#(bvslt (bvadd main_~j~0 (_ bv4 32)) (_ bv10 32))} is VALID [2018-11-23 11:08:49,545 INFO L256 TraceCheckUtils]: 4: Hoare triple {868#true} call #t~ret18 := main(); {868#true} is VALID [2018-11-23 11:08:49,546 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {868#true} {868#true} #57#return; {868#true} is VALID [2018-11-23 11:08:49,546 INFO L273 TraceCheckUtils]: 2: Hoare triple {868#true} assume true; {868#true} is VALID [2018-11-23 11:08:49,546 INFO L273 TraceCheckUtils]: 1: Hoare triple {868#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {868#true} is VALID [2018-11-23 11:08:49,546 INFO L256 TraceCheckUtils]: 0: Hoare triple {868#true} call ULTIMATE.init(); {868#true} is VALID [2018-11-23 11:08:49,547 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 11:08:49,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:08:49,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 11:08:49,549 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-23 11:08:49,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:08:49,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:08:49,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:49,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:08:49,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:08:49,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:08:49,648 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 12 states. [2018-11-23 11:08:55,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:55,363 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-11-23 11:08:55,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:08:55,364 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-23 11:08:55,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:08:55,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:08:55,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2018-11-23 11:08:55,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:08:55,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 56 transitions. [2018-11-23 11:08:55,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 56 transitions. [2018-11-23 11:08:55,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:08:55,504 INFO L225 Difference]: With dead ends: 53 [2018-11-23 11:08:55,504 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 11:08:55,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:08:55,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 11:08:55,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 11:08:55,721 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:08:55,721 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 11:08:55,722 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 11:08:55,722 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 11:08:55,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:55,724 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 11:08:55,724 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 11:08:55,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:55,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:55,725 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 11:08:55,725 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 11:08:55,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:08:55,727 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-11-23 11:08:55,728 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 11:08:55,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:08:55,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:08:55,729 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:08:55,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:08:55,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:08:55,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-11-23 11:08:55,731 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 27 [2018-11-23 11:08:55,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:08:55,731 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-11-23 11:08:55,731 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:08:55,731 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-11-23 11:08:55,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:08:55,733 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:08:55,733 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:08:55,733 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:08:55,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:08:55,733 INFO L82 PathProgramCache]: Analyzing trace with hash -551618496, now seen corresponding path program 2 times [2018-11-23 11:08:55,734 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:08:55,734 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:08:55,761 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:09:14,775 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:09:14,775 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:09:15,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:09:15,632 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:09:15,734 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:09:15,736 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 31 treesize of output 40 [2018-11-23 11:09:15,810 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:09:15,811 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:09:15,812 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 44 [2018-11-23 11:09:15,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:09:15,940 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:09:15,941 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:09:15,943 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:09:15,945 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2018-11-23 11:09:15,947 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:15,969 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:15,990 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:16,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:16,032 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:49, output treesize:40 [2018-11-23 11:09:17,793 INFO L303 Elim1Store]: Index analysis took 745 ms [2018-11-23 11:09:17,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 52 [2018-11-23 11:09:17,974 INFO L303 Elim1Store]: Index analysis took 174 ms [2018-11-23 11:09:17,975 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 11:09:18,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:20,589 INFO L303 Elim1Store]: Index analysis took 1482 ms [2018-11-23 11:09:20,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2018-11-23 11:09:20,794 INFO L303 Elim1Store]: Index analysis took 200 ms [2018-11-23 11:09:20,794 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 13 treesize of output 12 [2018-11-23 11:09:20,796 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:23,208 INFO L303 Elim1Store]: Index analysis took 1409 ms [2018-11-23 11:09:23,209 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 46 [2018-11-23 11:09:23,291 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:09:23,298 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:24,294 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:25,029 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:25,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:28,720 INFO L303 Elim1Store]: Index analysis took 253 ms [2018-11-23 11:09:28,721 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 46 [2018-11-23 11:09:28,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 11:09:28,778 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:29,258 INFO L303 Elim1Store]: Index analysis took 234 ms [2018-11-23 11:09:29,260 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 36 [2018-11-23 11:09:29,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-23 11:09:29,346 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:29,784 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:09:29,786 INFO L303 Elim1Store]: Index analysis took 250 ms [2018-11-23 11:09:29,787 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 49 [2018-11-23 11:09:29,817 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2018-11-23 11:09:29,821 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:30,001 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:30,121 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:30,257 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:30,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 30 [2018-11-23 11:09:30,962 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 14 treesize of output 13 [2018-11-23 11:09:30,964 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:31,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 43 [2018-11-23 11:09:31,205 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 21 treesize of output 20 [2018-11-23 11:09:31,210 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:31,249 INFO L267 ElimStorePlain]: Start of recursive call 16: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:31,272 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:31,543 INFO L267 ElimStorePlain]: Start of recursive call 19: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:09:31,567 INFO L267 ElimStorePlain]: Start of recursive call 18: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 11:09:31,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2018-11-23 11:09:32,003 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-11-23 11:09:32,007 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:32,078 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:09:32,127 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 45 treesize of output 70 [2018-11-23 11:09:32,157 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 1 [2018-11-23 11:09:32,159 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:32,200 INFO L267 ElimStorePlain]: Start of recursive call 22: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:32,228 INFO L267 ElimStorePlain]: Start of recursive call 20: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:32,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 5 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:32,486 INFO L202 ElimStorePlain]: Needed 23 recursive calls to eliminate 7 variables, input treesize:345, output treesize:237 [2018-11-23 11:09:34,558 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:09:34,558 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_23|, |main_~#dummy~0.base|, |main_~#a~0.base|, |v_#memory_int_26|, |v_#memory_int_27|, |v_#memory_int_28|, |v_#memory_$Pointer$.offset_23|]. (let ((.cse6 (bvmul (_ bv4 32) main_~i~0))) (let ((.cse9 (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) (_ bv0 32))) (.cse10 (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) (_ bv0 32)) .cse6))) (let ((.cse0 (select (select |#memory_$Pointer$.base| .cse9) .cse10)) (.cse1 (select (select |#memory_$Pointer$.offset| .cse9) .cse10)) (.cse2 (bvadd .cse6 |main_~#dummies~0.offset| (_ bv4 32)))) (and (= |main_~#dummies~0.offset| (_ bv0 32)) (bvsgt main_~i~0 (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (bvslt main_~i~0 (_ bv9 32)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (= (bvadd (select (select |#memory_$Pointer$.offset| .cse0) .cse1) (_ bv4 32)) main_~pa~0.offset) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= (store |v_#memory_int_27| |main_~#dummies~0.base| (store (select |v_#memory_int_27| |main_~#dummies~0.base|) .cse2 (select (select |v_#memory_int_26| |main_~#dummies~0.base|) .cse2))) |v_#memory_int_26|) (= |#memory_$Pointer$.base| (let ((.cse3 (let ((.cse4 (store |v_#memory_$Pointer$.base_23| |main_~#dummy~0.base| (store (select |v_#memory_$Pointer$.base_23| |main_~#dummy~0.base|) (_ bv0 32) |main_~#a~0.base|)))) (store .cse4 |main_~#dummies~0.base| (store (select .cse4 |main_~#dummies~0.base|) .cse2 |main_~#dummy~0.base|))))) (store .cse3 |main_~#cont~0.base| (store (select .cse3 |main_~#cont~0.base|) (_ bv0 32) |main_~#dummies~0.base|)))) (not (= |main_~#a~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (= (store |v_#memory_int_26| |main_~#cont~0.base| (store (select |v_#memory_int_26| |main_~#cont~0.base|) (_ bv0 32) (select (select |#memory_int| |main_~#cont~0.base|) (_ bv0 32)))) |#memory_int|) (= main_~pa~0.base (select (select |#memory_$Pointer$.base| .cse0) .cse1)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (let ((.cse5 (store |v_#memory_int_28| |main_~#a~0.base| (store (select |v_#memory_int_28| |main_~#a~0.base|) .cse6 main_~i~0)))) (store .cse5 |main_~#dummy~0.base| (store (select .cse5 |main_~#dummy~0.base|) (_ bv0 32) (select (select |v_#memory_int_27| |main_~#dummy~0.base|) (_ bv0 32))))) |v_#memory_int_27|) (= |#memory_$Pointer$.offset| (let ((.cse7 (let ((.cse8 (store |v_#memory_$Pointer$.offset_23| |main_~#dummy~0.base| (store (select |v_#memory_$Pointer$.offset_23| |main_~#dummy~0.base|) (_ bv0 32) (bvadd .cse6 (_ bv4294967292 32)))))) (store .cse8 |main_~#dummies~0.base| (store (select .cse8 |main_~#dummies~0.base|) .cse2 (_ bv0 32)))))) (store .cse7 |main_~#cont~0.base| (store (select .cse7 |main_~#cont~0.base|) (_ bv0 32) (bvadd |main_~#dummies~0.offset| (_ bv4 32)))))))))) [2018-11-23 11:09:34,558 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse5 (bvmul (_ bv4 32) main_~i~0))) (let ((.cse7 (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) (_ bv0 32))) (.cse6 (bvadd .cse5 |main_~#dummies~0.offset| (_ bv4 32)))) (let ((.cse4 (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) .cse6)) (.cse0 (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) (_ bv0 32))) (.cse8 (bvadd .cse7 .cse5))) (let ((.cse2 (select (select |#memory_$Pointer$.base| .cse0) .cse8)) (.cse3 (select (select |#memory_$Pointer$.offset| .cse0) .cse8)) (.cse1 (select (select |#memory_$Pointer$.base| .cse4) (_ bv0 32)))) (and (= |main_~#dummies~0.offset| (_ bv0 32)) (bvsgt main_~i~0 (_ bv0 32)) (= .cse0 |main_~#dummies~0.base|) (not (= |main_~#dummies~0.base| .cse1)) (bvslt main_~i~0 (_ bv9 32)) (= (bvadd (select (select |#memory_$Pointer$.offset| .cse2) .cse3) (_ bv4 32)) main_~pa~0.offset) (not (= .cse4 .cse1)) (= (bvadd .cse5 (_ bv4294967292 32)) (select (select |#memory_$Pointer$.offset| .cse4) (_ bv0 32))) (= (select (select |#memory_$Pointer$.offset| |main_~#dummies~0.base|) .cse6) (_ bv0 32)) (not (= .cse1 |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (= .cse7 (bvadd |main_~#dummies~0.offset| (_ bv4 32))) (= main_~pa~0.base (select (select |#memory_$Pointer$.base| .cse2) .cse3)) (not (= .cse4 |main_~#dummies~0.base|)) (= (select (select |#memory_int| .cse1) .cse5) main_~i~0)))))) [2018-11-23 11:09:34,906 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2018-11-23 11:09:34,997 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:09:35,000 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:09:35,001 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:09:35,002 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:09:35,023 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 224 [2018-11-23 11:09:35,053 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 11:09:35,055 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 95 treesize of output 71 [2018-11-23 11:09:35,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:35,134 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 35 treesize of output 19 [2018-11-23 11:09:35,136 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:35,209 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 46 treesize of output 35 [2018-11-23 11:09:35,212 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:35,238 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:35,356 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:09:35,368 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 11:09:35,370 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 174 treesize of output 100 [2018-11-23 11:09:35,420 INFO L478 Elim1Store]: Elim1 applied some 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 35 [2018-11-23 11:09:35,431 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:35,477 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 33 [2018-11-23 11:09:35,484 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:35,518 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 21 treesize of output 9 [2018-11-23 11:09:35,527 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:35,541 INFO L267 ElimStorePlain]: Start of recursive call 6: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:35,574 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:09:35,574 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 3 variables, input treesize:330, output treesize:38 [2018-11-23 11:09:35,623 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:09:35,624 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, |#memory_$Pointer$.offset|, v_main_~i~0_18]. (let ((.cse2 (bvmul (_ bv4 32) v_main_~i~0_18)) (.cse0 (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) (_ bv0 32)))) (let ((.cse12 (select |#memory_$Pointer$.base| .cse0)) (.cse13 (bvadd .cse2 (_ bv4 32)))) (let ((.cse7 (select .cse12 .cse13)) (.cse6 (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) (_ bv0 32)))) (let ((.cse11 (bvadd .cse6 .cse2)) (.cse3 (select |#memory_$Pointer$.base| .cse7)) (.cse10 (select |#memory_$Pointer$.offset| .cse0))) (let ((.cse4 (select .cse10 .cse13)) (.cse1 (select .cse3 (_ bv0 32))) (.cse5 (select |#memory_$Pointer$.offset| .cse7)) (.cse8 (select .cse12 .cse11)) (.cse9 (select .cse10 .cse11))) (and (not (= .cse0 |main_~#cont~0.base|)) (= v_main_~i~0_18 (select (select |#memory_int| .cse1) .cse2)) (= (bvadd (select (select |#memory_int| (select .cse3 .cse4)) (bvadd (select .cse5 .cse4) (_ bv4 32))) (_ bv4294967286 32)) main_~i~0) (bvsgt v_main_~i~0_18 (_ bv0 32)) (not (= |main_~#cont~0.base| .cse1)) (= (bvadd .cse6 (_ bv4294967292 32)) (_ bv0 32)) (not (= .cse0 .cse1)) (not (= .cse0 .cse7)) (= (bvadd (select (select |#memory_$Pointer$.offset| .cse8) .cse9) (_ bv4 32)) main_~pa~0.offset) (= .cse4 (_ bv0 32)) (not (= .cse7 .cse1)) (= (bvadd .cse2 (_ bv4294967292 32)) (select .cse5 (_ bv0 32))) (bvslt v_main_~i~0_18 (_ bv9 32)) (= (select (select |#memory_$Pointer$.base| .cse8) .cse9) main_~pa~0.base))))))) [2018-11-23 11:09:35,624 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~i~0_18]. (let ((.cse0 (bvmul (_ bv4 32) v_main_~i~0_18)) (.cse1 (select |#memory_int| main_~pa~0.base))) (and (= (bvadd .cse0 (_ bv4294967292 32)) (bvadd main_~pa~0.offset (_ bv4294967292 32))) (= v_main_~i~0_18 (select .cse1 .cse0)) (= main_~i~0 (bvadd (select .cse1 main_~pa~0.offset) (_ bv4294967286 32))) (bvslt v_main_~i~0_18 (_ bv9 32)) (not (= main_~pa~0.base |main_~#cont~0.base|)) (bvsgt v_main_~i~0_18 (_ bv0 32)))) [2018-11-23 11:09:36,008 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 30 treesize of output 24 [2018-11-23 11:09:36,040 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 24 treesize of output 9 [2018-11-23 11:09:36,042 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:36,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 11:09:36,074 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:09:36,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:40, output treesize:12 [2018-11-23 11:09:36,085 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 11:09:36,085 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~pa~0.base, v_main_~i~0_18]. (let ((.cse0 (select (select |#memory_int| main_~pa~0.base) (bvmul (_ bv4 32) v_main_~i~0_18)))) (and (= v_main_~i~0_18 .cse0) (= |main_#t~mem15| .cse0) (= (bvadd main_~i~0 (_ bv9 32)) .cse0) (not (= main_~pa~0.base |main_~#cont~0.base|)) (bvslt v_main_~i~0_18 (_ bv9 32)) (bvsgt v_main_~i~0_18 (_ bv0 32)))) [2018-11-23 11:09:36,085 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (bvsgt |main_#t~mem15| (_ bv0 32)) (bvslt |main_#t~mem15| (_ bv9 32)) (= (bvadd |main_#t~mem15| (_ bv4294967287 32)) main_~i~0)) [2018-11-23 11:09:36,223 INFO L256 TraceCheckUtils]: 0: Hoare triple {1267#true} call ULTIMATE.init(); {1267#true} is VALID [2018-11-23 11:09:36,224 INFO L273 TraceCheckUtils]: 1: Hoare triple {1267#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1267#true} is VALID [2018-11-23 11:09:36,224 INFO L273 TraceCheckUtils]: 2: Hoare triple {1267#true} assume true; {1267#true} is VALID [2018-11-23 11:09:36,224 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1267#true} {1267#true} #57#return; {1267#true} is VALID [2018-11-23 11:09:36,225 INFO L256 TraceCheckUtils]: 4: Hoare triple {1267#true} call #t~ret18 := main(); {1267#true} is VALID [2018-11-23 11:09:36,228 INFO L273 TraceCheckUtils]: 5: Hoare triple {1267#true} call ~#cont~0.base, ~#cont~0.offset := #Ultimate.alloc(4bv32);call ~#dummy~0.base, ~#dummy~0.offset := #Ultimate.alloc(4bv32);call ~#dummies~0.base, ~#dummies~0.offset := #Ultimate.alloc(40bv32);call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(40bv32);havoc ~i~0;havoc ~pa~0.base, ~pa~0.offset;~i~0 := #t~nondet4;havoc #t~nondet4;~j~0 := 0bv32; {1287#(and (= main_~j~0 (_ bv0 32)) (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:09:36,229 INFO L273 TraceCheckUtils]: 6: Hoare triple {1287#(and (= main_~j~0 (_ bv0 32)) (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet6, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet7.base, #t~nondet7.offset; {1287#(and (= main_~j~0 (_ bv0 32)) (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:09:36,231 INFO L273 TraceCheckUtils]: 7: Hoare triple {1287#(and (= main_~j~0 (_ bv0 32)) (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} #t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1294#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:09:36,233 INFO L273 TraceCheckUtils]: 8: Hoare triple {1294#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet6, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet7.base, #t~nondet7.offset; {1294#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:09:36,234 INFO L273 TraceCheckUtils]: 9: Hoare triple {1294#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1301#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:09:36,236 INFO L273 TraceCheckUtils]: 10: Hoare triple {1301#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet6, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet7.base, #t~nondet7.offset; {1301#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:09:36,238 INFO L273 TraceCheckUtils]: 11: Hoare triple {1301#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} #t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1308#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:09:36,240 INFO L273 TraceCheckUtils]: 12: Hoare triple {1308#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet6, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet7.base, #t~nondet7.offset; {1308#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:09:36,241 INFO L273 TraceCheckUtils]: 13: Hoare triple {1308#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} #t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1315#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:09:36,243 INFO L273 TraceCheckUtils]: 14: Hoare triple {1315#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet6, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet7.base, #t~nondet7.offset; {1315#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:09:36,245 INFO L273 TraceCheckUtils]: 15: Hoare triple {1315#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} #t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1322#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (= (bvadd main_~j~0 (_ bv4294967291 32)) (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:09:36,246 INFO L273 TraceCheckUtils]: 16: Hoare triple {1322#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (= (bvadd main_~j~0 (_ bv4294967291 32)) (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet6, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet7.base, #t~nondet7.offset; {1322#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (= (bvadd main_~j~0 (_ bv4294967291 32)) (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:09:36,248 INFO L273 TraceCheckUtils]: 17: Hoare triple {1322#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (= (bvadd main_~j~0 (_ bv4294967291 32)) (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} #t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1329#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:09:36,249 INFO L273 TraceCheckUtils]: 18: Hoare triple {1329#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet6, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet7.base, #t~nondet7.offset; {1329#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:09:36,249 INFO L273 TraceCheckUtils]: 19: Hoare triple {1329#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} #t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1336#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv7 32) main_~j~0) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:09:36,251 INFO L273 TraceCheckUtils]: 20: Hoare triple {1336#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv7 32) main_~j~0) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet6, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet7.base, #t~nondet7.offset; {1336#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv7 32) main_~j~0) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:09:36,253 INFO L273 TraceCheckUtils]: 21: Hoare triple {1336#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv7 32) main_~j~0) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} #t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1343#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:09:36,254 INFO L273 TraceCheckUtils]: 22: Hoare triple {1343#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet6, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet7.base, #t~nondet7.offset; {1343#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:09:36,256 INFO L273 TraceCheckUtils]: 23: Hoare triple {1343#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} #t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1350#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:09:36,257 INFO L273 TraceCheckUtils]: 24: Hoare triple {1350#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} assume !!~bvslt32(~j~0, 10bv32);call write~intINTTYPE4(#t~nondet6, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet6;call write~$Pointer$(#t~nondet7.base, #t~nondet7.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet7.base, #t~nondet7.offset; {1350#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:09:36,258 INFO L273 TraceCheckUtils]: 25: Hoare triple {1350#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} #t~post5 := ~j~0;~j~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1350#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:09:36,259 INFO L273 TraceCheckUtils]: 26: Hoare triple {1350#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} assume !~bvslt32(~j~0, 10bv32); {1350#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} is VALID [2018-11-23 11:09:36,277 INFO L273 TraceCheckUtils]: 27: Hoare triple {1350#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummy~0.base| |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#dummy~0.base|)) (not (= |main_~#dummies~0.base| |main_~#a~0.base|)) (= |main_~#cont~0.offset| (_ bv0 32)) (not (= |main_~#dummy~0.base| |main_~#a~0.base|)) (= (_ bv0 32) |main_~#dummy~0.offset|) (= |main_~#a~0.offset| (_ bv0 32)) (not (= |main_~#a~0.base| |main_~#cont~0.base|)))} assume ~bvsgt32(~i~0, 0bv32) && ~bvslt32(~i~0, 9bv32);call write~intINTTYPE4(~i~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~$Pointer$(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~bvsub32(~i~0, 1bv32))), ~#dummy~0.base, ~#dummy~0.offset, 4bv32);call write~$Pointer$(~#dummy~0.base, ~#dummy~0.offset, ~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);call write~$Pointer$(~#dummies~0.base, ~bvadd32(4bv32, ~#dummies~0.offset), ~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem8.base, #t~mem8.offset := read~$Pointer$(~#cont~0.base, ~#cont~0.offset, 4bv32);call #t~mem9.base, #t~mem9.offset := read~$Pointer$(#t~mem8.base, ~bvadd32(#t~mem8.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem10.base, #t~mem10.offset := read~$Pointer$(#t~mem9.base, #t~mem9.offset, 4bv32);~pa~0.base, ~pa~0.offset := #t~mem10.base, ~bvadd32(4bv32, #t~mem10.offset);havoc #t~mem9.base, #t~mem9.offset;havoc #t~mem8.base, #t~mem8.offset;havoc #t~mem10.base, #t~mem10.offset;call #t~mem11 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1363#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (bvsgt main_~i~0 (_ bv0 32)) (not (= |main_~#dummies~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32)))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) (_ bv0 32)) |main_~#dummies~0.base|) (bvslt main_~i~0 (_ bv9 32)) (= (bvadd (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) (_ bv0 32)) (bvmul (_ bv4 32) main_~i~0)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) (_ bv0 32)) (bvmul (_ bv4 32) main_~i~0)))) (_ bv4 32)) main_~pa~0.offset) (not (= (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32)))) (_ bv0 32)))) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32)))) (_ bv0 32))) (= (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) (_ bv0 32)) (_ bv4294967292 32)) |main_~#dummies~0.offset|) (= (select (select |#memory_$Pointer$.offset| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32)))) (_ bv0 32)) |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (= main_~pa~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) (_ bv0 32)) (bvmul (_ bv4 32) main_~i~0)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) (_ bv0 32)) (bvmul (_ bv4 32) main_~i~0))))) (not (= (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32))) |main_~#dummies~0.base|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32)))) (_ bv0 32))) (bvmul (_ bv4 32) main_~i~0)) main_~i~0))} is VALID [2018-11-23 11:09:36,309 INFO L273 TraceCheckUtils]: 28: Hoare triple {1363#(and (= |main_~#dummies~0.offset| (_ bv0 32)) (bvsgt main_~i~0 (_ bv0 32)) (not (= |main_~#dummies~0.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32)))) (_ bv0 32)))) (= (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) (_ bv0 32)) |main_~#dummies~0.base|) (bvslt main_~i~0 (_ bv9 32)) (= (bvadd (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) (_ bv0 32)) (bvmul (_ bv4 32) main_~i~0)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) (_ bv0 32)) (bvmul (_ bv4 32) main_~i~0)))) (_ bv4 32)) main_~pa~0.offset) (not (= (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32))) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32)))) (_ bv0 32)))) (= (bvadd (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32)))) (_ bv0 32))) (= (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) (_ bv0 32)) (_ bv4294967292 32)) |main_~#dummies~0.offset|) (= (select (select |#memory_$Pointer$.offset| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32))) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32)))) (_ bv0 32)) |main_~#cont~0.base|)) (not (= |main_~#dummies~0.base| |main_~#cont~0.base|)) (= main_~pa~0.base (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) (_ bv0 32)) (bvmul (_ bv4 32) main_~i~0)))) (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) (_ bv0 32))) (bvadd (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) (_ bv0 32)) (bvmul (_ bv4 32) main_~i~0))))) (not (= (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32))) |main_~#dummies~0.base|)) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |main_~#dummies~0.base|) (bvadd (bvmul (_ bv4 32) main_~i~0) |main_~#dummies~0.offset| (_ bv4 32)))) (_ bv0 32))) (bvmul (_ bv4 32) main_~i~0)) main_~i~0))} assume ~bvsgt32(#t~mem11, 0bv32);havoc #t~mem11;call #t~mem12.base, #t~mem12.offset := read~$Pointer$(~#dummies~0.base, ~bvadd32(~#dummies~0.offset, ~bvmul32(4bv32, ~bvadd32(1bv32, ~i~0))), 4bv32);call #t~mem13.base, #t~mem13.offset := read~$Pointer$(#t~mem12.base, #t~mem12.offset, 4bv32);call #t~mem14 := read~intINTTYPE4(#t~mem13.base, ~bvadd32(4bv32, #t~mem13.offset), 4bv32);~i~0 := ~bvsub32(#t~mem14, 10bv32);havoc #t~mem12.base, #t~mem12.offset;havoc #t~mem13.base, #t~mem13.offset;havoc #t~mem14; {1367#(and (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (= main_~pa~0.base |main_~#cont~0.base|)) (exists ((v_main_~i~0_18 (_ BitVec 32))) (and (= v_main_~i~0_18 (select (select |#memory_int| main_~pa~0.base) (bvmul (_ bv4 32) v_main_~i~0_18))) (= (bvmul (_ bv4 32) v_main_~i~0_18) main_~pa~0.offset) (bvslt v_main_~i~0_18 (_ bv9 32)) (bvsgt v_main_~i~0_18 (_ bv0 32)))))} is VALID [2018-11-23 11:09:36,311 INFO L273 TraceCheckUtils]: 29: Hoare triple {1367#(and (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (= main_~pa~0.base |main_~#cont~0.base|)) (exists ((v_main_~i~0_18 (_ BitVec 32))) (and (= v_main_~i~0_18 (select (select |#memory_int| main_~pa~0.base) (bvmul (_ bv4 32) v_main_~i~0_18))) (= (bvmul (_ bv4 32) v_main_~i~0_18) main_~pa~0.offset) (bvslt v_main_~i~0_18 (_ bv9 32)) (bvsgt v_main_~i~0_18 (_ bv0 32)))))} call #t~mem15 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1367#(and (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (= main_~pa~0.base |main_~#cont~0.base|)) (exists ((v_main_~i~0_18 (_ BitVec 32))) (and (= v_main_~i~0_18 (select (select |#memory_int| main_~pa~0.base) (bvmul (_ bv4 32) v_main_~i~0_18))) (= (bvmul (_ bv4 32) v_main_~i~0_18) main_~pa~0.offset) (bvslt v_main_~i~0_18 (_ bv9 32)) (bvsgt v_main_~i~0_18 (_ bv0 32)))))} is VALID [2018-11-23 11:09:36,317 INFO L273 TraceCheckUtils]: 30: Hoare triple {1367#(and (= (bvadd main_~i~0 (_ bv10 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (= main_~pa~0.base |main_~#cont~0.base|)) (exists ((v_main_~i~0_18 (_ BitVec 32))) (and (= v_main_~i~0_18 (select (select |#memory_int| main_~pa~0.base) (bvmul (_ bv4 32) v_main_~i~0_18))) (= (bvmul (_ bv4 32) v_main_~i~0_18) main_~pa~0.offset) (bvslt v_main_~i~0_18 (_ bv9 32)) (bvsgt v_main_~i~0_18 (_ bv0 32)))))} assume !!~bvslt32(~i~0, #t~mem15);havoc #t~mem15;#t~pre16 := ~bvadd32(1bv32, ~i~0);~i~0 := ~bvadd32(1bv32, ~i~0);havoc #t~pre16; {1374#(and (= (bvadd main_~i~0 (_ bv9 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (= main_~pa~0.base |main_~#cont~0.base|)) (exists ((v_main_~i~0_18 (_ BitVec 32))) (and (= v_main_~i~0_18 (select (select |#memory_int| main_~pa~0.base) (bvmul (_ bv4 32) v_main_~i~0_18))) (= (bvmul (_ bv4 32) v_main_~i~0_18) main_~pa~0.offset) (bvslt v_main_~i~0_18 (_ bv9 32)) (bvsgt v_main_~i~0_18 (_ bv0 32)))))} is VALID [2018-11-23 11:09:36,322 INFO L273 TraceCheckUtils]: 31: Hoare triple {1374#(and (= (bvadd main_~i~0 (_ bv9 32)) (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (not (= main_~pa~0.base |main_~#cont~0.base|)) (exists ((v_main_~i~0_18 (_ BitVec 32))) (and (= v_main_~i~0_18 (select (select |#memory_int| main_~pa~0.base) (bvmul (_ bv4 32) v_main_~i~0_18))) (= (bvmul (_ bv4 32) v_main_~i~0_18) main_~pa~0.offset) (bvslt v_main_~i~0_18 (_ bv9 32)) (bvsgt v_main_~i~0_18 (_ bv0 32)))))} call #t~mem15 := read~intINTTYPE4(~pa~0.base, ~pa~0.offset, 4bv32); {1378#(and (bvsgt |main_#t~mem15| (_ bv0 32)) (bvslt |main_#t~mem15| (_ bv9 32)) (= (bvadd |main_#t~mem15| (_ bv4294967287 32)) main_~i~0))} is VALID [2018-11-23 11:09:36,324 INFO L273 TraceCheckUtils]: 32: Hoare triple {1378#(and (bvsgt |main_#t~mem15| (_ bv0 32)) (bvslt |main_#t~mem15| (_ bv9 32)) (= (bvadd |main_#t~mem15| (_ bv4294967287 32)) main_~i~0))} assume !~bvslt32(~i~0, #t~mem15);havoc #t~mem15; {1268#false} is VALID [2018-11-23 11:09:36,325 INFO L256 TraceCheckUtils]: 33: Hoare triple {1268#false} call #t~ret17 := check(~#cont~0.base, ~#cont~0.offset, ~i~0); {1268#false} is VALID [2018-11-23 11:09:36,325 INFO L273 TraceCheckUtils]: 34: Hoare triple {1268#false} ~pc.base, ~pc.offset := #in~pc.base, #in~pc.offset;~i := #in~i;call #t~mem0.base, #t~mem0.offset := read~$Pointer$(~pc.base, ~pc.offset, 4bv32);call #t~mem1.base, #t~mem1.offset := read~$Pointer$(#t~mem0.base, ~bvadd32(#t~mem0.offset, ~bvmul32(4bv32, ~i)), 4bv32);call #t~mem2.base, #t~mem2.offset := read~$Pointer$(#t~mem1.base, #t~mem1.offset, 4bv32);call #t~mem3 := read~intINTTYPE4(#t~mem2.base, ~bvadd32(4bv32, #t~mem2.offset), 4bv32);#res := (if #t~mem3 == ~i then 1bv32 else 0bv32);havoc #t~mem3;havoc #t~mem0.base, #t~mem0.offset;havoc #t~mem1.base, #t~mem1.offset;havoc #t~mem2.base, #t~mem2.offset; {1268#false} is VALID [2018-11-23 11:09:36,325 INFO L273 TraceCheckUtils]: 35: Hoare triple {1268#false} assume true; {1268#false} is VALID [2018-11-23 11:09:36,325 INFO L268 TraceCheckUtils]: 36: Hoare quadruple {1268#false} {1268#false} #61#return; {1268#false} is VALID [2018-11-23 11:09:36,325 INFO L273 TraceCheckUtils]: 37: Hoare triple {1268#false} assume 0bv32 == #t~ret17;havoc #t~ret17; {1268#false} is VALID [2018-11-23 11:09:36,326 INFO L273 TraceCheckUtils]: 38: Hoare triple {1268#false} assume !false; {1268#false} is VALID [2018-11-23 11:09:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 101 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 11:09:36,338 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:09:40,006 INFO L303 Elim1Store]: Index analysis took 1058 ms [2018-11-23 11:09:40,007 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 1029 treesize of output 732 [2018-11-23 11:09:40,074 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 14 treesize of output 13 [2018-11-23 11:09:40,076 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 11:09:41,549 INFO L303 Elim1Store]: Index analysis took 888 ms [2018-11-23 11:09:41,723 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 731 treesize of output 606 [2018-11-23 11:10:01,851 WARN L180 SmtUtils]: Spent 14.05 s on a formula simplification. DAG size of input: 171 DAG size of output: 171 [2018-11-23 11:10:01,985 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 1290 treesize of output 1289 [2018-11-23 11:10:01,991 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:02,061 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 1406 treesize of output 1405 [2018-11-23 11:10:02,070 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:02,178 INFO L303 Elim1Store]: Index analysis took 107 ms [2018-11-23 11:10:02,179 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 461 treesize of output 460 [2018-11-23 11:10:02,182 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:02,241 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 863 treesize of output 862 [2018-11-23 11:10:02,246 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:02,318 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 633 treesize of output 632 [2018-11-23 11:10:02,323 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:02,372 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 467 treesize of output 466 [2018-11-23 11:10:02,376 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:02,503 INFO L303 Elim1Store]: Index analysis took 126 ms [2018-11-23 11:10:02,504 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 1159 treesize of output 1158 [2018-11-23 11:10:02,507 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:02,539 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 574 treesize of output 573 [2018-11-23 11:10:02,543 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:02,562 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-23 11:10:02,562 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:02,720 INFO L303 Elim1Store]: Index analysis took 156 ms [2018-11-23 11:10:02,721 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 1392 treesize of output 1391 [2018-11-23 11:10:02,726 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:02,804 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 880 treesize of output 879 [2018-11-23 11:10:02,809 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:02,918 INFO L303 Elim1Store]: Index analysis took 108 ms [2018-11-23 11:10:02,919 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 577 treesize of output 576 [2018-11-23 11:10:02,922 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:03,126 INFO L303 Elim1Store]: Index analysis took 203 ms [2018-11-23 11:10:03,127 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 639 treesize of output 638 [2018-11-23 11:10:03,131 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:03,435 INFO L303 Elim1Store]: Index analysis took 303 ms [2018-11-23 11:10:03,436 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 1448 treesize of output 1447 [2018-11-23 11:10:03,440 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:03,590 INFO L303 Elim1Store]: Index analysis took 149 ms [2018-11-23 11:10:03,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 1695 treesize of output 1694 [2018-11-23 11:10:03,595 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:03,742 INFO L303 Elim1Store]: Index analysis took 146 ms [2018-11-23 11:10:03,743 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 1081 treesize of output 1080 [2018-11-23 11:10:03,747 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:03,832 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 886 treesize of output 885 [2018-11-23 11:10:03,836 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:03,922 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 1276 treesize of output 1275 [2018-11-23 11:10:03,943 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,042 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 769 treesize of output 768 [2018-11-23 11:10:04,048 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2018-11-23 11:10:04,180 INFO L303 Elim1Store]: Index analysis took 130 ms [2018-11-23 11:10:04,180 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 583 treesize of output 582 [2018-11-23 11:10:04,187 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts.