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/array-industry-pattern/array_shadowinit_true-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:17:42,395 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:17:42,398 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:17:42,415 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:17:42,415 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:17:42,416 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:17:42,419 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:17:42,423 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:17:42,425 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:17:42,427 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:17:42,428 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:17:42,430 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:17:42,432 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:17:42,435 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:17:42,437 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:17:42,443 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:17:42,447 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:17:42,449 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:17:42,452 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:17:42,457 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:17:42,458 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:17:42,459 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:17:42,463 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:17:42,463 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:17:42,463 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:17:42,464 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:17:42,465 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:17:42,469 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:17:42,470 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:17:42,472 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:17:42,473 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:17:42,473 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:17:42,473 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:17:42,474 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:17:42,475 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:17:42,477 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:17:42,478 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 10:17:42,505 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:17:42,506 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:17:42,506 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:17:42,507 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:17:42,507 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:17:42,507 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:17:42,508 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:17:42,508 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:17:42,508 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:17:42,508 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:17:42,508 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:17:42,509 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:17:42,509 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:17:42,509 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:17:42,509 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:17:42,509 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:17:42,510 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:17:42,510 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:17:42,510 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:17:42,510 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:17:42,510 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:17:42,511 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:17:42,512 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:17:42,512 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:17:42,512 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:17:42,513 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:17:42,513 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:17:42,513 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:17:42,513 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:17:42,513 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:17:42,513 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:17:42,514 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:17:42,514 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:17:42,578 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:17:42,593 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:17:42,598 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:17:42,600 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:17:42,600 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:17:42,601 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_shadowinit_true-unreach-call_true-termination.i [2018-11-23 10:17:42,654 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb8f999ea/dfe54beb24804c2bb11be87c8102a8da/FLAG0bb22cb60 [2018-11-23 10:17:43,116 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:17:43,117 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_shadowinit_true-unreach-call_true-termination.i [2018-11-23 10:17:43,126 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb8f999ea/dfe54beb24804c2bb11be87c8102a8da/FLAG0bb22cb60 [2018-11-23 10:17:43,473 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eb8f999ea/dfe54beb24804c2bb11be87c8102a8da [2018-11-23 10:17:43,484 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:17:43,485 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:17:43,486 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:17:43,486 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:17:43,490 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:17:43,492 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:17:43" (1/1) ... [2018-11-23 10:17:43,495 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d94b8da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:43, skipping insertion in model container [2018-11-23 10:17:43,495 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:17:43" (1/1) ... [2018-11-23 10:17:43,506 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:17:43,530 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:17:43,785 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:17:43,793 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:17:43,827 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:17:43,860 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:17:43,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:43 WrapperNode [2018-11-23 10:17:43,861 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:17:43,862 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:17:43,862 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:17:43,862 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:17:43,874 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:43" (1/1) ... [2018-11-23 10:17:43,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:43" (1/1) ... [2018-11-23 10:17:43,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:17:43,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:17:43,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:17:43,896 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:17:43,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:43" (1/1) ... [2018-11-23 10:17:43,909 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:43" (1/1) ... [2018-11-23 10:17:43,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:43" (1/1) ... [2018-11-23 10:17:43,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:43" (1/1) ... [2018-11-23 10:17:43,928 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:43" (1/1) ... [2018-11-23 10:17:43,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:43" (1/1) ... [2018-11-23 10:17:43,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:43" (1/1) ... [2018-11-23 10:17:43,951 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:17:43,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:17:43,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:17:43,952 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:17:43,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:43" (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 10:17:44,089 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:17:44,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:17:44,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:17:44,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:17:44,090 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:17:44,090 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:17:44,090 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:17:44,091 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:17:44,091 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:17:44,091 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:17:44,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:17:44,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:17:44,633 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:17:44,634 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 10:17:44,634 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:17:44 BoogieIcfgContainer [2018-11-23 10:17:44,634 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:17:44,635 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:17:44,635 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:17:44,640 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:17:44,640 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:17:43" (1/3) ... [2018-11-23 10:17:44,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b93d392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:17:44, skipping insertion in model container [2018-11-23 10:17:44,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:17:43" (2/3) ... [2018-11-23 10:17:44,641 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b93d392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:17:44, skipping insertion in model container [2018-11-23 10:17:44,642 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:17:44" (3/3) ... [2018-11-23 10:17:44,643 INFO L112 eAbstractionObserver]: Analyzing ICFG array_shadowinit_true-unreach-call_true-termination.i [2018-11-23 10:17:44,654 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:17:44,662 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:17:44,680 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:17:44,714 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:17:44,715 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:17:44,715 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:17:44,715 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:17:44,716 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:17:44,716 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:17:44,716 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:17:44,717 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:17:44,717 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:17:44,736 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-11-23 10:17:44,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 10:17:44,743 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:17:44,744 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:17:44,746 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:17:44,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:17:44,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1065998934, now seen corresponding path program 1 times [2018-11-23 10:17:44,758 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:17:44,758 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 10:17:44,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:17:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:44,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:17:44,957 INFO L256 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {27#true} is VALID [2018-11-23 10:17:44,961 INFO L273 TraceCheckUtils]: 1: Hoare triple {27#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {27#true} is VALID [2018-11-23 10:17:44,962 INFO L273 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2018-11-23 10:17:44,962 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #54#return; {27#true} is VALID [2018-11-23 10:17:44,963 INFO L256 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret2 := main(); {27#true} is VALID [2018-11-23 10:17:44,963 INFO L273 TraceCheckUtils]: 5: Hoare triple {27#true} ~N~0 := #t~nondet0;havoc #t~nondet0; {27#true} is VALID [2018-11-23 10:17:44,963 INFO L273 TraceCheckUtils]: 6: Hoare triple {27#true} assume ~bvsgt32(~N~0, 0bv32);havoc ~i~0;havoc ~k~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));~i~0 := 0bv32;~k~0 := 0bv32; {27#true} is VALID [2018-11-23 10:17:44,964 INFO L273 TraceCheckUtils]: 7: Hoare triple {27#true} assume !true; {28#false} is VALID [2018-11-23 10:17:44,964 INFO L273 TraceCheckUtils]: 8: Hoare triple {28#false} ~i~0 := 0bv32; {28#false} is VALID [2018-11-23 10:17:44,965 INFO L273 TraceCheckUtils]: 9: Hoare triple {28#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {28#false} is VALID [2018-11-23 10:17:44,965 INFO L256 TraceCheckUtils]: 10: Hoare triple {28#false} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {28#false} is VALID [2018-11-23 10:17:44,965 INFO L273 TraceCheckUtils]: 11: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2018-11-23 10:17:44,966 INFO L273 TraceCheckUtils]: 12: Hoare triple {28#false} assume 0bv32 == ~cond; {28#false} is VALID [2018-11-23 10:17:44,966 INFO L273 TraceCheckUtils]: 13: Hoare triple {28#false} assume !false; {28#false} is VALID [2018-11-23 10:17:44,969 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 10:17:44,970 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:17:44,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:17:44,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:17:44,984 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 10:17:44,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:17:44,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:17:45,096 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:45,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:17:45,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:17:45,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:17:45,113 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 2 states. [2018-11-23 10:17:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:45,495 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 10:17:45,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:17:45,495 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 10:17:45,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:17:45,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:17:45,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2018-11-23 10:17:45,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:17:45,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2018-11-23 10:17:45,515 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 48 transitions. [2018-11-23 10:17:45,677 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:45,688 INFO L225 Difference]: With dead ends: 40 [2018-11-23 10:17:45,689 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 10:17:45,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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 10:17:45,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 10:17:45,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 10:17:45,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:17:45,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 10:17:45,747 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 10:17:45,748 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 10:17:45,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:45,751 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 10:17:45,751 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 10:17:45,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:45,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:45,752 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 10:17:45,753 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 10:17:45,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:45,757 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 10:17:45,757 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 10:17:45,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:45,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:45,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:17:45,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:17:45,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 10:17:45,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 10:17:45,763 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2018-11-23 10:17:45,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:17:45,763 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 10:17:45,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:17:45,764 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 10:17:45,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 10:17:45,765 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:17:45,765 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:17:45,765 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:17:45,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:17:45,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1810951506, now seen corresponding path program 1 times [2018-11-23 10:17:45,766 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:17:45,767 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 10:17:45,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:17:45,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:45,857 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:17:46,140 INFO L256 TraceCheckUtils]: 0: Hoare triple {183#true} call ULTIMATE.init(); {183#true} is VALID [2018-11-23 10:17:46,141 INFO L273 TraceCheckUtils]: 1: Hoare triple {183#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {183#true} is VALID [2018-11-23 10:17:46,141 INFO L273 TraceCheckUtils]: 2: Hoare triple {183#true} assume true; {183#true} is VALID [2018-11-23 10:17:46,141 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {183#true} {183#true} #54#return; {183#true} is VALID [2018-11-23 10:17:46,142 INFO L256 TraceCheckUtils]: 4: Hoare triple {183#true} call #t~ret2 := main(); {183#true} is VALID [2018-11-23 10:17:46,142 INFO L273 TraceCheckUtils]: 5: Hoare triple {183#true} ~N~0 := #t~nondet0;havoc #t~nondet0; {183#true} is VALID [2018-11-23 10:17:46,145 INFO L273 TraceCheckUtils]: 6: Hoare triple {183#true} assume ~bvsgt32(~N~0, 0bv32);havoc ~i~0;havoc ~k~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));~i~0 := 0bv32;~k~0 := 0bv32; {206#(and (bvsgt ~N~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:17:46,145 INFO L273 TraceCheckUtils]: 7: Hoare triple {206#(and (bvsgt ~N~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !~bvslt32(~i~0, ~N~0); {184#false} is VALID [2018-11-23 10:17:46,146 INFO L273 TraceCheckUtils]: 8: Hoare triple {184#false} ~i~0 := 0bv32; {184#false} is VALID [2018-11-23 10:17:46,146 INFO L273 TraceCheckUtils]: 9: Hoare triple {184#false} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {184#false} is VALID [2018-11-23 10:17:46,146 INFO L256 TraceCheckUtils]: 10: Hoare triple {184#false} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {184#false} is VALID [2018-11-23 10:17:46,147 INFO L273 TraceCheckUtils]: 11: Hoare triple {184#false} ~cond := #in~cond; {184#false} is VALID [2018-11-23 10:17:46,147 INFO L273 TraceCheckUtils]: 12: Hoare triple {184#false} assume 0bv32 == ~cond; {184#false} is VALID [2018-11-23 10:17:46,147 INFO L273 TraceCheckUtils]: 13: Hoare triple {184#false} assume !false; {184#false} is VALID [2018-11-23 10:17:46,149 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 10:17:46,149 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:17:46,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:17:46,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:17:46,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 10:17:46,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:17:46,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:17:46,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:46,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:17:46,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:17:46,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:17:46,195 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 3 states. [2018-11-23 10:17:46,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:46,313 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2018-11-23 10:17:46,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:17:46,314 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 10:17:46,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:17:46,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:17:46,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2018-11-23 10:17:46,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:17:46,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 31 transitions. [2018-11-23 10:17:46,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 31 transitions. [2018-11-23 10:17:46,626 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:46,627 INFO L225 Difference]: With dead ends: 29 [2018-11-23 10:17:46,627 INFO L226 Difference]: Without dead ends: 19 [2018-11-23 10:17:46,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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 10:17:46,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-11-23 10:17:46,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-23 10:17:46,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:17:46,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2018-11-23 10:17:46,759 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 10:17:46,759 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 10:17:46,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:46,761 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 10:17:46,761 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 10:17:46,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:46,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:46,762 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2018-11-23 10:17:46,763 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2018-11-23 10:17:46,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:46,765 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 10:17:46,765 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 10:17:46,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:46,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:46,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:17:46,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:17:46,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 10:17:46,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-11-23 10:17:46,768 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2018-11-23 10:17:46,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:17:46,769 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-11-23 10:17:46,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:17:46,769 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-11-23 10:17:46,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:17:46,770 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:17:46,770 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:17:46,770 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:17:46,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:17:46,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1816633037, now seen corresponding path program 1 times [2018-11-23 10:17:46,771 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:17:46,771 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 10:17:46,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:17:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:46,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:46,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:17:47,006 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 10:17:47,015 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 10:17:47,017 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:17:47,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:17:47,037 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:17:47,038 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-11-23 10:17:47,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 10:17:47,261 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:17:47,262 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 13 treesize of output 9 [2018-11-23 10:17:47,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:17:47,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:17:47,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:17:47,286 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:7 [2018-11-23 10:17:47,292 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:17:47,292 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (and (= |main_#t~mem1| (select .cse0 (bvmul (_ bv4 32) main_~i~0))) (= (_ bv0 32) (select .cse0 (_ bv0 32))) (= main_~i~0 (_ bv0 32)))) [2018-11-23 10:17:47,293 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv0 32) |main_#t~mem1|) (= main_~i~0 (_ bv0 32))) [2018-11-23 10:17:47,402 INFO L256 TraceCheckUtils]: 0: Hoare triple {334#true} call ULTIMATE.init(); {334#true} is VALID [2018-11-23 10:17:47,403 INFO L273 TraceCheckUtils]: 1: Hoare triple {334#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {334#true} is VALID [2018-11-23 10:17:47,403 INFO L273 TraceCheckUtils]: 2: Hoare triple {334#true} assume true; {334#true} is VALID [2018-11-23 10:17:47,404 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} #54#return; {334#true} is VALID [2018-11-23 10:17:47,404 INFO L256 TraceCheckUtils]: 4: Hoare triple {334#true} call #t~ret2 := main(); {334#true} is VALID [2018-11-23 10:17:47,404 INFO L273 TraceCheckUtils]: 5: Hoare triple {334#true} ~N~0 := #t~nondet0;havoc #t~nondet0; {334#true} is VALID [2018-11-23 10:17:47,406 INFO L273 TraceCheckUtils]: 6: Hoare triple {334#true} assume ~bvsgt32(~N~0, 0bv32);havoc ~i~0;havoc ~k~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));~i~0 := 0bv32;~k~0 := 0bv32; {357#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 10:17:47,416 INFO L273 TraceCheckUtils]: 7: Hoare triple {357#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {361#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:17:47,417 INFO L273 TraceCheckUtils]: 8: Hoare triple {361#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} assume !~bvslt32(~i~0, ~N~0); {361#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:17:47,418 INFO L273 TraceCheckUtils]: 9: Hoare triple {361#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} ~i~0 := 0bv32; {368#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:17:47,419 INFO L273 TraceCheckUtils]: 10: Hoare triple {368#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {372#(and (= (_ bv0 32) |main_#t~mem1|) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:17:47,421 INFO L256 TraceCheckUtils]: 11: Hoare triple {372#(and (= (_ bv0 32) |main_#t~mem1|) (= main_~i~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {376#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,422 INFO L273 TraceCheckUtils]: 12: Hoare triple {376#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {380#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:47,423 INFO L273 TraceCheckUtils]: 13: Hoare triple {380#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {335#false} is VALID [2018-11-23 10:17:47,423 INFO L273 TraceCheckUtils]: 14: Hoare triple {335#false} assume !false; {335#false} is VALID [2018-11-23 10:17:47,428 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 10:17:47,428 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:17:47,679 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2018-11-23 10:17:47,844 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-11-23 10:17:47,867 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2018-11-23 10:17:47,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:17:47,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:17:47,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:17:47,904 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:14, output treesize:3 [2018-11-23 10:17:47,911 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:17:47,911 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#a~0.base|]. (= (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) |main_~#a~0.offset|) (_ bv0 32)) [2018-11-23 10:17:47,911 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (= main_~k~0 (_ bv0 32)) [2018-11-23 10:17:47,994 INFO L273 TraceCheckUtils]: 14: Hoare triple {335#false} assume !false; {335#false} is VALID [2018-11-23 10:17:47,995 INFO L273 TraceCheckUtils]: 13: Hoare triple {390#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {335#false} is VALID [2018-11-23 10:17:47,996 INFO L273 TraceCheckUtils]: 12: Hoare triple {394#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {390#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:17:48,001 INFO L256 TraceCheckUtils]: 11: Hoare triple {398#(= main_~i~0 |main_#t~mem1|)} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {394#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:17:48,003 INFO L273 TraceCheckUtils]: 10: Hoare triple {402#(= main_~i~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {398#(= main_~i~0 |main_#t~mem1|)} is VALID [2018-11-23 10:17:48,004 INFO L273 TraceCheckUtils]: 9: Hoare triple {406#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} ~i~0 := 0bv32; {402#(= main_~i~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} is VALID [2018-11-23 10:17:48,006 INFO L273 TraceCheckUtils]: 8: Hoare triple {406#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} assume !~bvslt32(~i~0, ~N~0); {406#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-23 10:17:48,008 INFO L273 TraceCheckUtils]: 7: Hoare triple {413#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {406#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-23 10:17:48,015 INFO L273 TraceCheckUtils]: 6: Hoare triple {334#true} assume ~bvsgt32(~N~0, 0bv32);havoc ~i~0;havoc ~k~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));~i~0 := 0bv32;~k~0 := 0bv32; {413#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 10:17:48,015 INFO L273 TraceCheckUtils]: 5: Hoare triple {334#true} ~N~0 := #t~nondet0;havoc #t~nondet0; {334#true} is VALID [2018-11-23 10:17:48,016 INFO L256 TraceCheckUtils]: 4: Hoare triple {334#true} call #t~ret2 := main(); {334#true} is VALID [2018-11-23 10:17:48,016 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} #54#return; {334#true} is VALID [2018-11-23 10:17:48,016 INFO L273 TraceCheckUtils]: 2: Hoare triple {334#true} assume true; {334#true} is VALID [2018-11-23 10:17:48,016 INFO L273 TraceCheckUtils]: 1: Hoare triple {334#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {334#true} is VALID [2018-11-23 10:17:48,017 INFO L256 TraceCheckUtils]: 0: Hoare triple {334#true} call ULTIMATE.init(); {334#true} is VALID [2018-11-23 10:17:48,018 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 10:17:48,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:17:48,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 10:17:48,021 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2018-11-23 10:17:48,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:17:48,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 10:17:48,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:48,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 10:17:48,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 10:17:48,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-11-23 10:17:48,090 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 14 states. [2018-11-23 10:17:49,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:49,156 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2018-11-23 10:17:49,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 10:17:49,156 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2018-11-23 10:17:49,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:17:49,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 10:17:49,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2018-11-23 10:17:49,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 10:17:49,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 36 transitions. [2018-11-23 10:17:49,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 36 transitions. [2018-11-23 10:17:49,239 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:49,242 INFO L225 Difference]: With dead ends: 33 [2018-11-23 10:17:49,242 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 10:17:49,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:17:49,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 10:17:49,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2018-11-23 10:17:49,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:17:49,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 27 states. [2018-11-23 10:17:49,283 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 27 states. [2018-11-23 10:17:49,283 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 27 states. [2018-11-23 10:17:49,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:49,288 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-23 10:17:49,288 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-23 10:17:49,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:49,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:49,289 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 31 states. [2018-11-23 10:17:49,289 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 31 states. [2018-11-23 10:17:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:49,293 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-23 10:17:49,293 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-23 10:17:49,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:49,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:49,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:17:49,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:17:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 10:17:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-23 10:17:49,297 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 15 [2018-11-23 10:17:49,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:17:49,297 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-23 10:17:49,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 10:17:49,298 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 10:17:49,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:17:49,299 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:17:49,299 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:17:49,299 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:17:49,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:17:49,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1692363122, now seen corresponding path program 2 times [2018-11-23 10:17:49,300 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:17:49,300 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 10:17:49,322 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:17:49,379 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:17:49,379 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:17:49,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:49,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:17:49,450 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 10:17:49,456 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 10:17:49,459 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:17:49,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:17:49,474 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:17:49,475 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-23 10:17:49,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-23 10:17:49,522 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:49,524 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:49,526 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-11-23 10:17:49,543 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:17:49,562 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:17:49,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:17:49,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-11-23 10:17:49,700 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 10:17:49,714 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:49,715 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:17:49,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:49,717 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2018-11-23 10:17:49,720 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:17:49,728 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:17:49,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:17:49,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:7 [2018-11-23 10:17:49,742 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:17:49,742 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (and (= (_ bv1 32) (select .cse0 (_ bv4 32))) (= |main_#t~mem1| (select .cse0 (bvmul (_ bv4 32) main_~i~0))) (= (_ bv0 32) (select .cse0 (_ bv0 32))) (= main_~i~0 (_ bv0 32)))) [2018-11-23 10:17:49,743 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv0 32) |main_#t~mem1|) (= main_~i~0 (_ bv0 32))) [2018-11-23 10:17:49,864 INFO L256 TraceCheckUtils]: 0: Hoare triple {591#true} call ULTIMATE.init(); {591#true} is VALID [2018-11-23 10:17:49,865 INFO L273 TraceCheckUtils]: 1: Hoare triple {591#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {591#true} is VALID [2018-11-23 10:17:49,865 INFO L273 TraceCheckUtils]: 2: Hoare triple {591#true} assume true; {591#true} is VALID [2018-11-23 10:17:49,866 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {591#true} {591#true} #54#return; {591#true} is VALID [2018-11-23 10:17:49,866 INFO L256 TraceCheckUtils]: 4: Hoare triple {591#true} call #t~ret2 := main(); {591#true} is VALID [2018-11-23 10:17:49,867 INFO L273 TraceCheckUtils]: 5: Hoare triple {591#true} ~N~0 := #t~nondet0;havoc #t~nondet0; {591#true} is VALID [2018-11-23 10:17:49,870 INFO L273 TraceCheckUtils]: 6: Hoare triple {591#true} assume ~bvsgt32(~N~0, 0bv32);havoc ~i~0;havoc ~k~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));~i~0 := 0bv32;~k~0 := 0bv32; {614#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 10:17:49,873 INFO L273 TraceCheckUtils]: 7: Hoare triple {614#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {618#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:17:49,876 INFO L273 TraceCheckUtils]: 8: Hoare triple {618#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {622#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:17:49,878 INFO L273 TraceCheckUtils]: 9: Hoare triple {622#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} assume !~bvslt32(~i~0, ~N~0); {622#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:17:49,879 INFO L273 TraceCheckUtils]: 10: Hoare triple {622#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} ~i~0 := 0bv32; {629#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:17:49,880 INFO L273 TraceCheckUtils]: 11: Hoare triple {629#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {633#(and (= (_ bv0 32) |main_#t~mem1|) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:17:49,882 INFO L256 TraceCheckUtils]: 12: Hoare triple {633#(and (= (_ bv0 32) |main_#t~mem1|) (= main_~i~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {637#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:49,883 INFO L273 TraceCheckUtils]: 13: Hoare triple {637#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {641#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:49,886 INFO L273 TraceCheckUtils]: 14: Hoare triple {641#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {592#false} is VALID [2018-11-23 10:17:49,886 INFO L273 TraceCheckUtils]: 15: Hoare triple {592#false} assume !false; {592#false} is VALID [2018-11-23 10:17:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:17:49,888 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:17:50,144 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2018-11-23 10:17:50,159 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 26 [2018-11-23 10:17:50,245 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 17 treesize of output 6 [2018-11-23 10:17:50,248 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 10:17:50,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2018-11-23 10:17:50,297 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 10:17:50,308 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:17:50,314 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:17:50,320 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:17:50,321 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:24, output treesize:9 [2018-11-23 10:17:50,327 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:17:50,327 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#a~0.base|]. (= (_ bv0 32) (select (let ((.cse0 (bvmul (_ bv4 32) main_~k~0))) (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| .cse0) main_~k~0) (bvadd |main_~#a~0.offset| .cse0 (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32)))) |main_~#a~0.offset|)) [2018-11-23 10:17:50,328 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (or (= (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32))) [2018-11-23 10:17:50,381 INFO L273 TraceCheckUtils]: 15: Hoare triple {592#false} assume !false; {592#false} is VALID [2018-11-23 10:17:50,383 INFO L273 TraceCheckUtils]: 14: Hoare triple {651#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {592#false} is VALID [2018-11-23 10:17:50,384 INFO L273 TraceCheckUtils]: 13: Hoare triple {655#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {651#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:17:50,385 INFO L256 TraceCheckUtils]: 12: Hoare triple {659#(= main_~i~0 |main_#t~mem1|)} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {655#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:17:50,385 INFO L273 TraceCheckUtils]: 11: Hoare triple {663#(= main_~i~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {659#(= main_~i~0 |main_#t~mem1|)} is VALID [2018-11-23 10:17:50,387 INFO L273 TraceCheckUtils]: 10: Hoare triple {667#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} ~i~0 := 0bv32; {663#(= main_~i~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} is VALID [2018-11-23 10:17:50,387 INFO L273 TraceCheckUtils]: 9: Hoare triple {667#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} assume !~bvslt32(~i~0, ~N~0); {667#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-23 10:17:50,416 INFO L273 TraceCheckUtils]: 8: Hoare triple {674#(= (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) |main_~#a~0.offset|) (_ bv0 32))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {667#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-23 10:17:50,438 INFO L273 TraceCheckUtils]: 7: Hoare triple {678#(or (= (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {674#(= (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-23 10:17:50,440 INFO L273 TraceCheckUtils]: 6: Hoare triple {591#true} assume ~bvsgt32(~N~0, 0bv32);havoc ~i~0;havoc ~k~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));~i~0 := 0bv32;~k~0 := 0bv32; {678#(or (= (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 10:17:50,441 INFO L273 TraceCheckUtils]: 5: Hoare triple {591#true} ~N~0 := #t~nondet0;havoc #t~nondet0; {591#true} is VALID [2018-11-23 10:17:50,441 INFO L256 TraceCheckUtils]: 4: Hoare triple {591#true} call #t~ret2 := main(); {591#true} is VALID [2018-11-23 10:17:50,441 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {591#true} {591#true} #54#return; {591#true} is VALID [2018-11-23 10:17:50,442 INFO L273 TraceCheckUtils]: 2: Hoare triple {591#true} assume true; {591#true} is VALID [2018-11-23 10:17:50,442 INFO L273 TraceCheckUtils]: 1: Hoare triple {591#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {591#true} is VALID [2018-11-23 10:17:50,442 INFO L256 TraceCheckUtils]: 0: Hoare triple {591#true} call ULTIMATE.init(); {591#true} is VALID [2018-11-23 10:17:50,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:17:50,445 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:17:50,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 10:17:50,445 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-11-23 10:17:50,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:17:50,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 10:17:50,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:50,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 10:17:50,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 10:17:50,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:17:50,535 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 16 states. [2018-11-23 10:17:53,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:53,024 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2018-11-23 10:17:53,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 10:17:53,024 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2018-11-23 10:17:53,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:17:53,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 10:17:53,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 62 transitions. [2018-11-23 10:17:53,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 10:17:53,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 62 transitions. [2018-11-23 10:17:53,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 62 transitions. [2018-11-23 10:17:53,302 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:53,307 INFO L225 Difference]: With dead ends: 56 [2018-11-23 10:17:53,307 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 10:17:53,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=123, Invalid=527, Unknown=0, NotChecked=0, Total=650 [2018-11-23 10:17:53,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 10:17:53,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2018-11-23 10:17:53,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:17:53,407 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 40 states. [2018-11-23 10:17:53,408 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 40 states. [2018-11-23 10:17:53,408 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 40 states. [2018-11-23 10:17:53,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:53,413 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2018-11-23 10:17:53,413 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-23 10:17:53,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:53,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:53,415 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 54 states. [2018-11-23 10:17:53,415 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 54 states. [2018-11-23 10:17:53,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:17:53,419 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2018-11-23 10:17:53,420 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-23 10:17:53,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:17:53,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:17:53,421 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:17:53,421 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:17:53,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 10:17:53,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2018-11-23 10:17:53,424 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 16 [2018-11-23 10:17:53,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:17:53,425 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2018-11-23 10:17:53,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 10:17:53,425 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-23 10:17:53,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 10:17:53,426 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:17:53,426 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:17:53,427 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:17:53,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:17:53,427 INFO L82 PathProgramCache]: Analyzing trace with hash -601924206, now seen corresponding path program 3 times [2018-11-23 10:17:53,427 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:17:53,428 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 10:17:53,455 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:17:53,555 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 10:17:53,555 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:17:53,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:17:53,603 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:17:53,646 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 10:17:53,652 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 10:17:53,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:17:53,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:17:53,675 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:17:53,675 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-23 10:17:53,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-23 10:17:53,821 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:53,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:53,827 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-11-23 10:17:53,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:17:53,844 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:17:53,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:17:53,859 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-23 10:17:53,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-11-23 10:17:53,930 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:53,931 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:53,933 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:53,937 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:53,938 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:53,941 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:53,943 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 95 [2018-11-23 10:17:53,948 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:17:53,969 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:17:53,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:17:53,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-11-23 10:17:54,209 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2018-11-23 10:17:54,244 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2018-11-23 10:17:54,258 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:54,259 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:54,261 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:54,263 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:54,266 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:54,268 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:54,272 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:54,274 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:54,276 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:54,279 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:54,282 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:54,283 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:54,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 151 [2018-11-23 10:17:54,288 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:17:54,327 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:17:54,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:17:54,345 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:44, output treesize:40 [2018-11-23 10:17:54,536 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 30 [2018-11-23 10:17:54,658 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:54,675 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:54,677 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:54,677 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:17:54,679 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:54,681 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:54,683 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:54,683 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:54,684 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:54,685 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:17:54,687 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 39 [2018-11-23 10:17:54,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:17:54,709 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:17:54,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:17:54,715 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:7 [2018-11-23 10:17:54,721 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:17:54,721 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (and (= (_ bv1 32) (select .cse0 (_ bv4 32))) (= |main_#t~mem1| (select .cse0 (bvmul (_ bv4 32) main_~i~0))) (= (_ bv0 32) (select .cse0 (_ bv0 32))) (= (_ bv3 32) (select .cse0 (_ bv12 32))) (= main_~i~0 (_ bv0 32)) (= (bvadd (select .cse0 (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32)))) [2018-11-23 10:17:54,722 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv0 32) |main_#t~mem1|) (= main_~i~0 (_ bv0 32))) [2018-11-23 10:17:54,829 INFO L256 TraceCheckUtils]: 0: Hoare triple {974#true} call ULTIMATE.init(); {974#true} is VALID [2018-11-23 10:17:54,830 INFO L273 TraceCheckUtils]: 1: Hoare triple {974#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {974#true} is VALID [2018-11-23 10:17:54,830 INFO L273 TraceCheckUtils]: 2: Hoare triple {974#true} assume true; {974#true} is VALID [2018-11-23 10:17:54,830 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {974#true} {974#true} #54#return; {974#true} is VALID [2018-11-23 10:17:54,830 INFO L256 TraceCheckUtils]: 4: Hoare triple {974#true} call #t~ret2 := main(); {974#true} is VALID [2018-11-23 10:17:54,831 INFO L273 TraceCheckUtils]: 5: Hoare triple {974#true} ~N~0 := #t~nondet0;havoc #t~nondet0; {974#true} is VALID [2018-11-23 10:17:54,831 INFO L273 TraceCheckUtils]: 6: Hoare triple {974#true} assume ~bvsgt32(~N~0, 0bv32);havoc ~i~0;havoc ~k~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));~i~0 := 0bv32;~k~0 := 0bv32; {997#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 10:17:54,833 INFO L273 TraceCheckUtils]: 7: Hoare triple {997#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {1001#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:17:54,835 INFO L273 TraceCheckUtils]: 8: Hoare triple {1001#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {1005#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 10:17:54,838 INFO L273 TraceCheckUtils]: 9: Hoare triple {1005#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {1009#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:17:54,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {1009#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {1013#(and (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:17:54,844 INFO L273 TraceCheckUtils]: 11: Hoare triple {1013#(and (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} assume !~bvslt32(~i~0, ~N~0); {1013#(and (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:17:54,845 INFO L273 TraceCheckUtils]: 12: Hoare triple {1013#(and (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)))} ~i~0 := 0bv32; {1020#(and (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:17:54,846 INFO L273 TraceCheckUtils]: 13: Hoare triple {1020#(and (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))) (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1024#(and (= (_ bv0 32) |main_#t~mem1|) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:17:54,847 INFO L256 TraceCheckUtils]: 14: Hoare triple {1024#(and (= (_ bv0 32) |main_#t~mem1|) (= main_~i~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {1028#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:54,854 INFO L273 TraceCheckUtils]: 15: Hoare triple {1028#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1032#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:17:54,855 INFO L273 TraceCheckUtils]: 16: Hoare triple {1032#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {975#false} is VALID [2018-11-23 10:17:54,855 INFO L273 TraceCheckUtils]: 17: Hoare triple {975#false} assume !false; {975#false} is VALID [2018-11-23 10:17:54,857 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:17:54,857 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:17:55,493 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2018-11-23 10:17:55,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 46 [2018-11-23 10:17:55,548 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:17:55,549 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:17:55,550 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 46 treesize of output 72 [2018-11-23 10:17:55,616 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:17:55,617 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:17:55,617 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:17:55,619 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:17:55,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 123 [2018-11-23 10:17:55,856 WARN L180 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2018-11-23 10:17:55,915 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:17:55,918 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:17:55,923 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:17:55,928 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:17:55,934 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:17:55,941 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:17:55,988 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 100 [2018-11-23 10:17:56,024 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-11-23 10:17:56,031 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:17:56,033 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:17:56,033 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:17:56,035 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:17:56,036 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:17:56,037 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:17:56,040 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 61 [2018-11-23 10:17:56,043 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-23 10:17:56,131 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 10:17:56,177 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 10:17:56,217 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 10:17:56,257 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 10:17:56,301 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 10:17:56,301 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:44, output treesize:76 [2018-11-23 10:17:56,310 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:17:56,310 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#a~0.base|]. (= (_ bv0 32) (select (let ((.cse0 (bvmul (_ bv4 32) main_~k~0))) (store (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| .cse0) main_~k~0) (bvadd |main_~#a~0.offset| .cse0 (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| .cse0 (_ bv8 32)) (bvadd main_~k~0 (_ bv2 32))) (bvadd |main_~#a~0.offset| .cse0 (_ bv12 32)) (bvadd main_~k~0 (_ bv3 32)))) |main_~#a~0.offset|)) [2018-11-23 10:17:56,310 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (let ((.cse4 (bvmul (_ bv4 32) main_~k~0))) (let ((.cse2 (= (bvadd |main_~#a~0.offset| .cse4) |main_~#a~0.offset|)) (.cse3 (= |main_~#a~0.offset| (bvadd |main_~#a~0.offset| .cse4 (_ bv4 32)))) (.cse0 (= (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32))) (.cse1 (= |main_~#a~0.offset| (bvadd |main_~#a~0.offset| .cse4 (_ bv8 32))))) (and (or (= (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32)) .cse0 .cse1 .cse2) (or .cse3 .cse0 (= (_ bv4294967294 32) main_~k~0) .cse2) (or .cse3 .cse0 (= main_~k~0 (_ bv0 32)) .cse1)))) [2018-11-23 10:17:56,492 INFO L273 TraceCheckUtils]: 17: Hoare triple {975#false} assume !false; {975#false} is VALID [2018-11-23 10:17:56,500 INFO L273 TraceCheckUtils]: 16: Hoare triple {1042#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {975#false} is VALID [2018-11-23 10:17:56,501 INFO L273 TraceCheckUtils]: 15: Hoare triple {1046#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1042#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:17:56,502 INFO L256 TraceCheckUtils]: 14: Hoare triple {1050#(= main_~i~0 |main_#t~mem1|)} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {1046#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:17:56,513 INFO L273 TraceCheckUtils]: 13: Hoare triple {1054#(= main_~i~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1050#(= main_~i~0 |main_#t~mem1|)} is VALID [2018-11-23 10:17:56,514 INFO L273 TraceCheckUtils]: 12: Hoare triple {1058#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} ~i~0 := 0bv32; {1054#(= main_~i~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} is VALID [2018-11-23 10:17:56,515 INFO L273 TraceCheckUtils]: 11: Hoare triple {1058#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} assume !~bvslt32(~i~0, ~N~0); {1058#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-23 10:17:56,538 INFO L273 TraceCheckUtils]: 10: Hoare triple {1065#(= (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) |main_~#a~0.offset|) (_ bv0 32))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {1058#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-23 10:17:56,556 INFO L273 TraceCheckUtils]: 9: Hoare triple {1069#(= (_ bv0 32) (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) |main_~#a~0.offset|))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {1065#(= (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-23 10:17:56,575 INFO L273 TraceCheckUtils]: 8: Hoare triple {1073#(= (select (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv8 32)) (bvadd main_~k~0 (_ bv2 32))) |main_~#a~0.offset|) (_ bv0 32))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {1069#(= (_ bv0 32) (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) |main_~#a~0.offset|))} is VALID [2018-11-23 10:17:56,601 INFO L273 TraceCheckUtils]: 7: Hoare triple {1077#(and (or (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32)) (= (_ bv4294967294 32) main_~k~0) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32))) (or (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32))) (or (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32))))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {1073#(= (select (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv8 32)) (bvadd main_~k~0 (_ bv2 32))) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-23 10:17:56,602 INFO L273 TraceCheckUtils]: 6: Hoare triple {974#true} assume ~bvsgt32(~N~0, 0bv32);havoc ~i~0;havoc ~k~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));~i~0 := 0bv32;~k~0 := 0bv32; {1077#(and (or (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32)) (= (_ bv4294967294 32) main_~k~0) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32))) (or (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32))) (or (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32))))} is VALID [2018-11-23 10:17:56,602 INFO L273 TraceCheckUtils]: 5: Hoare triple {974#true} ~N~0 := #t~nondet0;havoc #t~nondet0; {974#true} is VALID [2018-11-23 10:17:56,602 INFO L256 TraceCheckUtils]: 4: Hoare triple {974#true} call #t~ret2 := main(); {974#true} is VALID [2018-11-23 10:17:56,603 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {974#true} {974#true} #54#return; {974#true} is VALID [2018-11-23 10:17:56,603 INFO L273 TraceCheckUtils]: 2: Hoare triple {974#true} assume true; {974#true} is VALID [2018-11-23 10:17:56,603 INFO L273 TraceCheckUtils]: 1: Hoare triple {974#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {974#true} is VALID [2018-11-23 10:17:56,603 INFO L256 TraceCheckUtils]: 0: Hoare triple {974#true} call ULTIMATE.init(); {974#true} is VALID [2018-11-23 10:17:56,606 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:17:56,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:17:56,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2018-11-23 10:17:56,619 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 18 [2018-11-23 10:17:56,620 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:17:56,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 10:17:56,750 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:17:56,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 10:17:56,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 10:17:56,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2018-11-23 10:17:56,751 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand 20 states. [2018-11-23 10:18:02,524 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2018-11-23 10:18:04,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:18:04,287 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2018-11-23 10:18:04,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 10:18:04,287 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 18 [2018-11-23 10:18:04,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:18:04,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 10:18:04,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 10:18:04,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 10:18:04,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 106 transitions. [2018-11-23 10:18:04,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 106 transitions. [2018-11-23 10:18:04,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:18:04,592 INFO L225 Difference]: With dead ends: 98 [2018-11-23 10:18:04,592 INFO L226 Difference]: Without dead ends: 96 [2018-11-23 10:18:04,593 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=308, Invalid=1252, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 10:18:04,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-11-23 10:18:04,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 55. [2018-11-23 10:18:04,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:18:04,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand 55 states. [2018-11-23 10:18:04,822 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 55 states. [2018-11-23 10:18:04,822 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 55 states. [2018-11-23 10:18:04,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:18:04,829 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2018-11-23 10:18:04,829 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2018-11-23 10:18:04,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:18:04,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:18:04,831 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 96 states. [2018-11-23 10:18:04,831 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 96 states. [2018-11-23 10:18:04,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:18:04,838 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2018-11-23 10:18:04,838 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2018-11-23 10:18:04,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:18:04,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:18:04,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:18:04,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:18:04,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 10:18:04,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2018-11-23 10:18:04,844 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 18 [2018-11-23 10:18:04,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:18:04,844 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2018-11-23 10:18:04,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 10:18:04,844 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2018-11-23 10:18:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 10:18:04,846 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:18:04,846 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:18:04,846 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:18:04,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:18:04,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1919305976, now seen corresponding path program 1 times [2018-11-23 10:18:04,847 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:18:04,847 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 10:18:04,868 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:18:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:18:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:18:04,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:18:05,230 INFO L256 TraceCheckUtils]: 0: Hoare triple {1567#true} call ULTIMATE.init(); {1567#true} is VALID [2018-11-23 10:18:05,231 INFO L273 TraceCheckUtils]: 1: Hoare triple {1567#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {1567#true} is VALID [2018-11-23 10:18:05,231 INFO L273 TraceCheckUtils]: 2: Hoare triple {1567#true} assume true; {1567#true} is VALID [2018-11-23 10:18:05,232 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1567#true} {1567#true} #54#return; {1567#true} is VALID [2018-11-23 10:18:05,232 INFO L256 TraceCheckUtils]: 4: Hoare triple {1567#true} call #t~ret2 := main(); {1567#true} is VALID [2018-11-23 10:18:05,232 INFO L273 TraceCheckUtils]: 5: Hoare triple {1567#true} ~N~0 := #t~nondet0;havoc #t~nondet0; {1567#true} is VALID [2018-11-23 10:18:05,235 INFO L273 TraceCheckUtils]: 6: Hoare triple {1567#true} assume ~bvsgt32(~N~0, 0bv32);havoc ~i~0;havoc ~k~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));~i~0 := 0bv32;~k~0 := 0bv32; {1590#(and (bvsgt ~N~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:18:05,236 INFO L273 TraceCheckUtils]: 7: Hoare triple {1590#(and (bvsgt ~N~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {1594#(and (bvsgt ~N~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:18:05,237 INFO L273 TraceCheckUtils]: 8: Hoare triple {1594#(and (bvsgt ~N~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~N~0); {1598#(and (bvsgt ~N~0 (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0)))} is VALID [2018-11-23 10:18:05,237 INFO L273 TraceCheckUtils]: 9: Hoare triple {1598#(and (bvsgt ~N~0 (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0)))} ~i~0 := 0bv32; {1602#(and (bvsgt ~N~0 (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:18:05,238 INFO L273 TraceCheckUtils]: 10: Hoare triple {1602#(and (bvsgt ~N~0 (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1602#(and (bvsgt ~N~0 (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:18:05,240 INFO L256 TraceCheckUtils]: 11: Hoare triple {1602#(and (bvsgt ~N~0 (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0)) (= main_~i~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {1598#(and (bvsgt ~N~0 (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0)))} is VALID [2018-11-23 10:18:05,257 INFO L273 TraceCheckUtils]: 12: Hoare triple {1598#(and (bvsgt ~N~0 (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0)))} ~cond := #in~cond; {1598#(and (bvsgt ~N~0 (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0)))} is VALID [2018-11-23 10:18:05,264 INFO L273 TraceCheckUtils]: 13: Hoare triple {1598#(and (bvsgt ~N~0 (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0)))} assume !(0bv32 == ~cond); {1598#(and (bvsgt ~N~0 (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0)))} is VALID [2018-11-23 10:18:05,265 INFO L273 TraceCheckUtils]: 14: Hoare triple {1598#(and (bvsgt ~N~0 (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0)))} assume true; {1598#(and (bvsgt ~N~0 (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0)))} is VALID [2018-11-23 10:18:05,266 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1598#(and (bvsgt ~N~0 (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0)))} {1602#(and (bvsgt ~N~0 (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0)) (= main_~i~0 (_ bv0 32)))} #58#return; {1602#(and (bvsgt ~N~0 (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:18:05,267 INFO L273 TraceCheckUtils]: 16: Hoare triple {1602#(and (bvsgt ~N~0 (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0)) (= main_~i~0 (_ bv0 32)))} havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0); {1624#(and (bvsgt ~N~0 (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:18:05,268 INFO L273 TraceCheckUtils]: 17: Hoare triple {1624#(and (bvsgt ~N~0 (_ bv0 32)) (not (bvslt (_ bv1 32) ~N~0)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1568#false} is VALID [2018-11-23 10:18:05,269 INFO L256 TraceCheckUtils]: 18: Hoare triple {1568#false} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {1568#false} is VALID [2018-11-23 10:18:05,269 INFO L273 TraceCheckUtils]: 19: Hoare triple {1568#false} ~cond := #in~cond; {1568#false} is VALID [2018-11-23 10:18:05,269 INFO L273 TraceCheckUtils]: 20: Hoare triple {1568#false} assume 0bv32 == ~cond; {1568#false} is VALID [2018-11-23 10:18:05,269 INFO L273 TraceCheckUtils]: 21: Hoare triple {1568#false} assume !false; {1568#false} is VALID [2018-11-23 10:18:05,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:18:05,272 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:18:05,465 INFO L273 TraceCheckUtils]: 21: Hoare triple {1568#false} assume !false; {1568#false} is VALID [2018-11-23 10:18:05,465 INFO L273 TraceCheckUtils]: 20: Hoare triple {1568#false} assume 0bv32 == ~cond; {1568#false} is VALID [2018-11-23 10:18:05,466 INFO L273 TraceCheckUtils]: 19: Hoare triple {1568#false} ~cond := #in~cond; {1568#false} is VALID [2018-11-23 10:18:05,466 INFO L256 TraceCheckUtils]: 18: Hoare triple {1568#false} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {1568#false} is VALID [2018-11-23 10:18:05,467 INFO L273 TraceCheckUtils]: 17: Hoare triple {1652#(not (bvslt main_~i~0 ~N~0))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1568#false} is VALID [2018-11-23 10:18:05,467 INFO L273 TraceCheckUtils]: 16: Hoare triple {1656#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~N~0))} havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0); {1652#(not (bvslt main_~i~0 ~N~0))} is VALID [2018-11-23 10:18:05,469 INFO L268 TraceCheckUtils]: 15: Hoare quadruple {1567#true} {1656#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~N~0))} #58#return; {1656#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~N~0))} is VALID [2018-11-23 10:18:05,469 INFO L273 TraceCheckUtils]: 14: Hoare triple {1567#true} assume true; {1567#true} is VALID [2018-11-23 10:18:05,469 INFO L273 TraceCheckUtils]: 13: Hoare triple {1567#true} assume !(0bv32 == ~cond); {1567#true} is VALID [2018-11-23 10:18:05,470 INFO L273 TraceCheckUtils]: 12: Hoare triple {1567#true} ~cond := #in~cond; {1567#true} is VALID [2018-11-23 10:18:05,470 INFO L256 TraceCheckUtils]: 11: Hoare triple {1656#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~N~0))} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {1567#true} is VALID [2018-11-23 10:18:05,471 INFO L273 TraceCheckUtils]: 10: Hoare triple {1656#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~N~0))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1656#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~N~0))} is VALID [2018-11-23 10:18:05,472 INFO L273 TraceCheckUtils]: 9: Hoare triple {1678#(not (bvslt (_ bv1 32) ~N~0))} ~i~0 := 0bv32; {1656#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~N~0))} is VALID [2018-11-23 10:18:05,474 INFO L273 TraceCheckUtils]: 8: Hoare triple {1682#(or (bvslt main_~i~0 ~N~0) (not (bvslt (_ bv1 32) ~N~0)))} assume !~bvslt32(~i~0, ~N~0); {1678#(not (bvslt (_ bv1 32) ~N~0))} is VALID [2018-11-23 10:18:05,474 INFO L273 TraceCheckUtils]: 7: Hoare triple {1686#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) ~N~0) (not (bvslt (_ bv1 32) ~N~0)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {1682#(or (bvslt main_~i~0 ~N~0) (not (bvslt (_ bv1 32) ~N~0)))} is VALID [2018-11-23 10:18:05,476 INFO L273 TraceCheckUtils]: 6: Hoare triple {1567#true} assume ~bvsgt32(~N~0, 0bv32);havoc ~i~0;havoc ~k~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));~i~0 := 0bv32;~k~0 := 0bv32; {1686#(or (bvslt (bvadd main_~i~0 (_ bv1 32)) ~N~0) (not (bvslt (_ bv1 32) ~N~0)))} is VALID [2018-11-23 10:18:05,476 INFO L273 TraceCheckUtils]: 5: Hoare triple {1567#true} ~N~0 := #t~nondet0;havoc #t~nondet0; {1567#true} is VALID [2018-11-23 10:18:05,476 INFO L256 TraceCheckUtils]: 4: Hoare triple {1567#true} call #t~ret2 := main(); {1567#true} is VALID [2018-11-23 10:18:05,476 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1567#true} {1567#true} #54#return; {1567#true} is VALID [2018-11-23 10:18:05,477 INFO L273 TraceCheckUtils]: 2: Hoare triple {1567#true} assume true; {1567#true} is VALID [2018-11-23 10:18:05,477 INFO L273 TraceCheckUtils]: 1: Hoare triple {1567#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {1567#true} is VALID [2018-11-23 10:18:05,477 INFO L256 TraceCheckUtils]: 0: Hoare triple {1567#true} call ULTIMATE.init(); {1567#true} is VALID [2018-11-23 10:18:05,477 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:18:05,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:18:05,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:18:05,480 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-11-23 10:18:05,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:18:05,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:18:05,532 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 10:18:05,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:18:05,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:18:05,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:18:05,534 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand 12 states. [2018-11-23 10:18:06,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:18:06,555 INFO L93 Difference]: Finished difference Result 78 states and 90 transitions. [2018-11-23 10:18:06,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 10:18:06,555 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-11-23 10:18:06,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:18:06,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:18:06,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 45 transitions. [2018-11-23 10:18:06,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:18:06,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 45 transitions. [2018-11-23 10:18:06,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 45 transitions. [2018-11-23 10:18:06,701 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:18:06,703 INFO L225 Difference]: With dead ends: 78 [2018-11-23 10:18:06,704 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 10:18:06,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2018-11-23 10:18:06,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 10:18:07,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2018-11-23 10:18:07,153 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:18:07,153 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 54 states. [2018-11-23 10:18:07,154 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 54 states. [2018-11-23 10:18:07,154 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 54 states. [2018-11-23 10:18:07,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:18:07,160 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-11-23 10:18:07,160 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-11-23 10:18:07,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:18:07,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:18:07,161 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 60 states. [2018-11-23 10:18:07,161 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 60 states. [2018-11-23 10:18:07,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:18:07,165 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-11-23 10:18:07,165 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-11-23 10:18:07,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:18:07,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:18:07,166 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:18:07,166 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:18:07,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 10:18:07,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-11-23 10:18:07,169 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 22 [2018-11-23 10:18:07,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:18:07,169 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-11-23 10:18:07,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:18:07,169 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-23 10:18:07,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 10:18:07,170 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:18:07,170 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:18:07,170 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:18:07,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:18:07,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1290031662, now seen corresponding path program 4 times [2018-11-23 10:18:07,171 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:18:07,171 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 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 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:18:07,198 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:18:07,295 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:18:07,295 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:18:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:18:07,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:18:07,378 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 10:18:07,383 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 10:18:07,386 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:18:07,390 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:07,402 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:07,402 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-23 10:18:07,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-11-23 10:18:07,478 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:07,480 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:07,481 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 41 [2018-11-23 10:18:07,484 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:18:07,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:07,522 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:07,522 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2018-11-23 10:18:07,585 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 25 [2018-11-23 10:18:07,596 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:07,599 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:07,601 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:07,604 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:07,605 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:07,607 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:07,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 80 [2018-11-23 10:18:07,611 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:18:07,632 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:07,655 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:07,656 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:36 [2018-11-23 10:18:07,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2018-11-23 10:18:07,803 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:07,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:07,853 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:07,857 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:07,860 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:07,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:07,865 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:07,867 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:07,869 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:07,871 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:07,873 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:07,875 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:07,876 INFO L303 Elim1Store]: Index analysis took 124 ms [2018-11-23 10:18:07,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 149 [2018-11-23 10:18:07,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:18:07,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:07,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:07,973 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-11-23 10:18:08,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 44 [2018-11-23 10:18:08,101 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,104 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,107 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,111 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,113 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,116 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,118 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,121 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,123 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,126 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,129 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,131 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,133 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,136 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,138 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,141 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,143 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,146 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,148 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,151 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,152 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 271 [2018-11-23 10:18:08,161 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:18:08,224 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:08,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:08,257 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:63, output treesize:59 [2018-11-23 10:18:08,392 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 54 [2018-11-23 10:18:08,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,417 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,421 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,423 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,426 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,429 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,432 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,441 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,447 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,451 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,459 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,462 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,464 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,470 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,473 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,478 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,481 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,483 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,487 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,491 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,495 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,499 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,504 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,508 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,512 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,513 INFO L303 Elim1Store]: Index analysis took 107 ms [2018-11-23 10:18:08,514 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 30 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 428 [2018-11-23 10:18:08,525 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:18:08,625 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:08,672 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:08,673 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:73, output treesize:69 [2018-11-23 10:18:08,829 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 57 [2018-11-23 10:18:08,847 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,848 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,849 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,851 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,852 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,853 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,855 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,856 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,858 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,859 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,860 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,863 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,865 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,867 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,868 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,870 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,871 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,872 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,874 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,875 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,877 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,879 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,880 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,882 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,883 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,885 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,886 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,888 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,889 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,891 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,892 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,894 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,895 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,898 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,900 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,902 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,903 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,926 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,928 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:08,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 42 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 512 [2018-11-23 10:18:08,937 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:18:09,093 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:09,136 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:09,136 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:80, output treesize:76 [2018-11-23 10:18:09,264 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 62 [2018-11-23 10:18:09,310 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,333 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,354 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,359 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,363 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,367 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,371 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,374 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,378 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,382 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,386 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,398 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,404 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,409 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,413 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,417 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,428 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,456 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,478 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,484 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,488 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,493 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,498 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,504 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,508 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,512 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,515 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,520 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,524 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,528 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,534 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,539 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,543 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,548 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,553 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,557 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,561 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,566 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,570 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,575 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,579 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,584 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,589 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,594 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,599 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,603 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,606 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,611 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,617 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,621 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,625 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,632 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,637 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:09,637 INFO L303 Elim1Store]: Index analysis took 364 ms [2018-11-23 10:18:09,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 56 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 677 [2018-11-23 10:18:09,649 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:18:09,895 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:09,934 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:09,935 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:82, output treesize:78 [2018-11-23 10:18:10,382 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 50 [2018-11-23 10:18:10,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,396 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,397 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,398 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,398 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,399 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,400 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,401 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:10,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,403 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,408 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,410 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,410 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,412 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,413 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,417 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,419 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,420 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,423 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,424 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,425 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,426 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,428 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,429 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,430 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,432 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,434 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,435 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,436 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:10,440 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 59 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 75 [2018-11-23 10:18:10,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:18:10,463 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:10,469 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:10,470 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:71, output treesize:7 [2018-11-23 10:18:10,478 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:18:10,479 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (and (= (_ bv4 32) (select .cse0 (_ bv16 32))) (= (_ bv1 32) (select .cse0 (_ bv4 32))) (= |main_#t~mem1| (select .cse0 (bvmul (_ bv4 32) main_~i~0))) (= (_ bv7 32) (select .cse0 (_ bv28 32))) (= (_ bv0 32) (select .cse0 (_ bv0 32))) (= (_ bv5 32) (select .cse0 (_ bv20 32))) (= (bvadd (select .cse0 (_ bv24 32)) (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv3 32) (select .cse0 (_ bv12 32))) (= (_ bv2 32) (select .cse0 (_ bv8 32))) (= main_~i~0 (_ bv0 32)))) [2018-11-23 10:18:10,479 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv0 32) |main_#t~mem1|) (= main_~i~0 (_ bv0 32))) [2018-11-23 10:18:10,637 INFO L256 TraceCheckUtils]: 0: Hoare triple {2034#true} call ULTIMATE.init(); {2034#true} is VALID [2018-11-23 10:18:10,637 INFO L273 TraceCheckUtils]: 1: Hoare triple {2034#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {2034#true} is VALID [2018-11-23 10:18:10,637 INFO L273 TraceCheckUtils]: 2: Hoare triple {2034#true} assume true; {2034#true} is VALID [2018-11-23 10:18:10,637 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2034#true} {2034#true} #54#return; {2034#true} is VALID [2018-11-23 10:18:10,638 INFO L256 TraceCheckUtils]: 4: Hoare triple {2034#true} call #t~ret2 := main(); {2034#true} is VALID [2018-11-23 10:18:10,638 INFO L273 TraceCheckUtils]: 5: Hoare triple {2034#true} ~N~0 := #t~nondet0;havoc #t~nondet0; {2034#true} is VALID [2018-11-23 10:18:10,639 INFO L273 TraceCheckUtils]: 6: Hoare triple {2034#true} assume ~bvsgt32(~N~0, 0bv32);havoc ~i~0;havoc ~k~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));~i~0 := 0bv32;~k~0 := 0bv32; {2057#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 10:18:10,641 INFO L273 TraceCheckUtils]: 7: Hoare triple {2057#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2061#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:18:10,645 INFO L273 TraceCheckUtils]: 8: Hoare triple {2061#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2065#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~k~0))} is VALID [2018-11-23 10:18:10,649 INFO L273 TraceCheckUtils]: 9: Hoare triple {2065#(and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~k~0))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2069#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:18:10,652 INFO L273 TraceCheckUtils]: 10: Hoare triple {2069#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2073#(and (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:18:10,658 INFO L273 TraceCheckUtils]: 11: Hoare triple {2073#(and (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2077#(and (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~k~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:18:10,665 INFO L273 TraceCheckUtils]: 12: Hoare triple {2077#(and (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~k~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2081#(and (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4294967288 32))) (_ bv2 32)) main_~k~0) (= (_ bv6 32) main_~k~0) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~k~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:18:10,670 INFO L273 TraceCheckUtils]: 13: Hoare triple {2081#(and (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4294967288 32))) (_ bv2 32)) main_~k~0) (= (_ bv6 32) main_~k~0) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~k~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2085#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv6 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv24 32)))) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 10:18:10,675 INFO L273 TraceCheckUtils]: 14: Hoare triple {2085#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv6 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv24 32)))) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2089#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv6 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv24 32)))) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv28 32))) (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 10:18:10,677 INFO L273 TraceCheckUtils]: 15: Hoare triple {2089#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv6 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv24 32)))) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv28 32))) (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~N~0); {2089#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv6 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv24 32)))) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv28 32))) (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 10:18:10,679 INFO L273 TraceCheckUtils]: 16: Hoare triple {2089#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv6 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv24 32)))) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv28 32))) (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)))} ~i~0 := 0bv32; {2096#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv6 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv24 32)))) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv28 32))) (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 10:18:10,681 INFO L273 TraceCheckUtils]: 17: Hoare triple {2096#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv6 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv24 32)))) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv28 32))) (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2100#(and (= (_ bv0 32) |main_#t~mem1|) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:18:10,682 INFO L256 TraceCheckUtils]: 18: Hoare triple {2100#(and (= (_ bv0 32) |main_#t~mem1|) (= main_~i~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {2104#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:10,683 INFO L273 TraceCheckUtils]: 19: Hoare triple {2104#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {2108#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:10,683 INFO L273 TraceCheckUtils]: 20: Hoare triple {2108#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {2035#false} is VALID [2018-11-23 10:18:10,683 INFO L273 TraceCheckUtils]: 21: Hoare triple {2035#false} assume !false; {2035#false} is VALID [2018-11-23 10:18:10,687 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:18:10,688 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:18:12,631 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 82 [2018-11-23 10:18:12,639 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 86 [2018-11-23 10:18:12,661 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:12,662 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:12,663 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 86 treesize of output 112 [2018-11-23 10:18:12,743 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:12,744 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:12,744 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:12,745 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:12,748 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 163 [2018-11-23 10:18:12,901 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:12,901 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:12,902 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:12,903 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:12,903 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:12,905 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:12,908 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 239 [2018-11-23 10:18:13,140 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,141 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,142 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,142 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,143 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,143 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,144 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,145 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,150 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 164 treesize of output 340 [2018-11-23 10:18:13,342 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,342 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,343 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,343 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,344 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,344 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,347 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,348 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,348 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,351 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,354 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 30 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 214 treesize of output 466 [2018-11-23 10:18:13,848 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,861 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,875 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,884 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,898 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,907 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,921 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,926 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,927 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,928 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,929 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,930 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:13,934 INFO L303 Elim1Store]: Index analysis took 117 ms [2018-11-23 10:18:13,936 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 42 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 276 treesize of output 617 [2018-11-23 10:18:14,621 WARN L180 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 61 [2018-11-23 10:18:14,776 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,777 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,784 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,785 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,785 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,786 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,786 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,791 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,792 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,792 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,792 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,796 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,797 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,797 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,798 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,822 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,823 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,823 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,824 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,825 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,825 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,826 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,828 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,851 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,852 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,853 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,854 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,854 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,862 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,862 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,863 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,863 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,871 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,872 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,873 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,875 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,897 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,898 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,899 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,900 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,902 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,903 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:14,906 INFO L303 Elim1Store]: Index analysis took 139 ms [2018-11-23 10:18:14,998 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 43 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 94 treesize of output 508 [2018-11-23 10:18:14,999 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-23 10:18:15,671 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 8 xjuncts. [2018-11-23 10:18:15,819 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,819 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,820 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,820 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,821 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,821 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,822 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,823 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,823 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,824 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,825 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,825 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,826 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,827 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,828 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,828 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,829 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,830 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,830 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,831 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,832 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,833 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,834 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,835 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,837 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,838 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,839 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,840 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,841 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,841 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,842 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,843 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,844 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,845 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,846 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,847 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,848 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,849 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,850 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,851 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,853 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,854 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:15,859 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 42 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 409 [2018-11-23 10:18:15,864 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 10:18:17,795 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-23 10:18:18,027 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-23 10:18:18,234 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-23 10:18:18,466 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-23 10:18:18,647 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-23 10:18:18,822 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-23 10:18:18,994 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-23 10:18:19,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-23 10:18:19,525 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-23 10:18:19,525 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:84, output treesize:402 [2018-11-23 10:18:19,534 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:18:19,534 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#a~0.base|]. (= (_ bv0 32) (select (let ((.cse0 (bvmul (_ bv4 32) main_~k~0))) (store (store (store (store (store (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| .cse0) main_~k~0) (bvadd |main_~#a~0.offset| .cse0 (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| .cse0 (_ bv8 32)) (bvadd main_~k~0 (_ bv2 32))) (bvadd |main_~#a~0.offset| .cse0 (_ bv12 32)) (bvadd main_~k~0 (_ bv3 32))) (bvadd |main_~#a~0.offset| .cse0 (_ bv16 32)) (bvadd main_~k~0 (_ bv4 32))) (bvadd |main_~#a~0.offset| .cse0 (_ bv20 32)) (bvadd main_~k~0 (_ bv5 32))) (bvadd |main_~#a~0.offset| .cse0 (_ bv24 32)) (bvadd main_~k~0 (_ bv6 32))) (bvadd |main_~#a~0.offset| .cse0 (_ bv28 32)) (bvadd main_~k~0 (_ bv7 32)))) |main_~#a~0.offset|)) [2018-11-23 10:18:19,535 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (let ((.cse8 (bvmul (_ bv4 32) main_~k~0))) (let ((.cse5 (= |main_~#a~0.offset| (bvadd |main_~#a~0.offset| .cse8 (_ bv24 32)))) (.cse0 (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32))) (.cse1 (= |main_~#a~0.offset| (bvadd |main_~#a~0.offset| .cse8 (_ bv4 32)))) (.cse2 (= |main_~#a~0.offset| (bvadd |main_~#a~0.offset| .cse8 (_ bv16 32)))) (.cse3 (= |main_~#a~0.offset| (bvadd |main_~#a~0.offset| .cse8 (_ bv12 32)))) (.cse7 (= |main_~#a~0.offset| (bvadd |main_~#a~0.offset| .cse8 (_ bv20 32)))) (.cse4 (= |main_~#a~0.offset| (bvadd |main_~#a~0.offset| .cse8 (_ bv8 32)))) (.cse6 (= (bvadd |main_~#a~0.offset| .cse8) |main_~#a~0.offset|))) (and (or .cse0 .cse1 (= (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32)) .cse2 .cse3 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 .cse3 .cse7 .cse4 (= main_~k~0 (_ bv0 32)) .cse5) (or .cse0 .cse1 (= (_ bv4294967292 32) main_~k~0) .cse3 .cse7 .cse4 .cse5 .cse6) (or .cse0 .cse1 (= (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32)) .cse2 .cse7 .cse4 .cse5 .cse6) (or .cse0 (= (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32)) .cse2 .cse3 .cse7 .cse4 .cse5 .cse6) (or .cse0 .cse1 .cse2 (= (_ bv4294967294 32) main_~k~0) .cse3 .cse7 .cse5 .cse6) (or .cse0 .cse1 (= (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32)) .cse2 .cse3 .cse7 .cse4 .cse6)))) [2018-11-23 10:18:19,823 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification that was a NOOP. DAG size: 44 [2018-11-23 10:18:19,857 INFO L273 TraceCheckUtils]: 21: Hoare triple {2035#false} assume !false; {2035#false} is VALID [2018-11-23 10:18:19,858 INFO L273 TraceCheckUtils]: 20: Hoare triple {2118#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {2035#false} is VALID [2018-11-23 10:18:19,858 INFO L273 TraceCheckUtils]: 19: Hoare triple {2122#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {2118#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:18:19,861 INFO L256 TraceCheckUtils]: 18: Hoare triple {2126#(= main_~i~0 |main_#t~mem1|)} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {2122#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:18:19,862 INFO L273 TraceCheckUtils]: 17: Hoare triple {2130#(= main_~i~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2126#(= main_~i~0 |main_#t~mem1|)} is VALID [2018-11-23 10:18:19,863 INFO L273 TraceCheckUtils]: 16: Hoare triple {2134#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} ~i~0 := 0bv32; {2130#(= main_~i~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} is VALID [2018-11-23 10:18:19,863 INFO L273 TraceCheckUtils]: 15: Hoare triple {2134#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} assume !~bvslt32(~i~0, ~N~0); {2134#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-23 10:18:19,878 INFO L273 TraceCheckUtils]: 14: Hoare triple {2141#(= (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) |main_~#a~0.offset|) (_ bv0 32))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2134#(= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-23 10:18:19,891 INFO L273 TraceCheckUtils]: 13: Hoare triple {2145#(= (_ bv0 32) (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) |main_~#a~0.offset|))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2141#(= (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-23 10:18:19,920 INFO L273 TraceCheckUtils]: 12: Hoare triple {2149#(= (select (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv8 32)) (bvadd main_~k~0 (_ bv2 32))) |main_~#a~0.offset|) (_ bv0 32))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2145#(= (_ bv0 32) (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) |main_~#a~0.offset|))} is VALID [2018-11-23 10:18:19,954 INFO L273 TraceCheckUtils]: 11: Hoare triple {2153#(= (_ bv0 32) (select (store (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv8 32)) (bvadd main_~k~0 (_ bv2 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (bvadd main_~k~0 (_ bv3 32))) |main_~#a~0.offset|))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2149#(= (select (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv8 32)) (bvadd main_~k~0 (_ bv2 32))) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-23 10:18:19,994 INFO L273 TraceCheckUtils]: 10: Hoare triple {2157#(= (_ bv0 32) (select (store (store (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv8 32)) (bvadd main_~k~0 (_ bv2 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (bvadd main_~k~0 (_ bv3 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv16 32)) (bvadd main_~k~0 (_ bv4 32))) |main_~#a~0.offset|))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2153#(= (_ bv0 32) (select (store (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv8 32)) (bvadd main_~k~0 (_ bv2 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (bvadd main_~k~0 (_ bv3 32))) |main_~#a~0.offset|))} is VALID [2018-11-23 10:18:20,041 INFO L273 TraceCheckUtils]: 9: Hoare triple {2161#(= (select (store (store (store (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv8 32)) (bvadd main_~k~0 (_ bv2 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (bvadd main_~k~0 (_ bv3 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv16 32)) (bvadd main_~k~0 (_ bv4 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (bvadd main_~k~0 (_ bv5 32))) |main_~#a~0.offset|) (_ bv0 32))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2157#(= (_ bv0 32) (select (store (store (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv8 32)) (bvadd main_~k~0 (_ bv2 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (bvadd main_~k~0 (_ bv3 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv16 32)) (bvadd main_~k~0 (_ bv4 32))) |main_~#a~0.offset|))} is VALID [2018-11-23 10:18:20,084 INFO L273 TraceCheckUtils]: 8: Hoare triple {2165#(= (select (store (store (store (store (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv8 32)) (bvadd main_~k~0 (_ bv2 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (bvadd main_~k~0 (_ bv3 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv16 32)) (bvadd main_~k~0 (_ bv4 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (bvadd main_~k~0 (_ bv5 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv24 32)) (bvadd main_~k~0 (_ bv6 32))) |main_~#a~0.offset|) (_ bv0 32))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2161#(= (select (store (store (store (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv8 32)) (bvadd main_~k~0 (_ bv2 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (bvadd main_~k~0 (_ bv3 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv16 32)) (bvadd main_~k~0 (_ bv4 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (bvadd main_~k~0 (_ bv5 32))) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-23 10:18:20,111 INFO L273 TraceCheckUtils]: 7: Hoare triple {2169#(and (or (= (_ bv4294967284 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32)) (= (_ bv4294967276 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32)) (= (_ bv4294967272 32) (bvmul (_ bv4 32) main_~k~0))) (or (= (_ bv4294967284 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967276 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32))) (or (= (_ bv4294967284 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967294 32) main_~k~0) (= (_ bv4294967276 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32)) (= (_ bv4294967272 32) (bvmul (_ bv4 32) main_~k~0))) (or (= (_ bv4294967284 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (_ bv4294967292 32) main_~k~0) (= (_ bv4294967276 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32)) (= (_ bv4294967272 32) (bvmul (_ bv4 32) main_~k~0))) (or (= (_ bv4294967284 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= main_~k~0 (_ bv0 32)) (= (_ bv4294967276 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967272 32) (bvmul (_ bv4 32) main_~k~0))) (or (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32)) (= (_ bv4294967276 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32)) (= (_ bv4294967272 32) (bvmul (_ bv4 32) main_~k~0))) (or (= (_ bv4294967284 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32)) (= (_ bv4294967272 32) (bvmul (_ bv4 32) main_~k~0))))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2165#(= (select (store (store (store (store (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv8 32)) (bvadd main_~k~0 (_ bv2 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (bvadd main_~k~0 (_ bv3 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv16 32)) (bvadd main_~k~0 (_ bv4 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (bvadd main_~k~0 (_ bv5 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv24 32)) (bvadd main_~k~0 (_ bv6 32))) |main_~#a~0.offset|) (_ bv0 32))} is VALID [2018-11-23 10:18:20,112 INFO L273 TraceCheckUtils]: 6: Hoare triple {2034#true} assume ~bvsgt32(~N~0, 0bv32);havoc ~i~0;havoc ~k~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));~i~0 := 0bv32;~k~0 := 0bv32; {2169#(and (or (= (_ bv4294967284 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32)) (= (_ bv4294967276 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32)) (= (_ bv4294967272 32) (bvmul (_ bv4 32) main_~k~0))) (or (= (_ bv4294967284 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967276 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32))) (or (= (_ bv4294967284 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967294 32) main_~k~0) (= (_ bv4294967276 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32)) (= (_ bv4294967272 32) (bvmul (_ bv4 32) main_~k~0))) (or (= (_ bv4294967284 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (_ bv4294967292 32) main_~k~0) (= (_ bv4294967276 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32)) (= (_ bv4294967272 32) (bvmul (_ bv4 32) main_~k~0))) (or (= (_ bv4294967284 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= main_~k~0 (_ bv0 32)) (= (_ bv4294967276 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967272 32) (bvmul (_ bv4 32) main_~k~0))) (or (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32)) (= (_ bv4294967276 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32)) (= (_ bv4294967272 32) (bvmul (_ bv4 32) main_~k~0))) (or (= (_ bv4294967284 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32)) (= (_ bv4294967272 32) (bvmul (_ bv4 32) main_~k~0))))} is VALID [2018-11-23 10:18:20,113 INFO L273 TraceCheckUtils]: 5: Hoare triple {2034#true} ~N~0 := #t~nondet0;havoc #t~nondet0; {2034#true} is VALID [2018-11-23 10:18:20,113 INFO L256 TraceCheckUtils]: 4: Hoare triple {2034#true} call #t~ret2 := main(); {2034#true} is VALID [2018-11-23 10:18:20,113 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2034#true} {2034#true} #54#return; {2034#true} is VALID [2018-11-23 10:18:20,113 INFO L273 TraceCheckUtils]: 2: Hoare triple {2034#true} assume true; {2034#true} is VALID [2018-11-23 10:18:20,114 INFO L273 TraceCheckUtils]: 1: Hoare triple {2034#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {2034#true} is VALID [2018-11-23 10:18:20,114 INFO L256 TraceCheckUtils]: 0: Hoare triple {2034#true} call ULTIMATE.init(); {2034#true} is VALID [2018-11-23 10:18:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:18:20,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:18:20,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-11-23 10:18:20,119 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 22 [2018-11-23 10:18:20,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:18:20,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 10:18:20,505 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:18:20,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 10:18:20,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 10:18:20,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=632, Unknown=0, NotChecked=0, Total=756 [2018-11-23 10:18:20,507 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 28 states. [2018-11-23 10:18:24,743 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 74 [2018-11-23 10:18:27,680 WARN L180 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2018-11-23 10:18:29,402 WARN L180 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2018-11-23 10:18:30,604 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 45 [2018-11-23 10:18:35,791 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 79 [2018-11-23 10:18:36,598 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 81 [2018-11-23 10:18:44,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:18:44,240 INFO L93 Difference]: Finished difference Result 161 states and 202 transitions. [2018-11-23 10:18:44,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-23 10:18:44,240 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 22 [2018-11-23 10:18:44,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:18:44,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 10:18:44,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 184 transitions. [2018-11-23 10:18:44,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 10:18:44,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 184 transitions. [2018-11-23 10:18:44,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 184 transitions. [2018-11-23 10:18:45,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:18:45,026 INFO L225 Difference]: With dead ends: 161 [2018-11-23 10:18:45,026 INFO L226 Difference]: Without dead ends: 159 [2018-11-23 10:18:45,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=943, Invalid=3347, Unknown=0, NotChecked=0, Total=4290 [2018-11-23 10:18:45,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-11-23 10:18:45,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 62. [2018-11-23 10:18:45,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:18:45,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand 62 states. [2018-11-23 10:18:45,348 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand 62 states. [2018-11-23 10:18:45,349 INFO L87 Difference]: Start difference. First operand 159 states. Second operand 62 states. [2018-11-23 10:18:45,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:18:45,359 INFO L93 Difference]: Finished difference Result 159 states and 200 transitions. [2018-11-23 10:18:45,359 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 200 transitions. [2018-11-23 10:18:45,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:18:45,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:18:45,361 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 159 states. [2018-11-23 10:18:45,361 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 159 states. [2018-11-23 10:18:45,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:18:45,369 INFO L93 Difference]: Finished difference Result 159 states and 200 transitions. [2018-11-23 10:18:45,369 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 200 transitions. [2018-11-23 10:18:45,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:18:45,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:18:45,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:18:45,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:18:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 10:18:45,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 79 transitions. [2018-11-23 10:18:45,374 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 79 transitions. Word has length 22 [2018-11-23 10:18:45,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:18:45,374 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 79 transitions. [2018-11-23 10:18:45,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 10:18:45,374 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 79 transitions. [2018-11-23 10:18:45,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 10:18:45,375 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:18:45,375 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:18:45,376 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:18:45,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:18:45,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1269212440, now seen corresponding path program 2 times [2018-11-23 10:18:45,376 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:18:45,376 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 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 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:18:45,399 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:18:45,477 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:18:45,478 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:18:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:18:45,503 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:18:45,566 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 10:18:45,575 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 10:18:45,578 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:18:45,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:45,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:45,594 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-23 10:18:45,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 20 [2018-11-23 10:18:45,644 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:45,646 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:45,647 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 39 [2018-11-23 10:18:45,650 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:18:45,663 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:45,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:45,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-23 10:18:45,891 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 18 [2018-11-23 10:18:45,897 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:45,898 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:45,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2018-11-23 10:18:45,901 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:18:45,905 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:45,911 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:45,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:9 [2018-11-23 10:18:45,918 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:18:45,918 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (and (= (_ bv1 32) (select .cse0 (_ bv4 32))) (= |main_#t~mem1| (select .cse0 (bvmul (_ bv4 32) main_~i~0))) (= (_ bv2 32) (select .cse0 (_ bv8 32))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-23 10:18:45,918 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv1 32) |main_#t~mem1|) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 10:18:45,984 INFO L256 TraceCheckUtils]: 0: Hoare triple {2938#true} call ULTIMATE.init(); {2938#true} is VALID [2018-11-23 10:18:45,985 INFO L273 TraceCheckUtils]: 1: Hoare triple {2938#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {2938#true} is VALID [2018-11-23 10:18:45,985 INFO L273 TraceCheckUtils]: 2: Hoare triple {2938#true} assume true; {2938#true} is VALID [2018-11-23 10:18:45,985 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2938#true} {2938#true} #54#return; {2938#true} is VALID [2018-11-23 10:18:45,985 INFO L256 TraceCheckUtils]: 4: Hoare triple {2938#true} call #t~ret2 := main(); {2938#true} is VALID [2018-11-23 10:18:45,986 INFO L273 TraceCheckUtils]: 5: Hoare triple {2938#true} ~N~0 := #t~nondet0;havoc #t~nondet0; {2938#true} is VALID [2018-11-23 10:18:45,986 INFO L273 TraceCheckUtils]: 6: Hoare triple {2938#true} assume ~bvsgt32(~N~0, 0bv32);havoc ~i~0;havoc ~k~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));~i~0 := 0bv32;~k~0 := 0bv32; {2961#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 10:18:45,987 INFO L273 TraceCheckUtils]: 7: Hoare triple {2961#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2965#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:18:45,989 INFO L273 TraceCheckUtils]: 8: Hoare triple {2965#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2969#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 10:18:45,992 INFO L273 TraceCheckUtils]: 9: Hoare triple {2969#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {2973#(and (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:18:45,993 INFO L273 TraceCheckUtils]: 10: Hoare triple {2973#(and (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} assume !~bvslt32(~i~0, ~N~0); {2973#(and (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:18:45,994 INFO L273 TraceCheckUtils]: 11: Hoare triple {2973#(and (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} ~i~0 := 0bv32; {2980#(and (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:18:45,995 INFO L273 TraceCheckUtils]: 12: Hoare triple {2980#(and (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2980#(and (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:18:45,999 INFO L256 TraceCheckUtils]: 13: Hoare triple {2980#(and (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {2987#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-23 10:18:46,000 INFO L273 TraceCheckUtils]: 14: Hoare triple {2987#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))))} ~cond := #in~cond; {2987#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-23 10:18:46,000 INFO L273 TraceCheckUtils]: 15: Hoare triple {2987#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))))} assume !(0bv32 == ~cond); {2987#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-23 10:18:46,001 INFO L273 TraceCheckUtils]: 16: Hoare triple {2987#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))))} assume true; {2987#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))))} is VALID [2018-11-23 10:18:46,003 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {2987#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32))))} {2980#(and (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} #58#return; {2980#(and (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:18:46,004 INFO L273 TraceCheckUtils]: 18: Hoare triple {2980#(and (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0); {3003#(and (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:18:46,006 INFO L273 TraceCheckUtils]: 19: Hoare triple {3003#(and (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3007#(and (= (_ bv1 32) |main_#t~mem1|) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:18:46,008 INFO L256 TraceCheckUtils]: 20: Hoare triple {3007#(and (= (_ bv1 32) |main_#t~mem1|) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {3011#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:46,009 INFO L273 TraceCheckUtils]: 21: Hoare triple {3011#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {3015#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:46,010 INFO L273 TraceCheckUtils]: 22: Hoare triple {3015#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {2939#false} is VALID [2018-11-23 10:18:46,010 INFO L273 TraceCheckUtils]: 23: Hoare triple {2939#false} assume !false; {2939#false} is VALID [2018-11-23 10:18:46,012 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:18:46,012 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:18:46,428 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2018-11-23 10:18:46,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 28 [2018-11-23 10:18:46,767 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 20 [2018-11-23 10:18:46,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2018-11-23 10:18:46,809 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 10:18:46,813 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 17 treesize of output 6 [2018-11-23 10:18:46,820 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 10:18:46,830 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:46,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:46,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:46,845 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:9 [2018-11-23 10:18:47,033 INFO L273 TraceCheckUtils]: 23: Hoare triple {2939#false} assume !false; {2939#false} is VALID [2018-11-23 10:18:47,033 INFO L273 TraceCheckUtils]: 22: Hoare triple {3025#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {2939#false} is VALID [2018-11-23 10:18:47,035 INFO L273 TraceCheckUtils]: 21: Hoare triple {3029#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {3025#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:18:47,036 INFO L256 TraceCheckUtils]: 20: Hoare triple {3033#(= main_~i~0 |main_#t~mem1|)} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {3029#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:18:47,037 INFO L273 TraceCheckUtils]: 19: Hoare triple {3037#(= main_~i~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3033#(= main_~i~0 |main_#t~mem1|)} is VALID [2018-11-23 10:18:47,249 INFO L273 TraceCheckUtils]: 18: Hoare triple {3041#(= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)} havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0); {3037#(= main_~i~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} is VALID [2018-11-23 10:18:47,252 INFO L268 TraceCheckUtils]: 17: Hoare quadruple {2938#true} {3041#(= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)} #58#return; {3041#(= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)} is VALID [2018-11-23 10:18:47,252 INFO L273 TraceCheckUtils]: 16: Hoare triple {2938#true} assume true; {2938#true} is VALID [2018-11-23 10:18:47,252 INFO L273 TraceCheckUtils]: 15: Hoare triple {2938#true} assume !(0bv32 == ~cond); {2938#true} is VALID [2018-11-23 10:18:47,252 INFO L273 TraceCheckUtils]: 14: Hoare triple {2938#true} ~cond := #in~cond; {2938#true} is VALID [2018-11-23 10:18:47,252 INFO L256 TraceCheckUtils]: 13: Hoare triple {3041#(= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {2938#true} is VALID [2018-11-23 10:18:47,253 INFO L273 TraceCheckUtils]: 12: Hoare triple {3041#(= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3041#(= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)} is VALID [2018-11-23 10:18:47,254 INFO L273 TraceCheckUtils]: 11: Hoare triple {3063#(= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))} ~i~0 := 0bv32; {3041#(= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)} is VALID [2018-11-23 10:18:47,254 INFO L273 TraceCheckUtils]: 10: Hoare triple {3063#(= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))} assume !~bvslt32(~i~0, ~N~0); {3063#(= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))} is VALID [2018-11-23 10:18:47,279 INFO L273 TraceCheckUtils]: 9: Hoare triple {3070#(= (_ bv1 32) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (_ bv4 32))))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {3063#(= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))} is VALID [2018-11-23 10:18:47,296 INFO L273 TraceCheckUtils]: 8: Hoare triple {3074#(or (= main_~k~0 (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {3070#(= (_ bv1 32) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (_ bv4 32))))} is VALID [2018-11-23 10:18:47,301 INFO L273 TraceCheckUtils]: 7: Hoare triple {3078#(or (= (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {3074#(or (= main_~k~0 (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:18:47,305 INFO L273 TraceCheckUtils]: 6: Hoare triple {2938#true} assume ~bvsgt32(~N~0, 0bv32);havoc ~i~0;havoc ~k~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));~i~0 := 0bv32;~k~0 := 0bv32; {3078#(or (= (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 10:18:47,306 INFO L273 TraceCheckUtils]: 5: Hoare triple {2938#true} ~N~0 := #t~nondet0;havoc #t~nondet0; {2938#true} is VALID [2018-11-23 10:18:47,306 INFO L256 TraceCheckUtils]: 4: Hoare triple {2938#true} call #t~ret2 := main(); {2938#true} is VALID [2018-11-23 10:18:47,306 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2938#true} {2938#true} #54#return; {2938#true} is VALID [2018-11-23 10:18:47,307 INFO L273 TraceCheckUtils]: 2: Hoare triple {2938#true} assume true; {2938#true} is VALID [2018-11-23 10:18:47,307 INFO L273 TraceCheckUtils]: 1: Hoare triple {2938#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {2938#true} is VALID [2018-11-23 10:18:47,307 INFO L256 TraceCheckUtils]: 0: Hoare triple {2938#true} call ULTIMATE.init(); {2938#true} is VALID [2018-11-23 10:18:47,309 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:18:47,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:18:47,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-11-23 10:18:47,312 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2018-11-23 10:18:47,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:18:47,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 10:18:47,812 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 10:18:47,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 10:18:47,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 10:18:47,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-11-23 10:18:47,813 INFO L87 Difference]: Start difference. First operand 62 states and 79 transitions. Second operand 21 states. [2018-11-23 10:18:53,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:18:53,245 INFO L93 Difference]: Finished difference Result 105 states and 127 transitions. [2018-11-23 10:18:53,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 10:18:53,246 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 24 [2018-11-23 10:18:53,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:18:53,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 10:18:53,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 83 transitions. [2018-11-23 10:18:53,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 10:18:53,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 83 transitions. [2018-11-23 10:18:53,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 83 transitions. [2018-11-23 10:18:55,706 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 82 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2018-11-23 10:18:55,710 INFO L225 Difference]: With dead ends: 105 [2018-11-23 10:18:55,711 INFO L226 Difference]: Without dead ends: 103 [2018-11-23 10:18:55,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=193, Invalid=1139, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 10:18:55,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-23 10:18:56,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 70. [2018-11-23 10:18:56,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:18:56,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 70 states. [2018-11-23 10:18:56,116 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 70 states. [2018-11-23 10:18:56,116 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 70 states. [2018-11-23 10:18:56,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:18:56,123 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2018-11-23 10:18:56,123 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2018-11-23 10:18:56,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:18:56,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:18:56,124 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 103 states. [2018-11-23 10:18:56,124 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 103 states. [2018-11-23 10:18:56,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:18:56,128 INFO L93 Difference]: Finished difference Result 103 states and 125 transitions. [2018-11-23 10:18:56,128 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 125 transitions. [2018-11-23 10:18:56,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:18:56,129 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:18:56,129 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:18:56,129 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:18:56,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 10:18:56,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 87 transitions. [2018-11-23 10:18:56,132 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 87 transitions. Word has length 24 [2018-11-23 10:18:56,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:18:56,132 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 87 transitions. [2018-11-23 10:18:56,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 10:18:56,132 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 87 transitions. [2018-11-23 10:18:56,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 10:18:56,133 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:18:56,133 INFO L402 BasicCegarLoop]: trace histogram [5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:18:56,134 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:18:56,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:18:56,134 INFO L82 PathProgramCache]: Analyzing trace with hash -700417736, now seen corresponding path program 3 times [2018-11-23 10:18:56,134 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:18:56,135 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:18:56,150 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:18:56,363 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 10:18:56,363 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:18:56,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:18:56,394 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:18:56,459 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-11-23 10:18:56,465 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 10:18:56,467 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:18:56,472 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:56,485 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:56,485 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-23 10:18:56,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2018-11-23 10:18:56,577 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:56,579 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:56,580 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 49 [2018-11-23 10:18:56,584 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:18:56,597 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:56,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:56,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2018-11-23 10:18:56,724 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 35 [2018-11-23 10:18:56,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:56,766 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:56,768 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:56,771 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:56,774 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:56,777 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:56,779 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 120 [2018-11-23 10:18:56,788 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:18:56,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:56,851 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:56,851 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:50, output treesize:46 [2018-11-23 10:18:57,100 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 34 [2018-11-23 10:18:57,118 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:57,124 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:57,127 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:57,136 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:57,141 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:57,144 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:57,147 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:57,150 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:57,153 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:57,157 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:57,160 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:57,163 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:57,164 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 165 [2018-11-23 10:18:57,172 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:18:57,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:57,248 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:57,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:46, output treesize:42 [2018-11-23 10:18:58,059 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 28 [2018-11-23 10:18:58,066 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:58,070 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:58,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:58,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:58,072 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:58,073 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:58,073 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:18:58,075 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 12 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 35 [2018-11-23 10:18:58,078 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:18:58,087 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:58,093 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:18:58,093 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:9 [2018-11-23 10:18:58,101 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:18:58,101 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (and (= (_ bv4 32) (select .cse0 (_ bv16 32))) (= (_ bv1 32) (select .cse0 (_ bv4 32))) (= |main_#t~mem1| (select .cse0 (bvmul (_ bv4 32) main_~i~0))) (= (_ bv3 32) (select .cse0 (_ bv12 32))) (= (_ bv2 32) (select .cse0 (_ bv8 32))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-23 10:18:58,101 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv1 32) |main_#t~mem1|) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 10:18:58,201 INFO L256 TraceCheckUtils]: 0: Hoare triple {3612#true} call ULTIMATE.init(); {3612#true} is VALID [2018-11-23 10:18:58,202 INFO L273 TraceCheckUtils]: 1: Hoare triple {3612#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {3612#true} is VALID [2018-11-23 10:18:58,202 INFO L273 TraceCheckUtils]: 2: Hoare triple {3612#true} assume true; {3612#true} is VALID [2018-11-23 10:18:58,202 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3612#true} {3612#true} #54#return; {3612#true} is VALID [2018-11-23 10:18:58,202 INFO L256 TraceCheckUtils]: 4: Hoare triple {3612#true} call #t~ret2 := main(); {3612#true} is VALID [2018-11-23 10:18:58,203 INFO L273 TraceCheckUtils]: 5: Hoare triple {3612#true} ~N~0 := #t~nondet0;havoc #t~nondet0; {3612#true} is VALID [2018-11-23 10:18:58,207 INFO L273 TraceCheckUtils]: 6: Hoare triple {3612#true} assume ~bvsgt32(~N~0, 0bv32);havoc ~i~0;havoc ~k~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));~i~0 := 0bv32;~k~0 := 0bv32; {3635#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 10:18:58,208 INFO L273 TraceCheckUtils]: 7: Hoare triple {3635#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {3639#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:18:58,211 INFO L273 TraceCheckUtils]: 8: Hoare triple {3639#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {3643#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 10:18:58,214 INFO L273 TraceCheckUtils]: 9: Hoare triple {3643#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {3647#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:18:58,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {3647#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {3651#(and (= (bvadd main_~k~0 (_ bv4294967294 32)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4294967288 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:18:58,225 INFO L273 TraceCheckUtils]: 11: Hoare triple {3651#(and (= (bvadd main_~k~0 (_ bv4294967294 32)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4294967288 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {3655#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:18:58,226 INFO L273 TraceCheckUtils]: 12: Hoare triple {3655#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} assume !~bvslt32(~i~0, ~N~0); {3655#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:18:58,227 INFO L273 TraceCheckUtils]: 13: Hoare triple {3655#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} ~i~0 := 0bv32; {3662#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:18:58,228 INFO L273 TraceCheckUtils]: 14: Hoare triple {3662#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3662#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:18:58,232 INFO L256 TraceCheckUtils]: 15: Hoare triple {3662#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {3669#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv16 32)) (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv12 32)) (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 10:18:58,233 INFO L273 TraceCheckUtils]: 16: Hoare triple {3669#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv16 32)) (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv12 32)) (_ bv4294967293 32)) (_ bv0 32))))} ~cond := #in~cond; {3669#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv16 32)) (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv12 32)) (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 10:18:58,233 INFO L273 TraceCheckUtils]: 17: Hoare triple {3669#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv16 32)) (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv12 32)) (_ bv4294967293 32)) (_ bv0 32))))} assume !(0bv32 == ~cond); {3669#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv16 32)) (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv12 32)) (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 10:18:58,234 INFO L273 TraceCheckUtils]: 18: Hoare triple {3669#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv16 32)) (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv12 32)) (_ bv4294967293 32)) (_ bv0 32))))} assume true; {3669#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv16 32)) (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv12 32)) (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 10:18:58,234 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {3669#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv16 32)) (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) (_ bv12 32)) (_ bv4294967293 32)) (_ bv0 32))))} {3662#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} #58#return; {3662#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:18:58,236 INFO L273 TraceCheckUtils]: 20: Hoare triple {3662#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0); {3685#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:18:58,238 INFO L273 TraceCheckUtils]: 21: Hoare triple {3685#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3689#(and (= (_ bv1 32) |main_#t~mem1|) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:18:58,239 INFO L256 TraceCheckUtils]: 22: Hoare triple {3689#(and (= (_ bv1 32) |main_#t~mem1|) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {3693#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:58,240 INFO L273 TraceCheckUtils]: 23: Hoare triple {3693#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {3697#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:18:58,254 INFO L273 TraceCheckUtils]: 24: Hoare triple {3697#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {3613#false} is VALID [2018-11-23 10:18:58,254 INFO L273 TraceCheckUtils]: 25: Hoare triple {3613#false} assume !false; {3613#false} is VALID [2018-11-23 10:18:58,257 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:18:58,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:18:59,088 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2018-11-23 10:18:59,096 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 48 [2018-11-23 10:18:59,106 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:59,106 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:59,108 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 48 treesize of output 74 [2018-11-23 10:18:59,179 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:59,179 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:59,180 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:59,181 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:59,183 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 125 [2018-11-23 10:18:59,367 WARN L180 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 36 [2018-11-23 10:18:59,407 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:59,407 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:59,408 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:59,408 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:59,409 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:59,409 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:59,411 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 61 [2018-11-23 10:18:59,433 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-23 10:18:59,537 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:59,540 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:59,543 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:59,548 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:59,552 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:59,555 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:18:59,600 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 1 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 108 [2018-11-23 10:18:59,619 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 4 xjuncts. [2018-11-23 10:18:59,707 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 10:18:59,753 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 10:18:59,794 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 10:18:59,838 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-23 10:18:59,881 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-23 10:18:59,882 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:46, output treesize:90 [2018-11-23 10:19:00,136 INFO L273 TraceCheckUtils]: 25: Hoare triple {3613#false} assume !false; {3613#false} is VALID [2018-11-23 10:19:00,137 INFO L273 TraceCheckUtils]: 24: Hoare triple {3707#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {3613#false} is VALID [2018-11-23 10:19:00,137 INFO L273 TraceCheckUtils]: 23: Hoare triple {3711#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {3707#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:19:00,138 INFO L256 TraceCheckUtils]: 22: Hoare triple {3715#(= main_~i~0 |main_#t~mem1|)} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {3711#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:19:00,139 INFO L273 TraceCheckUtils]: 21: Hoare triple {3719#(= main_~i~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3715#(= main_~i~0 |main_#t~mem1|)} is VALID [2018-11-23 10:19:00,348 INFO L273 TraceCheckUtils]: 20: Hoare triple {3723#(= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)} havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0); {3719#(= main_~i~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} is VALID [2018-11-23 10:19:00,349 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {3612#true} {3723#(= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)} #58#return; {3723#(= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)} is VALID [2018-11-23 10:19:00,350 INFO L273 TraceCheckUtils]: 18: Hoare triple {3612#true} assume true; {3612#true} is VALID [2018-11-23 10:19:00,350 INFO L273 TraceCheckUtils]: 17: Hoare triple {3612#true} assume !(0bv32 == ~cond); {3612#true} is VALID [2018-11-23 10:19:00,350 INFO L273 TraceCheckUtils]: 16: Hoare triple {3612#true} ~cond := #in~cond; {3612#true} is VALID [2018-11-23 10:19:00,350 INFO L256 TraceCheckUtils]: 15: Hoare triple {3723#(= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {3612#true} is VALID [2018-11-23 10:19:00,351 INFO L273 TraceCheckUtils]: 14: Hoare triple {3723#(= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3723#(= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)} is VALID [2018-11-23 10:19:00,351 INFO L273 TraceCheckUtils]: 13: Hoare triple {3745#(= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))} ~i~0 := 0bv32; {3723#(= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)} is VALID [2018-11-23 10:19:00,352 INFO L273 TraceCheckUtils]: 12: Hoare triple {3745#(= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))} assume !~bvslt32(~i~0, ~N~0); {3745#(= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))} is VALID [2018-11-23 10:19:00,378 INFO L273 TraceCheckUtils]: 11: Hoare triple {3752#(= (_ bv1 32) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (_ bv4 32))))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {3745#(= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))} is VALID [2018-11-23 10:19:00,419 INFO L273 TraceCheckUtils]: 10: Hoare triple {3756#(= (_ bv1 32) (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (_ bv4 32))))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {3752#(= (_ bv1 32) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (_ bv4 32))))} is VALID [2018-11-23 10:19:00,458 INFO L273 TraceCheckUtils]: 9: Hoare triple {3760#(= (_ bv1 32) (select (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv8 32)) (bvadd main_~k~0 (_ bv2 32))) (bvadd |main_~#a~0.offset| (_ bv4 32))))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {3756#(= (_ bv1 32) (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (_ bv4 32))))} is VALID [2018-11-23 10:19:00,480 INFO L273 TraceCheckUtils]: 8: Hoare triple {3764#(and (or (= (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32))) (or (= (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)) (_ bv0 32)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32))) (or (= (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (_ bv0 32))))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {3760#(= (_ bv1 32) (select (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv8 32)) (bvadd main_~k~0 (_ bv2 32))) (bvadd |main_~#a~0.offset| (_ bv4 32))))} is VALID [2018-11-23 10:19:00,488 INFO L273 TraceCheckUtils]: 7: Hoare triple {3768#(and (or (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~k~0))) (or (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32))) (or (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32)) (= (_ bv4294967294 32) main_~k~0) (= (_ bv0 32) (bvmul (_ bv4 32) main_~k~0))))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {3764#(and (or (= (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32))) (or (= (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)) (_ bv0 32)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32))) (or (= (bvadd main_~k~0 (_ bv2 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (_ bv0 32))))} is VALID [2018-11-23 10:19:00,490 INFO L273 TraceCheckUtils]: 6: Hoare triple {3612#true} assume ~bvsgt32(~N~0, 0bv32);havoc ~i~0;havoc ~k~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));~i~0 := 0bv32;~k~0 := 0bv32; {3768#(and (or (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~k~0))) (or (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32))) (or (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32)) (= (_ bv4294967294 32) main_~k~0) (= (_ bv0 32) (bvmul (_ bv4 32) main_~k~0))))} is VALID [2018-11-23 10:19:00,490 INFO L273 TraceCheckUtils]: 5: Hoare triple {3612#true} ~N~0 := #t~nondet0;havoc #t~nondet0; {3612#true} is VALID [2018-11-23 10:19:00,491 INFO L256 TraceCheckUtils]: 4: Hoare triple {3612#true} call #t~ret2 := main(); {3612#true} is VALID [2018-11-23 10:19:00,491 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3612#true} {3612#true} #54#return; {3612#true} is VALID [2018-11-23 10:19:00,491 INFO L273 TraceCheckUtils]: 2: Hoare triple {3612#true} assume true; {3612#true} is VALID [2018-11-23 10:19:00,491 INFO L273 TraceCheckUtils]: 1: Hoare triple {3612#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {3612#true} is VALID [2018-11-23 10:19:00,491 INFO L256 TraceCheckUtils]: 0: Hoare triple {3612#true} call ULTIMATE.init(); {3612#true} is VALID [2018-11-23 10:19:00,494 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 2 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:19:00,499 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:19:00,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 25 [2018-11-23 10:19:00,502 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2018-11-23 10:19:00,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:19:00,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 10:19:00,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:19:00,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 10:19:00,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 10:19:00,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=519, Unknown=0, NotChecked=0, Total=600 [2018-11-23 10:19:00,949 INFO L87 Difference]: Start difference. First operand 70 states and 87 transitions. Second operand 25 states. [2018-11-23 10:19:12,834 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2018-11-23 10:19:13,195 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2018-11-23 10:19:14,204 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2018-11-23 10:19:17,448 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 45 [2018-11-23 10:19:17,744 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2018-11-23 10:19:19,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:19:19,876 INFO L93 Difference]: Finished difference Result 155 states and 187 transitions. [2018-11-23 10:19:19,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 10:19:19,876 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 26 [2018-11-23 10:19:19,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:19:19,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 10:19:19,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 148 transitions. [2018-11-23 10:19:19,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 10:19:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 148 transitions. [2018-11-23 10:19:19,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 148 transitions. [2018-11-23 10:19:29,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 144 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2018-11-23 10:19:29,209 INFO L225 Difference]: With dead ends: 155 [2018-11-23 10:19:29,209 INFO L226 Difference]: Without dead ends: 153 [2018-11-23 10:19:29,211 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=488, Invalid=2704, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 10:19:29,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-23 10:19:30,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 87. [2018-11-23 10:19:30,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:19:30,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 87 states. [2018-11-23 10:19:30,046 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 87 states. [2018-11-23 10:19:30,046 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 87 states. [2018-11-23 10:19:30,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:19:30,053 INFO L93 Difference]: Finished difference Result 153 states and 184 transitions. [2018-11-23 10:19:30,053 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 184 transitions. [2018-11-23 10:19:30,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:19:30,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:19:30,054 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 153 states. [2018-11-23 10:19:30,054 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 153 states. [2018-11-23 10:19:30,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:19:30,060 INFO L93 Difference]: Finished difference Result 153 states and 184 transitions. [2018-11-23 10:19:30,060 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 184 transitions. [2018-11-23 10:19:30,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:19:30,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:19:30,062 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:19:30,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:19:30,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 10:19:30,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 105 transitions. [2018-11-23 10:19:30,065 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 105 transitions. Word has length 26 [2018-11-23 10:19:30,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:19:30,065 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 105 transitions. [2018-11-23 10:19:30,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 10:19:30,065 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 105 transitions. [2018-11-23 10:19:30,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 10:19:30,066 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:19:30,067 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:19:30,067 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:19:30,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:19:30,067 INFO L82 PathProgramCache]: Analyzing trace with hash -2146027630, now seen corresponding path program 4 times [2018-11-23 10:19:30,068 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:19:30,068 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:19:30,101 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:19:30,167 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:19:30,167 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:19:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:19:30,202 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:19:30,965 INFO L256 TraceCheckUtils]: 0: Hoare triple {4536#true} call ULTIMATE.init(); {4536#true} is VALID [2018-11-23 10:19:30,965 INFO L273 TraceCheckUtils]: 1: Hoare triple {4536#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {4536#true} is VALID [2018-11-23 10:19:30,966 INFO L273 TraceCheckUtils]: 2: Hoare triple {4536#true} assume true; {4536#true} is VALID [2018-11-23 10:19:30,966 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4536#true} {4536#true} #54#return; {4536#true} is VALID [2018-11-23 10:19:30,966 INFO L256 TraceCheckUtils]: 4: Hoare triple {4536#true} call #t~ret2 := main(); {4536#true} is VALID [2018-11-23 10:19:30,966 INFO L273 TraceCheckUtils]: 5: Hoare triple {4536#true} ~N~0 := #t~nondet0;havoc #t~nondet0; {4536#true} is VALID [2018-11-23 10:19:30,967 INFO L273 TraceCheckUtils]: 6: Hoare triple {4536#true} assume ~bvsgt32(~N~0, 0bv32);havoc ~i~0;havoc ~k~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));~i~0 := 0bv32;~k~0 := 0bv32; {4559#(and (bvsgt ~N~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:19:30,968 INFO L273 TraceCheckUtils]: 7: Hoare triple {4559#(and (bvsgt ~N~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {4563#(and (bvsgt ~N~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:19:30,970 INFO L273 TraceCheckUtils]: 8: Hoare triple {4563#(and (bvsgt ~N~0 (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {4567#(and (= (_ bv2 32) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) ~N~0))} is VALID [2018-11-23 10:19:30,971 INFO L273 TraceCheckUtils]: 9: Hoare triple {4567#(and (= (_ bv2 32) main_~i~0) (bvslt (bvadd main_~i~0 (_ bv4294967295 32)) ~N~0))} assume !~bvslt32(~i~0, ~N~0); {4571#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)))} is VALID [2018-11-23 10:19:30,972 INFO L273 TraceCheckUtils]: 10: Hoare triple {4571#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)))} ~i~0 := 0bv32; {4575#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:19:30,973 INFO L273 TraceCheckUtils]: 11: Hoare triple {4575#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4575#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:19:30,974 INFO L256 TraceCheckUtils]: 12: Hoare triple {4575#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)) (= main_~i~0 (_ bv0 32)))} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {4571#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)))} is VALID [2018-11-23 10:19:30,975 INFO L273 TraceCheckUtils]: 13: Hoare triple {4571#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)))} ~cond := #in~cond; {4571#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)))} is VALID [2018-11-23 10:19:30,975 INFO L273 TraceCheckUtils]: 14: Hoare triple {4571#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)))} assume !(0bv32 == ~cond); {4571#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)))} is VALID [2018-11-23 10:19:30,976 INFO L273 TraceCheckUtils]: 15: Hoare triple {4571#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)))} assume true; {4571#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)))} is VALID [2018-11-23 10:19:30,977 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {4571#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)))} {4575#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)) (= main_~i~0 (_ bv0 32)))} #58#return; {4575#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:19:30,978 INFO L273 TraceCheckUtils]: 17: Hoare triple {4575#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)) (= main_~i~0 (_ bv0 32)))} havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0); {4597#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:19:30,979 INFO L273 TraceCheckUtils]: 18: Hoare triple {4597#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4597#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:19:30,981 INFO L256 TraceCheckUtils]: 19: Hoare triple {4597#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {4571#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)))} is VALID [2018-11-23 10:19:30,982 INFO L273 TraceCheckUtils]: 20: Hoare triple {4571#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)))} ~cond := #in~cond; {4571#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)))} is VALID [2018-11-23 10:19:30,983 INFO L273 TraceCheckUtils]: 21: Hoare triple {4571#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)))} assume !(0bv32 == ~cond); {4571#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)))} is VALID [2018-11-23 10:19:30,983 INFO L273 TraceCheckUtils]: 22: Hoare triple {4571#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)))} assume true; {4571#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)))} is VALID [2018-11-23 10:19:30,985 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {4571#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)))} {4597#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #58#return; {4597#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:19:30,986 INFO L273 TraceCheckUtils]: 24: Hoare triple {4597#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0); {4619#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 10:19:30,989 INFO L273 TraceCheckUtils]: 25: Hoare triple {4619#(and (bvslt (_ bv1 32) ~N~0) (not (bvslt (_ bv2 32) ~N~0)) (= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4537#false} is VALID [2018-11-23 10:19:30,990 INFO L256 TraceCheckUtils]: 26: Hoare triple {4537#false} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {4537#false} is VALID [2018-11-23 10:19:30,990 INFO L273 TraceCheckUtils]: 27: Hoare triple {4537#false} ~cond := #in~cond; {4537#false} is VALID [2018-11-23 10:19:30,990 INFO L273 TraceCheckUtils]: 28: Hoare triple {4537#false} assume 0bv32 == ~cond; {4537#false} is VALID [2018-11-23 10:19:30,990 INFO L273 TraceCheckUtils]: 29: Hoare triple {4537#false} assume !false; {4537#false} is VALID [2018-11-23 10:19:30,992 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 10:19:30,992 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:19:31,312 INFO L273 TraceCheckUtils]: 29: Hoare triple {4537#false} assume !false; {4537#false} is VALID [2018-11-23 10:19:31,313 INFO L273 TraceCheckUtils]: 28: Hoare triple {4537#false} assume 0bv32 == ~cond; {4537#false} is VALID [2018-11-23 10:19:31,313 INFO L273 TraceCheckUtils]: 27: Hoare triple {4537#false} ~cond := #in~cond; {4537#false} is VALID [2018-11-23 10:19:31,313 INFO L256 TraceCheckUtils]: 26: Hoare triple {4537#false} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {4537#false} is VALID [2018-11-23 10:19:31,314 INFO L273 TraceCheckUtils]: 25: Hoare triple {4647#(not (bvslt main_~i~0 ~N~0))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4537#false} is VALID [2018-11-23 10:19:31,315 INFO L273 TraceCheckUtils]: 24: Hoare triple {4651#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~N~0))} havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0); {4647#(not (bvslt main_~i~0 ~N~0))} is VALID [2018-11-23 10:19:31,316 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {4536#true} {4651#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~N~0))} #58#return; {4651#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~N~0))} is VALID [2018-11-23 10:19:31,316 INFO L273 TraceCheckUtils]: 22: Hoare triple {4536#true} assume true; {4536#true} is VALID [2018-11-23 10:19:31,317 INFO L273 TraceCheckUtils]: 21: Hoare triple {4536#true} assume !(0bv32 == ~cond); {4536#true} is VALID [2018-11-23 10:19:31,317 INFO L273 TraceCheckUtils]: 20: Hoare triple {4536#true} ~cond := #in~cond; {4536#true} is VALID [2018-11-23 10:19:31,317 INFO L256 TraceCheckUtils]: 19: Hoare triple {4651#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~N~0))} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {4536#true} is VALID [2018-11-23 10:19:31,318 INFO L273 TraceCheckUtils]: 18: Hoare triple {4651#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~N~0))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4651#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~N~0))} is VALID [2018-11-23 10:19:31,340 INFO L273 TraceCheckUtils]: 17: Hoare triple {4673#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~N~0))} havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0); {4651#(not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~N~0))} is VALID [2018-11-23 10:19:31,342 INFO L268 TraceCheckUtils]: 16: Hoare quadruple {4536#true} {4673#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~N~0))} #58#return; {4673#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~N~0))} is VALID [2018-11-23 10:19:31,342 INFO L273 TraceCheckUtils]: 15: Hoare triple {4536#true} assume true; {4536#true} is VALID [2018-11-23 10:19:31,342 INFO L273 TraceCheckUtils]: 14: Hoare triple {4536#true} assume !(0bv32 == ~cond); {4536#true} is VALID [2018-11-23 10:19:31,342 INFO L273 TraceCheckUtils]: 13: Hoare triple {4536#true} ~cond := #in~cond; {4536#true} is VALID [2018-11-23 10:19:31,342 INFO L256 TraceCheckUtils]: 12: Hoare triple {4673#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~N~0))} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {4536#true} is VALID [2018-11-23 10:19:31,343 INFO L273 TraceCheckUtils]: 11: Hoare triple {4673#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~N~0))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4673#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~N~0))} is VALID [2018-11-23 10:19:31,343 INFO L273 TraceCheckUtils]: 10: Hoare triple {4695#(not (bvslt (_ bv2 32) ~N~0))} ~i~0 := 0bv32; {4673#(not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~N~0))} is VALID [2018-11-23 10:19:31,344 INFO L273 TraceCheckUtils]: 9: Hoare triple {4699#(or (not (bvslt (_ bv2 32) ~N~0)) (bvslt main_~i~0 ~N~0))} assume !~bvslt32(~i~0, ~N~0); {4695#(not (bvslt (_ bv2 32) ~N~0))} is VALID [2018-11-23 10:19:31,345 INFO L273 TraceCheckUtils]: 8: Hoare triple {4703#(or (not (bvslt main_~i~0 ~N~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~N~0) (not (bvslt (_ bv2 32) ~N~0)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {4699#(or (not (bvslt (_ bv2 32) ~N~0)) (bvslt main_~i~0 ~N~0))} is VALID [2018-11-23 10:19:31,378 INFO L273 TraceCheckUtils]: 7: Hoare triple {4707#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~N~0) (not (bvslt (_ bv2 32) ~N~0)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~N~0)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {4703#(or (not (bvslt main_~i~0 ~N~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~N~0) (not (bvslt (_ bv2 32) ~N~0)))} is VALID [2018-11-23 10:19:31,379 INFO L273 TraceCheckUtils]: 6: Hoare triple {4536#true} assume ~bvsgt32(~N~0, 0bv32);havoc ~i~0;havoc ~k~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));~i~0 := 0bv32;~k~0 := 0bv32; {4707#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~N~0) (not (bvslt (_ bv2 32) ~N~0)) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~N~0)))} is VALID [2018-11-23 10:19:31,379 INFO L273 TraceCheckUtils]: 5: Hoare triple {4536#true} ~N~0 := #t~nondet0;havoc #t~nondet0; {4536#true} is VALID [2018-11-23 10:19:31,379 INFO L256 TraceCheckUtils]: 4: Hoare triple {4536#true} call #t~ret2 := main(); {4536#true} is VALID [2018-11-23 10:19:31,379 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4536#true} {4536#true} #54#return; {4536#true} is VALID [2018-11-23 10:19:31,380 INFO L273 TraceCheckUtils]: 2: Hoare triple {4536#true} assume true; {4536#true} is VALID [2018-11-23 10:19:31,380 INFO L273 TraceCheckUtils]: 1: Hoare triple {4536#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {4536#true} is VALID [2018-11-23 10:19:31,380 INFO L256 TraceCheckUtils]: 0: Hoare triple {4536#true} call ULTIMATE.init(); {4536#true} is VALID [2018-11-23 10:19:31,381 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 10:19:31,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:19:31,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 10:19:31,383 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-11-23 10:19:31,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:19:31,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 10:19:31,515 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:19:31,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 10:19:31,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 10:19:31,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:19:31,516 INFO L87 Difference]: Start difference. First operand 87 states and 105 transitions. Second operand 16 states. [2018-11-23 10:19:32,211 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-11-23 10:19:34,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:19:34,781 INFO L93 Difference]: Finished difference Result 126 states and 149 transitions. [2018-11-23 10:19:34,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 10:19:34,781 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-11-23 10:19:34,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:19:34,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 10:19:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 54 transitions. [2018-11-23 10:19:34,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 10:19:34,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 54 transitions. [2018-11-23 10:19:34,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 54 transitions. [2018-11-23 10:19:34,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:19:34,997 INFO L225 Difference]: With dead ends: 126 [2018-11-23 10:19:34,997 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 10:19:34,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2018-11-23 10:19:34,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 10:19:35,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 87. [2018-11-23 10:19:35,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:19:35,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 87 states. [2018-11-23 10:19:35,493 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 87 states. [2018-11-23 10:19:35,493 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 87 states. [2018-11-23 10:19:35,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:19:35,498 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2018-11-23 10:19:35,498 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2018-11-23 10:19:35,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:19:35,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:19:35,499 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 101 states. [2018-11-23 10:19:35,499 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 101 states. [2018-11-23 10:19:35,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:19:35,503 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2018-11-23 10:19:35,503 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2018-11-23 10:19:35,503 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:19:35,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:19:35,504 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:19:35,504 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:19:35,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-11-23 10:19:35,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 104 transitions. [2018-11-23 10:19:35,506 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 104 transitions. Word has length 30 [2018-11-23 10:19:35,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:19:35,507 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 104 transitions. [2018-11-23 10:19:35,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 10:19:35,507 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2018-11-23 10:19:35,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 10:19:35,508 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:19:35,508 INFO L402 BasicCegarLoop]: trace histogram [9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:19:35,508 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:19:35,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:19:35,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1695058296, now seen corresponding path program 5 times [2018-11-23 10:19:35,509 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:19:35,509 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:19:35,537 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-23 10:19:36,201 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 10:19:36,201 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:19:36,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:19:36,253 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:19:36,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-23 10:19:36,346 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 15 treesize of output 14 [2018-11-23 10:19:36,350 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:19:36,353 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:19:36,369 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:19:36,369 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-23 10:19:36,423 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 18 [2018-11-23 10:19:36,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:36,435 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:36,436 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 37 [2018-11-23 10:19:36,439 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:19:36,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:19:36,467 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:19:36,467 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-11-23 10:19:36,547 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-11-23 10:19:36,558 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:36,560 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:36,562 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:36,564 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:36,567 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:36,569 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:36,570 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 105 [2018-11-23 10:19:36,581 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:19:36,603 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:19:36,630 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:19:36,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-11-23 10:19:36,761 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2018-11-23 10:19:36,800 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:36,803 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:36,805 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:36,807 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:36,809 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:36,811 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:36,814 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:36,816 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:36,818 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:36,821 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:36,823 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:36,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:36,827 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 206 [2018-11-23 10:19:36,836 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:19:36,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:19:36,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:19:36,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:59, output treesize:55 [2018-11-23 10:19:37,027 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 43 [2018-11-23 10:19:37,042 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,045 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,047 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,050 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,052 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,055 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,057 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,060 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,063 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,064 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,067 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,071 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,074 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,077 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,079 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,083 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,085 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,088 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,091 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,093 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,094 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 266 [2018-11-23 10:19:37,098 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:19:37,163 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:19:37,190 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:19:37,190 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:62, output treesize:58 [2018-11-23 10:19:37,338 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 55 [2018-11-23 10:19:37,355 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,357 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,360 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,364 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,367 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,370 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,373 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,376 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,379 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,383 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,386 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,392 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,398 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,402 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,405 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,408 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,411 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,414 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,421 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,425 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,428 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,432 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,434 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,440 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,447 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,447 INFO L303 Elim1Store]: Index analysis took 103 ms [2018-11-23 10:19:37,448 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 30 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 419 [2018-11-23 10:19:37,460 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:19:37,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:19:37,617 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:19:37,617 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:76, output treesize:72 [2018-11-23 10:19:37,769 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 61 [2018-11-23 10:19:37,789 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,797 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,801 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,804 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,808 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,814 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,818 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,826 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,829 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,832 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,835 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,839 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,842 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,846 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,850 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,854 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,858 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,862 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,866 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,869 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,873 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,877 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,882 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,885 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,889 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,893 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,897 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,901 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,912 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,917 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,921 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,925 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,928 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,932 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,936 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,941 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,945 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,949 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:37,950 INFO L303 Elim1Store]: Index analysis took 172 ms [2018-11-23 10:19:37,951 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 42 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 540 [2018-11-23 10:19:37,960 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:19:38,133 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:19:38,176 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:19:38,177 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:84, output treesize:80 [2018-11-23 10:19:38,329 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 68 [2018-11-23 10:19:38,351 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,357 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,361 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,366 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,370 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,374 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,379 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,384 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,387 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,395 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,399 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,403 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,407 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,413 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,417 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,422 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,426 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,430 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,435 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,438 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,442 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,446 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,451 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,459 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,463 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,468 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,473 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,477 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,481 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,486 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,490 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,494 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,499 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,503 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,509 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,515 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,519 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,525 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,530 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,535 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,539 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,544 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,584 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,589 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,593 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,598 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,602 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,608 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,622 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,626 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,629 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,634 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:38,634 INFO L303 Elim1Store]: Index analysis took 294 ms [2018-11-23 10:19:38,636 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 56 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 711 [2018-11-23 10:19:38,645 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:19:38,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:19:38,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:19:38,919 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:88, output treesize:84 [2018-11-23 10:19:39,694 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 52 [2018-11-23 10:19:39,706 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:39,707 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,707 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,708 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,709 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,710 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,711 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,713 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,714 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,715 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,716 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,717 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,718 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,720 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,721 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,722 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,723 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,724 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,725 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,726 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,728 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,729 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,730 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,731 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,732 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,733 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,734 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,735 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:19:39,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 55 disjoint index pairs (out of 36 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 69 [2018-11-23 10:19:39,741 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:19:39,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:19:39,768 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:19:39,768 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:75, output treesize:9 [2018-11-23 10:19:39,776 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:19:39,777 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (and (= (_ bv4 32) (select .cse0 (_ bv16 32))) (= (_ bv1 32) (select .cse0 (_ bv4 32))) (= (bvadd (select .cse0 (_ bv28 32)) (_ bv4294967289 32)) (_ bv0 32)) (= |main_#t~mem1| (select .cse0 (bvmul (_ bv4 32) main_~i~0))) (= (_ bv8 32) (select .cse0 (_ bv32 32))) (= (_ bv5 32) (select .cse0 (_ bv20 32))) (= (_ bv3 32) (select .cse0 (_ bv12 32))) (= (bvadd (select .cse0 (_ bv24 32)) (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv2 32) (select .cse0 (_ bv8 32))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))) [2018-11-23 10:19:39,777 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= (_ bv1 32) |main_#t~mem1|) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) [2018-11-23 10:19:39,996 INFO L256 TraceCheckUtils]: 0: Hoare triple {5267#true} call ULTIMATE.init(); {5267#true} is VALID [2018-11-23 10:19:39,997 INFO L273 TraceCheckUtils]: 1: Hoare triple {5267#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {5267#true} is VALID [2018-11-23 10:19:39,997 INFO L273 TraceCheckUtils]: 2: Hoare triple {5267#true} assume true; {5267#true} is VALID [2018-11-23 10:19:39,997 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5267#true} {5267#true} #54#return; {5267#true} is VALID [2018-11-23 10:19:39,997 INFO L256 TraceCheckUtils]: 4: Hoare triple {5267#true} call #t~ret2 := main(); {5267#true} is VALID [2018-11-23 10:19:39,998 INFO L273 TraceCheckUtils]: 5: Hoare triple {5267#true} ~N~0 := #t~nondet0;havoc #t~nondet0; {5267#true} is VALID [2018-11-23 10:19:39,999 INFO L273 TraceCheckUtils]: 6: Hoare triple {5267#true} assume ~bvsgt32(~N~0, 0bv32);havoc ~i~0;havoc ~k~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));~i~0 := 0bv32;~k~0 := 0bv32; {5290#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 10:19:40,000 INFO L273 TraceCheckUtils]: 7: Hoare triple {5290#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5294#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:19:40,005 INFO L273 TraceCheckUtils]: 8: Hoare triple {5294#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5298#(and (= (bvadd main_~k~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~k~0))} is VALID [2018-11-23 10:19:40,008 INFO L273 TraceCheckUtils]: 9: Hoare triple {5298#(and (= (bvadd main_~k~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~k~0))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5302#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:19:40,018 INFO L273 TraceCheckUtils]: 10: Hoare triple {5302#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5306#(and (= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~k~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} is VALID [2018-11-23 10:19:40,023 INFO L273 TraceCheckUtils]: 11: Hoare triple {5306#(and (= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~k~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5310#(and (= (bvadd main_~k~0 (_ bv4294967294 32)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4294967288 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~k~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:19:40,029 INFO L273 TraceCheckUtils]: 12: Hoare triple {5310#(and (= (bvadd main_~k~0 (_ bv4294967294 32)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4294967288 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~k~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5314#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~k~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 10:19:40,035 INFO L273 TraceCheckUtils]: 13: Hoare triple {5314#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd main_~k~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5318#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~k~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 10:19:40,044 INFO L273 TraceCheckUtils]: 14: Hoare triple {5318#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= (bvadd main_~k~0 (_ bv4294967295 32)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5322#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv28 32))) (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv24 32))) (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 10:19:40,053 INFO L273 TraceCheckUtils]: 15: Hoare triple {5322#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv28 32))) (_ bv4294967289 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv24 32))) (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5326#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv32 32))) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv24 32))) (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv7 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv28 32)))))} is VALID [2018-11-23 10:19:40,055 INFO L273 TraceCheckUtils]: 16: Hoare triple {5326#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv32 32))) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv24 32))) (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv7 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv28 32)))))} assume !~bvslt32(~i~0, ~N~0); {5326#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv32 32))) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv24 32))) (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv7 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv28 32)))))} is VALID [2018-11-23 10:19:40,056 INFO L273 TraceCheckUtils]: 17: Hoare triple {5326#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv32 32))) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv24 32))) (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv7 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv28 32)))))} ~i~0 := 0bv32; {5333#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv32 32))) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv24 32))) (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv7 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv28 32)))))} is VALID [2018-11-23 10:19:40,059 INFO L273 TraceCheckUtils]: 18: Hoare triple {5333#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv32 32))) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv24 32))) (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv7 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv28 32)))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5333#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv32 32))) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv24 32))) (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv7 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv28 32)))))} is VALID [2018-11-23 10:19:40,063 INFO L256 TraceCheckUtils]: 19: Hoare triple {5333#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv32 32))) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv24 32))) (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv7 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv28 32)))))} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {5340#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv7 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv28 32))) (= (_ bv5 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv20 32))) (= (_ bv4 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv16 32))) (= (_ bv6 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv24 32))) (= (_ bv8 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv32 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv12 32)) (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 10:19:40,064 INFO L273 TraceCheckUtils]: 20: Hoare triple {5340#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv7 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv28 32))) (= (_ bv5 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv20 32))) (= (_ bv4 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv16 32))) (= (_ bv6 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv24 32))) (= (_ bv8 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv32 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv12 32)) (_ bv4294967293 32)) (_ bv0 32))))} ~cond := #in~cond; {5340#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv7 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv28 32))) (= (_ bv5 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv20 32))) (= (_ bv4 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv16 32))) (= (_ bv6 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv24 32))) (= (_ bv8 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv32 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv12 32)) (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 10:19:40,064 INFO L273 TraceCheckUtils]: 21: Hoare triple {5340#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv7 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv28 32))) (= (_ bv5 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv20 32))) (= (_ bv4 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv16 32))) (= (_ bv6 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv24 32))) (= (_ bv8 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv32 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv12 32)) (_ bv4294967293 32)) (_ bv0 32))))} assume !(0bv32 == ~cond); {5340#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv7 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv28 32))) (= (_ bv5 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv20 32))) (= (_ bv4 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv16 32))) (= (_ bv6 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv24 32))) (= (_ bv8 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv32 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv12 32)) (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 10:19:40,065 INFO L273 TraceCheckUtils]: 22: Hoare triple {5340#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv7 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv28 32))) (= (_ bv5 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv20 32))) (= (_ bv4 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv16 32))) (= (_ bv6 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv24 32))) (= (_ bv8 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv32 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv12 32)) (_ bv4294967293 32)) (_ bv0 32))))} assume true; {5340#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv7 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv28 32))) (= (_ bv5 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv20 32))) (= (_ bv4 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv16 32))) (= (_ bv6 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv24 32))) (= (_ bv8 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv32 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv12 32)) (_ bv4294967293 32)) (_ bv0 32))))} is VALID [2018-11-23 10:19:40,066 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {5340#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| (_ BitVec 32))) (and (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv8 32)) (_ bv4294967294 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv4 32)) (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv7 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv28 32))) (= (_ bv5 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv20 32))) (= (_ bv4 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv16 32))) (= (_ bv6 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv24 32))) (= (_ bv8 32) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv32 32))) (= (bvadd (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (_ bv12 32)) (_ bv4294967293 32)) (_ bv0 32))))} {5333#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv32 32))) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv24 32))) (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv7 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv28 32)))))} #58#return; {5333#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv32 32))) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv24 32))) (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv7 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv28 32)))))} is VALID [2018-11-23 10:19:40,068 INFO L273 TraceCheckUtils]: 24: Hoare triple {5333#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv32 32))) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv24 32))) (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv7 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv28 32)))))} havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0); {5356#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv32 32))) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv24 32))) (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv7 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv28 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:19:40,070 INFO L273 TraceCheckUtils]: 25: Hoare triple {5356#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv16 32))) (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv3 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv12 32)))) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv32 32))) (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv2 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv24 32))) (_ bv4294967290 32)) (_ bv0 32)) (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv20 32))) (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv7 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv28 32)))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5360#(and (= (_ bv1 32) |main_#t~mem1|) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:19:40,072 INFO L256 TraceCheckUtils]: 26: Hoare triple {5360#(and (= (_ bv1 32) |main_#t~mem1|) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {5364#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:19:40,072 INFO L273 TraceCheckUtils]: 27: Hoare triple {5364#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {5368#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:19:40,073 INFO L273 TraceCheckUtils]: 28: Hoare triple {5368#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {5268#false} is VALID [2018-11-23 10:19:40,073 INFO L273 TraceCheckUtils]: 29: Hoare triple {5268#false} assume !false; {5268#false} is VALID [2018-11-23 10:19:40,081 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:19:40,081 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:19:42,792 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 84 [2018-11-23 10:19:42,802 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 88 [2018-11-23 10:19:42,831 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:42,831 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:42,833 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 88 treesize of output 114 [2018-11-23 10:19:42,870 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:42,870 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:42,871 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:42,872 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:42,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 165 [2018-11-23 10:19:42,900 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:42,900 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:42,901 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:42,901 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:42,901 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:42,902 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:42,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 128 treesize of output 241 [2018-11-23 10:19:43,080 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,083 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,086 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,086 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,087 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,087 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,091 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,092 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 166 treesize of output 342 [2018-11-23 10:19:43,247 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,248 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,252 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,253 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,253 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,254 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,256 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,256 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,258 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,258 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,262 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 30 disjoint index pairs (out of 10 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 216 treesize of output 468 [2018-11-23 10:19:43,565 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,566 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,566 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,567 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,567 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,567 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,568 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,569 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,570 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,571 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,573 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,575 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:43,581 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 42 disjoint index pairs (out of 15 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 278 treesize of output 619 [2018-11-23 10:19:45,041 WARN L180 SmtUtils]: Spent 670.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 64 [2018-11-23 10:19:45,129 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,130 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,137 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,138 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,145 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,146 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,146 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,156 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,157 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,157 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,158 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,166 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,167 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,167 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,168 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,184 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,185 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,185 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,186 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,187 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,187 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,188 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,189 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,196 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,196 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,197 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,197 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,198 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,204 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,206 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,208 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,209 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,216 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,217 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,217 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,218 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,235 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,236 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,237 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,238 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,239 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,240 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:45,243 INFO L303 Elim1Store]: Index analysis took 130 ms [2018-11-23 10:19:45,339 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 43 disjoint index pairs (out of 28 index pairs), introduced 1 new quantified variables, introduced 7 case distinctions, treesize of input 98 treesize of output 524 [2018-11-23 10:19:45,340 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-23 10:19:46,168 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 8 xjuncts. [2018-11-23 10:19:46,246 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,247 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,247 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,248 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,248 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,249 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,249 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,250 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,250 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,251 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,252 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,252 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,253 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,254 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,254 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,255 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,256 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,256 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,257 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,258 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,258 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,260 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,260 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,261 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,262 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,263 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,263 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,264 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,266 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,267 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,269 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,270 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,270 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,271 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,272 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,273 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,273 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,274 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,276 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,276 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,278 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,279 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:19:46,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 42 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 411 [2018-11-23 10:19:46,323 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-23 10:19:47,608 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-23 10:19:47,855 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-23 10:19:48,052 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-23 10:19:48,260 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-23 10:19:48,469 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-23 10:19:48,666 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-23 10:19:48,873 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-23 10:19:49,045 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 7 xjuncts. [2018-11-23 10:19:49,212 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 7 xjuncts. [2018-11-23 10:19:49,213 INFO L202 ElimStorePlain]: Needed 11 recursive calls to eliminate 2 variables, input treesize:86, output treesize:486 [2018-11-23 10:19:49,539 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 47 [2018-11-23 10:19:49,881 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 46 [2018-11-23 10:19:49,911 INFO L273 TraceCheckUtils]: 29: Hoare triple {5268#false} assume !false; {5268#false} is VALID [2018-11-23 10:19:49,913 INFO L273 TraceCheckUtils]: 28: Hoare triple {5378#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {5268#false} is VALID [2018-11-23 10:19:49,913 INFO L273 TraceCheckUtils]: 27: Hoare triple {5382#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {5378#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:19:49,914 INFO L256 TraceCheckUtils]: 26: Hoare triple {5386#(= main_~i~0 |main_#t~mem1|)} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {5382#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:19:49,915 INFO L273 TraceCheckUtils]: 25: Hoare triple {5390#(= main_~i~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5386#(= main_~i~0 |main_#t~mem1|)} is VALID [2018-11-23 10:19:50,150 INFO L273 TraceCheckUtils]: 24: Hoare triple {5394#(= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)} havoc #t~mem1;~i~0 := ~bvadd32(1bv32, ~i~0); {5390#(= main_~i~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))} is VALID [2018-11-23 10:19:50,151 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {5267#true} {5394#(= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)} #58#return; {5394#(= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)} is VALID [2018-11-23 10:19:50,151 INFO L273 TraceCheckUtils]: 22: Hoare triple {5267#true} assume true; {5267#true} is VALID [2018-11-23 10:19:50,151 INFO L273 TraceCheckUtils]: 21: Hoare triple {5267#true} assume !(0bv32 == ~cond); {5267#true} is VALID [2018-11-23 10:19:50,152 INFO L273 TraceCheckUtils]: 20: Hoare triple {5267#true} ~cond := #in~cond; {5267#true} is VALID [2018-11-23 10:19:50,152 INFO L256 TraceCheckUtils]: 19: Hoare triple {5394#(= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)} call __VERIFIER_assert((if #t~mem1 == ~i~0 then 1bv32 else 0bv32)); {5267#true} is VALID [2018-11-23 10:19:50,152 INFO L273 TraceCheckUtils]: 18: Hoare triple {5394#(= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)} assume !!~bvslt32(~i~0, ~N~0);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {5394#(= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)} is VALID [2018-11-23 10:19:50,153 INFO L273 TraceCheckUtils]: 17: Hoare triple {5416#(= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))} ~i~0 := 0bv32; {5394#(= (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) (_ bv4294967295 32)) main_~i~0)} is VALID [2018-11-23 10:19:50,153 INFO L273 TraceCheckUtils]: 16: Hoare triple {5416#(= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))} assume !~bvslt32(~i~0, ~N~0); {5416#(= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))} is VALID [2018-11-23 10:19:50,173 INFO L273 TraceCheckUtils]: 15: Hoare triple {5423#(= (_ bv1 32) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (_ bv4 32))))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5416#(= (_ bv1 32) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))} is VALID [2018-11-23 10:19:50,210 INFO L273 TraceCheckUtils]: 14: Hoare triple {5427#(= (_ bv1 32) (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (_ bv4 32))))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5423#(= (_ bv1 32) (select (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (_ bv4 32))))} is VALID [2018-11-23 10:19:50,268 INFO L273 TraceCheckUtils]: 13: Hoare triple {5431#(= (bvadd (select (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv8 32)) (bvadd main_~k~0 (_ bv2 32))) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5427#(= (_ bv1 32) (select (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (_ bv4 32))))} is VALID [2018-11-23 10:19:50,319 INFO L273 TraceCheckUtils]: 12: Hoare triple {5435#(= (_ bv1 32) (select (store (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv8 32)) (bvadd main_~k~0 (_ bv2 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (bvadd main_~k~0 (_ bv3 32))) (bvadd |main_~#a~0.offset| (_ bv4 32))))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5431#(= (bvadd (select (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv8 32)) (bvadd main_~k~0 (_ bv2 32))) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:19:50,377 INFO L273 TraceCheckUtils]: 11: Hoare triple {5439#(= (bvadd (select (store (store (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv8 32)) (bvadd main_~k~0 (_ bv2 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (bvadd main_~k~0 (_ bv3 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv16 32)) (bvadd main_~k~0 (_ bv4 32))) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5435#(= (_ bv1 32) (select (store (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv8 32)) (bvadd main_~k~0 (_ bv2 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (bvadd main_~k~0 (_ bv3 32))) (bvadd |main_~#a~0.offset| (_ bv4 32))))} is VALID [2018-11-23 10:19:50,454 INFO L273 TraceCheckUtils]: 10: Hoare triple {5443#(= (_ bv1 32) (select (store (store (store (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv8 32)) (bvadd main_~k~0 (_ bv2 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (bvadd main_~k~0 (_ bv3 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv16 32)) (bvadd main_~k~0 (_ bv4 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (bvadd main_~k~0 (_ bv5 32))) (bvadd |main_~#a~0.offset| (_ bv4 32))))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5439#(= (bvadd (select (store (store (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv8 32)) (bvadd main_~k~0 (_ bv2 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (bvadd main_~k~0 (_ bv3 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv16 32)) (bvadd main_~k~0 (_ bv4 32))) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:19:50,539 INFO L273 TraceCheckUtils]: 9: Hoare triple {5447#(= (bvadd (select (store (store (store (store (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv8 32)) (bvadd main_~k~0 (_ bv2 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (bvadd main_~k~0 (_ bv3 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv16 32)) (bvadd main_~k~0 (_ bv4 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (bvadd main_~k~0 (_ bv5 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv24 32)) (bvadd main_~k~0 (_ bv6 32))) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5443#(= (_ bv1 32) (select (store (store (store (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv8 32)) (bvadd main_~k~0 (_ bv2 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (bvadd main_~k~0 (_ bv3 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv16 32)) (bvadd main_~k~0 (_ bv4 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (bvadd main_~k~0 (_ bv5 32))) (bvadd |main_~#a~0.offset| (_ bv4 32))))} is VALID [2018-11-23 10:19:50,577 INFO L273 TraceCheckUtils]: 8: Hoare triple {5451#(and (or (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (_ bv0 32)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (_ bv0 32))) (or (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967294 32) main_~k~0) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (_ bv0 32)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32))) (or (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (_ bv0 32)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)) (_ bv0 32)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32))) (or (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (_ bv0 32)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (_ bv0 32)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32))) (or (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (_ bv0 32)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32))) (or (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (_ bv0 32)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32)) (= (_ bv4294967292 32) main_~k~0) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (_ bv0 32)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32))) (or (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (_ bv0 32)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32))))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5447#(= (bvadd (select (store (store (store (store (store (store (store (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) main_~k~0) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd main_~k~0 (_ bv1 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv8 32)) (bvadd main_~k~0 (_ bv2 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (bvadd main_~k~0 (_ bv3 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv16 32)) (bvadd main_~k~0 (_ bv4 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (bvadd main_~k~0 (_ bv5 32))) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv24 32)) (bvadd main_~k~0 (_ bv6 32))) (bvadd |main_~#a~0.offset| (_ bv4 32))) (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:19:50,590 INFO L273 TraceCheckUtils]: 7: Hoare triple {5455#(and (or (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (_ bv0 32)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (_ bv4294967292 32) main_~k~0) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (_ bv0 32)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967272 32) (bvmul (_ bv4 32) main_~k~0))) (or (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (_ bv0 32)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967272 32) (bvmul (_ bv4 32) main_~k~0))) (or (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (_ bv0 32)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (_ bv0 32)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967272 32) (bvmul (_ bv4 32) main_~k~0))) (or (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (_ bv0 32)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967272 32) (bvmul (_ bv4 32) main_~k~0))) (or (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (_ bv0 32)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (_ bv0 32)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~k~0))) (or (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (_ bv0 32)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967294 32) main_~k~0) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (_ bv0 32)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967272 32) (bvmul (_ bv4 32) main_~k~0))) (or (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (_ bv0 32)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)) (= (_ bv4294967272 32) (bvmul (_ bv4 32) main_~k~0))))} assume !!~bvslt32(~i~0, ~N~0);call write~intINTTYPE4(~k~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0);~k~0 := ~bvadd32(1bv32, ~k~0); {5451#(and (or (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (_ bv0 32)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (_ bv0 32))) (or (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967294 32) main_~k~0) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (_ bv0 32)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32))) (or (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (_ bv0 32)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)) (_ bv0 32)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32))) (or (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (_ bv0 32)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (_ bv0 32)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32))) (or (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (_ bv0 32)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32))) (or (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (_ bv0 32)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32)) (= (_ bv4294967292 32) main_~k~0) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (_ bv0 32)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32))) (or (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4294967292 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (_ bv0 32)) (= (bvmul (_ bv4 32) main_~k~0) (_ bv0 32))))} is VALID [2018-11-23 10:19:50,591 INFO L273 TraceCheckUtils]: 6: Hoare triple {5267#true} assume ~bvsgt32(~N~0, 0bv32);havoc ~i~0;havoc ~k~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~N~0));~i~0 := 0bv32;~k~0 := 0bv32; {5455#(and (or (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (_ bv0 32)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (_ bv4294967292 32) main_~k~0) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (_ bv0 32)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967272 32) (bvmul (_ bv4 32) main_~k~0))) (or (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv3 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (_ bv0 32)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967272 32) (bvmul (_ bv4 32) main_~k~0))) (or (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (_ bv0 32)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv1 32)) (_ bv0 32)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (_ bv0 32)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967272 32) (bvmul (_ bv4 32) main_~k~0))) (or (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (_ bv0 32)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv5 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967272 32) (bvmul (_ bv4 32) main_~k~0))) (or (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (_ bv0 32)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv6 32)) (_ bv0 32)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (_ bv0 32)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~k~0))) (or (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (_ bv0 32)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967294 32) main_~k~0) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (_ bv0 32)) (= (_ bv0 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967272 32) (bvmul (_ bv4 32) main_~k~0))) (or (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv12 32)) (_ bv0 32)) (= (_ bv4294967288 32) (bvmul (_ bv4 32) main_~k~0)) (= (_ bv4294967292 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd main_~k~0 (_ bv7 32)) (_ bv0 32)) (= (_ bv4294967280 32) (bvmul (_ bv4 32) main_~k~0)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv20 32)) (_ bv0 32)) (= main_~k~0 (_ bv0 32)) (= (_ bv4294967272 32) (bvmul (_ bv4 32) main_~k~0))))} is VALID [2018-11-23 10:19:50,592 INFO L273 TraceCheckUtils]: 5: Hoare triple {5267#true} ~N~0 := #t~nondet0;havoc #t~nondet0; {5267#true} is VALID [2018-11-23 10:19:50,592 INFO L256 TraceCheckUtils]: 4: Hoare triple {5267#true} call #t~ret2 := main(); {5267#true} is VALID [2018-11-23 10:19:50,592 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5267#true} {5267#true} #54#return; {5267#true} is VALID [2018-11-23 10:19:50,592 INFO L273 TraceCheckUtils]: 2: Hoare triple {5267#true} assume true; {5267#true} is VALID [2018-11-23 10:19:50,592 INFO L273 TraceCheckUtils]: 1: Hoare triple {5267#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~N~0 := 0bv32; {5267#true} is VALID [2018-11-23 10:19:50,592 INFO L256 TraceCheckUtils]: 0: Hoare triple {5267#true} call ULTIMATE.init(); {5267#true} is VALID [2018-11-23 10:19:50,596 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 2 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:19:50,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:19:50,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 33 [2018-11-23 10:19:50,600 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 30 [2018-11-23 10:19:50,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:19:50,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 10:19:51,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:19:51,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 10:19:51,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 10:19:51,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=907, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 10:19:51,381 INFO L87 Difference]: Start difference. First operand 87 states and 104 transitions. Second operand 33 states. [2018-11-23 10:19:57,835 WARN L180 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2018-11-23 10:20:01,146 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2018-11-23 10:20:02,542 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2018-11-23 10:20:04,247 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-11-23 10:20:06,094 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 36 [2018-11-23 10:20:07,867 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 33 [2018-11-23 10:20:12,893 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2018-11-23 10:20:14,047 WARN L180 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2018-11-23 10:20:22,000 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2018-11-23 10:20:22,911 WARN L180 SmtUtils]: Spent 318.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 91 [2018-11-23 10:20:29,274 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 43 [2018-11-23 10:20:30,607 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2018-11-23 10:20:31,448 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 45 [2018-11-23 10:20:34,540 WARN L180 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 85 [2018-11-23 10:20:35,106 WARN L180 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 87 [2018-11-23 10:20:42,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:20:42,250 INFO L93 Difference]: Finished difference Result 240 states and 291 transitions. [2018-11-23 10:20:42,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-11-23 10:20:42,250 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 30 [2018-11-23 10:20:42,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:20:42,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 10:20:42,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 254 transitions. [2018-11-23 10:20:42,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 10:20:42,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 254 transitions. [2018-11-23 10:20:42,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 72 states and 254 transitions. [2018-11-23 10:20:59,165 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 247 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2018-11-23 10:20:59,171 INFO L225 Difference]: With dead ends: 240 [2018-11-23 10:20:59,172 INFO L226 Difference]: Without dead ends: 238 [2018-11-23 10:20:59,175 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1792 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=1364, Invalid=6646, Unknown=0, NotChecked=0, Total=8010 [2018-11-23 10:20:59,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-11-23 10:21:00,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 133. [2018-11-23 10:21:00,921 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:21:00,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand 133 states. [2018-11-23 10:21:00,921 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand 133 states. [2018-11-23 10:21:00,921 INFO L87 Difference]: Start difference. First operand 238 states. Second operand 133 states. [2018-11-23 10:21:00,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:00,930 INFO L93 Difference]: Finished difference Result 238 states and 288 transitions. [2018-11-23 10:21:00,930 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 288 transitions. [2018-11-23 10:21:00,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:00,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:00,932 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 238 states. [2018-11-23 10:21:00,932 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 238 states. [2018-11-23 10:21:00,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:21:00,941 INFO L93 Difference]: Finished difference Result 238 states and 288 transitions. [2018-11-23 10:21:00,941 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 288 transitions. [2018-11-23 10:21:00,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:21:00,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:21:00,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:21:00,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:21:00,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-11-23 10:21:00,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 156 transitions. [2018-11-23 10:21:00,947 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 156 transitions. Word has length 30 [2018-11-23 10:21:00,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:21:00,947 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 156 transitions. [2018-11-23 10:21:00,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 10:21:00,947 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 156 transitions. [2018-11-23 10:21:00,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 10:21:00,948 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:21:00,948 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:21:00,949 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:21:00,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:21:00,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1514279342, now seen corresponding path program 5 times [2018-11-23 10:21:00,949 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:21:00,950 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 13 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 13 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:21:00,979 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 10:21:03,834 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2018-11-23 10:21:03,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:21:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:21:03,926 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:21:03,964 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-23 10:21:03,972 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-23 10:21:03,975 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:21:03,980 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:21:03,991 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:21:03,992 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-11-23 10:21:04,041 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 16 [2018-11-23 10:21:04,050 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,052 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,053 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 31 [2018-11-23 10:21:04,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:21:04,070 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:21:04,086 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:21:04,087 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:25 [2018-11-23 10:21:04,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 30 [2018-11-23 10:21:04,198 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,202 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,205 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,207 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,209 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,212 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 95 [2018-11-23 10:21:04,223 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:21:04,248 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:21:04,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:21:04,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:41 [2018-11-23 10:21:04,368 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 32 [2018-11-23 10:21:04,385 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,389 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,397 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,400 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,403 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,407 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,410 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,413 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,418 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,421 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,422 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 12 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 151 [2018-11-23 10:21:04,426 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:21:04,464 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:21:04,488 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:21:04,488 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:49, output treesize:45 [2018-11-23 10:21:04,580 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 41 [2018-11-23 10:21:04,597 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,599 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,603 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,605 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,607 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,610 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,613 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,615 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,618 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,621 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,623 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,626 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,630 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,632 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,635 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,637 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,640 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,642 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,644 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,647 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,648 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 20 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 248 [2018-11-23 10:21:04,655 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:21:04,720 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:21:04,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:21:04,750 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:60, output treesize:56 [2018-11-23 10:21:04,866 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 48 [2018-11-23 10:21:04,906 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,910 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,913 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,916 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,919 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,922 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,925 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,928 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,931 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,934 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,937 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,940 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,942 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,945 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,949 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,952 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,955 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,958 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,961 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,965 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,967 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,970 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,974 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,978 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,982 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,984 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,987 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,991 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,994 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,997 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:04,999 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 30 disjoint index pairs (out of 10 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 367 [2018-11-23 10:21:05,010 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:21:05,135 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:21:05,178 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:21:05,178 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:69, output treesize:65 [2018-11-23 10:21:05,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 59 [2018-11-23 10:21:05,390 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,396 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,401 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,404 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,408 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,412 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,416 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,421 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,425 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,429 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,433 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,466 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,489 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,511 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,524 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,548 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,569 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,594 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,623 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,645 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,670 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,696 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,721 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,727 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,731 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,735 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,739 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,743 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,747 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,751 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,755 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,759 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,763 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,766 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,770 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,774 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,777 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,782 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,786 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,790 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,793 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,796 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:05,797 INFO L303 Elim1Store]: Index analysis took 417 ms [2018-11-23 10:21:05,798 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 42 disjoint index pairs (out of 15 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 514 [2018-11-23 10:21:05,806 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 10:21:06,037 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:21:06,078 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 10:21:06,078 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:82, output treesize:78 [2018-11-23 10:21:06,222 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 69 [2018-11-23 10:21:06,242 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,247 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,251 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,255 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,260 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,264 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,268 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,272 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,276 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,280 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,285 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,289 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,293 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,297 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,300 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,305 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,310 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,314 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,319 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,323 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,326 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,330 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,335 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,339 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,344 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,348 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,352 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,356 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,361 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,366 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,372 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,377 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,381 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,386 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,391 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,396 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,401 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,407 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,412 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,415 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,419 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,424 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,428 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,432 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,437 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,442 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,446 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,451 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,455 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,460 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,464 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,467 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,472 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,476 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,481 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,486 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 10:21:06,486 INFO L303 Elim1Store]: Index analysis took 254 ms [2018-11-23 10:21:06,488 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 7 select indices, 7 select index equivalence classes, 56 disjoint index pairs (out of 21 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 719 [2018-11-23 10:21:06,499 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.