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_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/rew_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:21:41,723 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:21:41,725 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:21:41,740 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:21:41,741 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:21:41,742 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:21:41,744 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:21:41,747 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:21:41,751 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:21:41,752 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:21:41,753 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:21:41,753 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:21:41,754 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:21:41,755 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:21:41,756 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:21:41,757 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:21:41,758 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:21:41,760 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:21:41,762 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:21:41,763 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:21:41,764 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:21:41,766 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:21:41,768 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:21:41,768 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:21:41,768 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:21:41,769 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:21:41,770 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:21:41,771 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:21:41,772 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:21:41,774 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:21:41,774 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:21:41,775 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:21:41,776 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:21:41,776 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:21:41,777 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:21:41,777 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:21:41,779 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:21:41,809 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:21:41,810 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:21:41,810 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:21:41,811 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:21:41,811 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:21:41,811 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:21:41,812 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:21:41,812 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:21:41,812 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:21:41,812 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:21:41,812 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:21:41,813 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:21:41,813 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:21:41,813 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:21:41,813 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:21:41,813 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:21:41,814 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:21:41,814 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:21:41,814 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:21:41,814 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:21:41,814 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:21:41,815 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:21:41,815 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:21:41,815 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:21:41,815 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:21:41,815 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:21:41,816 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:21:41,816 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:21:41,816 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:21:41,816 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:21:41,816 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:21:41,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:21:41,877 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:21:41,882 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:21:41,884 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:21:41,884 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:21:41,885 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/rew_true-unreach-call.i [2018-11-23 12:21:41,951 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46e911482/9cb852bf9dd74a85bbb4f9051c544de0/FLAGc474ed8ca [2018-11-23 12:21:42,407 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:21:42,408 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/rew_true-unreach-call.i [2018-11-23 12:21:42,414 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46e911482/9cb852bf9dd74a85bbb4f9051c544de0/FLAGc474ed8ca [2018-11-23 12:21:42,765 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/46e911482/9cb852bf9dd74a85bbb4f9051c544de0 [2018-11-23 12:21:42,774 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:21:42,775 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:21:42,776 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:21:42,776 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:21:42,780 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:21:42,782 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:21:42" (1/1) ... [2018-11-23 12:21:42,785 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1035785c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:42, skipping insertion in model container [2018-11-23 12:21:42,785 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:21:42" (1/1) ... [2018-11-23 12:21:42,796 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:21:42,818 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:21:43,082 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:21:43,088 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:21:43,120 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:21:43,152 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:21:43,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:43 WrapperNode [2018-11-23 12:21:43,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:21:43,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:21:43,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:21:43,154 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:21:43,162 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:43" (1/1) ... [2018-11-23 12:21:43,170 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:43" (1/1) ... [2018-11-23 12:21:43,177 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:21:43,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:21:43,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:21:43,177 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:21:43,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:43" (1/1) ... [2018-11-23 12:21:43,185 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:43" (1/1) ... [2018-11-23 12:21:43,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:43" (1/1) ... [2018-11-23 12:21:43,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:43" (1/1) ... [2018-11-23 12:21:43,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:43" (1/1) ... [2018-11-23 12:21:43,203 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:43" (1/1) ... [2018-11-23 12:21:43,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:43" (1/1) ... [2018-11-23 12:21:43,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:21:43,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:21:43,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:21:43,215 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:21:43,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21: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 12:21:43,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:21:43,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:21:43,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:21:43,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:21:43,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:21:43,340 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:21:43,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:21:43,340 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:21:43,341 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:21:43,341 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:21:43,341 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:21:43,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:21:43,877 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:21:43,877 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:21:43,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:21:43 BoogieIcfgContainer [2018-11-23 12:21:43,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:21:43,879 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:21:43,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:21:43,883 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:21:43,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:21:42" (1/3) ... [2018-11-23 12:21:43,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f9c6ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:21:43, skipping insertion in model container [2018-11-23 12:21:43,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:21:43" (2/3) ... [2018-11-23 12:21:43,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31f9c6ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:21:43, skipping insertion in model container [2018-11-23 12:21:43,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:21:43" (3/3) ... [2018-11-23 12:21:43,887 INFO L112 eAbstractionObserver]: Analyzing ICFG rew_true-unreach-call.i [2018-11-23 12:21:43,898 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:21:43,907 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:21:43,926 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:21:43,959 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:21:43,960 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:21:43,960 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:21:43,961 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:21:43,961 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:21:43,961 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:21:43,961 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:21:43,962 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:21:43,962 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:21:43,980 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2018-11-23 12:21:43,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:21:43,986 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:43,987 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:21:43,989 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:43,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:43,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1204506220, now seen corresponding path program 1 times [2018-11-23 12:21:43,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:21:43,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:21:44,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:44,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:44,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:44,166 INFO L256 TraceCheckUtils]: 0: Hoare triple {31#true} call ULTIMATE.init(); {31#true} is VALID [2018-11-23 12:21:44,171 INFO L273 TraceCheckUtils]: 1: Hoare triple {31#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {31#true} is VALID [2018-11-23 12:21:44,172 INFO L273 TraceCheckUtils]: 2: Hoare triple {31#true} assume true; {31#true} is VALID [2018-11-23 12:21:44,173 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {31#true} {31#true} #63#return; {31#true} is VALID [2018-11-23 12:21:44,173 INFO L256 TraceCheckUtils]: 4: Hoare triple {31#true} call #t~ret5 := main(); {31#true} is VALID [2018-11-23 12:21:44,174 INFO L273 TraceCheckUtils]: 5: Hoare triple {31#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {31#true} is VALID [2018-11-23 12:21:44,174 INFO L273 TraceCheckUtils]: 6: Hoare triple {31#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 0;~low~0 := 2;~i~0 := 0; {31#true} is VALID [2018-11-23 12:21:44,181 INFO L273 TraceCheckUtils]: 7: Hoare triple {31#true} assume !true; {32#false} is VALID [2018-11-23 12:21:44,181 INFO L273 TraceCheckUtils]: 8: Hoare triple {32#false} ~i~0 := 0; {32#false} is VALID [2018-11-23 12:21:44,181 INFO L273 TraceCheckUtils]: 9: Hoare triple {32#false} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {32#false} is VALID [2018-11-23 12:21:44,182 INFO L256 TraceCheckUtils]: 10: Hoare triple {32#false} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {32#false} is VALID [2018-11-23 12:21:44,182 INFO L273 TraceCheckUtils]: 11: Hoare triple {32#false} ~cond := #in~cond; {32#false} is VALID [2018-11-23 12:21:44,183 INFO L273 TraceCheckUtils]: 12: Hoare triple {32#false} assume 0 == ~cond; {32#false} is VALID [2018-11-23 12:21:44,183 INFO L273 TraceCheckUtils]: 13: Hoare triple {32#false} assume !false; {32#false} is VALID [2018-11-23 12:21:44,186 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 12:21:44,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:44,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:21:44,193 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 12:21:44,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:21:44,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:21:44,291 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 12:21:44,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:21:44,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:21:44,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:21:44,306 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2018-11-23 12:21:44,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:44,615 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2018-11-23 12:21:44,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:21:44,615 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 12:21:44,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:44,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:21:44,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2018-11-23 12:21:44,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:21:44,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 54 transitions. [2018-11-23 12:21:44,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 54 transitions. [2018-11-23 12:21:44,774 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 12:21:44,784 INFO L225 Difference]: With dead ends: 45 [2018-11-23 12:21:44,784 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 12:21:44,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:21:44,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 12:21:44,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-23 12:21:44,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:21:44,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-23 12:21:44,828 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 12:21:44,828 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 12:21:44,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:44,832 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 12:21:44,832 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 12:21:44,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:44,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:44,833 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-23 12:21:44,833 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-23 12:21:44,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:44,837 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2018-11-23 12:21:44,837 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 12:21:44,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:44,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:44,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:21:44,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:21:44,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:21:44,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2018-11-23 12:21:44,842 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 14 [2018-11-23 12:21:44,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:44,843 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2018-11-23 12:21:44,843 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:21:44,843 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2018-11-23 12:21:44,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:21:44,844 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:44,844 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:21:44,845 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:44,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:44,845 INFO L82 PathProgramCache]: Analyzing trace with hash 142847815, now seen corresponding path program 1 times [2018-11-23 12:21:44,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:21:44,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:21:44,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:44,847 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:44,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:44,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:45,037 INFO L256 TraceCheckUtils]: 0: Hoare triple {165#true} call ULTIMATE.init(); {165#true} is VALID [2018-11-23 12:21:45,038 INFO L273 TraceCheckUtils]: 1: Hoare triple {165#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {165#true} is VALID [2018-11-23 12:21:45,038 INFO L273 TraceCheckUtils]: 2: Hoare triple {165#true} assume true; {165#true} is VALID [2018-11-23 12:21:45,038 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {165#true} {165#true} #63#return; {165#true} is VALID [2018-11-23 12:21:45,039 INFO L256 TraceCheckUtils]: 4: Hoare triple {165#true} call #t~ret5 := main(); {165#true} is VALID [2018-11-23 12:21:45,039 INFO L273 TraceCheckUtils]: 5: Hoare triple {165#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {165#true} is VALID [2018-11-23 12:21:45,040 INFO L273 TraceCheckUtils]: 6: Hoare triple {165#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 0;~low~0 := 2;~i~0 := 0; {167#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-23 12:21:45,043 INFO L273 TraceCheckUtils]: 7: Hoare triple {167#(and (<= 2 ~SIZE~0) (= main_~i~0 0))} assume !(~i~0 < ~SIZE~0); {166#false} is VALID [2018-11-23 12:21:45,043 INFO L273 TraceCheckUtils]: 8: Hoare triple {166#false} ~i~0 := 0; {166#false} is VALID [2018-11-23 12:21:45,044 INFO L273 TraceCheckUtils]: 9: Hoare triple {166#false} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {166#false} is VALID [2018-11-23 12:21:45,044 INFO L256 TraceCheckUtils]: 10: Hoare triple {166#false} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {166#false} is VALID [2018-11-23 12:21:45,045 INFO L273 TraceCheckUtils]: 11: Hoare triple {166#false} ~cond := #in~cond; {166#false} is VALID [2018-11-23 12:21:45,045 INFO L273 TraceCheckUtils]: 12: Hoare triple {166#false} assume 0 == ~cond; {166#false} is VALID [2018-11-23 12:21:45,046 INFO L273 TraceCheckUtils]: 13: Hoare triple {166#false} assume !false; {166#false} is VALID [2018-11-23 12:21:45,048 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 12:21:45,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:45,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:21:45,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 12:21:45,050 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:21:45,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:21:45,099 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 12:21:45,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:21:45,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:21:45,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:45,100 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2018-11-23 12:21:45,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:45,292 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-23 12:21:45,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:21:45,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 12:21:45,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:45,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:21:45,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2018-11-23 12:21:45,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:21:45,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2018-11-23 12:21:45,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2018-11-23 12:21:45,661 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:21:45,663 INFO L225 Difference]: With dead ends: 41 [2018-11-23 12:21:45,663 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 12:21:45,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:21:45,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 12:21:45,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-23 12:21:45,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:21:45,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2018-11-23 12:21:45,713 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2018-11-23 12:21:45,714 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2018-11-23 12:21:45,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:45,716 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-23 12:21:45,716 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 12:21:45,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:45,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:45,718 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2018-11-23 12:21:45,718 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2018-11-23 12:21:45,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:45,720 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-23 12:21:45,721 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 12:21:45,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:45,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:45,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:21:45,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:21:45,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:21:45,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-23 12:21:45,724 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 14 [2018-11-23 12:21:45,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:45,725 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-23 12:21:45,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:21:45,725 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 12:21:45,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:21:45,726 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:45,726 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:21:45,726 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:45,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:45,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1002652542, now seen corresponding path program 1 times [2018-11-23 12:21:45,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:21:45,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:21:45,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:45,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:45,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:45,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:45,838 INFO L256 TraceCheckUtils]: 0: Hoare triple {309#true} call ULTIMATE.init(); {309#true} is VALID [2018-11-23 12:21:45,838 INFO L273 TraceCheckUtils]: 1: Hoare triple {309#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {309#true} is VALID [2018-11-23 12:21:45,839 INFO L273 TraceCheckUtils]: 2: Hoare triple {309#true} assume true; {309#true} is VALID [2018-11-23 12:21:45,839 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {309#true} {309#true} #63#return; {309#true} is VALID [2018-11-23 12:21:45,839 INFO L256 TraceCheckUtils]: 4: Hoare triple {309#true} call #t~ret5 := main(); {309#true} is VALID [2018-11-23 12:21:45,840 INFO L273 TraceCheckUtils]: 5: Hoare triple {309#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {309#true} is VALID [2018-11-23 12:21:45,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {309#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 0;~low~0 := 2;~i~0 := 0; {309#true} is VALID [2018-11-23 12:21:45,840 INFO L273 TraceCheckUtils]: 7: Hoare triple {309#true} assume !!(~i~0 < ~SIZE~0); {309#true} is VALID [2018-11-23 12:21:45,857 INFO L273 TraceCheckUtils]: 8: Hoare triple {309#true} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {311#(<= (+ main_~i~0 2) ~SIZE~0)} is VALID [2018-11-23 12:21:45,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {311#(<= (+ main_~i~0 2) ~SIZE~0)} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {311#(<= (+ main_~i~0 2) ~SIZE~0)} is VALID [2018-11-23 12:21:45,877 INFO L273 TraceCheckUtils]: 10: Hoare triple {311#(<= (+ main_~i~0 2) ~SIZE~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {312#(<= (+ main_~i~0 1) ~SIZE~0)} is VALID [2018-11-23 12:21:45,878 INFO L273 TraceCheckUtils]: 11: Hoare triple {312#(<= (+ main_~i~0 1) ~SIZE~0)} assume !(~i~0 < ~SIZE~0); {310#false} is VALID [2018-11-23 12:21:45,878 INFO L273 TraceCheckUtils]: 12: Hoare triple {310#false} ~i~0 := 0; {310#false} is VALID [2018-11-23 12:21:45,878 INFO L273 TraceCheckUtils]: 13: Hoare triple {310#false} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {310#false} is VALID [2018-11-23 12:21:45,879 INFO L256 TraceCheckUtils]: 14: Hoare triple {310#false} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {310#false} is VALID [2018-11-23 12:21:45,879 INFO L273 TraceCheckUtils]: 15: Hoare triple {310#false} ~cond := #in~cond; {310#false} is VALID [2018-11-23 12:21:45,879 INFO L273 TraceCheckUtils]: 16: Hoare triple {310#false} assume 0 == ~cond; {310#false} is VALID [2018-11-23 12:21:45,879 INFO L273 TraceCheckUtils]: 17: Hoare triple {310#false} assume !false; {310#false} is VALID [2018-11-23 12:21:45,881 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:45,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:21:45,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:21:45,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 12:21:45,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:21:45,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:21:45,925 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:21:45,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:21:45,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:21:45,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:21:45,926 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 4 states. [2018-11-23 12:21:46,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:46,248 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-11-23 12:21:46,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:21:46,248 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 12:21:46,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:46,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:21:46,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2018-11-23 12:21:46,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:21:46,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2018-11-23 12:21:46,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2018-11-23 12:21:46,350 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 12:21:46,352 INFO L225 Difference]: With dead ends: 38 [2018-11-23 12:21:46,352 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:21:46,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:21:46,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:21:46,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-23 12:21:46,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:21:46,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2018-11-23 12:21:46,371 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:21:46,371 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:21:46,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:46,375 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 12:21:46,375 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 12:21:46,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:46,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:46,376 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2018-11-23 12:21:46,377 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2018-11-23 12:21:46,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:46,379 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2018-11-23 12:21:46,379 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 12:21:46,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:46,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:46,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:21:46,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:21:46,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:21:46,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-23 12:21:46,383 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2018-11-23 12:21:46,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:46,383 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-23 12:21:46,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:21:46,383 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 12:21:46,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:21:46,384 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:46,384 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 12:21:46,385 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:46,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:46,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1636198789, now seen corresponding path program 1 times [2018-11-23 12:21:46,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:21:46,386 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:21:46,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:46,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:46,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:46,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:46,994 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 26 [2018-11-23 12:21:47,274 INFO L256 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {457#true} is VALID [2018-11-23 12:21:47,275 INFO L273 TraceCheckUtils]: 1: Hoare triple {457#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {457#true} is VALID [2018-11-23 12:21:47,275 INFO L273 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2018-11-23 12:21:47,276 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #63#return; {457#true} is VALID [2018-11-23 12:21:47,276 INFO L256 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret5 := main(); {457#true} is VALID [2018-11-23 12:21:47,277 INFO L273 TraceCheckUtils]: 5: Hoare triple {457#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {457#true} is VALID [2018-11-23 12:21:47,280 INFO L273 TraceCheckUtils]: 6: Hoare triple {457#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 0;~low~0 := 2;~i~0 := 0; {459#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 2 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:47,281 INFO L273 TraceCheckUtils]: 7: Hoare triple {459#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 2 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0); {459#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 2 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:47,283 INFO L273 TraceCheckUtils]: 8: Hoare triple {459#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 2 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {459#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 2 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:47,283 INFO L273 TraceCheckUtils]: 9: Hoare triple {459#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 2 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {460#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (<= 2 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:47,284 INFO L273 TraceCheckUtils]: 10: Hoare triple {460#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (<= 2 ~SIZE~0) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {461#(and (or (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0)) (and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) 0)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:47,285 INFO L273 TraceCheckUtils]: 11: Hoare triple {461#(and (or (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0)) (and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) 0)))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0); {461#(and (or (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0)) (and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) 0)))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:47,292 INFO L273 TraceCheckUtils]: 12: Hoare triple {461#(and (or (<= (+ (* 4 main_~i~0) |main_~#a~0.offset| 5) (* 4 ~SIZE~0)) (and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) 0)))) (= |main_~#a~0.offset| 0))} assume !(1 + ~i~0 < ~SIZE~0); {462#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) 0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:47,293 INFO L273 TraceCheckUtils]: 13: Hoare triple {462#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) 0)) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {463#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) 0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:47,294 INFO L273 TraceCheckUtils]: 14: Hoare triple {463#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) 0)) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {463#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) 0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:47,295 INFO L273 TraceCheckUtils]: 15: Hoare triple {463#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) 0)) (= |main_~#a~0.offset| 0))} assume !(~i~0 < ~SIZE~0); {463#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) 0)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:47,297 INFO L273 TraceCheckUtils]: 16: Hoare triple {463#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) 0)) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {464#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:47,300 INFO L273 TraceCheckUtils]: 17: Hoare triple {464#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {465#(<= (+ main_~low~0 1) |main_#t~mem4|)} is VALID [2018-11-23 12:21:47,302 INFO L256 TraceCheckUtils]: 18: Hoare triple {465#(<= (+ main_~low~0 1) |main_#t~mem4|)} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {466#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:21:47,302 INFO L273 TraceCheckUtils]: 19: Hoare triple {466#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {467#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 12:21:47,303 INFO L273 TraceCheckUtils]: 20: Hoare triple {467#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {458#false} is VALID [2018-11-23 12:21:47,303 INFO L273 TraceCheckUtils]: 21: Hoare triple {458#false} assume !false; {458#false} is VALID [2018-11-23 12:21:47,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:47,306 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:21:47,307 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:21:47,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:47,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:47,382 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:21:47,545 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 15 treesize of output 12 [2018-11-23 12:21:47,555 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 12:21:47,560 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:47,566 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:47,591 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:47,591 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-23 12:21:47,904 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 27 treesize of output 20 [2018-11-23 12:21:47,918 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:47,920 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 31 [2018-11-23 12:21:47,922 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:47,932 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:47,983 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:21:47,984 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:32 [2018-11-23 12:21:47,988 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:21:47,989 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_9|, main_~i~0]. (let ((.cse1 (select |v_#memory_int_9| |main_~#a~0.base|))) (let ((.cse0 (select .cse1 |main_~#a~0.offset|))) (and (<= 1 main_~i~0) (<= main_~low~0 2) (<= 3 .cse0) (= |#memory_int| (store |v_#memory_int_9| |main_~#a~0.base| (store .cse1 (+ (* 4 main_~i~0) |main_~#a~0.offset|) .cse0))) (= |main_~#a~0.offset| 0)))) [2018-11-23 12:21:47,989 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~i~0]. (let ((.cse1 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse0 (select .cse1 |main_~#a~0.offset|))) (and (<= 3 .cse0) (= .cse0 (select .cse1 (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= 1 main_~i~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0)))) [2018-11-23 12:21:48,975 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 28 treesize of output 20 [2018-11-23 12:21:48,981 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:48,983 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 12:21:48,990 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:48,994 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:49,003 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:49,004 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:7 [2018-11-23 12:21:49,015 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:21:49,015 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, v_prenex_1]. (let ((.cse1 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse0 (select .cse1 0))) (and (<= 1 v_prenex_1) (<= 3 .cse0) (<= main_~low~0 2) (= .cse0 (select .cse1 (* 4 v_prenex_1))) (<= .cse0 |main_#t~mem4|)))) [2018-11-23 12:21:49,015 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= main_~low~0 2) (<= 3 |main_#t~mem4|)) [2018-11-23 12:21:49,067 INFO L256 TraceCheckUtils]: 0: Hoare triple {457#true} call ULTIMATE.init(); {457#true} is VALID [2018-11-23 12:21:49,068 INFO L273 TraceCheckUtils]: 1: Hoare triple {457#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {457#true} is VALID [2018-11-23 12:21:49,068 INFO L273 TraceCheckUtils]: 2: Hoare triple {457#true} assume true; {457#true} is VALID [2018-11-23 12:21:49,068 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {457#true} {457#true} #63#return; {457#true} is VALID [2018-11-23 12:21:49,068 INFO L256 TraceCheckUtils]: 4: Hoare triple {457#true} call #t~ret5 := main(); {457#true} is VALID [2018-11-23 12:21:49,069 INFO L273 TraceCheckUtils]: 5: Hoare triple {457#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {457#true} is VALID [2018-11-23 12:21:49,070 INFO L273 TraceCheckUtils]: 6: Hoare triple {457#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 0;~low~0 := 2;~i~0 := 0; {489#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:49,070 INFO L273 TraceCheckUtils]: 7: Hoare triple {489#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0); {489#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:49,071 INFO L273 TraceCheckUtils]: 8: Hoare triple {489#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {489#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:49,072 INFO L273 TraceCheckUtils]: 9: Hoare triple {489#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {499#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:49,073 INFO L273 TraceCheckUtils]: 10: Hoare triple {499#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {503#(and (<= 3 main_~val2~0) (<= 1 main_~i~0) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:49,075 INFO L273 TraceCheckUtils]: 11: Hoare triple {503#(and (<= 3 main_~val2~0) (<= 1 main_~i~0) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0); {503#(and (<= 3 main_~val2~0) (<= 1 main_~i~0) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:49,076 INFO L273 TraceCheckUtils]: 12: Hoare triple {503#(and (<= 3 main_~val2~0) (<= 1 main_~i~0) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} assume !(1 + ~i~0 < ~SIZE~0); {503#(and (<= 3 main_~val2~0) (<= 1 main_~i~0) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:49,078 INFO L273 TraceCheckUtils]: 13: Hoare triple {503#(and (<= 3 main_~val2~0) (<= 1 main_~i~0) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {513#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (<= main_~low~0 2) (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= 1 main_~i~0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:49,079 INFO L273 TraceCheckUtils]: 14: Hoare triple {513#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (<= main_~low~0 2) (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= 1 main_~i~0))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {513#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (<= main_~low~0 2) (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= 1 main_~i~0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:49,081 INFO L273 TraceCheckUtils]: 15: Hoare triple {513#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (<= main_~low~0 2) (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= 1 main_~i~0))) (= |main_~#a~0.offset| 0))} assume !(~i~0 < ~SIZE~0); {513#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (<= main_~low~0 2) (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= 1 main_~i~0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:49,082 INFO L273 TraceCheckUtils]: 16: Hoare triple {513#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (<= main_~low~0 2) (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= 1 main_~i~0))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {523#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (<= main_~low~0 2) (exists ((v_prenex_1 Int)) (and (<= 1 v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_1) |main_~#a~0.offset|))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:49,087 INFO L273 TraceCheckUtils]: 17: Hoare triple {523#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (<= main_~low~0 2) (exists ((v_prenex_1 Int)) (and (<= 1 v_prenex_1) (= (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_1) |main_~#a~0.offset|))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {527#(and (<= main_~low~0 2) (<= 3 |main_#t~mem4|))} is VALID [2018-11-23 12:21:49,088 INFO L256 TraceCheckUtils]: 18: Hoare triple {527#(and (<= main_~low~0 2) (<= 3 |main_#t~mem4|))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {466#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:21:49,088 INFO L273 TraceCheckUtils]: 19: Hoare triple {466#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {467#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 12:21:49,089 INFO L273 TraceCheckUtils]: 20: Hoare triple {467#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {458#false} is VALID [2018-11-23 12:21:49,089 INFO L273 TraceCheckUtils]: 21: Hoare triple {458#false} assume !false; {458#false} is VALID [2018-11-23 12:21:49,093 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:49,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:21:49,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 17 [2018-11-23 12:21:49,114 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2018-11-23 12:21:49,114 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:21:49,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:21:49,335 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:21:49,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:21:49,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:21:49,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=215, Unknown=2, NotChecked=0, Total=272 [2018-11-23 12:21:49,336 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 17 states. [2018-11-23 12:21:50,795 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 30 [2018-11-23 12:21:51,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:51,439 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2018-11-23 12:21:51,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:21:51,439 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 22 [2018-11-23 12:21:51,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:51,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:21:51,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 41 transitions. [2018-11-23 12:21:51,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:21:51,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 41 transitions. [2018-11-23 12:21:51,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 41 transitions. [2018-11-23 12:21:51,516 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 12:21:51,518 INFO L225 Difference]: With dead ends: 41 [2018-11-23 12:21:51,519 INFO L226 Difference]: Without dead ends: 39 [2018-11-23 12:21:51,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=106, Invalid=398, Unknown=2, NotChecked=0, Total=506 [2018-11-23 12:21:51,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-23 12:21:51,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2018-11-23 12:21:51,603 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:21:51,604 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 33 states. [2018-11-23 12:21:51,604 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 33 states. [2018-11-23 12:21:51,604 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 33 states. [2018-11-23 12:21:51,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:51,608 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-23 12:21:51,608 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-23 12:21:51,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:51,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:51,609 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 39 states. [2018-11-23 12:21:51,609 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 39 states. [2018-11-23 12:21:51,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:51,612 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2018-11-23 12:21:51,612 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2018-11-23 12:21:51,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:51,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:51,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:21:51,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:21:51,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:21:51,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2018-11-23 12:21:51,615 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 22 [2018-11-23 12:21:51,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:51,615 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2018-11-23 12:21:51,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:21:51,616 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2018-11-23 12:21:51,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:21:51,617 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:51,617 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:21:51,617 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:51,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:51,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1656033490, now seen corresponding path program 1 times [2018-11-23 12:21:51,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:21:51,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:21:51,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:51,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:51,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:51,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:52,062 INFO L256 TraceCheckUtils]: 0: Hoare triple {730#true} call ULTIMATE.init(); {730#true} is VALID [2018-11-23 12:21:52,063 INFO L273 TraceCheckUtils]: 1: Hoare triple {730#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {730#true} is VALID [2018-11-23 12:21:52,063 INFO L273 TraceCheckUtils]: 2: Hoare triple {730#true} assume true; {730#true} is VALID [2018-11-23 12:21:52,064 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {730#true} {730#true} #63#return; {730#true} is VALID [2018-11-23 12:21:52,064 INFO L256 TraceCheckUtils]: 4: Hoare triple {730#true} call #t~ret5 := main(); {730#true} is VALID [2018-11-23 12:21:52,064 INFO L273 TraceCheckUtils]: 5: Hoare triple {730#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {730#true} is VALID [2018-11-23 12:21:52,066 INFO L273 TraceCheckUtils]: 6: Hoare triple {730#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 0;~low~0 := 2;~i~0 := 0; {732#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 2 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-23 12:21:52,067 INFO L273 TraceCheckUtils]: 7: Hoare triple {732#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 2 ~SIZE~0) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0); {732#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 2 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-23 12:21:52,069 INFO L273 TraceCheckUtils]: 8: Hoare triple {732#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 2 ~SIZE~0) (= main_~i~0 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {732#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 2 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-23 12:21:52,070 INFO L273 TraceCheckUtils]: 9: Hoare triple {732#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 2 ~SIZE~0) (= main_~i~0 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {732#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 2 ~SIZE~0) (= main_~i~0 0))} is VALID [2018-11-23 12:21:52,071 INFO L273 TraceCheckUtils]: 10: Hoare triple {732#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 2 ~SIZE~0) (= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {733#(and (or (= (* 4 ~SIZE~0) 8) (<= (+ main_~i~0 2) ~SIZE~0)) (<= (+ main_~low~0 1) main_~val2~0) (<= (+ main_~i~0 1) ~SIZE~0))} is VALID [2018-11-23 12:21:52,072 INFO L273 TraceCheckUtils]: 11: Hoare triple {733#(and (or (= (* 4 ~SIZE~0) 8) (<= (+ main_~i~0 2) ~SIZE~0)) (<= (+ main_~low~0 1) main_~val2~0) (<= (+ main_~i~0 1) ~SIZE~0))} assume !!(~i~0 < ~SIZE~0); {733#(and (or (= (* 4 ~SIZE~0) 8) (<= (+ main_~i~0 2) ~SIZE~0)) (<= (+ main_~low~0 1) main_~val2~0) (<= (+ main_~i~0 1) ~SIZE~0))} is VALID [2018-11-23 12:21:52,073 INFO L273 TraceCheckUtils]: 12: Hoare triple {733#(and (or (= (* 4 ~SIZE~0) 8) (<= (+ main_~i~0 2) ~SIZE~0)) (<= (+ main_~low~0 1) main_~val2~0) (<= (+ main_~i~0 1) ~SIZE~0))} assume !(1 + ~i~0 < ~SIZE~0); {734#(and (<= (+ main_~low~0 1) main_~val2~0) (= (* 4 main_~i~0) 4))} is VALID [2018-11-23 12:21:52,075 INFO L273 TraceCheckUtils]: 13: Hoare triple {734#(and (<= (+ main_~low~0 1) main_~val2~0) (= (* 4 main_~i~0) 4))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {735#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= (* 4 main_~i~0) 4))} is VALID [2018-11-23 12:21:52,076 INFO L273 TraceCheckUtils]: 14: Hoare triple {735#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= (* 4 main_~i~0) 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {736#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4))))} is VALID [2018-11-23 12:21:52,077 INFO L273 TraceCheckUtils]: 15: Hoare triple {736#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4))))} assume !(~i~0 < ~SIZE~0); {736#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4))))} is VALID [2018-11-23 12:21:52,083 INFO L273 TraceCheckUtils]: 16: Hoare triple {736#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4))))} ~i~0 := 0; {737#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0))} is VALID [2018-11-23 12:21:52,084 INFO L273 TraceCheckUtils]: 17: Hoare triple {737#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {737#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0))} is VALID [2018-11-23 12:21:52,084 INFO L256 TraceCheckUtils]: 18: Hoare triple {737#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {730#true} is VALID [2018-11-23 12:21:52,085 INFO L273 TraceCheckUtils]: 19: Hoare triple {730#true} ~cond := #in~cond; {738#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 12:21:52,085 INFO L273 TraceCheckUtils]: 20: Hoare triple {738#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {739#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:21:52,086 INFO L273 TraceCheckUtils]: 21: Hoare triple {739#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {739#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:21:52,087 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {739#(not (= |__VERIFIER_assert_#in~cond| 0))} {737#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0))} #67#return; {737#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0))} is VALID [2018-11-23 12:21:52,088 INFO L273 TraceCheckUtils]: 23: Hoare triple {737#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0))} havoc #t~mem4; {737#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0))} is VALID [2018-11-23 12:21:52,089 INFO L273 TraceCheckUtils]: 24: Hoare triple {737#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {740#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))} is VALID [2018-11-23 12:21:52,091 INFO L273 TraceCheckUtils]: 25: Hoare triple {740#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {741#(<= (+ main_~low~0 1) |main_#t~mem4|)} is VALID [2018-11-23 12:21:52,092 INFO L256 TraceCheckUtils]: 26: Hoare triple {741#(<= (+ main_~low~0 1) |main_#t~mem4|)} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {739#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:21:52,093 INFO L273 TraceCheckUtils]: 27: Hoare triple {739#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {742#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:21:52,094 INFO L273 TraceCheckUtils]: 28: Hoare triple {742#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {731#false} is VALID [2018-11-23 12:21:52,095 INFO L273 TraceCheckUtils]: 29: Hoare triple {731#false} assume !false; {731#false} is VALID [2018-11-23 12:21:52,099 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:21:52,099 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:21:52,099 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:21:52,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:21:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:52,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:52,165 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:21:52,337 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 12:21:52,344 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 12:21:52,346 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:52,349 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:52,361 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 12:21:52,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-11-23 12:21:52,365 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:21:52,366 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_10|, main_~val2~0]. (and (<= 3 main_~val2~0) (= (store |v_#memory_int_10| |main_~#a~0.base| (store (select |v_#memory_int_10| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4) main_~val2~0)) |#memory_int|) (<= main_~low~0 2) (= |main_~#a~0.offset| 0)) [2018-11-23 12:21:52,366 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0)) [2018-11-23 12:21:52,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 12:21:52,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 12:21:52,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:52,776 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:52,780 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 12:21:52,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-23 12:21:52,782 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:21:52,782 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) 4))) (and (<= .cse0 |main_#t~mem4|) (<= main_~low~0 2) (<= 3 .cse0))) [2018-11-23 12:21:52,782 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= main_~low~0 2) (<= 3 |main_#t~mem4|)) [2018-11-23 12:21:52,871 INFO L256 TraceCheckUtils]: 0: Hoare triple {730#true} call ULTIMATE.init(); {730#true} is VALID [2018-11-23 12:21:52,872 INFO L273 TraceCheckUtils]: 1: Hoare triple {730#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {730#true} is VALID [2018-11-23 12:21:52,872 INFO L273 TraceCheckUtils]: 2: Hoare triple {730#true} assume true; {730#true} is VALID [2018-11-23 12:21:52,872 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {730#true} {730#true} #63#return; {730#true} is VALID [2018-11-23 12:21:52,872 INFO L256 TraceCheckUtils]: 4: Hoare triple {730#true} call #t~ret5 := main(); {730#true} is VALID [2018-11-23 12:21:52,873 INFO L273 TraceCheckUtils]: 5: Hoare triple {730#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {730#true} is VALID [2018-11-23 12:21:52,886 INFO L273 TraceCheckUtils]: 6: Hoare triple {730#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 0;~low~0 := 2;~i~0 := 0; {764#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:52,887 INFO L273 TraceCheckUtils]: 7: Hoare triple {764#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0); {764#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:52,892 INFO L273 TraceCheckUtils]: 8: Hoare triple {764#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {764#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:52,893 INFO L273 TraceCheckUtils]: 9: Hoare triple {764#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {764#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:52,893 INFO L273 TraceCheckUtils]: 10: Hoare triple {764#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {777#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:52,896 INFO L273 TraceCheckUtils]: 11: Hoare triple {777#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0); {777#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:52,896 INFO L273 TraceCheckUtils]: 12: Hoare triple {777#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !(1 + ~i~0 < ~SIZE~0); {777#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:52,897 INFO L273 TraceCheckUtils]: 13: Hoare triple {777#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {787#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:52,897 INFO L273 TraceCheckUtils]: 14: Hoare triple {787#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {787#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:52,898 INFO L273 TraceCheckUtils]: 15: Hoare triple {787#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume !(~i~0 < ~SIZE~0); {787#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:52,899 INFO L273 TraceCheckUtils]: 16: Hoare triple {787#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {797#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:52,899 INFO L273 TraceCheckUtils]: 17: Hoare triple {797#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {797#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:52,901 INFO L256 TraceCheckUtils]: 18: Hoare triple {797#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {804#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)))} is VALID [2018-11-23 12:21:52,902 INFO L273 TraceCheckUtils]: 19: Hoare triple {804#(exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4)))} ~cond := #in~cond; {808#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:21:52,903 INFO L273 TraceCheckUtils]: 20: Hoare triple {808#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(0 == ~cond); {812#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4))))} is VALID [2018-11-23 12:21:52,919 INFO L273 TraceCheckUtils]: 21: Hoare triple {812#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4))))} assume true; {812#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4))))} is VALID [2018-11-23 12:21:52,926 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {812#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|) 4))))} {797#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #67#return; {797#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:52,927 INFO L273 TraceCheckUtils]: 23: Hoare triple {797#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} havoc #t~mem4; {797#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:52,928 INFO L273 TraceCheckUtils]: 24: Hoare triple {797#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {825#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:21:52,928 INFO L273 TraceCheckUtils]: 25: Hoare triple {825#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {829#(and (<= main_~low~0 2) (<= 3 |main_#t~mem4|))} is VALID [2018-11-23 12:21:52,929 INFO L256 TraceCheckUtils]: 26: Hoare triple {829#(and (<= main_~low~0 2) (<= 3 |main_#t~mem4|))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {833#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:21:52,930 INFO L273 TraceCheckUtils]: 27: Hoare triple {833#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {837#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:21:52,930 INFO L273 TraceCheckUtils]: 28: Hoare triple {837#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {731#false} is VALID [2018-11-23 12:21:52,931 INFO L273 TraceCheckUtils]: 29: Hoare triple {731#false} assume !false; {731#false} is VALID [2018-11-23 12:21:52,935 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 12:21:52,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:21:52,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 12:21:52,954 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2018-11-23 12:21:52,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:21:52,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 12:21:53,118 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 12:21:53,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 12:21:53,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 12:21:53,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=484, Unknown=0, NotChecked=0, Total=552 [2018-11-23 12:21:53,121 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 24 states. [2018-11-23 12:22:04,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:04,352 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-11-23 12:22:04,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 12:22:04,352 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 30 [2018-11-23 12:22:04,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:22:04,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:22:04,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 64 transitions. [2018-11-23 12:22:04,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 12:22:04,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 64 transitions. [2018-11-23 12:22:04,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 64 transitions. [2018-11-23 12:22:04,470 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:04,474 INFO L225 Difference]: With dead ends: 74 [2018-11-23 12:22:04,474 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 12:22:04,475 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=140, Invalid=916, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:22:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 12:22:04,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 49. [2018-11-23 12:22:04,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:22:04,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 49 states. [2018-11-23 12:22:04,638 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 49 states. [2018-11-23 12:22:04,638 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 49 states. [2018-11-23 12:22:04,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:04,645 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-11-23 12:22:04,645 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-11-23 12:22:04,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:04,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:04,646 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 72 states. [2018-11-23 12:22:04,646 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 72 states. [2018-11-23 12:22:04,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:04,650 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2018-11-23 12:22:04,650 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2018-11-23 12:22:04,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:04,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:04,653 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:22:04,653 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:22:04,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:22:04,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2018-11-23 12:22:04,658 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 30 [2018-11-23 12:22:04,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:22:04,658 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2018-11-23 12:22:04,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 12:22:04,658 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2018-11-23 12:22:04,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:22:04,659 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:22:04,662 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:22:04,663 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:22:04,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:04,663 INFO L82 PathProgramCache]: Analyzing trace with hash -26204567, now seen corresponding path program 2 times [2018-11-23 12:22:04,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:04,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:04,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:04,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:22:04,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:04,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:05,027 INFO L256 TraceCheckUtils]: 0: Hoare triple {1171#true} call ULTIMATE.init(); {1171#true} is VALID [2018-11-23 12:22:05,027 INFO L273 TraceCheckUtils]: 1: Hoare triple {1171#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1171#true} is VALID [2018-11-23 12:22:05,028 INFO L273 TraceCheckUtils]: 2: Hoare triple {1171#true} assume true; {1171#true} is VALID [2018-11-23 12:22:05,028 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1171#true} {1171#true} #63#return; {1171#true} is VALID [2018-11-23 12:22:05,028 INFO L256 TraceCheckUtils]: 4: Hoare triple {1171#true} call #t~ret5 := main(); {1171#true} is VALID [2018-11-23 12:22:05,029 INFO L273 TraceCheckUtils]: 5: Hoare triple {1171#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1171#true} is VALID [2018-11-23 12:22:05,049 INFO L273 TraceCheckUtils]: 6: Hoare triple {1171#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 0;~low~0 := 2;~i~0 := 0; {1173#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:22:05,062 INFO L273 TraceCheckUtils]: 7: Hoare triple {1173#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0); {1173#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:22:05,076 INFO L273 TraceCheckUtils]: 8: Hoare triple {1173#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {1173#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:22:05,077 INFO L273 TraceCheckUtils]: 9: Hoare triple {1173#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1173#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:22:05,078 INFO L273 TraceCheckUtils]: 10: Hoare triple {1173#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1174#(and (<= (+ main_~low~0 1) main_~val2~0) (= (* 4 main_~i~0) 4))} is VALID [2018-11-23 12:22:05,078 INFO L273 TraceCheckUtils]: 11: Hoare triple {1174#(and (<= (+ main_~low~0 1) main_~val2~0) (= (* 4 main_~i~0) 4))} assume !!(~i~0 < ~SIZE~0); {1174#(and (<= (+ main_~low~0 1) main_~val2~0) (= (* 4 main_~i~0) 4))} is VALID [2018-11-23 12:22:05,079 INFO L273 TraceCheckUtils]: 12: Hoare triple {1174#(and (<= (+ main_~low~0 1) main_~val2~0) (= (* 4 main_~i~0) 4))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {1174#(and (<= (+ main_~low~0 1) main_~val2~0) (= (* 4 main_~i~0) 4))} is VALID [2018-11-23 12:22:05,081 INFO L273 TraceCheckUtils]: 13: Hoare triple {1174#(and (<= (+ main_~low~0 1) main_~val2~0) (= (* 4 main_~i~0) 4))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1175#(and (<= (+ main_~low~0 1) main_~val2~0) (= (* 4 main_~i~0) 4) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))))} is VALID [2018-11-23 12:22:05,082 INFO L273 TraceCheckUtils]: 14: Hoare triple {1175#(and (<= (+ main_~low~0 1) main_~val2~0) (= (* 4 main_~i~0) 4) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1176#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))))} is VALID [2018-11-23 12:22:05,083 INFO L273 TraceCheckUtils]: 15: Hoare triple {1176#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))))} assume !!(~i~0 < ~SIZE~0); {1176#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))))} is VALID [2018-11-23 12:22:05,084 INFO L273 TraceCheckUtils]: 16: Hoare triple {1176#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))))} assume !(1 + ~i~0 < ~SIZE~0); {1176#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))))} is VALID [2018-11-23 12:22:05,085 INFO L273 TraceCheckUtils]: 17: Hoare triple {1176#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1177#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4))))} is VALID [2018-11-23 12:22:05,086 INFO L273 TraceCheckUtils]: 18: Hoare triple {1177#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1177#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4))))} is VALID [2018-11-23 12:22:05,086 INFO L273 TraceCheckUtils]: 19: Hoare triple {1177#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4))))} assume !(~i~0 < ~SIZE~0); {1177#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4))))} is VALID [2018-11-23 12:22:05,087 INFO L273 TraceCheckUtils]: 20: Hoare triple {1177#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4))))} ~i~0 := 0; {1178#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0))} is VALID [2018-11-23 12:22:05,088 INFO L273 TraceCheckUtils]: 21: Hoare triple {1178#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1178#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0))} is VALID [2018-11-23 12:22:05,089 INFO L256 TraceCheckUtils]: 22: Hoare triple {1178#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {1171#true} is VALID [2018-11-23 12:22:05,089 INFO L273 TraceCheckUtils]: 23: Hoare triple {1171#true} ~cond := #in~cond; {1179#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 12:22:05,090 INFO L273 TraceCheckUtils]: 24: Hoare triple {1179#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {1180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:22:05,090 INFO L273 TraceCheckUtils]: 25: Hoare triple {1180#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:22:05,092 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1180#(not (= |__VERIFIER_assert_#in~cond| 0))} {1178#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0))} #67#return; {1178#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0))} is VALID [2018-11-23 12:22:05,093 INFO L273 TraceCheckUtils]: 27: Hoare triple {1178#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0))} havoc #t~mem4; {1178#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0))} is VALID [2018-11-23 12:22:05,094 INFO L273 TraceCheckUtils]: 28: Hoare triple {1178#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 0) 4)))) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1181#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))} is VALID [2018-11-23 12:22:05,095 INFO L273 TraceCheckUtils]: 29: Hoare triple {1181#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1182#(<= (+ main_~low~0 1) |main_#t~mem4|)} is VALID [2018-11-23 12:22:05,096 INFO L256 TraceCheckUtils]: 30: Hoare triple {1182#(<= (+ main_~low~0 1) |main_#t~mem4|)} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {1180#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:22:05,096 INFO L273 TraceCheckUtils]: 31: Hoare triple {1180#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1183#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:22:05,097 INFO L273 TraceCheckUtils]: 32: Hoare triple {1183#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1172#false} is VALID [2018-11-23 12:22:05,097 INFO L273 TraceCheckUtils]: 33: Hoare triple {1172#false} assume !false; {1172#false} is VALID [2018-11-23 12:22:05,101 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:22:05,101 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:22:05,101 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:22:05,110 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:22:05,153 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:22:05,154 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:22:05,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:05,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:22:05,341 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 15 treesize of output 12 [2018-11-23 12:22:05,351 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 12:22:05,353 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:05,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:05,378 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:05,378 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-23 12:22:05,562 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 31 treesize of output 24 [2018-11-23 12:22:05,573 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:05,575 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 37 [2018-11-23 12:22:05,579 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:05,589 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:05,603 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:22:05,604 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:36 [2018-11-23 12:22:05,607 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:22:05,607 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_12|, main_~i~0]. (let ((.cse0 (select |v_#memory_int_12| |main_~#a~0.base|))) (let ((.cse1 (select .cse0 (+ |main_~#a~0.offset| 4)))) (and (<= 2 main_~i~0) (<= main_~low~0 2) (= |#memory_int| (store |v_#memory_int_12| |main_~#a~0.base| (store .cse0 (+ (* 4 main_~i~0) |main_~#a~0.offset|) .cse1))) (<= 3 .cse1) (= |main_~#a~0.offset| 0)))) [2018-11-23 12:22:05,607 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~i~0]. (let ((.cse1 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse0 (select .cse1 (+ |main_~#a~0.offset| 4)))) (and (<= 2 main_~i~0) (<= 3 .cse0) (<= main_~low~0 2) (= .cse0 (select .cse1 (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0)))) [2018-11-23 12:22:06,091 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 28 treesize of output 20 [2018-11-23 12:22:06,097 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:06,099 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 12:22:06,105 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:06,110 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:06,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:06,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:7 [2018-11-23 12:22:06,120 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:22:06,121 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, v_prenex_2]. (let ((.cse1 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse0 (select .cse1 4))) (and (<= 2 v_prenex_2) (<= .cse0 |main_#t~mem4|) (<= main_~low~0 2) (= (select .cse1 (* 4 v_prenex_2)) .cse0) (<= 3 .cse0)))) [2018-11-23 12:22:06,121 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= main_~low~0 2) (<= 3 |main_#t~mem4|)) [2018-11-23 12:22:06,213 INFO L256 TraceCheckUtils]: 0: Hoare triple {1171#true} call ULTIMATE.init(); {1171#true} is VALID [2018-11-23 12:22:06,213 INFO L273 TraceCheckUtils]: 1: Hoare triple {1171#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1171#true} is VALID [2018-11-23 12:22:06,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {1171#true} assume true; {1171#true} is VALID [2018-11-23 12:22:06,214 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1171#true} {1171#true} #63#return; {1171#true} is VALID [2018-11-23 12:22:06,214 INFO L256 TraceCheckUtils]: 4: Hoare triple {1171#true} call #t~ret5 := main(); {1171#true} is VALID [2018-11-23 12:22:06,214 INFO L273 TraceCheckUtils]: 5: Hoare triple {1171#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1171#true} is VALID [2018-11-23 12:22:06,216 INFO L273 TraceCheckUtils]: 6: Hoare triple {1171#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 0;~low~0 := 2;~i~0 := 0; {1205#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:06,217 INFO L273 TraceCheckUtils]: 7: Hoare triple {1205#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0); {1205#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:06,218 INFO L273 TraceCheckUtils]: 8: Hoare triple {1205#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {1205#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:06,219 INFO L273 TraceCheckUtils]: 9: Hoare triple {1205#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1205#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:06,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {1205#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1218#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:06,220 INFO L273 TraceCheckUtils]: 11: Hoare triple {1218#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0); {1218#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:06,221 INFO L273 TraceCheckUtils]: 12: Hoare triple {1218#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {1218#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:06,222 INFO L273 TraceCheckUtils]: 13: Hoare triple {1218#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1228#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:06,224 INFO L273 TraceCheckUtils]: 14: Hoare triple {1228#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1232#(and (<= 3 main_~val2~0) (<= 2 main_~i~0) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:06,224 INFO L273 TraceCheckUtils]: 15: Hoare triple {1232#(and (<= 3 main_~val2~0) (<= 2 main_~i~0) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0); {1232#(and (<= 3 main_~val2~0) (<= 2 main_~i~0) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:06,225 INFO L273 TraceCheckUtils]: 16: Hoare triple {1232#(and (<= 3 main_~val2~0) (<= 2 main_~i~0) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} assume !(1 + ~i~0 < ~SIZE~0); {1232#(and (<= 3 main_~val2~0) (<= 2 main_~i~0) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:06,227 INFO L273 TraceCheckUtils]: 17: Hoare triple {1232#(and (<= 3 main_~val2~0) (<= 2 main_~i~0) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1242#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (exists ((main_~i~0 Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:06,229 INFO L273 TraceCheckUtils]: 18: Hoare triple {1242#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (exists ((main_~i~0 Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1242#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (exists ((main_~i~0 Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:06,237 INFO L273 TraceCheckUtils]: 19: Hoare triple {1242#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (exists ((main_~i~0 Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))) (= |main_~#a~0.offset| 0))} assume !(~i~0 < ~SIZE~0); {1242#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (exists ((main_~i~0 Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:06,238 INFO L273 TraceCheckUtils]: 20: Hoare triple {1242#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (exists ((main_~i~0 Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {1252#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (exists ((v_prenex_2 Int)) (and (<= 2 v_prenex_2) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_2) |main_~#a~0.offset|))))))} is VALID [2018-11-23 12:22:06,239 INFO L273 TraceCheckUtils]: 21: Hoare triple {1252#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (exists ((v_prenex_2 Int)) (and (<= 2 v_prenex_2) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_2) |main_~#a~0.offset|))))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1252#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (exists ((v_prenex_2 Int)) (and (<= 2 v_prenex_2) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_2) |main_~#a~0.offset|))))))} is VALID [2018-11-23 12:22:06,240 INFO L256 TraceCheckUtils]: 22: Hoare triple {1252#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (exists ((v_prenex_2 Int)) (and (<= 2 v_prenex_2) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_2) |main_~#a~0.offset|))))))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {1259#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (and (<= 2 v_prenex_2) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (* 4 v_prenex_2)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4))))} is VALID [2018-11-23 12:22:06,241 INFO L273 TraceCheckUtils]: 23: Hoare triple {1259#(exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (and (<= 2 v_prenex_2) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (* 4 v_prenex_2)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4))))} ~cond := #in~cond; {1263#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (and (<= 2 v_prenex_2) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (* 4 v_prenex_2)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:22:06,242 INFO L273 TraceCheckUtils]: 24: Hoare triple {1263#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (and (<= 2 v_prenex_2) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (* 4 v_prenex_2)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(0 == ~cond); {1267#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (and (<= 2 v_prenex_2) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (* 4 v_prenex_2)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4)))))} is VALID [2018-11-23 12:22:06,243 INFO L273 TraceCheckUtils]: 25: Hoare triple {1267#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (and (<= 2 v_prenex_2) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (* 4 v_prenex_2)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4)))))} assume true; {1267#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (and (<= 2 v_prenex_2) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (* 4 v_prenex_2)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4)))))} is VALID [2018-11-23 12:22:06,246 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {1267#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (v_prenex_2 Int)) (and (<= 2 v_prenex_2) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) (* 4 v_prenex_2)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|) 4)))))} {1252#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (exists ((v_prenex_2 Int)) (and (<= 2 v_prenex_2) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_2) |main_~#a~0.offset|))))))} #67#return; {1252#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (exists ((v_prenex_2 Int)) (and (<= 2 v_prenex_2) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_2) |main_~#a~0.offset|))))))} is VALID [2018-11-23 12:22:06,247 INFO L273 TraceCheckUtils]: 27: Hoare triple {1252#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (exists ((v_prenex_2 Int)) (and (<= 2 v_prenex_2) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_2) |main_~#a~0.offset|))))))} havoc #t~mem4; {1252#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (exists ((v_prenex_2 Int)) (and (<= 2 v_prenex_2) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_2) |main_~#a~0.offset|))))))} is VALID [2018-11-23 12:22:06,248 INFO L273 TraceCheckUtils]: 28: Hoare triple {1252#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0) (exists ((v_prenex_2 Int)) (and (<= 2 v_prenex_2) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_2) |main_~#a~0.offset|))))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1280#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (exists ((v_prenex_2 Int)) (and (<= 2 v_prenex_2) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_2) |main_~#a~0.offset|))))))} is VALID [2018-11-23 12:22:06,248 INFO L273 TraceCheckUtils]: 29: Hoare triple {1280#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4))) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0) (exists ((v_prenex_2 Int)) (and (<= 2 v_prenex_2) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 4)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_2) |main_~#a~0.offset|))))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1284#(and (<= main_~low~0 2) (<= 3 |main_#t~mem4|))} is VALID [2018-11-23 12:22:06,249 INFO L256 TraceCheckUtils]: 30: Hoare triple {1284#(and (<= main_~low~0 2) (<= 3 |main_#t~mem4|))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {1288#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:22:06,250 INFO L273 TraceCheckUtils]: 31: Hoare triple {1288#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1292#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:22:06,250 INFO L273 TraceCheckUtils]: 32: Hoare triple {1292#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1172#false} is VALID [2018-11-23 12:22:06,251 INFO L273 TraceCheckUtils]: 33: Hoare triple {1172#false} assume !false; {1172#false} is VALID [2018-11-23 12:22:06,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 12:22:06,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:22:06,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 26 [2018-11-23 12:22:06,278 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 34 [2018-11-23 12:22:06,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:22:06,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 12:22:06,358 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:06,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 12:22:06,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 12:22:06,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=567, Unknown=0, NotChecked=0, Total=650 [2018-11-23 12:22:06,359 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 26 states. [2018-11-23 12:22:26,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:26,601 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2018-11-23 12:22:26,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:22:26,601 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 34 [2018-11-23 12:22:26,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:22:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:22:26,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 77 transitions. [2018-11-23 12:22:26,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 12:22:26,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 77 transitions. [2018-11-23 12:22:26,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 77 transitions. [2018-11-23 12:22:26,750 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:26,753 INFO L225 Difference]: With dead ends: 84 [2018-11-23 12:22:26,753 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 12:22:26,754 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 380 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=203, Invalid=1279, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 12:22:26,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 12:22:26,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 41. [2018-11-23 12:22:26,850 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:22:26,850 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 41 states. [2018-11-23 12:22:26,850 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 41 states. [2018-11-23 12:22:26,852 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 41 states. [2018-11-23 12:22:26,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:26,856 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-11-23 12:22:26,856 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-11-23 12:22:26,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:26,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:26,857 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 82 states. [2018-11-23 12:22:26,857 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 82 states. [2018-11-23 12:22:26,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:26,861 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2018-11-23 12:22:26,861 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2018-11-23 12:22:26,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:26,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:26,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:22:26,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:22:26,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:22:26,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2018-11-23 12:22:26,864 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 34 [2018-11-23 12:22:26,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:22:26,864 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2018-11-23 12:22:26,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 12:22:26,864 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-23 12:22:26,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:22:26,865 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:22:26,865 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:22:26,866 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:22:26,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:26,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1830675681, now seen corresponding path program 3 times [2018-11-23 12:22:26,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:26,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:26,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:26,867 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:22:26,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:27,100 INFO L256 TraceCheckUtils]: 0: Hoare triple {1657#true} call ULTIMATE.init(); {1657#true} is VALID [2018-11-23 12:22:27,101 INFO L273 TraceCheckUtils]: 1: Hoare triple {1657#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1657#true} is VALID [2018-11-23 12:22:27,102 INFO L273 TraceCheckUtils]: 2: Hoare triple {1657#true} assume true; {1657#true} is VALID [2018-11-23 12:22:27,102 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1657#true} {1657#true} #63#return; {1657#true} is VALID [2018-11-23 12:22:27,102 INFO L256 TraceCheckUtils]: 4: Hoare triple {1657#true} call #t~ret5 := main(); {1657#true} is VALID [2018-11-23 12:22:27,103 INFO L273 TraceCheckUtils]: 5: Hoare triple {1657#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1657#true} is VALID [2018-11-23 12:22:27,103 INFO L273 TraceCheckUtils]: 6: Hoare triple {1657#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 0;~low~0 := 2;~i~0 := 0; {1659#(= main_~i~0 0)} is VALID [2018-11-23 12:22:27,104 INFO L273 TraceCheckUtils]: 7: Hoare triple {1659#(= main_~i~0 0)} assume !!(~i~0 < ~SIZE~0); {1659#(= main_~i~0 0)} is VALID [2018-11-23 12:22:27,104 INFO L273 TraceCheckUtils]: 8: Hoare triple {1659#(= main_~i~0 0)} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {1659#(= main_~i~0 0)} is VALID [2018-11-23 12:22:27,104 INFO L273 TraceCheckUtils]: 9: Hoare triple {1659#(= main_~i~0 0)} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1659#(= main_~i~0 0)} is VALID [2018-11-23 12:22:27,105 INFO L273 TraceCheckUtils]: 10: Hoare triple {1659#(= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1660#(<= main_~i~0 1)} is VALID [2018-11-23 12:22:27,105 INFO L273 TraceCheckUtils]: 11: Hoare triple {1660#(<= main_~i~0 1)} assume !!(~i~0 < ~SIZE~0); {1660#(<= main_~i~0 1)} is VALID [2018-11-23 12:22:27,106 INFO L273 TraceCheckUtils]: 12: Hoare triple {1660#(<= main_~i~0 1)} assume !(1 + ~i~0 < ~SIZE~0); {1661#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:22:27,106 INFO L273 TraceCheckUtils]: 13: Hoare triple {1661#(<= ~SIZE~0 2)} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1661#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:22:27,107 INFO L273 TraceCheckUtils]: 14: Hoare triple {1661#(<= ~SIZE~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1661#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:22:27,107 INFO L273 TraceCheckUtils]: 15: Hoare triple {1661#(<= ~SIZE~0 2)} assume !(~i~0 < ~SIZE~0); {1661#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:22:27,108 INFO L273 TraceCheckUtils]: 16: Hoare triple {1661#(<= ~SIZE~0 2)} ~i~0 := 0; {1662#(and (<= ~SIZE~0 2) (= main_~i~0 0))} is VALID [2018-11-23 12:22:27,109 INFO L273 TraceCheckUtils]: 17: Hoare triple {1662#(and (<= ~SIZE~0 2) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1662#(and (<= ~SIZE~0 2) (= main_~i~0 0))} is VALID [2018-11-23 12:22:27,109 INFO L256 TraceCheckUtils]: 18: Hoare triple {1662#(and (<= ~SIZE~0 2) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {1657#true} is VALID [2018-11-23 12:22:27,109 INFO L273 TraceCheckUtils]: 19: Hoare triple {1657#true} ~cond := #in~cond; {1657#true} is VALID [2018-11-23 12:22:27,109 INFO L273 TraceCheckUtils]: 20: Hoare triple {1657#true} assume !(0 == ~cond); {1657#true} is VALID [2018-11-23 12:22:27,110 INFO L273 TraceCheckUtils]: 21: Hoare triple {1657#true} assume true; {1657#true} is VALID [2018-11-23 12:22:27,111 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1657#true} {1662#(and (<= ~SIZE~0 2) (= main_~i~0 0))} #67#return; {1662#(and (<= ~SIZE~0 2) (= main_~i~0 0))} is VALID [2018-11-23 12:22:27,111 INFO L273 TraceCheckUtils]: 23: Hoare triple {1662#(and (<= ~SIZE~0 2) (= main_~i~0 0))} havoc #t~mem4; {1662#(and (<= ~SIZE~0 2) (= main_~i~0 0))} is VALID [2018-11-23 12:22:27,112 INFO L273 TraceCheckUtils]: 24: Hoare triple {1662#(and (<= ~SIZE~0 2) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1663#(<= ~SIZE~0 (+ main_~i~0 1))} is VALID [2018-11-23 12:22:27,112 INFO L273 TraceCheckUtils]: 25: Hoare triple {1663#(<= ~SIZE~0 (+ main_~i~0 1))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1663#(<= ~SIZE~0 (+ main_~i~0 1))} is VALID [2018-11-23 12:22:27,112 INFO L256 TraceCheckUtils]: 26: Hoare triple {1663#(<= ~SIZE~0 (+ main_~i~0 1))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {1657#true} is VALID [2018-11-23 12:22:27,113 INFO L273 TraceCheckUtils]: 27: Hoare triple {1657#true} ~cond := #in~cond; {1657#true} is VALID [2018-11-23 12:22:27,113 INFO L273 TraceCheckUtils]: 28: Hoare triple {1657#true} assume !(0 == ~cond); {1657#true} is VALID [2018-11-23 12:22:27,113 INFO L273 TraceCheckUtils]: 29: Hoare triple {1657#true} assume true; {1657#true} is VALID [2018-11-23 12:22:27,114 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1657#true} {1663#(<= ~SIZE~0 (+ main_~i~0 1))} #67#return; {1663#(<= ~SIZE~0 (+ main_~i~0 1))} is VALID [2018-11-23 12:22:27,114 INFO L273 TraceCheckUtils]: 31: Hoare triple {1663#(<= ~SIZE~0 (+ main_~i~0 1))} havoc #t~mem4; {1663#(<= ~SIZE~0 (+ main_~i~0 1))} is VALID [2018-11-23 12:22:27,115 INFO L273 TraceCheckUtils]: 32: Hoare triple {1663#(<= ~SIZE~0 (+ main_~i~0 1))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1664#(<= ~SIZE~0 main_~i~0)} is VALID [2018-11-23 12:22:27,116 INFO L273 TraceCheckUtils]: 33: Hoare triple {1664#(<= ~SIZE~0 main_~i~0)} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1658#false} is VALID [2018-11-23 12:22:27,116 INFO L256 TraceCheckUtils]: 34: Hoare triple {1658#false} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {1658#false} is VALID [2018-11-23 12:22:27,117 INFO L273 TraceCheckUtils]: 35: Hoare triple {1658#false} ~cond := #in~cond; {1658#false} is VALID [2018-11-23 12:22:27,117 INFO L273 TraceCheckUtils]: 36: Hoare triple {1658#false} assume 0 == ~cond; {1658#false} is VALID [2018-11-23 12:22:27,117 INFO L273 TraceCheckUtils]: 37: Hoare triple {1658#false} assume !false; {1658#false} is VALID [2018-11-23 12:22:27,119 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:22:27,120 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:22:27,120 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:22:27,137 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:22:27,166 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 12:22:27,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:22:27,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:27,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:22:27,384 INFO L256 TraceCheckUtils]: 0: Hoare triple {1657#true} call ULTIMATE.init(); {1657#true} is VALID [2018-11-23 12:22:27,384 INFO L273 TraceCheckUtils]: 1: Hoare triple {1657#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {1657#true} is VALID [2018-11-23 12:22:27,385 INFO L273 TraceCheckUtils]: 2: Hoare triple {1657#true} assume true; {1657#true} is VALID [2018-11-23 12:22:27,385 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1657#true} {1657#true} #63#return; {1657#true} is VALID [2018-11-23 12:22:27,385 INFO L256 TraceCheckUtils]: 4: Hoare triple {1657#true} call #t~ret5 := main(); {1657#true} is VALID [2018-11-23 12:22:27,386 INFO L273 TraceCheckUtils]: 5: Hoare triple {1657#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1657#true} is VALID [2018-11-23 12:22:27,386 INFO L273 TraceCheckUtils]: 6: Hoare triple {1657#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 0;~low~0 := 2;~i~0 := 0; {1686#(<= main_~i~0 0)} is VALID [2018-11-23 12:22:27,387 INFO L273 TraceCheckUtils]: 7: Hoare triple {1686#(<= main_~i~0 0)} assume !!(~i~0 < ~SIZE~0); {1686#(<= main_~i~0 0)} is VALID [2018-11-23 12:22:27,387 INFO L273 TraceCheckUtils]: 8: Hoare triple {1686#(<= main_~i~0 0)} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {1686#(<= main_~i~0 0)} is VALID [2018-11-23 12:22:27,387 INFO L273 TraceCheckUtils]: 9: Hoare triple {1686#(<= main_~i~0 0)} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1686#(<= main_~i~0 0)} is VALID [2018-11-23 12:22:27,388 INFO L273 TraceCheckUtils]: 10: Hoare triple {1686#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1660#(<= main_~i~0 1)} is VALID [2018-11-23 12:22:27,388 INFO L273 TraceCheckUtils]: 11: Hoare triple {1660#(<= main_~i~0 1)} assume !!(~i~0 < ~SIZE~0); {1660#(<= main_~i~0 1)} is VALID [2018-11-23 12:22:27,389 INFO L273 TraceCheckUtils]: 12: Hoare triple {1660#(<= main_~i~0 1)} assume !(1 + ~i~0 < ~SIZE~0); {1661#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:22:27,389 INFO L273 TraceCheckUtils]: 13: Hoare triple {1661#(<= ~SIZE~0 2)} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1661#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:22:27,389 INFO L273 TraceCheckUtils]: 14: Hoare triple {1661#(<= ~SIZE~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1661#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:22:27,390 INFO L273 TraceCheckUtils]: 15: Hoare triple {1661#(<= ~SIZE~0 2)} assume !(~i~0 < ~SIZE~0); {1661#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:22:27,390 INFO L273 TraceCheckUtils]: 16: Hoare triple {1661#(<= ~SIZE~0 2)} ~i~0 := 0; {1717#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-23 12:22:27,391 INFO L273 TraceCheckUtils]: 17: Hoare triple {1717#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1717#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-23 12:22:27,392 INFO L256 TraceCheckUtils]: 18: Hoare triple {1717#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {1661#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:22:27,393 INFO L273 TraceCheckUtils]: 19: Hoare triple {1661#(<= ~SIZE~0 2)} ~cond := #in~cond; {1661#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:22:27,393 INFO L273 TraceCheckUtils]: 20: Hoare triple {1661#(<= ~SIZE~0 2)} assume !(0 == ~cond); {1661#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:22:27,398 INFO L273 TraceCheckUtils]: 21: Hoare triple {1661#(<= ~SIZE~0 2)} assume true; {1661#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:22:27,399 INFO L268 TraceCheckUtils]: 22: Hoare quadruple {1661#(<= ~SIZE~0 2)} {1717#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} #67#return; {1717#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-23 12:22:27,406 INFO L273 TraceCheckUtils]: 23: Hoare triple {1717#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} havoc #t~mem4; {1717#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-23 12:22:27,406 INFO L273 TraceCheckUtils]: 24: Hoare triple {1717#(and (<= 0 main_~i~0) (<= ~SIZE~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1742#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-23 12:22:27,407 INFO L273 TraceCheckUtils]: 25: Hoare triple {1742#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1742#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-23 12:22:27,408 INFO L256 TraceCheckUtils]: 26: Hoare triple {1742#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {1661#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:22:27,408 INFO L273 TraceCheckUtils]: 27: Hoare triple {1661#(<= ~SIZE~0 2)} ~cond := #in~cond; {1661#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:22:27,409 INFO L273 TraceCheckUtils]: 28: Hoare triple {1661#(<= ~SIZE~0 2)} assume !(0 == ~cond); {1661#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:22:27,409 INFO L273 TraceCheckUtils]: 29: Hoare triple {1661#(<= ~SIZE~0 2)} assume true; {1661#(<= ~SIZE~0 2)} is VALID [2018-11-23 12:22:27,410 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {1661#(<= ~SIZE~0 2)} {1742#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} #67#return; {1742#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-23 12:22:27,410 INFO L273 TraceCheckUtils]: 31: Hoare triple {1742#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} havoc #t~mem4; {1742#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-23 12:22:27,411 INFO L273 TraceCheckUtils]: 32: Hoare triple {1742#(and (<= 1 main_~i~0) (<= ~SIZE~0 2))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1767#(and (<= 2 main_~i~0) (<= ~SIZE~0 2))} is VALID [2018-11-23 12:22:27,412 INFO L273 TraceCheckUtils]: 33: Hoare triple {1767#(and (<= 2 main_~i~0) (<= ~SIZE~0 2))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {1658#false} is VALID [2018-11-23 12:22:27,412 INFO L256 TraceCheckUtils]: 34: Hoare triple {1658#false} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {1658#false} is VALID [2018-11-23 12:22:27,413 INFO L273 TraceCheckUtils]: 35: Hoare triple {1658#false} ~cond := #in~cond; {1658#false} is VALID [2018-11-23 12:22:27,413 INFO L273 TraceCheckUtils]: 36: Hoare triple {1658#false} assume 0 == ~cond; {1658#false} is VALID [2018-11-23 12:22:27,413 INFO L273 TraceCheckUtils]: 37: Hoare triple {1658#false} assume !false; {1658#false} is VALID [2018-11-23 12:22:27,415 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:22:27,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:22:27,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-11-23 12:22:27,434 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-11-23 12:22:27,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:22:27,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:22:27,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:27,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:22:27,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:22:27,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:22:27,492 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 12 states. [2018-11-23 12:22:28,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:28,367 INFO L93 Difference]: Finished difference Result 102 states and 108 transitions. [2018-11-23 12:22:28,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:22:28,367 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 38 [2018-11-23 12:22:28,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:22:28,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:22:28,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 82 transitions. [2018-11-23 12:22:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:22:28,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 82 transitions. [2018-11-23 12:22:28,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 82 transitions. [2018-11-23 12:22:28,459 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:28,461 INFO L225 Difference]: With dead ends: 102 [2018-11-23 12:22:28,462 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:22:28,463 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:22:28,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:22:28,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-11-23 12:22:28,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:22:28,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 45 states. [2018-11-23 12:22:28,579 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 45 states. [2018-11-23 12:22:28,580 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 45 states. [2018-11-23 12:22:28,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:28,582 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-23 12:22:28,582 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-23 12:22:28,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:28,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:28,583 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 49 states. [2018-11-23 12:22:28,583 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 49 states. [2018-11-23 12:22:28,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:28,585 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-11-23 12:22:28,585 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-23 12:22:28,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:28,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:28,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:22:28,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:22:28,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:22:28,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-11-23 12:22:28,588 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 38 [2018-11-23 12:22:28,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:22:28,588 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-11-23 12:22:28,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:22:28,589 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-11-23 12:22:28,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 12:22:28,590 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:22:28,590 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:22:28,590 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:22:28,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:28,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1193168612, now seen corresponding path program 4 times [2018-11-23 12:22:28,590 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:28,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:28,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:28,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:22:28,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:28,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:29,102 INFO L256 TraceCheckUtils]: 0: Hoare triple {2086#true} call ULTIMATE.init(); {2086#true} is VALID [2018-11-23 12:22:29,102 INFO L273 TraceCheckUtils]: 1: Hoare triple {2086#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {2086#true} is VALID [2018-11-23 12:22:29,102 INFO L273 TraceCheckUtils]: 2: Hoare triple {2086#true} assume true; {2086#true} is VALID [2018-11-23 12:22:29,103 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2086#true} {2086#true} #63#return; {2086#true} is VALID [2018-11-23 12:22:29,103 INFO L256 TraceCheckUtils]: 4: Hoare triple {2086#true} call #t~ret5 := main(); {2086#true} is VALID [2018-11-23 12:22:29,103 INFO L273 TraceCheckUtils]: 5: Hoare triple {2086#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2086#true} is VALID [2018-11-23 12:22:29,104 INFO L273 TraceCheckUtils]: 6: Hoare triple {2086#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 0;~low~0 := 2;~i~0 := 0; {2088#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:22:29,105 INFO L273 TraceCheckUtils]: 7: Hoare triple {2088#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0); {2088#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:22:29,105 INFO L273 TraceCheckUtils]: 8: Hoare triple {2088#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {2088#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:22:29,105 INFO L273 TraceCheckUtils]: 9: Hoare triple {2088#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2088#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:22:29,106 INFO L273 TraceCheckUtils]: 10: Hoare triple {2088#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2089#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:22:29,106 INFO L273 TraceCheckUtils]: 11: Hoare triple {2089#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 1))} assume !!(~i~0 < ~SIZE~0); {2089#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:22:29,107 INFO L273 TraceCheckUtils]: 12: Hoare triple {2089#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 1))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {2089#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:22:29,108 INFO L273 TraceCheckUtils]: 13: Hoare triple {2089#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 1))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2089#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:22:29,110 INFO L273 TraceCheckUtils]: 14: Hoare triple {2089#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2090#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} is VALID [2018-11-23 12:22:29,111 INFO L273 TraceCheckUtils]: 15: Hoare triple {2090#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0); {2090#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} is VALID [2018-11-23 12:22:29,112 INFO L273 TraceCheckUtils]: 16: Hoare triple {2090#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} assume !(1 + ~i~0 < ~SIZE~0); {2091#(and (<= (+ main_~low~0 1) main_~val2~0) (<= ~SIZE~0 3) (or (= (+ (* 4 main_~i~0) 4) (* 4 ~SIZE~0)) (<= ~SIZE~0 2)))} is VALID [2018-11-23 12:22:29,113 INFO L273 TraceCheckUtils]: 17: Hoare triple {2091#(and (<= (+ main_~low~0 1) main_~val2~0) (<= ~SIZE~0 3) (or (= (+ (* 4 main_~i~0) 4) (* 4 ~SIZE~0)) (<= ~SIZE~0 2)))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2092#(and (or (and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= (+ (* 4 main_~i~0) 4) (* 4 ~SIZE~0))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3))} is VALID [2018-11-23 12:22:29,114 INFO L273 TraceCheckUtils]: 18: Hoare triple {2092#(and (or (and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= (+ (* 4 main_~i~0) 4) (* 4 ~SIZE~0))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2093#(and (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3))} is VALID [2018-11-23 12:22:29,114 INFO L273 TraceCheckUtils]: 19: Hoare triple {2093#(and (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3))} assume !(~i~0 < ~SIZE~0); {2093#(and (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3))} is VALID [2018-11-23 12:22:29,115 INFO L273 TraceCheckUtils]: 20: Hoare triple {2093#(and (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3))} ~i~0 := 0; {2094#(and (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} is VALID [2018-11-23 12:22:29,116 INFO L273 TraceCheckUtils]: 21: Hoare triple {2094#(and (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2094#(and (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} is VALID [2018-11-23 12:22:29,116 INFO L256 TraceCheckUtils]: 22: Hoare triple {2094#(and (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {2086#true} is VALID [2018-11-23 12:22:29,116 INFO L273 TraceCheckUtils]: 23: Hoare triple {2086#true} ~cond := #in~cond; {2095#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 12:22:29,117 INFO L273 TraceCheckUtils]: 24: Hoare triple {2095#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {2096#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:22:29,118 INFO L273 TraceCheckUtils]: 25: Hoare triple {2096#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2096#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:22:29,121 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2096#(not (= |__VERIFIER_assert_#in~cond| 0))} {2094#(and (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} #67#return; {2094#(and (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} is VALID [2018-11-23 12:22:29,122 INFO L273 TraceCheckUtils]: 27: Hoare triple {2094#(and (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} havoc #t~mem4; {2094#(and (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} is VALID [2018-11-23 12:22:29,123 INFO L273 TraceCheckUtils]: 28: Hoare triple {2094#(and (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 2)) (<= ~SIZE~0 3) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2097#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 1))))} is VALID [2018-11-23 12:22:29,123 INFO L273 TraceCheckUtils]: 29: Hoare triple {2097#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 1))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2097#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 1))))} is VALID [2018-11-23 12:22:29,123 INFO L256 TraceCheckUtils]: 30: Hoare triple {2097#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 1))))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {2086#true} is VALID [2018-11-23 12:22:29,124 INFO L273 TraceCheckUtils]: 31: Hoare triple {2086#true} ~cond := #in~cond; {2086#true} is VALID [2018-11-23 12:22:29,124 INFO L273 TraceCheckUtils]: 32: Hoare triple {2086#true} assume !(0 == ~cond); {2086#true} is VALID [2018-11-23 12:22:29,124 INFO L273 TraceCheckUtils]: 33: Hoare triple {2086#true} assume true; {2086#true} is VALID [2018-11-23 12:22:29,125 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2086#true} {2097#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 1))))} #67#return; {2097#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 1))))} is VALID [2018-11-23 12:22:29,125 INFO L273 TraceCheckUtils]: 35: Hoare triple {2097#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 1))))} havoc #t~mem4; {2097#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 1))))} is VALID [2018-11-23 12:22:29,127 INFO L273 TraceCheckUtils]: 36: Hoare triple {2097#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 1))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2098#(or (<= ~SIZE~0 main_~i~0) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))))} is VALID [2018-11-23 12:22:29,128 INFO L273 TraceCheckUtils]: 37: Hoare triple {2098#(or (<= ~SIZE~0 main_~i~0) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2099#(<= (+ main_~low~0 1) |main_#t~mem4|)} is VALID [2018-11-23 12:22:29,129 INFO L256 TraceCheckUtils]: 38: Hoare triple {2099#(<= (+ main_~low~0 1) |main_#t~mem4|)} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {2096#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:22:29,130 INFO L273 TraceCheckUtils]: 39: Hoare triple {2096#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2100#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:22:29,130 INFO L273 TraceCheckUtils]: 40: Hoare triple {2100#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2087#false} is VALID [2018-11-23 12:22:29,131 INFO L273 TraceCheckUtils]: 41: Hoare triple {2087#false} assume !false; {2087#false} is VALID [2018-11-23 12:22:29,137 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:22:29,137 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:22:29,137 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:22:29,146 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:22:29,165 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:22:29,166 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:22:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:29,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:22:29,335 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 12:22:29,340 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 12:22:29,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:29,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:29,360 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 12:22:29,361 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-11-23 12:22:29,364 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:22:29,364 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_13|, main_~val2~0]. (and (<= 3 main_~val2~0) (= |#memory_int| (store |v_#memory_int_13| |main_~#a~0.base| (store (select |v_#memory_int_13| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8) main_~val2~0))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0)) [2018-11-23 12:22:29,365 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0)) [2018-11-23 12:22:29,768 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 12:22:29,774 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 12:22:29,777 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:29,779 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:29,784 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 12:22:29,784 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-23 12:22:29,787 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:22:29,787 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) 8))) (and (<= 3 .cse0) (<= main_~low~0 2) (<= .cse0 |main_#t~mem4|))) [2018-11-23 12:22:29,787 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= main_~low~0 2) (<= 3 |main_#t~mem4|)) [2018-11-23 12:22:29,864 INFO L256 TraceCheckUtils]: 0: Hoare triple {2086#true} call ULTIMATE.init(); {2086#true} is VALID [2018-11-23 12:22:29,865 INFO L273 TraceCheckUtils]: 1: Hoare triple {2086#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {2086#true} is VALID [2018-11-23 12:22:29,865 INFO L273 TraceCheckUtils]: 2: Hoare triple {2086#true} assume true; {2086#true} is VALID [2018-11-23 12:22:29,865 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2086#true} {2086#true} #63#return; {2086#true} is VALID [2018-11-23 12:22:29,865 INFO L256 TraceCheckUtils]: 4: Hoare triple {2086#true} call #t~ret5 := main(); {2086#true} is VALID [2018-11-23 12:22:29,865 INFO L273 TraceCheckUtils]: 5: Hoare triple {2086#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2086#true} is VALID [2018-11-23 12:22:29,866 INFO L273 TraceCheckUtils]: 6: Hoare triple {2086#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 0;~low~0 := 2;~i~0 := 0; {2122#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:29,867 INFO L273 TraceCheckUtils]: 7: Hoare triple {2122#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0); {2122#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:29,868 INFO L273 TraceCheckUtils]: 8: Hoare triple {2122#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {2122#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:29,869 INFO L273 TraceCheckUtils]: 9: Hoare triple {2122#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2122#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:29,870 INFO L273 TraceCheckUtils]: 10: Hoare triple {2122#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2135#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:29,871 INFO L273 TraceCheckUtils]: 11: Hoare triple {2135#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0); {2135#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:29,872 INFO L273 TraceCheckUtils]: 12: Hoare triple {2135#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {2135#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:29,872 INFO L273 TraceCheckUtils]: 13: Hoare triple {2135#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2135#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:29,873 INFO L273 TraceCheckUtils]: 14: Hoare triple {2135#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2148#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:29,874 INFO L273 TraceCheckUtils]: 15: Hoare triple {2148#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0); {2148#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:29,875 INFO L273 TraceCheckUtils]: 16: Hoare triple {2148#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume !(1 + ~i~0 < ~SIZE~0); {2148#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:29,876 INFO L273 TraceCheckUtils]: 17: Hoare triple {2148#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2158#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:29,877 INFO L273 TraceCheckUtils]: 18: Hoare triple {2158#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2158#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:29,878 INFO L273 TraceCheckUtils]: 19: Hoare triple {2158#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(~i~0 < ~SIZE~0); {2158#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:29,878 INFO L273 TraceCheckUtils]: 20: Hoare triple {2158#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {2168#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:29,900 INFO L273 TraceCheckUtils]: 21: Hoare triple {2168#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2168#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:29,915 INFO L256 TraceCheckUtils]: 22: Hoare triple {2168#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {2175#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8)))} is VALID [2018-11-23 12:22:29,930 INFO L273 TraceCheckUtils]: 23: Hoare triple {2175#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8)))} ~cond := #in~cond; {2179#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:22:29,945 INFO L273 TraceCheckUtils]: 24: Hoare triple {2179#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(0 == ~cond); {2183#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8))))} is VALID [2018-11-23 12:22:29,947 INFO L273 TraceCheckUtils]: 25: Hoare triple {2183#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8))))} assume true; {2183#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8))))} is VALID [2018-11-23 12:22:29,949 INFO L268 TraceCheckUtils]: 26: Hoare quadruple {2183#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8))))} {2168#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #67#return; {2168#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:29,949 INFO L273 TraceCheckUtils]: 27: Hoare triple {2168#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} havoc #t~mem4; {2168#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:29,950 INFO L273 TraceCheckUtils]: 28: Hoare triple {2168#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2196#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:29,951 INFO L273 TraceCheckUtils]: 29: Hoare triple {2196#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2196#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:29,952 INFO L256 TraceCheckUtils]: 30: Hoare triple {2196#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {2175#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8)))} is VALID [2018-11-23 12:22:29,952 INFO L273 TraceCheckUtils]: 31: Hoare triple {2175#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8)))} ~cond := #in~cond; {2175#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8)))} is VALID [2018-11-23 12:22:29,953 INFO L273 TraceCheckUtils]: 32: Hoare triple {2175#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8)))} assume !(0 == ~cond); {2175#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8)))} is VALID [2018-11-23 12:22:29,953 INFO L273 TraceCheckUtils]: 33: Hoare triple {2175#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8)))} assume true; {2175#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8)))} is VALID [2018-11-23 12:22:29,955 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {2175#(exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|) 8)))} {2196#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} #67#return; {2196#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:29,956 INFO L273 TraceCheckUtils]: 35: Hoare triple {2196#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} havoc #t~mem4; {2196#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:29,957 INFO L273 TraceCheckUtils]: 36: Hoare triple {2196#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2221#(and (= main_~i~0 2) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:29,958 INFO L273 TraceCheckUtils]: 37: Hoare triple {2221#(and (= main_~i~0 2) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2225#(and (<= main_~low~0 2) (<= 3 |main_#t~mem4|))} is VALID [2018-11-23 12:22:29,959 INFO L256 TraceCheckUtils]: 38: Hoare triple {2225#(and (<= main_~low~0 2) (<= 3 |main_#t~mem4|))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {2229#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:22:29,960 INFO L273 TraceCheckUtils]: 39: Hoare triple {2229#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2233#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:22:29,960 INFO L273 TraceCheckUtils]: 40: Hoare triple {2233#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2087#false} is VALID [2018-11-23 12:22:29,961 INFO L273 TraceCheckUtils]: 41: Hoare triple {2087#false} assume !false; {2087#false} is VALID [2018-11-23 12:22:29,966 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:22:29,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:22:29,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-11-23 12:22:29,987 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 42 [2018-11-23 12:22:29,988 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:22:29,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 12:22:30,087 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:30,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 12:22:30,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 12:22:30,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=677, Unknown=0, NotChecked=0, Total=756 [2018-11-23 12:22:30,089 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 28 states. [2018-11-23 12:22:44,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:44,394 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2018-11-23 12:22:44,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:22:44,394 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 42 [2018-11-23 12:22:44,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:22:44,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:22:44,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 75 transitions. [2018-11-23 12:22:44,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:22:44,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 75 transitions. [2018-11-23 12:22:44,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 75 transitions. [2018-11-23 12:22:44,504 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:44,505 INFO L225 Difference]: With dead ends: 88 [2018-11-23 12:22:44,506 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 12:22:44,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=229, Invalid=1751, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:22:44,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 12:22:44,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2018-11-23 12:22:44,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:22:44,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 49 states. [2018-11-23 12:22:44,635 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 49 states. [2018-11-23 12:22:44,635 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 49 states. [2018-11-23 12:22:44,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:44,638 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-23 12:22:44,638 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-23 12:22:44,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:44,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:44,639 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 54 states. [2018-11-23 12:22:44,639 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 54 states. [2018-11-23 12:22:44,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:22:44,640 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2018-11-23 12:22:44,640 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2018-11-23 12:22:44,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:22:44,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:22:44,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:22:44,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:22:44,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:22:44,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-11-23 12:22:44,642 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 42 [2018-11-23 12:22:44,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:22:44,642 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-11-23 12:22:44,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 12:22:44,642 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-23 12:22:44,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:22:44,643 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:22:44,643 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:22:44,643 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:22:44,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:22:44,644 INFO L82 PathProgramCache]: Analyzing trace with hash -1457592361, now seen corresponding path program 5 times [2018-11-23 12:22:44,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:22:44,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:22:44,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:44,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:22:44,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:22:44,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:45,181 INFO L256 TraceCheckUtils]: 0: Hoare triple {2567#true} call ULTIMATE.init(); {2567#true} is VALID [2018-11-23 12:22:45,182 INFO L273 TraceCheckUtils]: 1: Hoare triple {2567#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {2567#true} is VALID [2018-11-23 12:22:45,182 INFO L273 TraceCheckUtils]: 2: Hoare triple {2567#true} assume true; {2567#true} is VALID [2018-11-23 12:22:45,182 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2567#true} {2567#true} #63#return; {2567#true} is VALID [2018-11-23 12:22:45,183 INFO L256 TraceCheckUtils]: 4: Hoare triple {2567#true} call #t~ret5 := main(); {2567#true} is VALID [2018-11-23 12:22:45,183 INFO L273 TraceCheckUtils]: 5: Hoare triple {2567#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2567#true} is VALID [2018-11-23 12:22:45,185 INFO L273 TraceCheckUtils]: 6: Hoare triple {2567#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 0;~low~0 := 2;~i~0 := 0; {2569#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:22:45,186 INFO L273 TraceCheckUtils]: 7: Hoare triple {2569#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0); {2569#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:22:45,186 INFO L273 TraceCheckUtils]: 8: Hoare triple {2569#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {2569#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:22:45,187 INFO L273 TraceCheckUtils]: 9: Hoare triple {2569#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2569#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:22:45,187 INFO L273 TraceCheckUtils]: 10: Hoare triple {2569#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2570#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:22:45,188 INFO L273 TraceCheckUtils]: 11: Hoare triple {2570#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~i~0 < ~SIZE~0); {2570#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:22:45,195 INFO L273 TraceCheckUtils]: 12: Hoare triple {2570#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 1 main_~i~0) (<= main_~i~0 1))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {2570#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:22:45,196 INFO L273 TraceCheckUtils]: 13: Hoare triple {2570#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 1 main_~i~0) (<= main_~i~0 1))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2570#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:22:45,197 INFO L273 TraceCheckUtils]: 14: Hoare triple {2570#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2571#(and (<= (+ main_~low~0 1) main_~val2~0) (= (* 4 main_~i~0) 8))} is VALID [2018-11-23 12:22:45,197 INFO L273 TraceCheckUtils]: 15: Hoare triple {2571#(and (<= (+ main_~low~0 1) main_~val2~0) (= (* 4 main_~i~0) 8))} assume !!(~i~0 < ~SIZE~0); {2571#(and (<= (+ main_~low~0 1) main_~val2~0) (= (* 4 main_~i~0) 8))} is VALID [2018-11-23 12:22:45,198 INFO L273 TraceCheckUtils]: 16: Hoare triple {2571#(and (<= (+ main_~low~0 1) main_~val2~0) (= (* 4 main_~i~0) 8))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {2571#(and (<= (+ main_~low~0 1) main_~val2~0) (= (* 4 main_~i~0) 8))} is VALID [2018-11-23 12:22:45,198 INFO L273 TraceCheckUtils]: 17: Hoare triple {2571#(and (<= (+ main_~low~0 1) main_~val2~0) (= (* 4 main_~i~0) 8))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2572#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= (* 4 main_~i~0) 8))} is VALID [2018-11-23 12:22:45,199 INFO L273 TraceCheckUtils]: 18: Hoare triple {2572#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= (* 4 main_~i~0) 8))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2573#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))))} is VALID [2018-11-23 12:22:45,199 INFO L273 TraceCheckUtils]: 19: Hoare triple {2573#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))))} assume !!(~i~0 < ~SIZE~0); {2573#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))))} is VALID [2018-11-23 12:22:45,200 INFO L273 TraceCheckUtils]: 20: Hoare triple {2573#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))))} assume !(1 + ~i~0 < ~SIZE~0); {2573#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))))} is VALID [2018-11-23 12:22:45,202 INFO L273 TraceCheckUtils]: 21: Hoare triple {2573#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2574#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4))))} is VALID [2018-11-23 12:22:45,202 INFO L273 TraceCheckUtils]: 22: Hoare triple {2574#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2574#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4))))} is VALID [2018-11-23 12:22:45,203 INFO L273 TraceCheckUtils]: 23: Hoare triple {2574#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4))))} assume !(~i~0 < ~SIZE~0); {2574#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4))))} is VALID [2018-11-23 12:22:45,204 INFO L273 TraceCheckUtils]: 24: Hoare triple {2574#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4))))} ~i~0 := 0; {2575#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))) (= main_~i~0 0))} is VALID [2018-11-23 12:22:45,204 INFO L273 TraceCheckUtils]: 25: Hoare triple {2575#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2575#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))) (= main_~i~0 0))} is VALID [2018-11-23 12:22:45,205 INFO L256 TraceCheckUtils]: 26: Hoare triple {2575#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {2567#true} is VALID [2018-11-23 12:22:45,205 INFO L273 TraceCheckUtils]: 27: Hoare triple {2567#true} ~cond := #in~cond; {2576#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 12:22:45,206 INFO L273 TraceCheckUtils]: 28: Hoare triple {2576#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {2577#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:22:45,206 INFO L273 TraceCheckUtils]: 29: Hoare triple {2577#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2577#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:22:45,208 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2577#(not (= |__VERIFIER_assert_#in~cond| 0))} {2575#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))) (= main_~i~0 0))} #67#return; {2575#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))) (= main_~i~0 0))} is VALID [2018-11-23 12:22:45,209 INFO L273 TraceCheckUtils]: 31: Hoare triple {2575#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))) (= main_~i~0 0))} havoc #t~mem4; {2575#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))) (= main_~i~0 0))} is VALID [2018-11-23 12:22:45,210 INFO L273 TraceCheckUtils]: 32: Hoare triple {2575#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 1) 4)))) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2578#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-23 12:22:45,210 INFO L273 TraceCheckUtils]: 33: Hoare triple {2578#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2578#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-23 12:22:45,210 INFO L256 TraceCheckUtils]: 34: Hoare triple {2578#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {2567#true} is VALID [2018-11-23 12:22:45,210 INFO L273 TraceCheckUtils]: 35: Hoare triple {2567#true} ~cond := #in~cond; {2567#true} is VALID [2018-11-23 12:22:45,211 INFO L273 TraceCheckUtils]: 36: Hoare triple {2567#true} assume !(0 == ~cond); {2567#true} is VALID [2018-11-23 12:22:45,211 INFO L273 TraceCheckUtils]: 37: Hoare triple {2567#true} assume true; {2567#true} is VALID [2018-11-23 12:22:45,211 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2567#true} {2578#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} #67#return; {2578#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-23 12:22:45,212 INFO L273 TraceCheckUtils]: 39: Hoare triple {2578#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} havoc #t~mem4; {2578#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-23 12:22:45,213 INFO L273 TraceCheckUtils]: 40: Hoare triple {2578#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2579#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))} is VALID [2018-11-23 12:22:45,213 INFO L273 TraceCheckUtils]: 41: Hoare triple {2579#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2580#(<= (+ main_~low~0 1) |main_#t~mem4|)} is VALID [2018-11-23 12:22:45,214 INFO L256 TraceCheckUtils]: 42: Hoare triple {2580#(<= (+ main_~low~0 1) |main_#t~mem4|)} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {2577#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:22:45,215 INFO L273 TraceCheckUtils]: 43: Hoare triple {2577#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2581#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:22:45,215 INFO L273 TraceCheckUtils]: 44: Hoare triple {2581#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2568#false} is VALID [2018-11-23 12:22:45,215 INFO L273 TraceCheckUtils]: 45: Hoare triple {2568#false} assume !false; {2568#false} is VALID [2018-11-23 12:22:45,222 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 3 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:22:45,222 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:22:45,222 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:22:45,232 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:22:45,264 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2018-11-23 12:22:45,265 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:22:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:22:45,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:22:45,430 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 15 treesize of output 12 [2018-11-23 12:22:45,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 12 treesize of output 11 [2018-11-23 12:22:45,457 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:45,460 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:45,472 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:45,472 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-23 12:22:45,581 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 31 treesize of output 24 [2018-11-23 12:22:45,588 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:45,590 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 37 [2018-11-23 12:22:45,592 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:45,599 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:45,612 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:22:45,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:36 [2018-11-23 12:22:45,618 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:22:45,618 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_15|, main_~i~0]. (let ((.cse0 (select |v_#memory_int_15| |main_~#a~0.base|))) (let ((.cse1 (select .cse0 (+ |main_~#a~0.offset| 8)))) (and (<= main_~low~0 2) (= (store |v_#memory_int_15| |main_~#a~0.base| (store .cse0 (+ (* 4 main_~i~0) |main_~#a~0.offset|) .cse1)) |#memory_int|) (<= 3 main_~i~0) (<= 3 .cse1) (= |main_~#a~0.offset| 0)))) [2018-11-23 12:22:45,618 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~i~0]. (let ((.cse1 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse0 (select .cse1 (+ |main_~#a~0.offset| 8)))) (and (<= main_~low~0 2) (<= 3 .cse0) (<= 3 main_~i~0) (= .cse0 (select .cse1 (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0)))) [2018-11-23 12:22:46,808 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-11-23 12:22:47,198 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-11-23 12:22:47,229 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 28 treesize of output 20 [2018-11-23 12:22:47,234 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:22:47,237 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 12:22:47,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:22:47,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:47,253 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:22:47,254 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:7 [2018-11-23 12:22:47,257 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:22:47,257 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, v_prenex_4]. (let ((.cse1 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse0 (select .cse1 8))) (and (<= 3 .cse0) (<= 3 v_prenex_4) (<= main_~low~0 2) (= .cse0 (select .cse1 (* 4 v_prenex_4))) (<= .cse0 |main_#t~mem4|)))) [2018-11-23 12:22:47,257 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= main_~low~0 2) (<= 3 |main_#t~mem4|)) [2018-11-23 12:22:47,341 INFO L256 TraceCheckUtils]: 0: Hoare triple {2567#true} call ULTIMATE.init(); {2567#true} is VALID [2018-11-23 12:22:47,341 INFO L273 TraceCheckUtils]: 1: Hoare triple {2567#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {2567#true} is VALID [2018-11-23 12:22:47,342 INFO L273 TraceCheckUtils]: 2: Hoare triple {2567#true} assume true; {2567#true} is VALID [2018-11-23 12:22:47,342 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2567#true} {2567#true} #63#return; {2567#true} is VALID [2018-11-23 12:22:47,342 INFO L256 TraceCheckUtils]: 4: Hoare triple {2567#true} call #t~ret5 := main(); {2567#true} is VALID [2018-11-23 12:22:47,342 INFO L273 TraceCheckUtils]: 5: Hoare triple {2567#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2567#true} is VALID [2018-11-23 12:22:47,343 INFO L273 TraceCheckUtils]: 6: Hoare triple {2567#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 0;~low~0 := 2;~i~0 := 0; {2603#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,343 INFO L273 TraceCheckUtils]: 7: Hoare triple {2603#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0); {2603#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,344 INFO L273 TraceCheckUtils]: 8: Hoare triple {2603#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {2603#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,344 INFO L273 TraceCheckUtils]: 9: Hoare triple {2603#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2603#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,345 INFO L273 TraceCheckUtils]: 10: Hoare triple {2603#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2616#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,345 INFO L273 TraceCheckUtils]: 11: Hoare triple {2616#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0); {2616#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,346 INFO L273 TraceCheckUtils]: 12: Hoare triple {2616#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {2616#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,346 INFO L273 TraceCheckUtils]: 13: Hoare triple {2616#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2616#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,347 INFO L273 TraceCheckUtils]: 14: Hoare triple {2616#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2629#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,348 INFO L273 TraceCheckUtils]: 15: Hoare triple {2629#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0); {2629#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,349 INFO L273 TraceCheckUtils]: 16: Hoare triple {2629#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {2629#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,350 INFO L273 TraceCheckUtils]: 17: Hoare triple {2629#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2639#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,351 INFO L273 TraceCheckUtils]: 18: Hoare triple {2639#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2643#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= 3 main_~i~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,352 INFO L273 TraceCheckUtils]: 19: Hoare triple {2643#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= 3 main_~i~0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0); {2643#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= 3 main_~i~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,353 INFO L273 TraceCheckUtils]: 20: Hoare triple {2643#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= 3 main_~i~0) (= |main_~#a~0.offset| 0))} assume !(1 + ~i~0 < ~SIZE~0); {2643#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= 3 main_~i~0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,354 INFO L273 TraceCheckUtils]: 21: Hoare triple {2643#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (<= 3 main_~i~0) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2653#(and (<= main_~low~0 2) (exists ((main_~i~0 Int)) (and (<= 3 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,356 INFO L273 TraceCheckUtils]: 22: Hoare triple {2653#(and (<= main_~low~0 2) (exists ((main_~i~0 Int)) (and (<= 3 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2653#(and (<= main_~low~0 2) (exists ((main_~i~0 Int)) (and (<= 3 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,357 INFO L273 TraceCheckUtils]: 23: Hoare triple {2653#(and (<= main_~low~0 2) (exists ((main_~i~0 Int)) (and (<= 3 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} assume !(~i~0 < ~SIZE~0); {2653#(and (<= main_~low~0 2) (exists ((main_~i~0 Int)) (and (<= 3 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,359 INFO L273 TraceCheckUtils]: 24: Hoare triple {2653#(and (<= main_~low~0 2) (exists ((main_~i~0 Int)) (and (<= 3 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {2663#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (exists ((v_prenex_4 Int)) (and (<= 3 v_prenex_4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_4) |main_~#a~0.offset|))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,360 INFO L273 TraceCheckUtils]: 25: Hoare triple {2663#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (exists ((v_prenex_4 Int)) (and (<= 3 v_prenex_4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_4) |main_~#a~0.offset|))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2663#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (exists ((v_prenex_4 Int)) (and (<= 3 v_prenex_4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_4) |main_~#a~0.offset|))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,363 INFO L256 TraceCheckUtils]: 26: Hoare triple {2663#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (exists ((v_prenex_4 Int)) (and (<= 3 v_prenex_4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_4) |main_~#a~0.offset|))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {2670#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_4 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (* 4 v_prenex_4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (<= 3 v_prenex_4) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8))))} is VALID [2018-11-23 12:22:47,364 INFO L273 TraceCheckUtils]: 27: Hoare triple {2670#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_4 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (* 4 v_prenex_4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (<= 3 v_prenex_4) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8))))} ~cond := #in~cond; {2674#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_4 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (* 4 v_prenex_4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (<= 3 v_prenex_4) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:22:47,365 INFO L273 TraceCheckUtils]: 28: Hoare triple {2674#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_4 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (* 4 v_prenex_4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (<= 3 v_prenex_4) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(0 == ~cond); {2678#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_4 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (* 4 v_prenex_4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (<= 3 v_prenex_4) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)))))} is VALID [2018-11-23 12:22:47,365 INFO L273 TraceCheckUtils]: 29: Hoare triple {2678#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_4 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (* 4 v_prenex_4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (<= 3 v_prenex_4) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)))))} assume true; {2678#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_4 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (* 4 v_prenex_4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (<= 3 v_prenex_4) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)))))} is VALID [2018-11-23 12:22:47,366 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {2678#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_4 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (* 4 v_prenex_4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (<= 3 v_prenex_4) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)))))} {2663#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (exists ((v_prenex_4 Int)) (and (<= 3 v_prenex_4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_4) |main_~#a~0.offset|))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #67#return; {2663#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (exists ((v_prenex_4 Int)) (and (<= 3 v_prenex_4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_4) |main_~#a~0.offset|))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,367 INFO L273 TraceCheckUtils]: 31: Hoare triple {2663#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (exists ((v_prenex_4 Int)) (and (<= 3 v_prenex_4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_4) |main_~#a~0.offset|))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} havoc #t~mem4; {2663#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (exists ((v_prenex_4 Int)) (and (<= 3 v_prenex_4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_4) |main_~#a~0.offset|))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,369 INFO L273 TraceCheckUtils]: 32: Hoare triple {2663#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (exists ((v_prenex_4 Int)) (and (<= 3 v_prenex_4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_4) |main_~#a~0.offset|))))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2691#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (exists ((v_prenex_4 Int)) (and (<= 3 v_prenex_4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_4) |main_~#a~0.offset|))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,370 INFO L273 TraceCheckUtils]: 33: Hoare triple {2691#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (exists ((v_prenex_4 Int)) (and (<= 3 v_prenex_4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_4) |main_~#a~0.offset|))))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2691#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (exists ((v_prenex_4 Int)) (and (<= 3 v_prenex_4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_4) |main_~#a~0.offset|))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,372 INFO L256 TraceCheckUtils]: 34: Hoare triple {2691#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (exists ((v_prenex_4 Int)) (and (<= 3 v_prenex_4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_4) |main_~#a~0.offset|))))) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {2670#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_4 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (* 4 v_prenex_4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (<= 3 v_prenex_4) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8))))} is VALID [2018-11-23 12:22:47,373 INFO L273 TraceCheckUtils]: 35: Hoare triple {2670#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_4 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (* 4 v_prenex_4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (<= 3 v_prenex_4) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8))))} ~cond := #in~cond; {2670#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_4 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (* 4 v_prenex_4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (<= 3 v_prenex_4) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8))))} is VALID [2018-11-23 12:22:47,373 INFO L273 TraceCheckUtils]: 36: Hoare triple {2670#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_4 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (* 4 v_prenex_4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (<= 3 v_prenex_4) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8))))} assume !(0 == ~cond); {2670#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_4 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (* 4 v_prenex_4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (<= 3 v_prenex_4) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8))))} is VALID [2018-11-23 12:22:47,374 INFO L273 TraceCheckUtils]: 37: Hoare triple {2670#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_4 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (* 4 v_prenex_4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (<= 3 v_prenex_4) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8))))} assume true; {2670#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_4 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (* 4 v_prenex_4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (<= 3 v_prenex_4) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8))))} is VALID [2018-11-23 12:22:47,375 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {2670#(exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_prenex_4 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) (* 4 v_prenex_4)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8)) (<= 3 v_prenex_4) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|) 8))))} {2691#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (exists ((v_prenex_4 Int)) (and (<= 3 v_prenex_4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_4) |main_~#a~0.offset|))))) (= |main_~#a~0.offset| 0))} #67#return; {2691#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (exists ((v_prenex_4 Int)) (and (<= 3 v_prenex_4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_4) |main_~#a~0.offset|))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,376 INFO L273 TraceCheckUtils]: 39: Hoare triple {2691#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (exists ((v_prenex_4 Int)) (and (<= 3 v_prenex_4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_4) |main_~#a~0.offset|))))) (= |main_~#a~0.offset| 0))} havoc #t~mem4; {2691#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (exists ((v_prenex_4 Int)) (and (<= 3 v_prenex_4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_4) |main_~#a~0.offset|))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,378 INFO L273 TraceCheckUtils]: 40: Hoare triple {2691#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (exists ((v_prenex_4 Int)) (and (<= 3 v_prenex_4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_4) |main_~#a~0.offset|))))) (= |main_~#a~0.offset| 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2716#(and (= main_~i~0 2) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (exists ((v_prenex_4 Int)) (and (<= 3 v_prenex_4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_4) |main_~#a~0.offset|))))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:22:47,379 INFO L273 TraceCheckUtils]: 41: Hoare triple {2716#(and (= main_~i~0 2) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8))) (exists ((v_prenex_4 Int)) (and (<= 3 v_prenex_4) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 8)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_4) |main_~#a~0.offset|))))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {2720#(and (<= main_~low~0 2) (<= 3 |main_#t~mem4|))} is VALID [2018-11-23 12:22:47,381 INFO L256 TraceCheckUtils]: 42: Hoare triple {2720#(and (<= main_~low~0 2) (<= 3 |main_#t~mem4|))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {2724#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:22:47,381 INFO L273 TraceCheckUtils]: 43: Hoare triple {2724#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2728#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:22:47,382 INFO L273 TraceCheckUtils]: 44: Hoare triple {2728#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2568#false} is VALID [2018-11-23 12:22:47,382 INFO L273 TraceCheckUtils]: 45: Hoare triple {2568#false} assume !false; {2568#false} is VALID [2018-11-23 12:22:47,392 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 43 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:22:47,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:22:47,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2018-11-23 12:22:47,411 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 46 [2018-11-23 12:22:47,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:22:47,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 12:22:47,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:47,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 12:22:47,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 12:22:47,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=774, Unknown=0, NotChecked=0, Total=870 [2018-11-23 12:22:47,555 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 30 states. [2018-11-23 12:23:09,643 WARN L180 SmtUtils]: Spent 837.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2018-11-23 12:23:10,536 WARN L180 SmtUtils]: Spent 351.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-11-23 12:23:11,375 WARN L180 SmtUtils]: Spent 391.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 36 [2018-11-23 12:23:12,277 WARN L180 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 33 [2018-11-23 12:23:12,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:12,970 INFO L93 Difference]: Finished difference Result 66 states and 68 transitions. [2018-11-23 12:23:12,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 12:23:12,970 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 46 [2018-11-23 12:23:12,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:12,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:23:12,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 60 transitions. [2018-11-23 12:23:12,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:23:12,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 60 transitions. [2018-11-23 12:23:12,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 60 transitions. [2018-11-23 12:23:13,097 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:13,098 INFO L225 Difference]: With dead ends: 66 [2018-11-23 12:23:13,098 INFO L226 Difference]: Without dead ends: 64 [2018-11-23 12:23:13,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 30 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 440 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=195, Invalid=1445, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 12:23:13,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-23 12:23:13,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2018-11-23 12:23:13,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:13,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 57 states. [2018-11-23 12:23:13,277 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 57 states. [2018-11-23 12:23:13,277 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 57 states. [2018-11-23 12:23:13,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:13,281 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-11-23 12:23:13,281 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-11-23 12:23:13,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:13,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:13,281 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 64 states. [2018-11-23 12:23:13,281 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 64 states. [2018-11-23 12:23:13,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:13,284 INFO L93 Difference]: Finished difference Result 64 states and 66 transitions. [2018-11-23 12:23:13,284 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2018-11-23 12:23:13,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:13,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:13,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:13,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:13,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:23:13,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-11-23 12:23:13,287 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 46 [2018-11-23 12:23:13,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:13,287 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-11-23 12:23:13,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 12:23:13,287 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-11-23 12:23:13,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 12:23:13,288 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:13,288 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:13,288 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:13,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:13,289 INFO L82 PathProgramCache]: Analyzing trace with hash 581379210, now seen corresponding path program 6 times [2018-11-23 12:23:13,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:13,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:13,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:13,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:23:13,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:14,239 INFO L256 TraceCheckUtils]: 0: Hoare triple {3050#true} call ULTIMATE.init(); {3050#true} is VALID [2018-11-23 12:23:14,240 INFO L273 TraceCheckUtils]: 1: Hoare triple {3050#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {3050#true} is VALID [2018-11-23 12:23:14,240 INFO L273 TraceCheckUtils]: 2: Hoare triple {3050#true} assume true; {3050#true} is VALID [2018-11-23 12:23:14,240 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3050#true} {3050#true} #63#return; {3050#true} is VALID [2018-11-23 12:23:14,241 INFO L256 TraceCheckUtils]: 4: Hoare triple {3050#true} call #t~ret5 := main(); {3050#true} is VALID [2018-11-23 12:23:14,241 INFO L273 TraceCheckUtils]: 5: Hoare triple {3050#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {3050#true} is VALID [2018-11-23 12:23:14,242 INFO L273 TraceCheckUtils]: 6: Hoare triple {3050#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 0;~low~0 := 2;~i~0 := 0; {3052#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:23:14,242 INFO L273 TraceCheckUtils]: 7: Hoare triple {3052#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0); {3052#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:23:14,243 INFO L273 TraceCheckUtils]: 8: Hoare triple {3052#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {3052#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:23:14,243 INFO L273 TraceCheckUtils]: 9: Hoare triple {3052#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3052#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:23:14,244 INFO L273 TraceCheckUtils]: 10: Hoare triple {3052#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3053#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:23:14,244 INFO L273 TraceCheckUtils]: 11: Hoare triple {3053#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 1))} assume !!(~i~0 < ~SIZE~0); {3053#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:23:14,245 INFO L273 TraceCheckUtils]: 12: Hoare triple {3053#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 1))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {3053#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:23:14,245 INFO L273 TraceCheckUtils]: 13: Hoare triple {3053#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 1))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3053#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:23:14,246 INFO L273 TraceCheckUtils]: 14: Hoare triple {3053#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3054#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} is VALID [2018-11-23 12:23:14,247 INFO L273 TraceCheckUtils]: 15: Hoare triple {3054#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0); {3054#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} is VALID [2018-11-23 12:23:14,248 INFO L273 TraceCheckUtils]: 16: Hoare triple {3054#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {3054#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} is VALID [2018-11-23 12:23:14,249 INFO L273 TraceCheckUtils]: 17: Hoare triple {3054#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3054#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} is VALID [2018-11-23 12:23:14,250 INFO L273 TraceCheckUtils]: 18: Hoare triple {3054#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3055#(and (<= (+ main_~low~0 1) main_~val2~0) (or (= (* 4 main_~i~0) 12) (<= main_~i~0 2)))} is VALID [2018-11-23 12:23:14,251 INFO L273 TraceCheckUtils]: 19: Hoare triple {3055#(and (<= (+ main_~low~0 1) main_~val2~0) (or (= (* 4 main_~i~0) 12) (<= main_~i~0 2)))} assume !!(~i~0 < ~SIZE~0); {3055#(and (<= (+ main_~low~0 1) main_~val2~0) (or (= (* 4 main_~i~0) 12) (<= main_~i~0 2)))} is VALID [2018-11-23 12:23:14,252 INFO L273 TraceCheckUtils]: 20: Hoare triple {3055#(and (<= (+ main_~low~0 1) main_~val2~0) (or (= (* 4 main_~i~0) 12) (<= main_~i~0 2)))} assume !(1 + ~i~0 < ~SIZE~0); {3056#(and (<= (+ main_~low~0 1) main_~val2~0) (or (= (* 4 main_~i~0) 12) (<= ~SIZE~0 3)) (<= ~SIZE~0 4))} is VALID [2018-11-23 12:23:14,253 INFO L273 TraceCheckUtils]: 21: Hoare triple {3056#(and (<= (+ main_~low~0 1) main_~val2~0) (or (= (* 4 main_~i~0) 12) (<= ~SIZE~0 3)) (<= ~SIZE~0 4))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3057#(and (<= ~SIZE~0 4) (or (and (= (* 4 main_~i~0) 12) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))) (<= ~SIZE~0 3)))} is VALID [2018-11-23 12:23:14,254 INFO L273 TraceCheckUtils]: 22: Hoare triple {3057#(and (<= ~SIZE~0 4) (or (and (= (* 4 main_~i~0) 12) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))) (<= ~SIZE~0 3)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3058#(and (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))) (<= ~SIZE~0 3)) (<= ~SIZE~0 4))} is VALID [2018-11-23 12:23:14,255 INFO L273 TraceCheckUtils]: 23: Hoare triple {3058#(and (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))) (<= ~SIZE~0 3)) (<= ~SIZE~0 4))} assume !(~i~0 < ~SIZE~0); {3058#(and (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))) (<= ~SIZE~0 3)) (<= ~SIZE~0 4))} is VALID [2018-11-23 12:23:14,256 INFO L273 TraceCheckUtils]: 24: Hoare triple {3058#(and (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))) (<= ~SIZE~0 3)) (<= ~SIZE~0 4))} ~i~0 := 0; {3059#(and (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))) (<= ~SIZE~0 3)) (<= ~SIZE~0 4) (= main_~i~0 0))} is VALID [2018-11-23 12:23:14,257 INFO L273 TraceCheckUtils]: 25: Hoare triple {3059#(and (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))) (<= ~SIZE~0 3)) (<= ~SIZE~0 4) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3059#(and (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))) (<= ~SIZE~0 3)) (<= ~SIZE~0 4) (= main_~i~0 0))} is VALID [2018-11-23 12:23:14,257 INFO L256 TraceCheckUtils]: 26: Hoare triple {3059#(and (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))) (<= ~SIZE~0 3)) (<= ~SIZE~0 4) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {3050#true} is VALID [2018-11-23 12:23:14,258 INFO L273 TraceCheckUtils]: 27: Hoare triple {3050#true} ~cond := #in~cond; {3060#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 12:23:14,258 INFO L273 TraceCheckUtils]: 28: Hoare triple {3060#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {3061#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:23:14,259 INFO L273 TraceCheckUtils]: 29: Hoare triple {3061#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3061#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:23:14,260 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {3061#(not (= |__VERIFIER_assert_#in~cond| 0))} {3059#(and (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))) (<= ~SIZE~0 3)) (<= ~SIZE~0 4) (= main_~i~0 0))} #67#return; {3059#(and (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))) (<= ~SIZE~0 3)) (<= ~SIZE~0 4) (= main_~i~0 0))} is VALID [2018-11-23 12:23:14,261 INFO L273 TraceCheckUtils]: 31: Hoare triple {3059#(and (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))) (<= ~SIZE~0 3)) (<= ~SIZE~0 4) (= main_~i~0 0))} havoc #t~mem4; {3059#(and (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))) (<= ~SIZE~0 3)) (<= ~SIZE~0 4) (= main_~i~0 0))} is VALID [2018-11-23 12:23:14,262 INFO L273 TraceCheckUtils]: 32: Hoare triple {3059#(and (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))) (<= ~SIZE~0 3)) (<= ~SIZE~0 4) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3062#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4)))) (<= ~SIZE~0 (+ main_~i~0 2))))} is VALID [2018-11-23 12:23:14,263 INFO L273 TraceCheckUtils]: 33: Hoare triple {3062#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4)))) (<= ~SIZE~0 (+ main_~i~0 2))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3062#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4)))) (<= ~SIZE~0 (+ main_~i~0 2))))} is VALID [2018-11-23 12:23:14,264 INFO L256 TraceCheckUtils]: 34: Hoare triple {3062#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4)))) (<= ~SIZE~0 (+ main_~i~0 2))))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {3050#true} is VALID [2018-11-23 12:23:14,264 INFO L273 TraceCheckUtils]: 35: Hoare triple {3050#true} ~cond := #in~cond; {3050#true} is VALID [2018-11-23 12:23:14,264 INFO L273 TraceCheckUtils]: 36: Hoare triple {3050#true} assume !(0 == ~cond); {3050#true} is VALID [2018-11-23 12:23:14,264 INFO L273 TraceCheckUtils]: 37: Hoare triple {3050#true} assume true; {3050#true} is VALID [2018-11-23 12:23:14,266 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {3050#true} {3062#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4)))) (<= ~SIZE~0 (+ main_~i~0 2))))} #67#return; {3062#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4)))) (<= ~SIZE~0 (+ main_~i~0 2))))} is VALID [2018-11-23 12:23:14,266 INFO L273 TraceCheckUtils]: 39: Hoare triple {3062#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4)))) (<= ~SIZE~0 (+ main_~i~0 2))))} havoc #t~mem4; {3062#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4)))) (<= ~SIZE~0 (+ main_~i~0 2))))} is VALID [2018-11-23 12:23:14,270 INFO L273 TraceCheckUtils]: 40: Hoare triple {3062#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4)))) (<= ~SIZE~0 (+ main_~i~0 2))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3063#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= ~SIZE~0 (+ main_~i~0 1)) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))))} is VALID [2018-11-23 12:23:14,274 INFO L273 TraceCheckUtils]: 41: Hoare triple {3063#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= ~SIZE~0 (+ main_~i~0 1)) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3063#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= ~SIZE~0 (+ main_~i~0 1)) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))))} is VALID [2018-11-23 12:23:14,274 INFO L256 TraceCheckUtils]: 42: Hoare triple {3063#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= ~SIZE~0 (+ main_~i~0 1)) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {3050#true} is VALID [2018-11-23 12:23:14,275 INFO L273 TraceCheckUtils]: 43: Hoare triple {3050#true} ~cond := #in~cond; {3050#true} is VALID [2018-11-23 12:23:14,275 INFO L273 TraceCheckUtils]: 44: Hoare triple {3050#true} assume !(0 == ~cond); {3050#true} is VALID [2018-11-23 12:23:14,275 INFO L273 TraceCheckUtils]: 45: Hoare triple {3050#true} assume true; {3050#true} is VALID [2018-11-23 12:23:14,279 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {3050#true} {3063#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= ~SIZE~0 (+ main_~i~0 1)) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))))} #67#return; {3063#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= ~SIZE~0 (+ main_~i~0 1)) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))))} is VALID [2018-11-23 12:23:14,280 INFO L273 TraceCheckUtils]: 47: Hoare triple {3063#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= ~SIZE~0 (+ main_~i~0 1)) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))))} havoc #t~mem4; {3063#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= ~SIZE~0 (+ main_~i~0 1)) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))))} is VALID [2018-11-23 12:23:14,280 INFO L273 TraceCheckUtils]: 48: Hoare triple {3063#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= ~SIZE~0 (+ main_~i~0 1)) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3064#(or (<= ~SIZE~0 main_~i~0) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))))} is VALID [2018-11-23 12:23:14,281 INFO L273 TraceCheckUtils]: 49: Hoare triple {3064#(or (<= ~SIZE~0 main_~i~0) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3065#(<= (+ main_~low~0 1) |main_#t~mem4|)} is VALID [2018-11-23 12:23:14,282 INFO L256 TraceCheckUtils]: 50: Hoare triple {3065#(<= (+ main_~low~0 1) |main_#t~mem4|)} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {3061#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:23:14,282 INFO L273 TraceCheckUtils]: 51: Hoare triple {3061#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3066#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:23:14,283 INFO L273 TraceCheckUtils]: 52: Hoare triple {3066#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3051#false} is VALID [2018-11-23 12:23:14,283 INFO L273 TraceCheckUtils]: 53: Hoare triple {3051#false} assume !false; {3051#false} is VALID [2018-11-23 12:23:14,291 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 9 proven. 49 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:23:14,291 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:23:14,291 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:23:14,300 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:23:14,328 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-23 12:23:14,328 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:23:14,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:14,346 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:23:14,551 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 15 treesize of output 12 [2018-11-23 12:23:14,557 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 12:23:14,561 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:14,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:14,583 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:23:14,584 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:30, output treesize:23 [2018-11-23 12:23:14,590 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:23:14,591 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_16|, main_~i~0, main_~val2~0]. (and (<= 3 main_~val2~0) (<= main_~i~0 3) (<= main_~low~0 2) (<= ~SIZE~0 (+ main_~i~0 1)) (= (store |v_#memory_int_16| |main_~#a~0.base| (store (select |v_#memory_int_16| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|) main_~val2~0)) |#memory_int|)) [2018-11-23 12:23:14,591 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~i~0]. (and (<= main_~i~0 3) (<= main_~low~0 2) (<= ~SIZE~0 (+ main_~i~0 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|)))) [2018-11-23 12:23:15,392 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 23 treesize of output 19 [2018-11-23 12:23:15,398 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 12:23:15,400 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2018-11-23 12:23:15,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:15,410 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:15,424 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:15,424 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:35, output treesize:7 [2018-11-23 12:23:15,428 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:23:15,429 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, main_~i~0, |main_~#a~0.offset|, v_prenex_7]. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|))) (and (<= 3 (select .cse0 (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= main_~low~0 2) (<= v_prenex_7 3) (<= 3 main_~i~0) (<= main_~i~0 v_prenex_7) (<= (select .cse0 (+ (* 4 main_~i~0) |main_~#a~0.offset|)) |main_#t~mem4|))) [2018-11-23 12:23:15,429 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= main_~low~0 2) (<= 3 |main_#t~mem4|)) [2018-11-23 12:23:15,514 INFO L256 TraceCheckUtils]: 0: Hoare triple {3050#true} call ULTIMATE.init(); {3050#true} is VALID [2018-11-23 12:23:15,514 INFO L273 TraceCheckUtils]: 1: Hoare triple {3050#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {3050#true} is VALID [2018-11-23 12:23:15,514 INFO L273 TraceCheckUtils]: 2: Hoare triple {3050#true} assume true; {3050#true} is VALID [2018-11-23 12:23:15,515 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3050#true} {3050#true} #63#return; {3050#true} is VALID [2018-11-23 12:23:15,515 INFO L256 TraceCheckUtils]: 4: Hoare triple {3050#true} call #t~ret5 := main(); {3050#true} is VALID [2018-11-23 12:23:15,515 INFO L273 TraceCheckUtils]: 5: Hoare triple {3050#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {3050#true} is VALID [2018-11-23 12:23:15,515 INFO L273 TraceCheckUtils]: 6: Hoare triple {3050#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 0;~low~0 := 2;~i~0 := 0; {3088#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= main_~i~0 0))} is VALID [2018-11-23 12:23:15,516 INFO L273 TraceCheckUtils]: 7: Hoare triple {3088#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0); {3088#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= main_~i~0 0))} is VALID [2018-11-23 12:23:15,516 INFO L273 TraceCheckUtils]: 8: Hoare triple {3088#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= main_~i~0 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {3088#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= main_~i~0 0))} is VALID [2018-11-23 12:23:15,517 INFO L273 TraceCheckUtils]: 9: Hoare triple {3088#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= main_~i~0 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3088#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= main_~i~0 0))} is VALID [2018-11-23 12:23:15,517 INFO L273 TraceCheckUtils]: 10: Hoare triple {3088#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3101#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= main_~i~0 1))} is VALID [2018-11-23 12:23:15,518 INFO L273 TraceCheckUtils]: 11: Hoare triple {3101#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= main_~i~0 1))} assume !!(~i~0 < ~SIZE~0); {3101#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= main_~i~0 1))} is VALID [2018-11-23 12:23:15,518 INFO L273 TraceCheckUtils]: 12: Hoare triple {3101#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= main_~i~0 1))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {3101#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= main_~i~0 1))} is VALID [2018-11-23 12:23:15,519 INFO L273 TraceCheckUtils]: 13: Hoare triple {3101#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= main_~i~0 1))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3101#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= main_~i~0 1))} is VALID [2018-11-23 12:23:15,520 INFO L273 TraceCheckUtils]: 14: Hoare triple {3101#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3114#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= main_~i~0 2))} is VALID [2018-11-23 12:23:15,521 INFO L273 TraceCheckUtils]: 15: Hoare triple {3114#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0); {3114#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= main_~i~0 2))} is VALID [2018-11-23 12:23:15,521 INFO L273 TraceCheckUtils]: 16: Hoare triple {3114#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= main_~i~0 2))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {3114#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= main_~i~0 2))} is VALID [2018-11-23 12:23:15,522 INFO L273 TraceCheckUtils]: 17: Hoare triple {3114#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= main_~i~0 2))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3114#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= main_~i~0 2))} is VALID [2018-11-23 12:23:15,523 INFO L273 TraceCheckUtils]: 18: Hoare triple {3114#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= main_~i~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3127#(and (<= 3 main_~val2~0) (<= main_~i~0 3) (<= main_~low~0 2))} is VALID [2018-11-23 12:23:15,524 INFO L273 TraceCheckUtils]: 19: Hoare triple {3127#(and (<= 3 main_~val2~0) (<= main_~i~0 3) (<= main_~low~0 2))} assume !!(~i~0 < ~SIZE~0); {3127#(and (<= 3 main_~val2~0) (<= main_~i~0 3) (<= main_~low~0 2))} is VALID [2018-11-23 12:23:15,525 INFO L273 TraceCheckUtils]: 20: Hoare triple {3127#(and (<= 3 main_~val2~0) (<= main_~i~0 3) (<= main_~low~0 2))} assume !(1 + ~i~0 < ~SIZE~0); {3134#(and (<= 3 main_~val2~0) (<= main_~i~0 3) (<= main_~low~0 2) (<= ~SIZE~0 (+ main_~i~0 1)))} is VALID [2018-11-23 12:23:15,530 INFO L273 TraceCheckUtils]: 21: Hoare triple {3134#(and (<= 3 main_~val2~0) (<= main_~i~0 3) (<= main_~low~0 2) (<= ~SIZE~0 (+ main_~i~0 1)))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3138#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 3) (<= ~SIZE~0 (+ main_~i~0 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))) (<= main_~low~0 2))} is VALID [2018-11-23 12:23:15,530 INFO L273 TraceCheckUtils]: 22: Hoare triple {3138#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 3) (<= ~SIZE~0 (+ main_~i~0 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))) (<= main_~low~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3138#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 3) (<= ~SIZE~0 (+ main_~i~0 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))) (<= main_~low~0 2))} is VALID [2018-11-23 12:23:15,531 INFO L273 TraceCheckUtils]: 23: Hoare triple {3138#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 3) (<= ~SIZE~0 (+ main_~i~0 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))) (<= main_~low~0 2))} assume !(~i~0 < ~SIZE~0); {3138#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 3) (<= ~SIZE~0 (+ main_~i~0 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))) (<= main_~low~0 2))} is VALID [2018-11-23 12:23:15,532 INFO L273 TraceCheckUtils]: 24: Hoare triple {3138#(and (exists ((main_~i~0 Int)) (and (<= main_~i~0 3) (<= ~SIZE~0 (+ main_~i~0 1)) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))) (<= main_~low~0 2))} ~i~0 := 0; {3148#(and (<= 0 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} is VALID [2018-11-23 12:23:15,532 INFO L273 TraceCheckUtils]: 25: Hoare triple {3148#(and (<= 0 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3148#(and (<= 0 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} is VALID [2018-11-23 12:23:15,534 INFO L256 TraceCheckUtils]: 26: Hoare triple {3148#(and (<= 0 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {3155#(exists ((v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (and (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 4 v_prenex_7) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3)))} is VALID [2018-11-23 12:23:15,535 INFO L273 TraceCheckUtils]: 27: Hoare triple {3155#(exists ((v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (and (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 4 v_prenex_7) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3)))} ~cond := #in~cond; {3155#(exists ((v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (and (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 4 v_prenex_7) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3)))} is VALID [2018-11-23 12:23:15,536 INFO L273 TraceCheckUtils]: 28: Hoare triple {3155#(exists ((v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (and (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 4 v_prenex_7) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3)))} assume !(0 == ~cond); {3155#(exists ((v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (and (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 4 v_prenex_7) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3)))} is VALID [2018-11-23 12:23:15,536 INFO L273 TraceCheckUtils]: 29: Hoare triple {3155#(exists ((v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (and (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 4 v_prenex_7) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3)))} assume true; {3155#(exists ((v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (and (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 4 v_prenex_7) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3)))} is VALID [2018-11-23 12:23:15,537 INFO L268 TraceCheckUtils]: 30: Hoare quadruple {3155#(exists ((v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (and (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 4 v_prenex_7) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3)))} {3148#(and (<= 0 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} #67#return; {3148#(and (<= 0 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} is VALID [2018-11-23 12:23:15,538 INFO L273 TraceCheckUtils]: 31: Hoare triple {3148#(and (<= 0 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} havoc #t~mem4; {3148#(and (<= 0 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} is VALID [2018-11-23 12:23:15,539 INFO L273 TraceCheckUtils]: 32: Hoare triple {3148#(and (<= 0 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3174#(and (<= 1 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} is VALID [2018-11-23 12:23:15,540 INFO L273 TraceCheckUtils]: 33: Hoare triple {3174#(and (<= 1 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3174#(and (<= 1 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} is VALID [2018-11-23 12:23:15,543 INFO L256 TraceCheckUtils]: 34: Hoare triple {3174#(and (<= 1 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {3155#(exists ((v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (and (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 4 v_prenex_7) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3)))} is VALID [2018-11-23 12:23:15,543 INFO L273 TraceCheckUtils]: 35: Hoare triple {3155#(exists ((v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (and (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 4 v_prenex_7) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3)))} ~cond := #in~cond; {3155#(exists ((v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (and (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 4 v_prenex_7) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3)))} is VALID [2018-11-23 12:23:15,544 INFO L273 TraceCheckUtils]: 36: Hoare triple {3155#(exists ((v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (and (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 4 v_prenex_7) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3)))} assume !(0 == ~cond); {3155#(exists ((v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (and (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 4 v_prenex_7) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3)))} is VALID [2018-11-23 12:23:15,544 INFO L273 TraceCheckUtils]: 37: Hoare triple {3155#(exists ((v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (and (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 4 v_prenex_7) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3)))} assume true; {3155#(exists ((v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (and (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 4 v_prenex_7) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3)))} is VALID [2018-11-23 12:23:15,546 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {3155#(exists ((v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (and (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 4 v_prenex_7) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3)))} {3174#(and (<= 1 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} #67#return; {3174#(and (<= 1 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} is VALID [2018-11-23 12:23:15,546 INFO L273 TraceCheckUtils]: 39: Hoare triple {3174#(and (<= 1 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} havoc #t~mem4; {3174#(and (<= 1 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} is VALID [2018-11-23 12:23:15,550 INFO L273 TraceCheckUtils]: 40: Hoare triple {3174#(and (<= 1 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3199#(and (<= 2 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} is VALID [2018-11-23 12:23:15,551 INFO L273 TraceCheckUtils]: 41: Hoare triple {3199#(and (<= 2 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3199#(and (<= 2 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} is VALID [2018-11-23 12:23:15,552 INFO L256 TraceCheckUtils]: 42: Hoare triple {3199#(and (<= 2 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {3155#(exists ((v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (and (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 4 v_prenex_7) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3)))} is VALID [2018-11-23 12:23:15,553 INFO L273 TraceCheckUtils]: 43: Hoare triple {3155#(exists ((v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (and (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 4 v_prenex_7) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3)))} ~cond := #in~cond; {3209#(and (exists ((v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (and (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 4 v_prenex_7) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:23:15,553 INFO L273 TraceCheckUtils]: 44: Hoare triple {3209#(and (exists ((v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (and (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 4 v_prenex_7) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(0 == ~cond); {3213#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (and (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 4 v_prenex_7) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} is VALID [2018-11-23 12:23:15,554 INFO L273 TraceCheckUtils]: 45: Hoare triple {3213#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (and (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 4 v_prenex_7) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} assume true; {3213#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (and (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 4 v_prenex_7) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} is VALID [2018-11-23 12:23:15,555 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {3213#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((v_prenex_7 Int) (|v_main_~#a~0.offset_BEFORE_CALL_7| Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int)) (and (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|) (+ (* 4 v_prenex_7) |v_main_~#a~0.offset_BEFORE_CALL_7|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} {3199#(and (<= 2 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} #67#return; {3199#(and (<= 2 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} is VALID [2018-11-23 12:23:15,556 INFO L273 TraceCheckUtils]: 47: Hoare triple {3199#(and (<= 2 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} havoc #t~mem4; {3199#(and (<= 2 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} is VALID [2018-11-23 12:23:15,557 INFO L273 TraceCheckUtils]: 48: Hoare triple {3199#(and (<= 2 main_~i~0) (<= main_~low~0 2) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3226#(and (<= main_~low~0 2) (<= 3 main_~i~0) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} is VALID [2018-11-23 12:23:15,558 INFO L273 TraceCheckUtils]: 49: Hoare triple {3226#(and (<= main_~low~0 2) (<= 3 main_~i~0) (exists ((v_prenex_7 Int)) (and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_7) |main_~#a~0.offset|))) (<= ~SIZE~0 (+ v_prenex_7 1)) (<= v_prenex_7 3))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3230#(and (<= main_~low~0 2) (<= 3 |main_#t~mem4|))} is VALID [2018-11-23 12:23:15,560 INFO L256 TraceCheckUtils]: 50: Hoare triple {3230#(and (<= main_~low~0 2) (<= 3 |main_#t~mem4|))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {3234#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:23:15,560 INFO L273 TraceCheckUtils]: 51: Hoare triple {3234#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3238#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:23:15,561 INFO L273 TraceCheckUtils]: 52: Hoare triple {3238#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3051#false} is VALID [2018-11-23 12:23:15,561 INFO L273 TraceCheckUtils]: 53: Hoare triple {3051#false} assume !false; {3051#false} is VALID [2018-11-23 12:23:15,573 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 21 proven. 37 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:23:15,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:23:15,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 33 [2018-11-23 12:23:15,592 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 54 [2018-11-23 12:23:15,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:15,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 12:23:16,023 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:16,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 12:23:16,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 12:23:16,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=931, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 12:23:16,025 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 33 states. [2018-11-23 12:23:24,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:24,595 INFO L93 Difference]: Finished difference Result 101 states and 103 transitions. [2018-11-23 12:23:24,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 12:23:24,596 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 54 [2018-11-23 12:23:24,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:24,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:23:24,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 75 transitions. [2018-11-23 12:23:24,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:23:24,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 75 transitions. [2018-11-23 12:23:24,601 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 75 transitions. [2018-11-23 12:23:28,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 73 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:28,170 INFO L225 Difference]: With dead ends: 101 [2018-11-23 12:23:28,170 INFO L226 Difference]: Without dead ends: 63 [2018-11-23 12:23:28,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=279, Invalid=1977, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:23:28,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-23 12:23:28,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2018-11-23 12:23:28,445 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:28,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 61 states. [2018-11-23 12:23:28,445 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 61 states. [2018-11-23 12:23:28,445 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 61 states. [2018-11-23 12:23:28,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:28,447 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-11-23 12:23:28,447 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-11-23 12:23:28,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:28,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:28,448 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 63 states. [2018-11-23 12:23:28,448 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 63 states. [2018-11-23 12:23:28,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:28,450 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-11-23 12:23:28,450 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-11-23 12:23:28,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:28,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:28,450 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:28,450 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:28,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 12:23:28,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-11-23 12:23:28,452 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 54 [2018-11-23 12:23:28,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:28,452 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-11-23 12:23:28,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 12:23:28,453 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-11-23 12:23:28,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-23 12:23:28,453 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:28,454 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:28,454 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:28,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:28,454 INFO L82 PathProgramCache]: Analyzing trace with hash 2088311493, now seen corresponding path program 7 times [2018-11-23 12:23:28,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:28,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:28,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:28,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:23:28,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:28,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:29,580 WARN L180 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 21 [2018-11-23 12:23:29,789 INFO L256 TraceCheckUtils]: 0: Hoare triple {3619#true} call ULTIMATE.init(); {3619#true} is VALID [2018-11-23 12:23:29,789 INFO L273 TraceCheckUtils]: 1: Hoare triple {3619#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {3619#true} is VALID [2018-11-23 12:23:29,790 INFO L273 TraceCheckUtils]: 2: Hoare triple {3619#true} assume true; {3619#true} is VALID [2018-11-23 12:23:29,790 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3619#true} {3619#true} #63#return; {3619#true} is VALID [2018-11-23 12:23:29,790 INFO L256 TraceCheckUtils]: 4: Hoare triple {3619#true} call #t~ret5 := main(); {3619#true} is VALID [2018-11-23 12:23:29,790 INFO L273 TraceCheckUtils]: 5: Hoare triple {3619#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {3619#true} is VALID [2018-11-23 12:23:29,791 INFO L273 TraceCheckUtils]: 6: Hoare triple {3619#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 0;~low~0 := 2;~i~0 := 0; {3621#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:23:29,791 INFO L273 TraceCheckUtils]: 7: Hoare triple {3621#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0); {3621#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:23:29,792 INFO L273 TraceCheckUtils]: 8: Hoare triple {3621#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {3621#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:23:29,792 INFO L273 TraceCheckUtils]: 9: Hoare triple {3621#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3621#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:23:29,793 INFO L273 TraceCheckUtils]: 10: Hoare triple {3621#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3622#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:23:29,793 INFO L273 TraceCheckUtils]: 11: Hoare triple {3622#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~i~0 < ~SIZE~0); {3622#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:23:29,794 INFO L273 TraceCheckUtils]: 12: Hoare triple {3622#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 1 main_~i~0) (<= main_~i~0 1))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {3622#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:23:29,795 INFO L273 TraceCheckUtils]: 13: Hoare triple {3622#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 1 main_~i~0) (<= main_~i~0 1))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3622#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:23:29,796 INFO L273 TraceCheckUtils]: 14: Hoare triple {3622#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3623#(and (<= 2 main_~i~0) (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} is VALID [2018-11-23 12:23:29,797 INFO L273 TraceCheckUtils]: 15: Hoare triple {3623#(and (<= 2 main_~i~0) (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0); {3623#(and (<= 2 main_~i~0) (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} is VALID [2018-11-23 12:23:29,797 INFO L273 TraceCheckUtils]: 16: Hoare triple {3623#(and (<= 2 main_~i~0) (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {3623#(and (<= 2 main_~i~0) (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} is VALID [2018-11-23 12:23:29,798 INFO L273 TraceCheckUtils]: 17: Hoare triple {3623#(and (<= 2 main_~i~0) (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3623#(and (<= 2 main_~i~0) (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} is VALID [2018-11-23 12:23:29,799 INFO L273 TraceCheckUtils]: 18: Hoare triple {3623#(and (<= 2 main_~i~0) (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3624#(and (<= (+ main_~low~0 1) main_~val2~0) (= (* 4 main_~i~0) 12))} is VALID [2018-11-23 12:23:29,800 INFO L273 TraceCheckUtils]: 19: Hoare triple {3624#(and (<= (+ main_~low~0 1) main_~val2~0) (= (* 4 main_~i~0) 12))} assume !!(~i~0 < ~SIZE~0); {3624#(and (<= (+ main_~low~0 1) main_~val2~0) (= (* 4 main_~i~0) 12))} is VALID [2018-11-23 12:23:29,801 INFO L273 TraceCheckUtils]: 20: Hoare triple {3624#(and (<= (+ main_~low~0 1) main_~val2~0) (= (* 4 main_~i~0) 12))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {3624#(and (<= (+ main_~low~0 1) main_~val2~0) (= (* 4 main_~i~0) 12))} is VALID [2018-11-23 12:23:29,802 INFO L273 TraceCheckUtils]: 21: Hoare triple {3624#(and (<= (+ main_~low~0 1) main_~val2~0) (= (* 4 main_~i~0) 12))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3625#(and (<= (+ main_~low~0 1) main_~val2~0) (= (* 4 main_~i~0) 12) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))))} is VALID [2018-11-23 12:23:29,803 INFO L273 TraceCheckUtils]: 22: Hoare triple {3625#(and (<= (+ main_~low~0 1) main_~val2~0) (= (* 4 main_~i~0) 12) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3626#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))))} is VALID [2018-11-23 12:23:29,804 INFO L273 TraceCheckUtils]: 23: Hoare triple {3626#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))))} assume !!(~i~0 < ~SIZE~0); {3626#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))))} is VALID [2018-11-23 12:23:29,805 INFO L273 TraceCheckUtils]: 24: Hoare triple {3626#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))))} assume !(1 + ~i~0 < ~SIZE~0); {3626#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))))} is VALID [2018-11-23 12:23:29,806 INFO L273 TraceCheckUtils]: 25: Hoare triple {3626#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3627#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4))))} is VALID [2018-11-23 12:23:29,807 INFO L273 TraceCheckUtils]: 26: Hoare triple {3627#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3627#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4))))} is VALID [2018-11-23 12:23:29,808 INFO L273 TraceCheckUtils]: 27: Hoare triple {3627#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4))))} assume !(~i~0 < ~SIZE~0); {3627#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4))))} is VALID [2018-11-23 12:23:29,808 INFO L273 TraceCheckUtils]: 28: Hoare triple {3627#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4))))} ~i~0 := 0; {3628#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))) (= main_~i~0 0))} is VALID [2018-11-23 12:23:29,809 INFO L273 TraceCheckUtils]: 29: Hoare triple {3628#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3628#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))) (= main_~i~0 0))} is VALID [2018-11-23 12:23:29,810 INFO L256 TraceCheckUtils]: 30: Hoare triple {3628#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {3619#true} is VALID [2018-11-23 12:23:29,810 INFO L273 TraceCheckUtils]: 31: Hoare triple {3619#true} ~cond := #in~cond; {3629#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 12:23:29,811 INFO L273 TraceCheckUtils]: 32: Hoare triple {3629#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {3630#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:23:29,811 INFO L273 TraceCheckUtils]: 33: Hoare triple {3630#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3630#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:23:29,812 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3630#(not (= |__VERIFIER_assert_#in~cond| 0))} {3628#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))) (= main_~i~0 0))} #67#return; {3628#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))) (= main_~i~0 0))} is VALID [2018-11-23 12:23:29,813 INFO L273 TraceCheckUtils]: 35: Hoare triple {3628#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))) (= main_~i~0 0))} havoc #t~mem4; {3628#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))) (= main_~i~0 0))} is VALID [2018-11-23 12:23:29,815 INFO L273 TraceCheckUtils]: 36: Hoare triple {3628#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 2) 4)))) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3631#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4))))} is VALID [2018-11-23 12:23:29,815 INFO L273 TraceCheckUtils]: 37: Hoare triple {3631#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3631#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4))))} is VALID [2018-11-23 12:23:29,815 INFO L256 TraceCheckUtils]: 38: Hoare triple {3631#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4))))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {3619#true} is VALID [2018-11-23 12:23:29,816 INFO L273 TraceCheckUtils]: 39: Hoare triple {3619#true} ~cond := #in~cond; {3619#true} is VALID [2018-11-23 12:23:29,816 INFO L273 TraceCheckUtils]: 40: Hoare triple {3619#true} assume !(0 == ~cond); {3619#true} is VALID [2018-11-23 12:23:29,816 INFO L273 TraceCheckUtils]: 41: Hoare triple {3619#true} assume true; {3619#true} is VALID [2018-11-23 12:23:29,817 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {3619#true} {3631#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4))))} #67#return; {3631#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4))))} is VALID [2018-11-23 12:23:29,818 INFO L273 TraceCheckUtils]: 43: Hoare triple {3631#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4))))} havoc #t~mem4; {3631#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4))))} is VALID [2018-11-23 12:23:29,819 INFO L273 TraceCheckUtils]: 44: Hoare triple {3631#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3632#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-23 12:23:29,819 INFO L273 TraceCheckUtils]: 45: Hoare triple {3632#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3632#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-23 12:23:29,819 INFO L256 TraceCheckUtils]: 46: Hoare triple {3632#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {3619#true} is VALID [2018-11-23 12:23:29,819 INFO L273 TraceCheckUtils]: 47: Hoare triple {3619#true} ~cond := #in~cond; {3619#true} is VALID [2018-11-23 12:23:29,819 INFO L273 TraceCheckUtils]: 48: Hoare triple {3619#true} assume !(0 == ~cond); {3619#true} is VALID [2018-11-23 12:23:29,819 INFO L273 TraceCheckUtils]: 49: Hoare triple {3619#true} assume true; {3619#true} is VALID [2018-11-23 12:23:29,820 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {3619#true} {3632#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} #67#return; {3632#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-23 12:23:29,821 INFO L273 TraceCheckUtils]: 51: Hoare triple {3632#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} havoc #t~mem4; {3632#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-23 12:23:29,822 INFO L273 TraceCheckUtils]: 52: Hoare triple {3632#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3633#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))} is VALID [2018-11-23 12:23:29,823 INFO L273 TraceCheckUtils]: 53: Hoare triple {3633#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3634#(<= (+ main_~low~0 1) |main_#t~mem4|)} is VALID [2018-11-23 12:23:29,824 INFO L256 TraceCheckUtils]: 54: Hoare triple {3634#(<= (+ main_~low~0 1) |main_#t~mem4|)} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {3630#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:23:29,825 INFO L273 TraceCheckUtils]: 55: Hoare triple {3630#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3635#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:23:29,825 INFO L273 TraceCheckUtils]: 56: Hoare triple {3635#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3620#false} is VALID [2018-11-23 12:23:29,826 INFO L273 TraceCheckUtils]: 57: Hoare triple {3620#false} assume !false; {3620#false} is VALID [2018-11-23 12:23:29,834 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 5 proven. 70 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:23:29,834 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:23:29,834 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:23:29,844 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:29,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:23:29,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:23:30,091 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 15 treesize of output 12 [2018-11-23 12:23:30,095 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 12:23:30,097 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:30,100 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:30,111 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:30,112 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:28, output treesize:24 [2018-11-23 12:23:30,239 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 31 treesize of output 24 [2018-11-23 12:23:30,246 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:30,248 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 37 [2018-11-23 12:23:30,250 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:30,259 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:30,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:23:30,272 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:40, output treesize:36 [2018-11-23 12:23:30,278 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:23:30,279 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_18|, main_~i~0]. (let ((.cse0 (select |v_#memory_int_18| |main_~#a~0.base|))) (let ((.cse1 (select .cse0 (+ |main_~#a~0.offset| 12)))) (and (<= main_~low~0 2) (= (store |v_#memory_int_18| |main_~#a~0.base| (store .cse0 (+ (* 4 main_~i~0) |main_~#a~0.offset|) .cse1)) |#memory_int|) (<= 4 main_~i~0) (<= 3 .cse1) (= |main_~#a~0.offset| 0)))) [2018-11-23 12:23:30,279 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~i~0]. (let ((.cse1 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse0 (select .cse1 (+ |main_~#a~0.offset| 12)))) (and (<= 3 .cse0) (= .cse0 (select .cse1 (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= main_~low~0 2) (<= 4 main_~i~0) (= |main_~#a~0.offset| 0)))) [2018-11-23 12:23:31,635 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 28 treesize of output 20 [2018-11-23 12:23:31,640 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:23:31,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2018-11-23 12:23:31,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:23:31,651 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:31,657 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:23:31,658 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:34, output treesize:7 [2018-11-23 12:23:31,661 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:23:31,661 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|, v_prenex_11]. (let ((.cse1 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse0 (select .cse1 12))) (and (<= main_~low~0 2) (<= .cse0 |main_#t~mem4|) (<= 4 v_prenex_11) (= .cse0 (select .cse1 (* 4 v_prenex_11))) (<= 3 .cse0)))) [2018-11-23 12:23:31,661 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= main_~low~0 2) (<= 3 |main_#t~mem4|)) [2018-11-23 12:23:31,758 INFO L256 TraceCheckUtils]: 0: Hoare triple {3619#true} call ULTIMATE.init(); {3619#true} is VALID [2018-11-23 12:23:31,758 INFO L273 TraceCheckUtils]: 1: Hoare triple {3619#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {3619#true} is VALID [2018-11-23 12:23:31,758 INFO L273 TraceCheckUtils]: 2: Hoare triple {3619#true} assume true; {3619#true} is VALID [2018-11-23 12:23:31,758 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3619#true} {3619#true} #63#return; {3619#true} is VALID [2018-11-23 12:23:31,759 INFO L256 TraceCheckUtils]: 4: Hoare triple {3619#true} call #t~ret5 := main(); {3619#true} is VALID [2018-11-23 12:23:31,759 INFO L273 TraceCheckUtils]: 5: Hoare triple {3619#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {3619#true} is VALID [2018-11-23 12:23:31,785 INFO L273 TraceCheckUtils]: 6: Hoare triple {3619#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 0;~low~0 := 2;~i~0 := 0; {3657#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,785 INFO L273 TraceCheckUtils]: 7: Hoare triple {3657#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0); {3657#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,786 INFO L273 TraceCheckUtils]: 8: Hoare triple {3657#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {3657#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,786 INFO L273 TraceCheckUtils]: 9: Hoare triple {3657#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3657#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {3657#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3670#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,788 INFO L273 TraceCheckUtils]: 11: Hoare triple {3670#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0); {3670#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,788 INFO L273 TraceCheckUtils]: 12: Hoare triple {3670#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {3670#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,789 INFO L273 TraceCheckUtils]: 13: Hoare triple {3670#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3670#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,789 INFO L273 TraceCheckUtils]: 14: Hoare triple {3670#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3683#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,790 INFO L273 TraceCheckUtils]: 15: Hoare triple {3683#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0); {3683#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,791 INFO L273 TraceCheckUtils]: 16: Hoare triple {3683#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {3683#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,792 INFO L273 TraceCheckUtils]: 17: Hoare triple {3683#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3683#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,793 INFO L273 TraceCheckUtils]: 18: Hoare triple {3683#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3696#(and (= main_~i~0 3) (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,793 INFO L273 TraceCheckUtils]: 19: Hoare triple {3696#(and (= main_~i~0 3) (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0); {3696#(and (= main_~i~0 3) (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,794 INFO L273 TraceCheckUtils]: 20: Hoare triple {3696#(and (= main_~i~0 3) (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {3696#(and (= main_~i~0 3) (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,795 INFO L273 TraceCheckUtils]: 21: Hoare triple {3696#(and (= main_~i~0 3) (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3706#(and (= main_~i~0 3) (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,814 INFO L273 TraceCheckUtils]: 22: Hoare triple {3706#(and (= main_~i~0 3) (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3710#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= 4 main_~i~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,818 INFO L273 TraceCheckUtils]: 23: Hoare triple {3710#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= 4 main_~i~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0); {3710#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= 4 main_~i~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,819 INFO L273 TraceCheckUtils]: 24: Hoare triple {3710#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= 4 main_~i~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} assume !(1 + ~i~0 < ~SIZE~0); {3710#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= 4 main_~i~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,820 INFO L273 TraceCheckUtils]: 25: Hoare triple {3710#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= 4 main_~i~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3720#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (<= main_~low~0 2) (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= 4 main_~i~0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,821 INFO L273 TraceCheckUtils]: 26: Hoare triple {3720#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (<= main_~low~0 2) (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= 4 main_~i~0))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3720#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (<= main_~low~0 2) (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= 4 main_~i~0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,821 INFO L273 TraceCheckUtils]: 27: Hoare triple {3720#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (<= main_~low~0 2) (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= 4 main_~i~0))) (= |main_~#a~0.offset| 0))} assume !(~i~0 < ~SIZE~0); {3720#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (<= main_~low~0 2) (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= 4 main_~i~0))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,822 INFO L273 TraceCheckUtils]: 28: Hoare triple {3720#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (<= main_~low~0 2) (exists ((main_~i~0 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= 4 main_~i~0))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {3730#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,823 INFO L273 TraceCheckUtils]: 29: Hoare triple {3730#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3730#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,826 INFO L256 TraceCheckUtils]: 30: Hoare triple {3730#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {3737#(exists ((v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (and (<= 4 v_prenex_11) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (* 4 v_prenex_11))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12))))} is VALID [2018-11-23 12:23:31,827 INFO L273 TraceCheckUtils]: 31: Hoare triple {3737#(exists ((v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (and (<= 4 v_prenex_11) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (* 4 v_prenex_11))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12))))} ~cond := #in~cond; {3741#(and (exists ((v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (and (<= 4 v_prenex_11) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (* 4 v_prenex_11))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:23:31,827 INFO L273 TraceCheckUtils]: 32: Hoare triple {3741#(and (exists ((v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (and (<= 4 v_prenex_11) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (* 4 v_prenex_11))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(0 == ~cond); {3745#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (and (<= 4 v_prenex_11) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (* 4 v_prenex_11))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))))} is VALID [2018-11-23 12:23:31,828 INFO L273 TraceCheckUtils]: 33: Hoare triple {3745#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (and (<= 4 v_prenex_11) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (* 4 v_prenex_11))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))))} assume true; {3745#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (and (<= 4 v_prenex_11) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (* 4 v_prenex_11))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))))} is VALID [2018-11-23 12:23:31,829 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3745#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (and (<= 4 v_prenex_11) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (* 4 v_prenex_11))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12)))))} {3730#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #67#return; {3730#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,829 INFO L273 TraceCheckUtils]: 35: Hoare triple {3730#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} havoc #t~mem4; {3730#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,830 INFO L273 TraceCheckUtils]: 36: Hoare triple {3730#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3758#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,832 INFO L273 TraceCheckUtils]: 37: Hoare triple {3758#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3758#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,834 INFO L256 TraceCheckUtils]: 38: Hoare triple {3758#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {3737#(exists ((v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (and (<= 4 v_prenex_11) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (* 4 v_prenex_11))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12))))} is VALID [2018-11-23 12:23:31,834 INFO L273 TraceCheckUtils]: 39: Hoare triple {3737#(exists ((v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (and (<= 4 v_prenex_11) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (* 4 v_prenex_11))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12))))} ~cond := #in~cond; {3737#(exists ((v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (and (<= 4 v_prenex_11) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (* 4 v_prenex_11))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12))))} is VALID [2018-11-23 12:23:31,835 INFO L273 TraceCheckUtils]: 40: Hoare triple {3737#(exists ((v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (and (<= 4 v_prenex_11) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (* 4 v_prenex_11))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12))))} assume !(0 == ~cond); {3737#(exists ((v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (and (<= 4 v_prenex_11) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (* 4 v_prenex_11))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12))))} is VALID [2018-11-23 12:23:31,836 INFO L273 TraceCheckUtils]: 41: Hoare triple {3737#(exists ((v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (and (<= 4 v_prenex_11) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (* 4 v_prenex_11))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12))))} assume true; {3737#(exists ((v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (and (<= 4 v_prenex_11) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (* 4 v_prenex_11))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12))))} is VALID [2018-11-23 12:23:31,837 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {3737#(exists ((v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (and (<= 4 v_prenex_11) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (* 4 v_prenex_11))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12))))} {3758#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} #67#return; {3758#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,838 INFO L273 TraceCheckUtils]: 43: Hoare triple {3758#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} havoc #t~mem4; {3758#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,839 INFO L273 TraceCheckUtils]: 44: Hoare triple {3758#(and (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3783#(and (= main_~i~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,840 INFO L273 TraceCheckUtils]: 45: Hoare triple {3783#(and (= main_~i~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3783#(and (= main_~i~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,843 INFO L256 TraceCheckUtils]: 46: Hoare triple {3783#(and (= main_~i~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {3737#(exists ((v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (and (<= 4 v_prenex_11) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (* 4 v_prenex_11))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12))))} is VALID [2018-11-23 12:23:31,843 INFO L273 TraceCheckUtils]: 47: Hoare triple {3737#(exists ((v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (and (<= 4 v_prenex_11) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (* 4 v_prenex_11))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12))))} ~cond := #in~cond; {3737#(exists ((v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (and (<= 4 v_prenex_11) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (* 4 v_prenex_11))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12))))} is VALID [2018-11-23 12:23:31,844 INFO L273 TraceCheckUtils]: 48: Hoare triple {3737#(exists ((v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (and (<= 4 v_prenex_11) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (* 4 v_prenex_11))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12))))} assume !(0 == ~cond); {3737#(exists ((v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (and (<= 4 v_prenex_11) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (* 4 v_prenex_11))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12))))} is VALID [2018-11-23 12:23:31,844 INFO L273 TraceCheckUtils]: 49: Hoare triple {3737#(exists ((v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (and (<= 4 v_prenex_11) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (* 4 v_prenex_11))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12))))} assume true; {3737#(exists ((v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (and (<= 4 v_prenex_11) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (* 4 v_prenex_11))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12))))} is VALID [2018-11-23 12:23:31,845 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {3737#(exists ((v_prenex_11 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int)) (and (<= 4 v_prenex_11) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) (* 4 v_prenex_11))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|) 12))))} {3783#(and (= main_~i~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} #67#return; {3783#(and (= main_~i~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,846 INFO L273 TraceCheckUtils]: 51: Hoare triple {3783#(and (= main_~i~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} havoc #t~mem4; {3783#(and (= main_~i~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,847 INFO L273 TraceCheckUtils]: 52: Hoare triple {3783#(and (= main_~i~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3808#(and (= main_~i~0 3) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:23:31,848 INFO L273 TraceCheckUtils]: 53: Hoare triple {3808#(and (= main_~i~0 3) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12))) (exists ((v_prenex_11 Int)) (and (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 12)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_11) |main_~#a~0.offset|))) (<= 4 v_prenex_11))) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {3812#(and (<= main_~low~0 2) (<= 3 |main_#t~mem4|))} is VALID [2018-11-23 12:23:31,849 INFO L256 TraceCheckUtils]: 54: Hoare triple {3812#(and (<= main_~low~0 2) (<= 3 |main_#t~mem4|))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {3816#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:23:31,850 INFO L273 TraceCheckUtils]: 55: Hoare triple {3816#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {3820#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:23:31,851 INFO L273 TraceCheckUtils]: 56: Hoare triple {3820#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3620#false} is VALID [2018-11-23 12:23:31,851 INFO L273 TraceCheckUtils]: 57: Hoare triple {3620#false} assume !false; {3620#false} is VALID [2018-11-23 12:23:31,867 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:23:31,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:23:31,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19] total 34 [2018-11-23 12:23:31,887 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 58 [2018-11-23 12:23:31,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:23:31,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 12:23:32,018 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:32,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 12:23:32,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 12:23:32,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1013, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 12:23:32,019 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 34 states. [2018-11-23 12:23:53,557 WARN L180 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2018-11-23 12:23:55,019 WARN L180 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-11-23 12:23:59,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:59,475 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-11-23 12:23:59,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 12:23:59,475 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 58 [2018-11-23 12:23:59,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:23:59,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:23:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 69 transitions. [2018-11-23 12:23:59,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 12:23:59,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 69 transitions. [2018-11-23 12:23:59,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 69 transitions. [2018-11-23 12:23:59,632 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:23:59,633 INFO L225 Difference]: With dead ends: 78 [2018-11-23 12:23:59,634 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 12:23:59,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 38 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 600 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=223, Invalid=1939, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 12:23:59,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 12:23:59,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 69. [2018-11-23 12:23:59,886 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:23:59,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 69 states. [2018-11-23 12:23:59,887 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 69 states. [2018-11-23 12:23:59,887 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 69 states. [2018-11-23 12:23:59,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:59,889 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-11-23 12:23:59,890 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-11-23 12:23:59,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:59,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:59,890 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 76 states. [2018-11-23 12:23:59,890 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 76 states. [2018-11-23 12:23:59,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:23:59,893 INFO L93 Difference]: Finished difference Result 76 states and 78 transitions. [2018-11-23 12:23:59,893 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 78 transitions. [2018-11-23 12:23:59,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:23:59,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:23:59,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:23:59,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:23:59,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 12:23:59,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-11-23 12:23:59,895 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 58 [2018-11-23 12:23:59,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:23:59,895 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-11-23 12:23:59,895 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 12:23:59,895 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-11-23 12:23:59,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 12:23:59,895 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:23:59,896 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:23:59,896 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:23:59,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:23:59,896 INFO L82 PathProgramCache]: Analyzing trace with hash 827230584, now seen corresponding path program 8 times [2018-11-23 12:23:59,896 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:23:59,896 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:23:59,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:59,897 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:23:59,897 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:23:59,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:00,550 INFO L256 TraceCheckUtils]: 0: Hoare triple {4202#true} call ULTIMATE.init(); {4202#true} is VALID [2018-11-23 12:24:00,550 INFO L273 TraceCheckUtils]: 1: Hoare triple {4202#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {4202#true} is VALID [2018-11-23 12:24:00,551 INFO L273 TraceCheckUtils]: 2: Hoare triple {4202#true} assume true; {4202#true} is VALID [2018-11-23 12:24:00,551 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4202#true} {4202#true} #63#return; {4202#true} is VALID [2018-11-23 12:24:00,551 INFO L256 TraceCheckUtils]: 4: Hoare triple {4202#true} call #t~ret5 := main(); {4202#true} is VALID [2018-11-23 12:24:00,551 INFO L273 TraceCheckUtils]: 5: Hoare triple {4202#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {4202#true} is VALID [2018-11-23 12:24:00,552 INFO L273 TraceCheckUtils]: 6: Hoare triple {4202#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 0;~low~0 := 2;~i~0 := 0; {4204#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:24:00,553 INFO L273 TraceCheckUtils]: 7: Hoare triple {4204#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0); {4204#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:24:00,553 INFO L273 TraceCheckUtils]: 8: Hoare triple {4204#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {4204#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:24:00,554 INFO L273 TraceCheckUtils]: 9: Hoare triple {4204#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4204#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:24:00,554 INFO L273 TraceCheckUtils]: 10: Hoare triple {4204#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4205#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:24:00,555 INFO L273 TraceCheckUtils]: 11: Hoare triple {4205#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 1))} assume !!(~i~0 < ~SIZE~0); {4205#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:24:00,556 INFO L273 TraceCheckUtils]: 12: Hoare triple {4205#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 1))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {4205#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:24:00,556 INFO L273 TraceCheckUtils]: 13: Hoare triple {4205#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 1))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4205#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:24:00,557 INFO L273 TraceCheckUtils]: 14: Hoare triple {4205#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4206#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} is VALID [2018-11-23 12:24:00,558 INFO L273 TraceCheckUtils]: 15: Hoare triple {4206#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0); {4206#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} is VALID [2018-11-23 12:24:00,559 INFO L273 TraceCheckUtils]: 16: Hoare triple {4206#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {4206#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} is VALID [2018-11-23 12:24:00,559 INFO L273 TraceCheckUtils]: 17: Hoare triple {4206#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4206#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} is VALID [2018-11-23 12:24:00,560 INFO L273 TraceCheckUtils]: 18: Hoare triple {4206#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4207#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 3))} is VALID [2018-11-23 12:24:00,561 INFO L273 TraceCheckUtils]: 19: Hoare triple {4207#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 3))} assume !!(~i~0 < ~SIZE~0); {4207#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 3))} is VALID [2018-11-23 12:24:00,562 INFO L273 TraceCheckUtils]: 20: Hoare triple {4207#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 3))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {4207#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 3))} is VALID [2018-11-23 12:24:00,562 INFO L273 TraceCheckUtils]: 21: Hoare triple {4207#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 3))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4207#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 3))} is VALID [2018-11-23 12:24:00,563 INFO L273 TraceCheckUtils]: 22: Hoare triple {4207#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 3))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4208#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 4))} is VALID [2018-11-23 12:24:00,564 INFO L273 TraceCheckUtils]: 23: Hoare triple {4208#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0); {4208#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 4))} is VALID [2018-11-23 12:24:00,565 INFO L273 TraceCheckUtils]: 24: Hoare triple {4208#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 4))} assume !(1 + ~i~0 < ~SIZE~0); {4209#(and (<= (+ main_~low~0 1) main_~val2~0) (or (<= ~SIZE~0 4) (= (+ (* 4 main_~i~0) 4) (* 4 ~SIZE~0))) (<= ~SIZE~0 5))} is VALID [2018-11-23 12:24:00,566 INFO L273 TraceCheckUtils]: 25: Hoare triple {4209#(and (<= (+ main_~low~0 1) main_~val2~0) (or (<= ~SIZE~0 4) (= (+ (* 4 main_~i~0) 4) (* 4 ~SIZE~0))) (<= ~SIZE~0 5))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4210#(and (or (and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= (+ (* 4 main_~i~0) 4) (* 4 ~SIZE~0))) (<= ~SIZE~0 4)) (<= ~SIZE~0 5))} is VALID [2018-11-23 12:24:00,567 INFO L273 TraceCheckUtils]: 26: Hoare triple {4210#(and (or (and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))) (= (+ (* 4 main_~i~0) 4) (* 4 ~SIZE~0))) (<= ~SIZE~0 4)) (<= ~SIZE~0 5))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4211#(and (or (<= ~SIZE~0 4) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4))))) (<= ~SIZE~0 5))} is VALID [2018-11-23 12:24:00,568 INFO L273 TraceCheckUtils]: 27: Hoare triple {4211#(and (or (<= ~SIZE~0 4) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4))))) (<= ~SIZE~0 5))} assume !(~i~0 < ~SIZE~0); {4211#(and (or (<= ~SIZE~0 4) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4))))) (<= ~SIZE~0 5))} is VALID [2018-11-23 12:24:00,569 INFO L273 TraceCheckUtils]: 28: Hoare triple {4211#(and (or (<= ~SIZE~0 4) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4))))) (<= ~SIZE~0 5))} ~i~0 := 0; {4212#(and (or (<= ~SIZE~0 4) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4))))) (<= ~SIZE~0 5) (= main_~i~0 0))} is VALID [2018-11-23 12:24:00,570 INFO L273 TraceCheckUtils]: 29: Hoare triple {4212#(and (or (<= ~SIZE~0 4) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4))))) (<= ~SIZE~0 5) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4212#(and (or (<= ~SIZE~0 4) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4))))) (<= ~SIZE~0 5) (= main_~i~0 0))} is VALID [2018-11-23 12:24:00,570 INFO L256 TraceCheckUtils]: 30: Hoare triple {4212#(and (or (<= ~SIZE~0 4) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4))))) (<= ~SIZE~0 5) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {4202#true} is VALID [2018-11-23 12:24:00,571 INFO L273 TraceCheckUtils]: 31: Hoare triple {4202#true} ~cond := #in~cond; {4213#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 12:24:00,571 INFO L273 TraceCheckUtils]: 32: Hoare triple {4213#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {4214#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:24:00,572 INFO L273 TraceCheckUtils]: 33: Hoare triple {4214#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4214#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:24:00,573 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {4214#(not (= |__VERIFIER_assert_#in~cond| 0))} {4212#(and (or (<= ~SIZE~0 4) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4))))) (<= ~SIZE~0 5) (= main_~i~0 0))} #67#return; {4212#(and (or (<= ~SIZE~0 4) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4))))) (<= ~SIZE~0 5) (= main_~i~0 0))} is VALID [2018-11-23 12:24:00,574 INFO L273 TraceCheckUtils]: 35: Hoare triple {4212#(and (or (<= ~SIZE~0 4) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4))))) (<= ~SIZE~0 5) (= main_~i~0 0))} havoc #t~mem4; {4212#(and (or (<= ~SIZE~0 4) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4))))) (<= ~SIZE~0 5) (= main_~i~0 0))} is VALID [2018-11-23 12:24:00,575 INFO L273 TraceCheckUtils]: 36: Hoare triple {4212#(and (or (<= ~SIZE~0 4) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4))))) (<= ~SIZE~0 5) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4215#(and (<= ~SIZE~0 (+ main_~i~0 4)) (or (<= ~SIZE~0 (+ main_~i~0 3)) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4))))))} is VALID [2018-11-23 12:24:00,581 INFO L273 TraceCheckUtils]: 37: Hoare triple {4215#(and (<= ~SIZE~0 (+ main_~i~0 4)) (or (<= ~SIZE~0 (+ main_~i~0 3)) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4))))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4215#(and (<= ~SIZE~0 (+ main_~i~0 4)) (or (<= ~SIZE~0 (+ main_~i~0 3)) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4))))))} is VALID [2018-11-23 12:24:00,581 INFO L256 TraceCheckUtils]: 38: Hoare triple {4215#(and (<= ~SIZE~0 (+ main_~i~0 4)) (or (<= ~SIZE~0 (+ main_~i~0 3)) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4))))))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {4202#true} is VALID [2018-11-23 12:24:00,582 INFO L273 TraceCheckUtils]: 39: Hoare triple {4202#true} ~cond := #in~cond; {4202#true} is VALID [2018-11-23 12:24:00,582 INFO L273 TraceCheckUtils]: 40: Hoare triple {4202#true} assume !(0 == ~cond); {4202#true} is VALID [2018-11-23 12:24:00,582 INFO L273 TraceCheckUtils]: 41: Hoare triple {4202#true} assume true; {4202#true} is VALID [2018-11-23 12:24:00,583 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {4202#true} {4215#(and (<= ~SIZE~0 (+ main_~i~0 4)) (or (<= ~SIZE~0 (+ main_~i~0 3)) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4))))))} #67#return; {4215#(and (<= ~SIZE~0 (+ main_~i~0 4)) (or (<= ~SIZE~0 (+ main_~i~0 3)) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4))))))} is VALID [2018-11-23 12:24:00,583 INFO L273 TraceCheckUtils]: 43: Hoare triple {4215#(and (<= ~SIZE~0 (+ main_~i~0 4)) (or (<= ~SIZE~0 (+ main_~i~0 3)) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4))))))} havoc #t~mem4; {4215#(and (<= ~SIZE~0 (+ main_~i~0 4)) (or (<= ~SIZE~0 (+ main_~i~0 3)) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4))))))} is VALID [2018-11-23 12:24:00,584 INFO L273 TraceCheckUtils]: 44: Hoare triple {4215#(and (<= ~SIZE~0 (+ main_~i~0 4)) (or (<= ~SIZE~0 (+ main_~i~0 3)) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4))))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4216#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 2))))} is VALID [2018-11-23 12:24:00,585 INFO L273 TraceCheckUtils]: 45: Hoare triple {4216#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 2))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4216#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 2))))} is VALID [2018-11-23 12:24:00,585 INFO L256 TraceCheckUtils]: 46: Hoare triple {4216#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 2))))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {4202#true} is VALID [2018-11-23 12:24:00,586 INFO L273 TraceCheckUtils]: 47: Hoare triple {4202#true} ~cond := #in~cond; {4202#true} is VALID [2018-11-23 12:24:00,586 INFO L273 TraceCheckUtils]: 48: Hoare triple {4202#true} assume !(0 == ~cond); {4202#true} is VALID [2018-11-23 12:24:00,586 INFO L273 TraceCheckUtils]: 49: Hoare triple {4202#true} assume true; {4202#true} is VALID [2018-11-23 12:24:00,587 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {4202#true} {4216#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 2))))} #67#return; {4216#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 2))))} is VALID [2018-11-23 12:24:00,588 INFO L273 TraceCheckUtils]: 51: Hoare triple {4216#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 2))))} havoc #t~mem4; {4216#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 2))))} is VALID [2018-11-23 12:24:00,589 INFO L273 TraceCheckUtils]: 52: Hoare triple {4216#(and (<= ~SIZE~0 (+ main_~i~0 3)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 2))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4217#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 1))))} is VALID [2018-11-23 12:24:00,589 INFO L273 TraceCheckUtils]: 53: Hoare triple {4217#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 1))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4217#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 1))))} is VALID [2018-11-23 12:24:00,590 INFO L256 TraceCheckUtils]: 54: Hoare triple {4217#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 1))))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {4202#true} is VALID [2018-11-23 12:24:00,590 INFO L273 TraceCheckUtils]: 55: Hoare triple {4202#true} ~cond := #in~cond; {4202#true} is VALID [2018-11-23 12:24:00,590 INFO L273 TraceCheckUtils]: 56: Hoare triple {4202#true} assume !(0 == ~cond); {4202#true} is VALID [2018-11-23 12:24:00,590 INFO L273 TraceCheckUtils]: 57: Hoare triple {4202#true} assume true; {4202#true} is VALID [2018-11-23 12:24:00,591 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {4202#true} {4217#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 1))))} #67#return; {4217#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 1))))} is VALID [2018-11-23 12:24:00,592 INFO L273 TraceCheckUtils]: 59: Hoare triple {4217#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 1))))} havoc #t~mem4; {4217#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 1))))} is VALID [2018-11-23 12:24:00,593 INFO L273 TraceCheckUtils]: 60: Hoare triple {4217#(and (<= ~SIZE~0 (+ main_~i~0 2)) (or (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ ~SIZE~0 (- 2))) 4)))) (<= ~SIZE~0 (+ main_~i~0 1))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4218#(or (<= ~SIZE~0 main_~i~0) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))))} is VALID [2018-11-23 12:24:00,594 INFO L273 TraceCheckUtils]: 61: Hoare triple {4218#(or (<= ~SIZE~0 main_~i~0) (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4219#(<= (+ main_~low~0 1) |main_#t~mem4|)} is VALID [2018-11-23 12:24:00,595 INFO L256 TraceCheckUtils]: 62: Hoare triple {4219#(<= (+ main_~low~0 1) |main_#t~mem4|)} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {4214#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:24:00,595 INFO L273 TraceCheckUtils]: 63: Hoare triple {4214#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4220#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:24:00,596 INFO L273 TraceCheckUtils]: 64: Hoare triple {4220#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4203#false} is VALID [2018-11-23 12:24:00,596 INFO L273 TraceCheckUtils]: 65: Hoare triple {4203#false} assume !false; {4203#false} is VALID [2018-11-23 12:24:00,609 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 19 proven. 75 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:24:00,609 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:00,609 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:24:00,619 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:24:00,647 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:24:00,647 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:00,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:00,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:00,890 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 12:24:00,896 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 12:24:00,898 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:24:00,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:24:00,913 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 12:24:00,913 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:16 [2018-11-23 12:24:00,917 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:24:00,917 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_19|, main_~val2~0]. (and (<= 3 main_~val2~0) (<= main_~low~0 2) (= |#memory_int| (store |v_#memory_int_19| |main_~#a~0.base| (store (select |v_#memory_int_19| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16) main_~val2~0))) (= |main_~#a~0.offset| 0)) [2018-11-23 12:24:00,917 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0)) [2018-11-23 12:24:01,647 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 12:24:01,653 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 12:24:01,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:24:01,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:24:01,662 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 12:24:01,663 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-23 12:24:01,665 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:24:01,666 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#a~0.base|) 16))) (and (<= 3 .cse0) (<= main_~low~0 2) (<= .cse0 |main_#t~mem4|))) [2018-11-23 12:24:01,666 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= main_~low~0 2) (<= 3 |main_#t~mem4|)) [2018-11-23 12:24:01,755 INFO L256 TraceCheckUtils]: 0: Hoare triple {4202#true} call ULTIMATE.init(); {4202#true} is VALID [2018-11-23 12:24:01,756 INFO L273 TraceCheckUtils]: 1: Hoare triple {4202#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {4202#true} is VALID [2018-11-23 12:24:01,756 INFO L273 TraceCheckUtils]: 2: Hoare triple {4202#true} assume true; {4202#true} is VALID [2018-11-23 12:24:01,756 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4202#true} {4202#true} #63#return; {4202#true} is VALID [2018-11-23 12:24:01,756 INFO L256 TraceCheckUtils]: 4: Hoare triple {4202#true} call #t~ret5 := main(); {4202#true} is VALID [2018-11-23 12:24:01,756 INFO L273 TraceCheckUtils]: 5: Hoare triple {4202#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {4202#true} is VALID [2018-11-23 12:24:01,757 INFO L273 TraceCheckUtils]: 6: Hoare triple {4202#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 0;~low~0 := 2;~i~0 := 0; {4242#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,758 INFO L273 TraceCheckUtils]: 7: Hoare triple {4242#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0); {4242#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,759 INFO L273 TraceCheckUtils]: 8: Hoare triple {4242#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {4242#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,759 INFO L273 TraceCheckUtils]: 9: Hoare triple {4242#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4242#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,760 INFO L273 TraceCheckUtils]: 10: Hoare triple {4242#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4255#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,761 INFO L273 TraceCheckUtils]: 11: Hoare triple {4255#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0); {4255#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,762 INFO L273 TraceCheckUtils]: 12: Hoare triple {4255#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {4255#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,763 INFO L273 TraceCheckUtils]: 13: Hoare triple {4255#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4255#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,763 INFO L273 TraceCheckUtils]: 14: Hoare triple {4255#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4268#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,764 INFO L273 TraceCheckUtils]: 15: Hoare triple {4268#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0); {4268#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,784 INFO L273 TraceCheckUtils]: 16: Hoare triple {4268#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {4268#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,803 INFO L273 TraceCheckUtils]: 17: Hoare triple {4268#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4268#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,816 INFO L273 TraceCheckUtils]: 18: Hoare triple {4268#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4281#(and (= main_~i~0 3) (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,825 INFO L273 TraceCheckUtils]: 19: Hoare triple {4281#(and (= main_~i~0 3) (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0); {4281#(and (= main_~i~0 3) (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,840 INFO L273 TraceCheckUtils]: 20: Hoare triple {4281#(and (= main_~i~0 3) (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {4281#(and (= main_~i~0 3) (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,849 INFO L273 TraceCheckUtils]: 21: Hoare triple {4281#(and (= main_~i~0 3) (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4281#(and (= main_~i~0 3) (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,863 INFO L273 TraceCheckUtils]: 22: Hoare triple {4281#(and (= main_~i~0 3) (<= 3 main_~val2~0) (<= main_~low~0 2) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4294#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 4) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,872 INFO L273 TraceCheckUtils]: 23: Hoare triple {4294#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 4) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0); {4294#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 4) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,878 INFO L273 TraceCheckUtils]: 24: Hoare triple {4294#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 4) (= |main_~#a~0.offset| 0))} assume !(1 + ~i~0 < ~SIZE~0); {4294#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 4) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,879 INFO L273 TraceCheckUtils]: 25: Hoare triple {4294#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 4) (= |main_~#a~0.offset| 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4304#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,880 INFO L273 TraceCheckUtils]: 26: Hoare triple {4304#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4304#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,880 INFO L273 TraceCheckUtils]: 27: Hoare triple {4304#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} assume !(~i~0 < ~SIZE~0); {4304#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,882 INFO L273 TraceCheckUtils]: 28: Hoare triple {4304#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} ~i~0 := 0; {4314#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,883 INFO L273 TraceCheckUtils]: 29: Hoare triple {4314#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4314#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,884 INFO L256 TraceCheckUtils]: 30: Hoare triple {4314#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {4321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))} is VALID [2018-11-23 12:24:01,885 INFO L273 TraceCheckUtils]: 31: Hoare triple {4321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))} ~cond := #in~cond; {4325#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} is VALID [2018-11-23 12:24:01,885 INFO L273 TraceCheckUtils]: 32: Hoare triple {4325#(and (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16))) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))} assume !(0 == ~cond); {4329#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16))))} is VALID [2018-11-23 12:24:01,886 INFO L273 TraceCheckUtils]: 33: Hoare triple {4329#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16))))} assume true; {4329#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16))))} is VALID [2018-11-23 12:24:01,886 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {4329#(and (not (= |__VERIFIER_assert_#in~cond| 0)) (exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16))))} {4314#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #67#return; {4314#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,887 INFO L273 TraceCheckUtils]: 35: Hoare triple {4314#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} havoc #t~mem4; {4314#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,888 INFO L273 TraceCheckUtils]: 36: Hoare triple {4314#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0) (= |main_~#a~0.offset| 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4342#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,889 INFO L273 TraceCheckUtils]: 37: Hoare triple {4342#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4342#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,891 INFO L256 TraceCheckUtils]: 38: Hoare triple {4342#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {4321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))} is VALID [2018-11-23 12:24:01,891 INFO L273 TraceCheckUtils]: 39: Hoare triple {4321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))} ~cond := #in~cond; {4321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))} is VALID [2018-11-23 12:24:01,892 INFO L273 TraceCheckUtils]: 40: Hoare triple {4321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))} assume !(0 == ~cond); {4321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))} is VALID [2018-11-23 12:24:01,892 INFO L273 TraceCheckUtils]: 41: Hoare triple {4321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))} assume true; {4321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))} is VALID [2018-11-23 12:24:01,893 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {4321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))} {4342#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} #67#return; {4342#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,894 INFO L273 TraceCheckUtils]: 43: Hoare triple {4342#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} havoc #t~mem4; {4342#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,895 INFO L273 TraceCheckUtils]: 44: Hoare triple {4342#(and (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4367#(and (= main_~i~0 2) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,896 INFO L273 TraceCheckUtils]: 45: Hoare triple {4367#(and (= main_~i~0 2) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4367#(and (= main_~i~0 2) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,898 INFO L256 TraceCheckUtils]: 46: Hoare triple {4367#(and (= main_~i~0 2) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {4321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))} is VALID [2018-11-23 12:24:01,899 INFO L273 TraceCheckUtils]: 47: Hoare triple {4321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))} ~cond := #in~cond; {4321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))} is VALID [2018-11-23 12:24:01,899 INFO L273 TraceCheckUtils]: 48: Hoare triple {4321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))} assume !(0 == ~cond); {4321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))} is VALID [2018-11-23 12:24:01,900 INFO L273 TraceCheckUtils]: 49: Hoare triple {4321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))} assume true; {4321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))} is VALID [2018-11-23 12:24:01,901 INFO L268 TraceCheckUtils]: 50: Hoare quadruple {4321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))} {4367#(and (= main_~i~0 2) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} #67#return; {4367#(and (= main_~i~0 2) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,901 INFO L273 TraceCheckUtils]: 51: Hoare triple {4367#(and (= main_~i~0 2) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} havoc #t~mem4; {4367#(and (= main_~i~0 2) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,902 INFO L273 TraceCheckUtils]: 52: Hoare triple {4367#(and (= main_~i~0 2) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4392#(and (= main_~i~0 3) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,903 INFO L273 TraceCheckUtils]: 53: Hoare triple {4392#(and (= main_~i~0 3) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4392#(and (= main_~i~0 3) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,905 INFO L256 TraceCheckUtils]: 54: Hoare triple {4392#(and (= main_~i~0 3) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {4321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))} is VALID [2018-11-23 12:24:01,906 INFO L273 TraceCheckUtils]: 55: Hoare triple {4321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))} ~cond := #in~cond; {4321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))} is VALID [2018-11-23 12:24:01,906 INFO L273 TraceCheckUtils]: 56: Hoare triple {4321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))} assume !(0 == ~cond); {4321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))} is VALID [2018-11-23 12:24:01,907 INFO L273 TraceCheckUtils]: 57: Hoare triple {4321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))} assume true; {4321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))} is VALID [2018-11-23 12:24:01,908 INFO L268 TraceCheckUtils]: 58: Hoare quadruple {4321#(exists ((|v_main_~#a~0.base_BEFORE_CALL_13| Int)) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|) 16)))} {4392#(and (= main_~i~0 3) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} #67#return; {4392#(and (= main_~i~0 3) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,909 INFO L273 TraceCheckUtils]: 59: Hoare triple {4392#(and (= main_~i~0 3) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} havoc #t~mem4; {4392#(and (= main_~i~0 3) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,910 INFO L273 TraceCheckUtils]: 60: Hoare triple {4392#(and (= main_~i~0 3) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4417#(and (<= main_~low~0 2) (= main_~i~0 4) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} is VALID [2018-11-23 12:24:01,911 INFO L273 TraceCheckUtils]: 61: Hoare triple {4417#(and (<= main_~low~0 2) (= main_~i~0 4) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= |main_~#a~0.offset| 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4421#(and (<= main_~low~0 2) (<= 3 |main_#t~mem4|))} is VALID [2018-11-23 12:24:01,912 INFO L256 TraceCheckUtils]: 62: Hoare triple {4421#(and (<= main_~low~0 2) (<= 3 |main_#t~mem4|))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {4425#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:24:01,913 INFO L273 TraceCheckUtils]: 63: Hoare triple {4425#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {4429#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:24:01,913 INFO L273 TraceCheckUtils]: 64: Hoare triple {4429#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4203#false} is VALID [2018-11-23 12:24:01,914 INFO L273 TraceCheckUtils]: 65: Hoare triple {4203#false} assume !false; {4203#false} is VALID [2018-11-23 12:24:01,929 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 94 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:24:01,949 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:01,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2018-11-23 12:24:01,949 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 66 [2018-11-23 12:24:01,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:01,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 12:24:02,089 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:24:02,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 12:24:02,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 12:24:02,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=1142, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 12:24:02,091 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 36 states. [2018-11-23 12:24:21,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:21,845 INFO L93 Difference]: Finished difference Result 128 states and 132 transitions. [2018-11-23 12:24:21,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 12:24:21,845 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 66 [2018-11-23 12:24:21,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:24:21,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:24:21,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 93 transitions. [2018-11-23 12:24:21,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 12:24:21,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 93 transitions. [2018-11-23 12:24:21,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 93 transitions. [2018-11-23 12:24:21,990 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:24:21,992 INFO L225 Difference]: With dead ends: 128 [2018-11-23 12:24:21,992 INFO L226 Difference]: Without dead ends: 78 [2018-11-23 12:24:21,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 44 SyntacticMatches, 8 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 947 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=318, Invalid=2874, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 12:24:21,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-23 12:24:22,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 73. [2018-11-23 12:24:22,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:24:22,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 73 states. [2018-11-23 12:24:22,375 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 73 states. [2018-11-23 12:24:22,375 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 73 states. [2018-11-23 12:24:22,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:22,377 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-11-23 12:24:22,377 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-11-23 12:24:22,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:22,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:22,378 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 78 states. [2018-11-23 12:24:22,378 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 78 states. [2018-11-23 12:24:22,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:24:22,380 INFO L93 Difference]: Finished difference Result 78 states and 80 transitions. [2018-11-23 12:24:22,380 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2018-11-23 12:24:22,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:24:22,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:24:22,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:24:22,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:24:22,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 12:24:22,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 74 transitions. [2018-11-23 12:24:22,382 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 74 transitions. Word has length 66 [2018-11-23 12:24:22,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:24:22,382 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 74 transitions. [2018-11-23 12:24:22,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 12:24:22,383 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2018-11-23 12:24:22,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-23 12:24:22,383 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:24:22,384 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:24:22,384 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:24:22,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:24:22,384 INFO L82 PathProgramCache]: Analyzing trace with hash 974257971, now seen corresponding path program 9 times [2018-11-23 12:24:22,384 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:24:22,384 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:24:22,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:22,385 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:24:22,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:24:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:23,085 INFO L256 TraceCheckUtils]: 0: Hoare triple {4905#true} call ULTIMATE.init(); {4905#true} is VALID [2018-11-23 12:24:23,085 INFO L273 TraceCheckUtils]: 1: Hoare triple {4905#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {4905#true} is VALID [2018-11-23 12:24:23,085 INFO L273 TraceCheckUtils]: 2: Hoare triple {4905#true} assume true; {4905#true} is VALID [2018-11-23 12:24:23,086 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4905#true} {4905#true} #63#return; {4905#true} is VALID [2018-11-23 12:24:23,086 INFO L256 TraceCheckUtils]: 4: Hoare triple {4905#true} call #t~ret5 := main(); {4905#true} is VALID [2018-11-23 12:24:23,086 INFO L273 TraceCheckUtils]: 5: Hoare triple {4905#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {4905#true} is VALID [2018-11-23 12:24:23,087 INFO L273 TraceCheckUtils]: 6: Hoare triple {4905#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 0;~low~0 := 2;~i~0 := 0; {4907#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:24:23,088 INFO L273 TraceCheckUtils]: 7: Hoare triple {4907#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0); {4907#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:24:23,088 INFO L273 TraceCheckUtils]: 8: Hoare triple {4907#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {4907#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:24:23,089 INFO L273 TraceCheckUtils]: 9: Hoare triple {4907#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4907#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} is VALID [2018-11-23 12:24:23,090 INFO L273 TraceCheckUtils]: 10: Hoare triple {4907#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4908#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:24:23,091 INFO L273 TraceCheckUtils]: 11: Hoare triple {4908#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 1 main_~i~0) (<= main_~i~0 1))} assume !!(~i~0 < ~SIZE~0); {4908#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:24:23,092 INFO L273 TraceCheckUtils]: 12: Hoare triple {4908#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 1 main_~i~0) (<= main_~i~0 1))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {4908#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:24:23,092 INFO L273 TraceCheckUtils]: 13: Hoare triple {4908#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 1 main_~i~0) (<= main_~i~0 1))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4908#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 1 main_~i~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:24:23,094 INFO L273 TraceCheckUtils]: 14: Hoare triple {4908#(and (<= (+ main_~low~0 1) main_~val2~0) (<= 1 main_~i~0) (<= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4909#(and (<= 2 main_~i~0) (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} is VALID [2018-11-23 12:24:23,095 INFO L273 TraceCheckUtils]: 15: Hoare triple {4909#(and (<= 2 main_~i~0) (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} assume !!(~i~0 < ~SIZE~0); {4909#(and (<= 2 main_~i~0) (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} is VALID [2018-11-23 12:24:23,095 INFO L273 TraceCheckUtils]: 16: Hoare triple {4909#(and (<= 2 main_~i~0) (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {4909#(and (<= 2 main_~i~0) (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} is VALID [2018-11-23 12:24:23,096 INFO L273 TraceCheckUtils]: 17: Hoare triple {4909#(and (<= 2 main_~i~0) (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4909#(and (<= 2 main_~i~0) (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} is VALID [2018-11-23 12:24:23,097 INFO L273 TraceCheckUtils]: 18: Hoare triple {4909#(and (<= 2 main_~i~0) (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4910#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 12:24:23,098 INFO L273 TraceCheckUtils]: 19: Hoare triple {4910#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 3) (<= 3 main_~i~0))} assume !!(~i~0 < ~SIZE~0); {4910#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 12:24:23,099 INFO L273 TraceCheckUtils]: 20: Hoare triple {4910#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 3) (<= 3 main_~i~0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {4910#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 12:24:23,100 INFO L273 TraceCheckUtils]: 21: Hoare triple {4910#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 3) (<= 3 main_~i~0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4910#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 3) (<= 3 main_~i~0))} is VALID [2018-11-23 12:24:23,101 INFO L273 TraceCheckUtils]: 22: Hoare triple {4910#(and (<= (+ main_~low~0 1) main_~val2~0) (<= main_~i~0 3) (<= 3 main_~i~0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4911#(and (= (* 4 main_~i~0) 16) (<= (+ main_~low~0 1) main_~val2~0))} is VALID [2018-11-23 12:24:23,101 INFO L273 TraceCheckUtils]: 23: Hoare triple {4911#(and (= (* 4 main_~i~0) 16) (<= (+ main_~low~0 1) main_~val2~0))} assume !!(~i~0 < ~SIZE~0); {4911#(and (= (* 4 main_~i~0) 16) (<= (+ main_~low~0 1) main_~val2~0))} is VALID [2018-11-23 12:24:23,102 INFO L273 TraceCheckUtils]: 24: Hoare triple {4911#(and (= (* 4 main_~i~0) 16) (<= (+ main_~low~0 1) main_~val2~0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {4911#(and (= (* 4 main_~i~0) 16) (<= (+ main_~low~0 1) main_~val2~0))} is VALID [2018-11-23 12:24:23,103 INFO L273 TraceCheckUtils]: 25: Hoare triple {4911#(and (= (* 4 main_~i~0) 16) (<= (+ main_~low~0 1) main_~val2~0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4912#(and (= (* 4 main_~i~0) 16) (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))))} is VALID [2018-11-23 12:24:23,104 INFO L273 TraceCheckUtils]: 26: Hoare triple {4912#(and (= (* 4 main_~i~0) 16) (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4913#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 3) 4)))))} is VALID [2018-11-23 12:24:23,105 INFO L273 TraceCheckUtils]: 27: Hoare triple {4913#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 3) 4)))))} assume !!(~i~0 < ~SIZE~0); {4913#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 3) 4)))))} is VALID [2018-11-23 12:24:23,106 INFO L273 TraceCheckUtils]: 28: Hoare triple {4913#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 3) 4)))))} assume !(1 + ~i~0 < ~SIZE~0); {4913#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 3) 4)))))} is VALID [2018-11-23 12:24:23,107 INFO L273 TraceCheckUtils]: 29: Hoare triple {4913#(and (<= (+ main_~low~0 1) main_~val2~0) (= main_~val2~0 (select (store (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0)) main_~val2~0) (+ |main_~#a~0.offset| (+ (* 4 3) 4)))))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4914#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) 4))))} is VALID [2018-11-23 12:24:23,108 INFO L273 TraceCheckUtils]: 30: Hoare triple {4914#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) 4))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4914#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) 4))))} is VALID [2018-11-23 12:24:23,108 INFO L273 TraceCheckUtils]: 31: Hoare triple {4914#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) 4))))} assume !(~i~0 < ~SIZE~0); {4914#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) 4))))} is VALID [2018-11-23 12:24:23,109 INFO L273 TraceCheckUtils]: 32: Hoare triple {4914#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) 4))))} ~i~0 := 0; {4915#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) 4)))) (= main_~i~0 0))} is VALID [2018-11-23 12:24:23,110 INFO L273 TraceCheckUtils]: 33: Hoare triple {4915#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) 4)))) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4915#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) 4)))) (= main_~i~0 0))} is VALID [2018-11-23 12:24:23,110 INFO L256 TraceCheckUtils]: 34: Hoare triple {4915#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) 4)))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {4905#true} is VALID [2018-11-23 12:24:23,111 INFO L273 TraceCheckUtils]: 35: Hoare triple {4905#true} ~cond := #in~cond; {4916#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 12:24:23,111 INFO L273 TraceCheckUtils]: 36: Hoare triple {4916#(= __VERIFIER_assert_~cond |__VERIFIER_assert_#in~cond|)} assume !(0 == ~cond); {4917#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:24:23,112 INFO L273 TraceCheckUtils]: 37: Hoare triple {4917#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4917#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:24:23,113 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {4917#(not (= |__VERIFIER_assert_#in~cond| 0))} {4915#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) 4)))) (= main_~i~0 0))} #67#return; {4915#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) 4)))) (= main_~i~0 0))} is VALID [2018-11-23 12:24:23,114 INFO L273 TraceCheckUtils]: 39: Hoare triple {4915#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) 4)))) (= main_~i~0 0))} havoc #t~mem4; {4915#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) 4)))) (= main_~i~0 0))} is VALID [2018-11-23 12:24:23,115 INFO L273 TraceCheckUtils]: 40: Hoare triple {4915#(and (<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 3) 4)))) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4918#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) 4))))} is VALID [2018-11-23 12:24:23,116 INFO L273 TraceCheckUtils]: 41: Hoare triple {4918#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) 4))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4918#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) 4))))} is VALID [2018-11-23 12:24:23,116 INFO L256 TraceCheckUtils]: 42: Hoare triple {4918#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) 4))))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {4905#true} is VALID [2018-11-23 12:24:23,116 INFO L273 TraceCheckUtils]: 43: Hoare triple {4905#true} ~cond := #in~cond; {4905#true} is VALID [2018-11-23 12:24:23,116 INFO L273 TraceCheckUtils]: 44: Hoare triple {4905#true} assume !(0 == ~cond); {4905#true} is VALID [2018-11-23 12:24:23,117 INFO L273 TraceCheckUtils]: 45: Hoare triple {4905#true} assume true; {4905#true} is VALID [2018-11-23 12:24:23,118 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {4905#true} {4918#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) 4))))} #67#return; {4918#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) 4))))} is VALID [2018-11-23 12:24:23,118 INFO L273 TraceCheckUtils]: 47: Hoare triple {4918#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) 4))))} havoc #t~mem4; {4918#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) 4))))} is VALID [2018-11-23 12:24:23,120 INFO L273 TraceCheckUtils]: 48: Hoare triple {4918#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 2)) 4))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4919#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4))))} is VALID [2018-11-23 12:24:23,120 INFO L273 TraceCheckUtils]: 49: Hoare triple {4919#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4919#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4))))} is VALID [2018-11-23 12:24:23,120 INFO L256 TraceCheckUtils]: 50: Hoare triple {4919#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4))))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {4905#true} is VALID [2018-11-23 12:24:23,121 INFO L273 TraceCheckUtils]: 51: Hoare triple {4905#true} ~cond := #in~cond; {4905#true} is VALID [2018-11-23 12:24:23,121 INFO L273 TraceCheckUtils]: 52: Hoare triple {4905#true} assume !(0 == ~cond); {4905#true} is VALID [2018-11-23 12:24:23,121 INFO L273 TraceCheckUtils]: 53: Hoare triple {4905#true} assume true; {4905#true} is VALID [2018-11-23 12:24:23,122 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {4905#true} {4919#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4))))} #67#return; {4919#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4))))} is VALID [2018-11-23 12:24:23,123 INFO L273 TraceCheckUtils]: 55: Hoare triple {4919#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4))))} havoc #t~mem4; {4919#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4))))} is VALID [2018-11-23 12:24:23,123 INFO L273 TraceCheckUtils]: 56: Hoare triple {4919#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 (+ main_~i~0 1)) 4))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4920#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-23 12:24:23,124 INFO L273 TraceCheckUtils]: 57: Hoare triple {4920#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4920#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-23 12:24:23,124 INFO L256 TraceCheckUtils]: 58: Hoare triple {4920#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {4905#true} is VALID [2018-11-23 12:24:23,124 INFO L273 TraceCheckUtils]: 59: Hoare triple {4905#true} ~cond := #in~cond; {4905#true} is VALID [2018-11-23 12:24:23,124 INFO L273 TraceCheckUtils]: 60: Hoare triple {4905#true} assume !(0 == ~cond); {4905#true} is VALID [2018-11-23 12:24:23,124 INFO L273 TraceCheckUtils]: 61: Hoare triple {4905#true} assume true; {4905#true} is VALID [2018-11-23 12:24:23,125 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {4905#true} {4920#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} #67#return; {4920#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-23 12:24:23,125 INFO L273 TraceCheckUtils]: 63: Hoare triple {4920#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} havoc #t~mem4; {4920#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-23 12:24:23,126 INFO L273 TraceCheckUtils]: 64: Hoare triple {4920#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (+ (* 4 main_~i~0) 4))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4921#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))} is VALID [2018-11-23 12:24:23,127 INFO L273 TraceCheckUtils]: 65: Hoare triple {4921#(<= (+ main_~low~0 1) (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| (* 4 main_~i~0))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4922#(<= (+ main_~low~0 1) |main_#t~mem4|)} is VALID [2018-11-23 12:24:23,129 INFO L256 TraceCheckUtils]: 66: Hoare triple {4922#(<= (+ main_~low~0 1) |main_#t~mem4|)} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {4917#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:24:23,129 INFO L273 TraceCheckUtils]: 67: Hoare triple {4917#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {4923#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:24:23,130 INFO L273 TraceCheckUtils]: 68: Hoare triple {4923#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {4906#false} is VALID [2018-11-23 12:24:23,130 INFO L273 TraceCheckUtils]: 69: Hoare triple {4906#false} assume !false; {4906#false} is VALID [2018-11-23 12:24:23,143 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 7 proven. 108 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-23 12:24:23,143 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:24:23,143 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:24:23,154 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:24:23,206 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2018-11-23 12:24:23,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:24:23,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:24:23,224 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:24:23,782 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 15 treesize of output 12 [2018-11-23 12:24:23,795 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-23 12:24:23,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:24:23,806 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:24:23,821 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:24:23,821 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-23 12:24:23,934 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 31 treesize of output 24 [2018-11-23 12:24:23,942 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:24:23,946 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 37 [2018-11-23 12:24:23,950 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:24:23,960 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:24:23,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:24:23,972 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-11-23 12:24:23,977 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:24:23,977 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_21|, main_~i~0]. (let ((.cse1 (select |v_#memory_int_21| |main_~#a~0.base|))) (let ((.cse0 (select .cse1 (+ |main_~#a~0.offset| 16)))) (and (<= 3 .cse0) (<= main_~low~0 2) (<= 5 main_~i~0) (= |#memory_int| (store |v_#memory_int_21| |main_~#a~0.base| (store .cse1 (+ (* 4 main_~i~0) |main_~#a~0.offset|) .cse0)))))) [2018-11-23 12:24:23,977 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~i~0]. (let ((.cse1 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse0 (select .cse1 (+ |main_~#a~0.offset| 16)))) (and (<= main_~low~0 2) (<= 5 main_~i~0) (= .cse0 (select .cse1 (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (<= 3 .cse0)))) [2018-11-23 12:24:30,120 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 39 [2018-11-23 12:24:32,314 WARN L180 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 39 [2018-11-23 12:24:32,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 56 [2018-11-23 12:24:32,368 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:24:32,371 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2018-11-23 12:24:32,373 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:24:32,406 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:24:32,408 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 24 [2018-11-23 12:24:32,414 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:24:32,444 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:24:32,451 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:24:32,492 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 48 treesize of output 92 [2018-11-23 12:24:32,593 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 16 xjuncts. [2018-11-23 12:24:32,650 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:24:32,659 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:24:32,660 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:71, output treesize:7 [2018-11-23 12:24:32,664 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:24:32,664 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |v_main_~#a~0.base_BEFORE_CALL_17|, v_prenex_19, |v_main_~#a~0.offset_BEFORE_CALL_17|, v_prenex_15, |main_~#a~0.base|, |main_~#a~0.offset|]. (let ((.cse3 (select |#memory_int| |main_~#a~0.base|)) (.cse1 (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|))) (let ((.cse0 (select .cse1 (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16))) (.cse2 (select .cse3 (+ |main_~#a~0.offset| 16)))) (and (<= 5 v_prenex_15) (= .cse0 (select .cse1 (+ (* 4 v_prenex_19) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (= .cse2 (select .cse3 (+ (* 4 v_prenex_15) |main_~#a~0.offset|))) (<= 5 v_prenex_19) (<= main_~low~0 2) (<= .cse2 |main_#t~mem4|) (<= 3 .cse0) (<= 3 .cse2)))) [2018-11-23 12:24:32,664 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= main_~low~0 2) (<= 3 |main_#t~mem4|)) [2018-11-23 12:24:32,761 INFO L256 TraceCheckUtils]: 0: Hoare triple {4905#true} call ULTIMATE.init(); {4905#true} is VALID [2018-11-23 12:24:32,762 INFO L273 TraceCheckUtils]: 1: Hoare triple {4905#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~SIZE~0 := 0; {4905#true} is VALID [2018-11-23 12:24:32,762 INFO L273 TraceCheckUtils]: 2: Hoare triple {4905#true} assume true; {4905#true} is VALID [2018-11-23 12:24:32,762 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4905#true} {4905#true} #63#return; {4905#true} is VALID [2018-11-23 12:24:32,762 INFO L256 TraceCheckUtils]: 4: Hoare triple {4905#true} call #t~ret5 := main(); {4905#true} is VALID [2018-11-23 12:24:32,762 INFO L273 TraceCheckUtils]: 5: Hoare triple {4905#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~SIZE~0 := #t~nondet1;havoc #t~nondet1; {4905#true} is VALID [2018-11-23 12:24:32,763 INFO L273 TraceCheckUtils]: 6: Hoare triple {4905#true} assume ~SIZE~0 > 1;havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(4 * ~SIZE~0);~val2~0 := 3;~val1~0 := 0;~low~0 := 2;~i~0 := 0; {4945#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0))} is VALID [2018-11-23 12:24:32,764 INFO L273 TraceCheckUtils]: 7: Hoare triple {4945#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0); {4945#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0))} is VALID [2018-11-23 12:24:32,764 INFO L273 TraceCheckUtils]: 8: Hoare triple {4945#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {4945#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0))} is VALID [2018-11-23 12:24:32,765 INFO L273 TraceCheckUtils]: 9: Hoare triple {4945#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4945#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0))} is VALID [2018-11-23 12:24:32,765 INFO L273 TraceCheckUtils]: 10: Hoare triple {4945#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4958#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1))} is VALID [2018-11-23 12:24:32,766 INFO L273 TraceCheckUtils]: 11: Hoare triple {4958#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1))} assume !!(~i~0 < ~SIZE~0); {4958#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1))} is VALID [2018-11-23 12:24:32,767 INFO L273 TraceCheckUtils]: 12: Hoare triple {4958#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {4958#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1))} is VALID [2018-11-23 12:24:32,767 INFO L273 TraceCheckUtils]: 13: Hoare triple {4958#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4958#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1))} is VALID [2018-11-23 12:24:32,768 INFO L273 TraceCheckUtils]: 14: Hoare triple {4958#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4971#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2))} is VALID [2018-11-23 12:24:32,769 INFO L273 TraceCheckUtils]: 15: Hoare triple {4971#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2))} assume !!(~i~0 < ~SIZE~0); {4971#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2))} is VALID [2018-11-23 12:24:32,770 INFO L273 TraceCheckUtils]: 16: Hoare triple {4971#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {4971#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2))} is VALID [2018-11-23 12:24:32,770 INFO L273 TraceCheckUtils]: 17: Hoare triple {4971#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4971#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2))} is VALID [2018-11-23 12:24:32,771 INFO L273 TraceCheckUtils]: 18: Hoare triple {4971#(and (<= 3 main_~val2~0) (= main_~i~0 2) (<= main_~low~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4984#(and (= main_~i~0 3) (<= 3 main_~val2~0) (<= main_~low~0 2))} is VALID [2018-11-23 12:24:32,772 INFO L273 TraceCheckUtils]: 19: Hoare triple {4984#(and (= main_~i~0 3) (<= 3 main_~val2~0) (<= main_~low~0 2))} assume !!(~i~0 < ~SIZE~0); {4984#(and (= main_~i~0 3) (<= 3 main_~val2~0) (<= main_~low~0 2))} is VALID [2018-11-23 12:24:32,772 INFO L273 TraceCheckUtils]: 20: Hoare triple {4984#(and (= main_~i~0 3) (<= 3 main_~val2~0) (<= main_~low~0 2))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {4984#(and (= main_~i~0 3) (<= 3 main_~val2~0) (<= main_~low~0 2))} is VALID [2018-11-23 12:24:32,773 INFO L273 TraceCheckUtils]: 21: Hoare triple {4984#(and (= main_~i~0 3) (<= 3 main_~val2~0) (<= main_~low~0 2))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {4984#(and (= main_~i~0 3) (<= 3 main_~val2~0) (<= main_~low~0 2))} is VALID [2018-11-23 12:24:32,774 INFO L273 TraceCheckUtils]: 22: Hoare triple {4984#(and (= main_~i~0 3) (<= 3 main_~val2~0) (<= main_~low~0 2))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4997#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 4))} is VALID [2018-11-23 12:24:32,775 INFO L273 TraceCheckUtils]: 23: Hoare triple {4997#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 4))} assume !!(~i~0 < ~SIZE~0); {4997#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 4))} is VALID [2018-11-23 12:24:32,775 INFO L273 TraceCheckUtils]: 24: Hoare triple {4997#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 4))} assume 1 + ~i~0 < ~SIZE~0;call write~int(~val1~0, ~#a~0.base, ~#a~0.offset + 4 * (1 + ~i~0), 4); {4997#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 4))} is VALID [2018-11-23 12:24:32,776 INFO L273 TraceCheckUtils]: 25: Hoare triple {4997#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~i~0 4))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5007#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= main_~i~0 4))} is VALID [2018-11-23 12:24:32,777 INFO L273 TraceCheckUtils]: 26: Hoare triple {5007#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))) (= main_~i~0 4))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5011#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= 5 main_~i~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-23 12:24:32,778 INFO L273 TraceCheckUtils]: 27: Hoare triple {5011#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= 5 main_~i~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} assume !!(~i~0 < ~SIZE~0); {5011#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= 5 main_~i~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-23 12:24:32,779 INFO L273 TraceCheckUtils]: 28: Hoare triple {5011#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= 5 main_~i~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} assume !(1 + ~i~0 < ~SIZE~0); {5011#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= 5 main_~i~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-23 12:24:32,782 INFO L273 TraceCheckUtils]: 29: Hoare triple {5011#(and (<= 3 main_~val2~0) (<= main_~low~0 2) (<= 5 main_~i~0) (= main_~val2~0 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} call write~int(~val2~0, ~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5021#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (exists ((main_~i~0 Int)) (and (<= 5 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))))} is VALID [2018-11-23 12:24:32,783 INFO L273 TraceCheckUtils]: 30: Hoare triple {5021#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (exists ((main_~i~0 Int)) (and (<= 5 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5021#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (exists ((main_~i~0 Int)) (and (<= 5 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))))} is VALID [2018-11-23 12:24:32,784 INFO L273 TraceCheckUtils]: 31: Hoare triple {5021#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (exists ((main_~i~0 Int)) (and (<= 5 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))))} assume !(~i~0 < ~SIZE~0); {5021#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (exists ((main_~i~0 Int)) (and (<= 5 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))))} is VALID [2018-11-23 12:24:32,785 INFO L273 TraceCheckUtils]: 32: Hoare triple {5021#(and (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (exists ((main_~i~0 Int)) (and (<= 5 main_~i~0) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 main_~i~0) |main_~#a~0.offset|))))))} ~i~0 := 0; {5031#(and (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} is VALID [2018-11-23 12:24:32,786 INFO L273 TraceCheckUtils]: 33: Hoare triple {5031#(and (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5031#(and (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} is VALID [2018-11-23 12:24:32,787 INFO L256 TraceCheckUtils]: 34: Hoare triple {5031#(and (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} is VALID [2018-11-23 12:24:32,788 INFO L273 TraceCheckUtils]: 35: Hoare triple {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} ~cond := #in~cond; {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} is VALID [2018-11-23 12:24:32,789 INFO L273 TraceCheckUtils]: 36: Hoare triple {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} assume !(0 == ~cond); {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} is VALID [2018-11-23 12:24:32,789 INFO L273 TraceCheckUtils]: 37: Hoare triple {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} assume true; {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} is VALID [2018-11-23 12:24:32,790 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} {5031#(and (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} #67#return; {5031#(and (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} is VALID [2018-11-23 12:24:32,791 INFO L273 TraceCheckUtils]: 39: Hoare triple {5031#(and (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} havoc #t~mem4; {5031#(and (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} is VALID [2018-11-23 12:24:32,792 INFO L273 TraceCheckUtils]: 40: Hoare triple {5031#(and (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5057#(and (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-23 12:24:32,793 INFO L273 TraceCheckUtils]: 41: Hoare triple {5057#(and (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5057#(and (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-23 12:24:32,795 INFO L256 TraceCheckUtils]: 42: Hoare triple {5057#(and (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} is VALID [2018-11-23 12:24:32,796 INFO L273 TraceCheckUtils]: 43: Hoare triple {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} ~cond := #in~cond; {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} is VALID [2018-11-23 12:24:32,796 INFO L273 TraceCheckUtils]: 44: Hoare triple {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} assume !(0 == ~cond); {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} is VALID [2018-11-23 12:24:32,797 INFO L273 TraceCheckUtils]: 45: Hoare triple {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} assume true; {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} is VALID [2018-11-23 12:24:32,798 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} {5057#(and (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} #67#return; {5057#(and (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-23 12:24:32,799 INFO L273 TraceCheckUtils]: 47: Hoare triple {5057#(and (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} havoc #t~mem4; {5057#(and (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-23 12:24:32,800 INFO L273 TraceCheckUtils]: 48: Hoare triple {5057#(and (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (= main_~i~0 1) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5082#(and (= main_~i~0 2) (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-23 12:24:32,801 INFO L273 TraceCheckUtils]: 49: Hoare triple {5082#(and (= main_~i~0 2) (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5082#(and (= main_~i~0 2) (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-23 12:24:32,803 INFO L256 TraceCheckUtils]: 50: Hoare triple {5082#(and (= main_~i~0 2) (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} is VALID [2018-11-23 12:24:32,803 INFO L273 TraceCheckUtils]: 51: Hoare triple {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} ~cond := #in~cond; {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} is VALID [2018-11-23 12:24:32,804 INFO L273 TraceCheckUtils]: 52: Hoare triple {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} assume !(0 == ~cond); {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} is VALID [2018-11-23 12:24:32,805 INFO L273 TraceCheckUtils]: 53: Hoare triple {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} assume true; {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} is VALID [2018-11-23 12:24:32,805 INFO L268 TraceCheckUtils]: 54: Hoare quadruple {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} {5082#(and (= main_~i~0 2) (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} #67#return; {5082#(and (= main_~i~0 2) (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-23 12:24:32,806 INFO L273 TraceCheckUtils]: 55: Hoare triple {5082#(and (= main_~i~0 2) (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} havoc #t~mem4; {5082#(and (= main_~i~0 2) (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-23 12:24:32,808 INFO L273 TraceCheckUtils]: 56: Hoare triple {5082#(and (= main_~i~0 2) (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5107#(and (= main_~i~0 3) (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-23 12:24:32,809 INFO L273 TraceCheckUtils]: 57: Hoare triple {5107#(and (= main_~i~0 3) (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5107#(and (= main_~i~0 3) (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} is VALID [2018-11-23 12:24:32,810 INFO L256 TraceCheckUtils]: 58: Hoare triple {5107#(and (= main_~i~0 3) (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} is VALID [2018-11-23 12:24:32,811 INFO L273 TraceCheckUtils]: 59: Hoare triple {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} ~cond := #in~cond; {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} is VALID [2018-11-23 12:24:32,812 INFO L273 TraceCheckUtils]: 60: Hoare triple {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} assume !(0 == ~cond); {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} is VALID [2018-11-23 12:24:32,812 INFO L273 TraceCheckUtils]: 61: Hoare triple {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} assume true; {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} is VALID [2018-11-23 12:24:32,815 INFO L268 TraceCheckUtils]: 62: Hoare quadruple {5038#(exists ((v_prenex_15 Int) (|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_15) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)))))} {5107#(and (= main_~i~0 3) (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))))} #67#return; {5126#(and (= main_~i~0 3) (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int) (v_prenex_19 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_19) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 5 v_prenex_19) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16))))))} is VALID [2018-11-23 12:24:32,816 INFO L273 TraceCheckUtils]: 63: Hoare triple {5126#(and (= main_~i~0 3) (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int) (v_prenex_19 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_19) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 5 v_prenex_19) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16))))))} havoc #t~mem4; {5126#(and (= main_~i~0 3) (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int) (v_prenex_19 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_19) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 5 v_prenex_19) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16))))))} is VALID [2018-11-23 12:24:32,817 INFO L273 TraceCheckUtils]: 64: Hoare triple {5126#(and (= main_~i~0 3) (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int) (v_prenex_19 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_19) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 5 v_prenex_19) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16))))))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5133#(and (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (= main_~i~0 4) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int) (v_prenex_19 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_19) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 5 v_prenex_19) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16))))))} is VALID [2018-11-23 12:24:32,819 INFO L273 TraceCheckUtils]: 65: Hoare triple {5133#(and (exists ((v_prenex_15 Int)) (and (<= 5 v_prenex_15) (= (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16)) (select (select |#memory_int| |main_~#a~0.base|) (+ (* 4 v_prenex_15) |main_~#a~0.offset|))))) (<= main_~low~0 2) (= main_~i~0 4) (<= 3 (select (select |#memory_int| |main_~#a~0.base|) (+ |main_~#a~0.offset| 16))) (exists ((|v_main_~#a~0.offset_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int) (v_prenex_19 Int)) (and (= (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16)) (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ (* 4 v_prenex_19) |v_main_~#a~0.offset_BEFORE_CALL_17|))) (<= 5 v_prenex_19) (<= 3 (select (select |#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|) (+ |v_main_~#a~0.offset_BEFORE_CALL_17| 16))))))} assume !!(~i~0 < ~SIZE~0);call #t~mem4 := read~int(~#a~0.base, ~#a~0.offset + 4 * ~i~0, 4); {5137#(and (<= main_~low~0 2) (<= 3 |main_#t~mem4|))} is VALID [2018-11-23 12:24:32,820 INFO L256 TraceCheckUtils]: 66: Hoare triple {5137#(and (<= main_~low~0 2) (<= 3 |main_#t~mem4|))} call __VERIFIER_assert((if #t~mem4 >= ~low~0 then 1 else 0)); {5141#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:24:32,821 INFO L273 TraceCheckUtils]: 67: Hoare triple {5141#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {5145#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:24:32,821 INFO L273 TraceCheckUtils]: 68: Hoare triple {5145#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4906#false} is VALID [2018-11-23 12:24:32,821 INFO L273 TraceCheckUtils]: 69: Hoare triple {4906#false} assume !false; {4906#false} is VALID [2018-11-23 12:24:32,843 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 106 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2018-11-23 12:24:32,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:24:32,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20] total 37 [2018-11-23 12:24:32,863 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 70 [2018-11-23 12:24:32,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:24:32,864 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 12:24:43,055 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 113 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2018-11-23 12:24:43,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 12:24:43,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 12:24:43,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1210, Unknown=1, NotChecked=0, Total=1332 [2018-11-23 12:24:43,056 INFO L87 Difference]: Start difference. First operand 73 states and 74 transitions. Second operand 37 states.