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/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/array-tiling/mbpr5_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:51:55,096 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:51:55,098 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:51:55,116 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:51:55,116 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:51:55,118 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:51:55,120 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:51:55,122 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:51:55,125 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:51:55,126 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:51:55,129 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:51:55,130 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:51:55,131 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:51:55,133 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:51:55,134 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:51:55,142 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:51:55,143 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:51:55,148 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:51:55,151 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:51:55,153 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:51:55,154 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:51:55,157 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:51:55,161 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:51:55,162 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:51:55,163 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:51:55,164 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:51:55,165 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:51:55,165 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:51:55,166 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:51:55,167 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:51:55,167 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:51:55,168 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:51:55,168 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:51:55,168 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:51:55,169 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:51:55,170 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:51:55,170 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 18:51:55,186 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:51:55,187 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:51:55,187 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:51:55,188 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:51:55,188 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:51:55,188 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:51:55,189 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:51:55,189 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:51:55,189 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:51:55,189 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 18:51:55,189 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:51:55,190 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:51:55,190 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:51:55,190 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:51:55,190 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:51:55,190 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:51:55,191 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:51:55,191 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:51:55,191 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:51:55,191 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:51:55,191 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:51:55,191 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:51:55,192 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:51:55,192 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:51:55,192 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:51:55,192 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:51:55,192 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:51:55,193 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 18:51:55,193 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:51:55,193 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 18:51:55,193 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:51:55,241 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:51:55,253 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:51:55,257 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:51:55,259 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:51:55,259 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:51:55,260 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/mbpr5_true-unreach-call.i [2018-11-14 18:51:55,316 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6981eebc7/46c12c0450df490fa01d13a8c92b75b2/FLAGc1249b078 [2018-11-14 18:51:55,769 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:51:55,770 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/mbpr5_true-unreach-call.i [2018-11-14 18:51:55,778 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6981eebc7/46c12c0450df490fa01d13a8c92b75b2/FLAGc1249b078 [2018-11-14 18:51:55,793 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6981eebc7/46c12c0450df490fa01d13a8c92b75b2 [2018-11-14 18:51:55,802 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:51:55,804 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:51:55,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:51:55,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:51:55,809 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:51:55,810 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:51:55" (1/1) ... [2018-11-14 18:51:55,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7aead24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:55, skipping insertion in model container [2018-11-14 18:51:55,814 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:51:55" (1/1) ... [2018-11-14 18:51:55,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:51:55,854 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:51:56,189 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:51:56,199 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:51:56,283 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:51:56,304 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:51:56,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:56 WrapperNode [2018-11-14 18:51:56,305 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:51:56,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:51:56,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:51:56,306 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:51:56,318 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:56" (1/1) ... [2018-11-14 18:51:56,318 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:56" (1/1) ... [2018-11-14 18:51:56,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:56" (1/1) ... [2018-11-14 18:51:56,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:56" (1/1) ... [2018-11-14 18:51:56,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:56" (1/1) ... [2018-11-14 18:51:56,469 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:56" (1/1) ... [2018-11-14 18:51:56,471 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:56" (1/1) ... [2018-11-14 18:51:56,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:51:56,475 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:51:56,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:51:56,476 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:51:56,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:51:56,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:51:56,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:51:56,529 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:51:56,529 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:51:56,529 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:51:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 18:51:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:51:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:51:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:51:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:51:56,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:51:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 18:51:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 18:51:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:51:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:51:56,531 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 18:51:57,765 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:51:57,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:51:57 BoogieIcfgContainer [2018-11-14 18:51:57,766 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:51:57,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:51:57,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:51:57,770 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:51:57,771 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:51:55" (1/3) ... [2018-11-14 18:51:57,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc204d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:51:57, skipping insertion in model container [2018-11-14 18:51:57,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:51:56" (2/3) ... [2018-11-14 18:51:57,772 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc204d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:51:57, skipping insertion in model container [2018-11-14 18:51:57,772 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:51:57" (3/3) ... [2018-11-14 18:51:57,774 INFO L112 eAbstractionObserver]: Analyzing ICFG mbpr5_true-unreach-call.i [2018-11-14 18:51:57,783 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:51:57,790 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:51:57,805 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:51:57,838 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:51:57,839 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:51:57,839 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:51:57,839 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:51:57,839 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:51:57,840 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:51:57,840 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:51:57,840 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:51:57,840 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:51:57,861 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-11-14 18:51:57,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 18:51:57,868 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:51:57,869 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:51:57,872 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:51:57,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:51:57,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1029062908, now seen corresponding path program 1 times [2018-11-14 18:51:57,881 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:51:57,881 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:51:57,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:57,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:51:57,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:58,079 INFO L256 TraceCheckUtils]: 0: Hoare triple {59#true} call ULTIMATE.init(); {59#true} is VALID [2018-11-14 18:51:58,083 INFO L273 TraceCheckUtils]: 1: Hoare triple {59#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {59#true} is VALID [2018-11-14 18:51:58,084 INFO L273 TraceCheckUtils]: 2: Hoare triple {59#true} assume true; {59#true} is VALID [2018-11-14 18:51:58,084 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {59#true} {59#true} #163#return; {59#true} is VALID [2018-11-14 18:51:58,085 INFO L256 TraceCheckUtils]: 4: Hoare triple {59#true} call #t~ret31 := main(); {59#true} is VALID [2018-11-14 18:51:58,085 INFO L273 TraceCheckUtils]: 5: Hoare triple {59#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {59#true} is VALID [2018-11-14 18:51:58,085 INFO L273 TraceCheckUtils]: 6: Hoare triple {59#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL5~0 := 8;~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {59#true} is VALID [2018-11-14 18:51:58,085 INFO L273 TraceCheckUtils]: 7: Hoare triple {59#true} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) == 0 then 1 else 0) != 0;~i~0 := 1; {59#true} is VALID [2018-11-14 18:51:58,087 INFO L273 TraceCheckUtils]: 8: Hoare triple {59#true} assume !true; {60#false} is VALID [2018-11-14 18:51:58,087 INFO L273 TraceCheckUtils]: 9: Hoare triple {60#false} ~i~0 := 1; {60#false} is VALID [2018-11-14 18:51:58,087 INFO L273 TraceCheckUtils]: 10: Hoare triple {60#false} assume !true; {60#false} is VALID [2018-11-14 18:51:58,088 INFO L273 TraceCheckUtils]: 11: Hoare triple {60#false} ~i~0 := 1; {60#false} is VALID [2018-11-14 18:51:58,088 INFO L273 TraceCheckUtils]: 12: Hoare triple {60#false} assume !true; {60#false} is VALID [2018-11-14 18:51:58,088 INFO L273 TraceCheckUtils]: 13: Hoare triple {60#false} ~i~0 := 1; {60#false} is VALID [2018-11-14 18:51:58,089 INFO L273 TraceCheckUtils]: 14: Hoare triple {60#false} assume !true; {60#false} is VALID [2018-11-14 18:51:58,089 INFO L273 TraceCheckUtils]: 15: Hoare triple {60#false} ~i~0 := 1; {60#false} is VALID [2018-11-14 18:51:58,089 INFO L273 TraceCheckUtils]: 16: Hoare triple {60#false} assume !true; {60#false} is VALID [2018-11-14 18:51:58,090 INFO L273 TraceCheckUtils]: 17: Hoare triple {60#false} ~i~0 := 0; {60#false} is VALID [2018-11-14 18:51:58,090 INFO L273 TraceCheckUtils]: 18: Hoare triple {60#false} assume true; {60#false} is VALID [2018-11-14 18:51:58,091 INFO L273 TraceCheckUtils]: 19: Hoare triple {60#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {60#false} is VALID [2018-11-14 18:51:58,091 INFO L273 TraceCheckUtils]: 20: Hoare triple {60#false} assume #t~short30; {60#false} is VALID [2018-11-14 18:51:58,091 INFO L256 TraceCheckUtils]: 21: Hoare triple {60#false} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {60#false} is VALID [2018-11-14 18:51:58,092 INFO L273 TraceCheckUtils]: 22: Hoare triple {60#false} ~cond := #in~cond; {60#false} is VALID [2018-11-14 18:51:58,092 INFO L273 TraceCheckUtils]: 23: Hoare triple {60#false} assume ~cond == 0; {60#false} is VALID [2018-11-14 18:51:58,092 INFO L273 TraceCheckUtils]: 24: Hoare triple {60#false} assume !false; {60#false} is VALID [2018-11-14 18:51:58,097 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-14 18:51:58,100 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:51:58,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:51:58,106 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-14 18:51:58,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:51:58,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:51:58,291 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:58,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:51:58,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:51:58,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:51:58,303 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-11-14 18:51:58,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:58,618 INFO L93 Difference]: Finished difference Result 99 states and 135 transitions. [2018-11-14 18:51:58,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:51:58,618 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 25 [2018-11-14 18:51:58,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:51:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:51:58,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 135 transitions. [2018-11-14 18:51:58,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:51:58,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 135 transitions. [2018-11-14 18:51:58,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 135 transitions. [2018-11-14 18:51:59,228 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:59,243 INFO L225 Difference]: With dead ends: 99 [2018-11-14 18:51:59,244 INFO L226 Difference]: Without dead ends: 50 [2018-11-14 18:51:59,248 INFO L604 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-14 18:51:59,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-14 18:51:59,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-11-14 18:51:59,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:51:59,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 50 states. [2018-11-14 18:51:59,304 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-14 18:51:59,304 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-14 18:51:59,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:59,311 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2018-11-14 18:51:59,311 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2018-11-14 18:51:59,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:59,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:59,313 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 50 states. [2018-11-14 18:51:59,313 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 50 states. [2018-11-14 18:51:59,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:51:59,319 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2018-11-14 18:51:59,319 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2018-11-14 18:51:59,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:51:59,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:51:59,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:51:59,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:51:59,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 18:51:59,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 61 transitions. [2018-11-14 18:51:59,327 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 61 transitions. Word has length 25 [2018-11-14 18:51:59,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:51:59,328 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 61 transitions. [2018-11-14 18:51:59,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:51:59,328 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 61 transitions. [2018-11-14 18:51:59,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 18:51:59,330 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:51:59,330 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:51:59,330 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:51:59,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:51:59,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1702974415, now seen corresponding path program 1 times [2018-11-14 18:51:59,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:51:59,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:51:59,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:59,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:51:59,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:51:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:51:59,528 INFO L256 TraceCheckUtils]: 0: Hoare triple {343#true} call ULTIMATE.init(); {343#true} is VALID [2018-11-14 18:51:59,529 INFO L273 TraceCheckUtils]: 1: Hoare triple {343#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {343#true} is VALID [2018-11-14 18:51:59,530 INFO L273 TraceCheckUtils]: 2: Hoare triple {343#true} assume true; {343#true} is VALID [2018-11-14 18:51:59,530 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {343#true} {343#true} #163#return; {343#true} is VALID [2018-11-14 18:51:59,531 INFO L256 TraceCheckUtils]: 4: Hoare triple {343#true} call #t~ret31 := main(); {343#true} is VALID [2018-11-14 18:51:59,531 INFO L273 TraceCheckUtils]: 5: Hoare triple {343#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {343#true} is VALID [2018-11-14 18:51:59,532 INFO L273 TraceCheckUtils]: 6: Hoare triple {343#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL5~0 := 8;~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {343#true} is VALID [2018-11-14 18:51:59,532 INFO L273 TraceCheckUtils]: 7: Hoare triple {343#true} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) == 0 then 1 else 0) != 0;~i~0 := 1; {343#true} is VALID [2018-11-14 18:51:59,532 INFO L273 TraceCheckUtils]: 8: Hoare triple {343#true} assume true; {343#true} is VALID [2018-11-14 18:51:59,533 INFO L273 TraceCheckUtils]: 9: Hoare triple {343#true} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {343#true} is VALID [2018-11-14 18:51:59,533 INFO L273 TraceCheckUtils]: 10: Hoare triple {343#true} ~i~0 := 1; {343#true} is VALID [2018-11-14 18:51:59,533 INFO L273 TraceCheckUtils]: 11: Hoare triple {343#true} assume true; {343#true} is VALID [2018-11-14 18:51:59,534 INFO L273 TraceCheckUtils]: 12: Hoare triple {343#true} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {343#true} is VALID [2018-11-14 18:51:59,534 INFO L273 TraceCheckUtils]: 13: Hoare triple {343#true} ~i~0 := 1; {343#true} is VALID [2018-11-14 18:51:59,535 INFO L273 TraceCheckUtils]: 14: Hoare triple {343#true} assume true; {343#true} is VALID [2018-11-14 18:51:59,535 INFO L273 TraceCheckUtils]: 15: Hoare triple {343#true} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {343#true} is VALID [2018-11-14 18:51:59,535 INFO L273 TraceCheckUtils]: 16: Hoare triple {343#true} ~i~0 := 1; {343#true} is VALID [2018-11-14 18:51:59,536 INFO L273 TraceCheckUtils]: 17: Hoare triple {343#true} assume true; {343#true} is VALID [2018-11-14 18:51:59,536 INFO L273 TraceCheckUtils]: 18: Hoare triple {343#true} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {343#true} is VALID [2018-11-14 18:51:59,536 INFO L273 TraceCheckUtils]: 19: Hoare triple {343#true} ~i~0 := 1; {343#true} is VALID [2018-11-14 18:51:59,537 INFO L273 TraceCheckUtils]: 20: Hoare triple {343#true} assume true; {343#true} is VALID [2018-11-14 18:51:59,537 INFO L273 TraceCheckUtils]: 21: Hoare triple {343#true} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {343#true} is VALID [2018-11-14 18:51:59,537 INFO L273 TraceCheckUtils]: 22: Hoare triple {343#true} ~i~0 := 0; {343#true} is VALID [2018-11-14 18:51:59,538 INFO L273 TraceCheckUtils]: 23: Hoare triple {343#true} assume true; {343#true} is VALID [2018-11-14 18:51:59,538 INFO L273 TraceCheckUtils]: 24: Hoare triple {343#true} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {343#true} is VALID [2018-11-14 18:51:59,550 INFO L273 TraceCheckUtils]: 25: Hoare triple {343#true} assume #t~short30; {345#|main_#t~short30|} is VALID [2018-11-14 18:51:59,556 INFO L256 TraceCheckUtils]: 26: Hoare triple {345#|main_#t~short30|} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {346#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-14 18:51:59,557 INFO L273 TraceCheckUtils]: 27: Hoare triple {346#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {347#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-14 18:51:59,557 INFO L273 TraceCheckUtils]: 28: Hoare triple {347#(not (= 0 __VERIFIER_assert_~cond))} assume ~cond == 0; {344#false} is VALID [2018-11-14 18:51:59,558 INFO L273 TraceCheckUtils]: 29: Hoare triple {344#false} assume !false; {344#false} is VALID [2018-11-14 18:51:59,562 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-14 18:51:59,562 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:51:59,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:51:59,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-14 18:51:59,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:51:59,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:51:59,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:51:59,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:51:59,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:51:59,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:51:59,679 INFO L87 Difference]: Start difference. First operand 50 states and 61 transitions. Second operand 5 states. [2018-11-14 18:52:00,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:00,172 INFO L93 Difference]: Finished difference Result 58 states and 69 transitions. [2018-11-14 18:52:00,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:52:00,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2018-11-14 18:52:00,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:52:00,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:52:00,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2018-11-14 18:52:00,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:52:00,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 69 transitions. [2018-11-14 18:52:00,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 69 transitions. [2018-11-14 18:52:00,291 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-14 18:52:00,294 INFO L225 Difference]: With dead ends: 58 [2018-11-14 18:52:00,294 INFO L226 Difference]: Without dead ends: 56 [2018-11-14 18:52:00,295 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:52:00,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-14 18:52:00,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-11-14 18:52:00,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:52:00,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 55 states. [2018-11-14 18:52:00,331 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 55 states. [2018-11-14 18:52:00,331 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 55 states. [2018-11-14 18:52:00,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:00,336 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2018-11-14 18:52:00,336 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2018-11-14 18:52:00,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:00,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:00,337 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 56 states. [2018-11-14 18:52:00,338 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 56 states. [2018-11-14 18:52:00,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:00,342 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2018-11-14 18:52:00,342 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2018-11-14 18:52:00,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:00,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:00,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:52:00,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:52:00,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-14 18:52:00,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 66 transitions. [2018-11-14 18:52:00,347 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 66 transitions. Word has length 30 [2018-11-14 18:52:00,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:52:00,348 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 66 transitions. [2018-11-14 18:52:00,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:52:00,348 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 66 transitions. [2018-11-14 18:52:00,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 18:52:00,350 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:52:00,350 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:52:00,350 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:52:00,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:52:00,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1704821457, now seen corresponding path program 1 times [2018-11-14 18:52:00,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:52:00,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:52:00,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:00,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:52:00,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:00,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:52:00,633 INFO L256 TraceCheckUtils]: 0: Hoare triple {605#true} call ULTIMATE.init(); {605#true} is VALID [2018-11-14 18:52:00,634 INFO L273 TraceCheckUtils]: 1: Hoare triple {605#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {605#true} is VALID [2018-11-14 18:52:00,635 INFO L273 TraceCheckUtils]: 2: Hoare triple {605#true} assume true; {605#true} is VALID [2018-11-14 18:52:00,635 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {605#true} {605#true} #163#return; {605#true} is VALID [2018-11-14 18:52:00,635 INFO L256 TraceCheckUtils]: 4: Hoare triple {605#true} call #t~ret31 := main(); {605#true} is VALID [2018-11-14 18:52:00,636 INFO L273 TraceCheckUtils]: 5: Hoare triple {605#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {605#true} is VALID [2018-11-14 18:52:00,643 INFO L273 TraceCheckUtils]: 6: Hoare triple {605#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL5~0 := 8;~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {607#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-14 18:52:00,646 INFO L273 TraceCheckUtils]: 7: Hoare triple {607#(<= 2 ~CELLCOUNT~0)} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) == 0 then 1 else 0) != 0;~i~0 := 1; {608#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:00,647 INFO L273 TraceCheckUtils]: 8: Hoare triple {608#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume true; {608#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:00,648 INFO L273 TraceCheckUtils]: 9: Hoare triple {608#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {606#false} is VALID [2018-11-14 18:52:00,648 INFO L273 TraceCheckUtils]: 10: Hoare triple {606#false} ~i~0 := 1; {606#false} is VALID [2018-11-14 18:52:00,649 INFO L273 TraceCheckUtils]: 11: Hoare triple {606#false} assume true; {606#false} is VALID [2018-11-14 18:52:00,649 INFO L273 TraceCheckUtils]: 12: Hoare triple {606#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {606#false} is VALID [2018-11-14 18:52:00,650 INFO L273 TraceCheckUtils]: 13: Hoare triple {606#false} ~i~0 := 1; {606#false} is VALID [2018-11-14 18:52:00,650 INFO L273 TraceCheckUtils]: 14: Hoare triple {606#false} assume true; {606#false} is VALID [2018-11-14 18:52:00,651 INFO L273 TraceCheckUtils]: 15: Hoare triple {606#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {606#false} is VALID [2018-11-14 18:52:00,651 INFO L273 TraceCheckUtils]: 16: Hoare triple {606#false} ~i~0 := 1; {606#false} is VALID [2018-11-14 18:52:00,652 INFO L273 TraceCheckUtils]: 17: Hoare triple {606#false} assume true; {606#false} is VALID [2018-11-14 18:52:00,652 INFO L273 TraceCheckUtils]: 18: Hoare triple {606#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {606#false} is VALID [2018-11-14 18:52:00,653 INFO L273 TraceCheckUtils]: 19: Hoare triple {606#false} ~i~0 := 1; {606#false} is VALID [2018-11-14 18:52:00,653 INFO L273 TraceCheckUtils]: 20: Hoare triple {606#false} assume true; {606#false} is VALID [2018-11-14 18:52:00,653 INFO L273 TraceCheckUtils]: 21: Hoare triple {606#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {606#false} is VALID [2018-11-14 18:52:00,654 INFO L273 TraceCheckUtils]: 22: Hoare triple {606#false} ~i~0 := 0; {606#false} is VALID [2018-11-14 18:52:00,654 INFO L273 TraceCheckUtils]: 23: Hoare triple {606#false} assume true; {606#false} is VALID [2018-11-14 18:52:00,654 INFO L273 TraceCheckUtils]: 24: Hoare triple {606#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {606#false} is VALID [2018-11-14 18:52:00,655 INFO L273 TraceCheckUtils]: 25: Hoare triple {606#false} assume !#t~short30;call #t~mem29 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem29 == 0; {606#false} is VALID [2018-11-14 18:52:00,655 INFO L256 TraceCheckUtils]: 26: Hoare triple {606#false} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {606#false} is VALID [2018-11-14 18:52:00,655 INFO L273 TraceCheckUtils]: 27: Hoare triple {606#false} ~cond := #in~cond; {606#false} is VALID [2018-11-14 18:52:00,655 INFO L273 TraceCheckUtils]: 28: Hoare triple {606#false} assume ~cond == 0; {606#false} is VALID [2018-11-14 18:52:00,656 INFO L273 TraceCheckUtils]: 29: Hoare triple {606#false} assume !false; {606#false} is VALID [2018-11-14 18:52:00,658 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-14 18:52:00,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:52:00,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:52:00,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-14 18:52:00,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:52:00,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:52:00,749 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:52:00,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:52:00,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:52:00,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:52:00,751 INFO L87 Difference]: Start difference. First operand 55 states and 66 transitions. Second operand 4 states. [2018-11-14 18:52:01,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:01,178 INFO L93 Difference]: Finished difference Result 102 states and 124 transitions. [2018-11-14 18:52:01,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:52:01,179 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-14 18:52:01,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:52:01,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:52:01,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2018-11-14 18:52:01,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:52:01,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 114 transitions. [2018-11-14 18:52:01,186 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 114 transitions. [2018-11-14 18:52:01,361 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:52:01,365 INFO L225 Difference]: With dead ends: 102 [2018-11-14 18:52:01,365 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 18:52:01,366 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:52:01,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 18:52:01,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2018-11-14 18:52:01,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:52:01,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 57 states. [2018-11-14 18:52:01,405 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 57 states. [2018-11-14 18:52:01,405 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 57 states. [2018-11-14 18:52:01,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:01,409 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-11-14 18:52:01,409 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-11-14 18:52:01,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:01,410 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:01,410 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 60 states. [2018-11-14 18:52:01,411 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 60 states. [2018-11-14 18:52:01,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:01,414 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-11-14 18:52:01,414 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-11-14 18:52:01,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:01,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:01,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:52:01,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:52:01,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-14 18:52:01,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 68 transitions. [2018-11-14 18:52:01,419 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 68 transitions. Word has length 30 [2018-11-14 18:52:01,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:52:01,419 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 68 transitions. [2018-11-14 18:52:01,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:52:01,419 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 68 transitions. [2018-11-14 18:52:01,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 18:52:01,421 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:52:01,421 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:52:01,421 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:52:01,422 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:52:01,422 INFO L82 PathProgramCache]: Analyzing trace with hash 1923271226, now seen corresponding path program 1 times [2018-11-14 18:52:01,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:52:01,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:52:01,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:01,423 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:52:01,423 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:01,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:52:01,825 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2018-11-14 18:52:01,983 INFO L256 TraceCheckUtils]: 0: Hoare triple {929#true} call ULTIMATE.init(); {929#true} is VALID [2018-11-14 18:52:01,984 INFO L273 TraceCheckUtils]: 1: Hoare triple {929#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {929#true} is VALID [2018-11-14 18:52:01,984 INFO L273 TraceCheckUtils]: 2: Hoare triple {929#true} assume true; {929#true} is VALID [2018-11-14 18:52:01,984 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {929#true} {929#true} #163#return; {929#true} is VALID [2018-11-14 18:52:01,985 INFO L256 TraceCheckUtils]: 4: Hoare triple {929#true} call #t~ret31 := main(); {929#true} is VALID [2018-11-14 18:52:01,985 INFO L273 TraceCheckUtils]: 5: Hoare triple {929#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {929#true} is VALID [2018-11-14 18:52:01,986 INFO L273 TraceCheckUtils]: 6: Hoare triple {929#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL5~0 := 8;~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {931#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-14 18:52:01,987 INFO L273 TraceCheckUtils]: 7: Hoare triple {931#(<= 2 ~CELLCOUNT~0)} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) == 0 then 1 else 0) != 0;~i~0 := 1; {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:01,988 INFO L273 TraceCheckUtils]: 8: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume true; {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:01,989 INFO L273 TraceCheckUtils]: 9: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:01,997 INFO L273 TraceCheckUtils]: 10: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume ~CCCELVOL5~0 >= ~MINVAL~0;call write~int(~CCCELVOL5~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4); {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:02,000 INFO L273 TraceCheckUtils]: 11: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} call #t~mem3 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem3, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem3;call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem4, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem4;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem5, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem5;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem6, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem6; {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:02,003 INFO L273 TraceCheckUtils]: 12: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:02,003 INFO L273 TraceCheckUtils]: 13: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume true; {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:02,004 INFO L273 TraceCheckUtils]: 14: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:02,006 INFO L273 TraceCheckUtils]: 15: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} ~i~0 := 1; {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:02,025 INFO L273 TraceCheckUtils]: 16: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume true; {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:02,034 INFO L273 TraceCheckUtils]: 17: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:02,048 INFO L273 TraceCheckUtils]: 18: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} ~i~0 := 1; {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:02,057 INFO L273 TraceCheckUtils]: 19: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume true; {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:02,069 INFO L273 TraceCheckUtils]: 20: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:02,074 INFO L273 TraceCheckUtils]: 21: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} ~i~0 := 1; {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:02,075 INFO L273 TraceCheckUtils]: 22: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume true; {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:02,075 INFO L273 TraceCheckUtils]: 23: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:02,076 INFO L273 TraceCheckUtils]: 24: Hoare triple {932#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} ~i~0 := 1; {933#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:02,077 INFO L273 TraceCheckUtils]: 25: Hoare triple {933#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume true; {933#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:02,078 INFO L273 TraceCheckUtils]: 26: Hoare triple {933#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {930#false} is VALID [2018-11-14 18:52:02,078 INFO L273 TraceCheckUtils]: 27: Hoare triple {930#false} ~i~0 := 0; {930#false} is VALID [2018-11-14 18:52:02,078 INFO L273 TraceCheckUtils]: 28: Hoare triple {930#false} assume true; {930#false} is VALID [2018-11-14 18:52:02,079 INFO L273 TraceCheckUtils]: 29: Hoare triple {930#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {930#false} is VALID [2018-11-14 18:52:02,079 INFO L273 TraceCheckUtils]: 30: Hoare triple {930#false} assume !#t~short30;call #t~mem29 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem29 == 0; {930#false} is VALID [2018-11-14 18:52:02,080 INFO L256 TraceCheckUtils]: 31: Hoare triple {930#false} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {930#false} is VALID [2018-11-14 18:52:02,080 INFO L273 TraceCheckUtils]: 32: Hoare triple {930#false} ~cond := #in~cond; {930#false} is VALID [2018-11-14 18:52:02,080 INFO L273 TraceCheckUtils]: 33: Hoare triple {930#false} assume ~cond == 0; {930#false} is VALID [2018-11-14 18:52:02,081 INFO L273 TraceCheckUtils]: 34: Hoare triple {930#false} assume !false; {930#false} is VALID [2018-11-14 18:52:02,085 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:52:02,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:52:02,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 18:52:02,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-14 18:52:02,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:52:02,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:52:02,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:52:02,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:52:02,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:52:02,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:52:02,163 INFO L87 Difference]: Start difference. First operand 57 states and 68 transitions. Second operand 5 states. [2018-11-14 18:52:02,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:02,796 INFO L93 Difference]: Finished difference Result 116 states and 143 transitions. [2018-11-14 18:52:02,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:52:02,797 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-11-14 18:52:02,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:52:02,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:52:02,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2018-11-14 18:52:02,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:52:02,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2018-11-14 18:52:02,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 133 transitions. [2018-11-14 18:52:03,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:52:03,046 INFO L225 Difference]: With dead ends: 116 [2018-11-14 18:52:03,046 INFO L226 Difference]: Without dead ends: 80 [2018-11-14 18:52:03,047 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:52:03,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-14 18:52:03,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 65. [2018-11-14 18:52:03,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:52:03,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand 65 states. [2018-11-14 18:52:03,099 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 65 states. [2018-11-14 18:52:03,099 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 65 states. [2018-11-14 18:52:03,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:03,103 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2018-11-14 18:52:03,103 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2018-11-14 18:52:03,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:03,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:03,105 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 80 states. [2018-11-14 18:52:03,105 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 80 states. [2018-11-14 18:52:03,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:03,109 INFO L93 Difference]: Finished difference Result 80 states and 96 transitions. [2018-11-14 18:52:03,109 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 96 transitions. [2018-11-14 18:52:03,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:03,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:03,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:52:03,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:52:03,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-14 18:52:03,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2018-11-14 18:52:03,114 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 35 [2018-11-14 18:52:03,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:52:03,115 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2018-11-14 18:52:03,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:52:03,115 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2018-11-14 18:52:03,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-14 18:52:03,116 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:52:03,117 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:52:03,117 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:52:03,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:52:03,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1665185152, now seen corresponding path program 1 times [2018-11-14 18:52:03,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:52:03,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:52:03,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:03,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:52:03,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:03,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:52:03,251 INFO L256 TraceCheckUtils]: 0: Hoare triple {1323#true} call ULTIMATE.init(); {1323#true} is VALID [2018-11-14 18:52:03,252 INFO L273 TraceCheckUtils]: 1: Hoare triple {1323#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1323#true} is VALID [2018-11-14 18:52:03,252 INFO L273 TraceCheckUtils]: 2: Hoare triple {1323#true} assume true; {1323#true} is VALID [2018-11-14 18:52:03,252 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1323#true} {1323#true} #163#return; {1323#true} is VALID [2018-11-14 18:52:03,253 INFO L256 TraceCheckUtils]: 4: Hoare triple {1323#true} call #t~ret31 := main(); {1323#true} is VALID [2018-11-14 18:52:03,253 INFO L273 TraceCheckUtils]: 5: Hoare triple {1323#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1323#true} is VALID [2018-11-14 18:52:03,267 INFO L273 TraceCheckUtils]: 6: Hoare triple {1323#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL5~0 := 8;~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} is VALID [2018-11-14 18:52:03,268 INFO L273 TraceCheckUtils]: 7: Hoare triple {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) == 0 then 1 else 0) != 0;~i~0 := 1; {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} is VALID [2018-11-14 18:52:03,271 INFO L273 TraceCheckUtils]: 8: Hoare triple {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} assume true; {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} is VALID [2018-11-14 18:52:03,272 INFO L273 TraceCheckUtils]: 9: Hoare triple {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} is VALID [2018-11-14 18:52:03,272 INFO L273 TraceCheckUtils]: 10: Hoare triple {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} assume ~CCCELVOL5~0 >= ~MINVAL~0;call write~int(~CCCELVOL5~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4); {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} is VALID [2018-11-14 18:52:03,273 INFO L273 TraceCheckUtils]: 11: Hoare triple {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} call #t~mem3 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem3, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem3;call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem4, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem4;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem5, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem5;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem6, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem6; {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} is VALID [2018-11-14 18:52:03,273 INFO L273 TraceCheckUtils]: 12: Hoare triple {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} is VALID [2018-11-14 18:52:03,274 INFO L273 TraceCheckUtils]: 13: Hoare triple {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} assume true; {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} is VALID [2018-11-14 18:52:03,275 INFO L273 TraceCheckUtils]: 14: Hoare triple {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} is VALID [2018-11-14 18:52:03,276 INFO L273 TraceCheckUtils]: 15: Hoare triple {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} ~i~0 := 1; {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} is VALID [2018-11-14 18:52:03,276 INFO L273 TraceCheckUtils]: 16: Hoare triple {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} assume true; {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} is VALID [2018-11-14 18:52:03,277 INFO L273 TraceCheckUtils]: 17: Hoare triple {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} is VALID [2018-11-14 18:52:03,278 INFO L273 TraceCheckUtils]: 18: Hoare triple {1325#(<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0)} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4); {1324#false} is VALID [2018-11-14 18:52:03,278 INFO L273 TraceCheckUtils]: 19: Hoare triple {1324#false} call #t~mem8 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem8, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem8;call #t~mem9 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem9, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem9;call #t~mem10 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem10, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem10;call #t~mem11 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem11, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem11; {1324#false} is VALID [2018-11-14 18:52:03,278 INFO L273 TraceCheckUtils]: 20: Hoare triple {1324#false} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {1324#false} is VALID [2018-11-14 18:52:03,279 INFO L273 TraceCheckUtils]: 21: Hoare triple {1324#false} assume true; {1324#false} is VALID [2018-11-14 18:52:03,279 INFO L273 TraceCheckUtils]: 22: Hoare triple {1324#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1324#false} is VALID [2018-11-14 18:52:03,279 INFO L273 TraceCheckUtils]: 23: Hoare triple {1324#false} ~i~0 := 1; {1324#false} is VALID [2018-11-14 18:52:03,279 INFO L273 TraceCheckUtils]: 24: Hoare triple {1324#false} assume true; {1324#false} is VALID [2018-11-14 18:52:03,280 INFO L273 TraceCheckUtils]: 25: Hoare triple {1324#false} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1324#false} is VALID [2018-11-14 18:52:03,280 INFO L273 TraceCheckUtils]: 26: Hoare triple {1324#false} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4); {1324#false} is VALID [2018-11-14 18:52:03,280 INFO L273 TraceCheckUtils]: 27: Hoare triple {1324#false} call #t~mem13 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem13, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem13;call #t~mem14 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem14, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem14;call #t~mem15 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem15, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem15;call #t~mem16 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem16, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem16; {1324#false} is VALID [2018-11-14 18:52:03,281 INFO L273 TraceCheckUtils]: 28: Hoare triple {1324#false} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {1324#false} is VALID [2018-11-14 18:52:03,281 INFO L273 TraceCheckUtils]: 29: Hoare triple {1324#false} assume true; {1324#false} is VALID [2018-11-14 18:52:03,281 INFO L273 TraceCheckUtils]: 30: Hoare triple {1324#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1324#false} is VALID [2018-11-14 18:52:03,282 INFO L273 TraceCheckUtils]: 31: Hoare triple {1324#false} ~i~0 := 1; {1324#false} is VALID [2018-11-14 18:52:03,282 INFO L273 TraceCheckUtils]: 32: Hoare triple {1324#false} assume true; {1324#false} is VALID [2018-11-14 18:52:03,282 INFO L273 TraceCheckUtils]: 33: Hoare triple {1324#false} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1324#false} is VALID [2018-11-14 18:52:03,282 INFO L273 TraceCheckUtils]: 34: Hoare triple {1324#false} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4); {1324#false} is VALID [2018-11-14 18:52:03,282 INFO L273 TraceCheckUtils]: 35: Hoare triple {1324#false} call #t~mem18 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem18, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem18;call #t~mem19 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem19, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem19;call #t~mem20 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem20, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem20;call #t~mem21 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem21, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem21; {1324#false} is VALID [2018-11-14 18:52:03,284 INFO L273 TraceCheckUtils]: 36: Hoare triple {1324#false} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {1324#false} is VALID [2018-11-14 18:52:03,284 INFO L273 TraceCheckUtils]: 37: Hoare triple {1324#false} assume true; {1324#false} is VALID [2018-11-14 18:52:03,284 INFO L273 TraceCheckUtils]: 38: Hoare triple {1324#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1324#false} is VALID [2018-11-14 18:52:03,284 INFO L273 TraceCheckUtils]: 39: Hoare triple {1324#false} ~i~0 := 1; {1324#false} is VALID [2018-11-14 18:52:03,285 INFO L273 TraceCheckUtils]: 40: Hoare triple {1324#false} assume true; {1324#false} is VALID [2018-11-14 18:52:03,285 INFO L273 TraceCheckUtils]: 41: Hoare triple {1324#false} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1324#false} is VALID [2018-11-14 18:52:03,285 INFO L273 TraceCheckUtils]: 42: Hoare triple {1324#false} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4); {1324#false} is VALID [2018-11-14 18:52:03,285 INFO L273 TraceCheckUtils]: 43: Hoare triple {1324#false} call #t~mem23 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem23, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem23;call #t~mem24 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem24, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem24;call #t~mem25 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem25, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem25;call #t~mem26 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem26, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem26; {1324#false} is VALID [2018-11-14 18:52:03,286 INFO L273 TraceCheckUtils]: 44: Hoare triple {1324#false} #t~post22 := ~i~0;~i~0 := #t~post22 + 1;havoc #t~post22; {1324#false} is VALID [2018-11-14 18:52:03,286 INFO L273 TraceCheckUtils]: 45: Hoare triple {1324#false} assume true; {1324#false} is VALID [2018-11-14 18:52:03,286 INFO L273 TraceCheckUtils]: 46: Hoare triple {1324#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1324#false} is VALID [2018-11-14 18:52:03,286 INFO L273 TraceCheckUtils]: 47: Hoare triple {1324#false} ~i~0 := 0; {1324#false} is VALID [2018-11-14 18:52:03,286 INFO L273 TraceCheckUtils]: 48: Hoare triple {1324#false} assume true; {1324#false} is VALID [2018-11-14 18:52:03,287 INFO L273 TraceCheckUtils]: 49: Hoare triple {1324#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {1324#false} is VALID [2018-11-14 18:52:03,287 INFO L273 TraceCheckUtils]: 50: Hoare triple {1324#false} assume !#t~short30;call #t~mem29 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem29 == 0; {1324#false} is VALID [2018-11-14 18:52:03,287 INFO L256 TraceCheckUtils]: 51: Hoare triple {1324#false} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {1324#false} is VALID [2018-11-14 18:52:03,287 INFO L273 TraceCheckUtils]: 52: Hoare triple {1324#false} ~cond := #in~cond; {1324#false} is VALID [2018-11-14 18:52:03,287 INFO L273 TraceCheckUtils]: 53: Hoare triple {1324#false} assume ~cond == 0; {1324#false} is VALID [2018-11-14 18:52:03,288 INFO L273 TraceCheckUtils]: 54: Hoare triple {1324#false} assume !false; {1324#false} is VALID [2018-11-14 18:52:03,293 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 18:52:03,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:52:03,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:52:03,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-11-14 18:52:03,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:52:03,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:52:03,380 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:52:03,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:52:03,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:52:03,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:52:03,381 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand 3 states. [2018-11-14 18:52:03,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:03,542 INFO L93 Difference]: Finished difference Result 112 states and 132 transitions. [2018-11-14 18:52:03,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:52:03,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-11-14 18:52:03,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:52:03,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:52:03,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2018-11-14 18:52:03,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:52:03,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2018-11-14 18:52:03,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2018-11-14 18:52:03,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:52:03,696 INFO L225 Difference]: With dead ends: 112 [2018-11-14 18:52:03,696 INFO L226 Difference]: Without dead ends: 65 [2018-11-14 18:52:03,697 INFO L604 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-14 18:52:03,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-14 18:52:03,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-14 18:52:03,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:52:03,754 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 65 states. [2018-11-14 18:52:03,754 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2018-11-14 18:52:03,755 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2018-11-14 18:52:03,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:03,757 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2018-11-14 18:52:03,757 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2018-11-14 18:52:03,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:03,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:03,758 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2018-11-14 18:52:03,758 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2018-11-14 18:52:03,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:03,761 INFO L93 Difference]: Finished difference Result 65 states and 75 transitions. [2018-11-14 18:52:03,761 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2018-11-14 18:52:03,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:03,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:03,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:52:03,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:52:03,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-14 18:52:03,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 75 transitions. [2018-11-14 18:52:03,765 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 75 transitions. Word has length 55 [2018-11-14 18:52:03,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:52:03,765 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 75 transitions. [2018-11-14 18:52:03,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:52:03,766 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 75 transitions. [2018-11-14 18:52:03,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-14 18:52:03,767 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:52:03,767 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:52:03,768 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:52:03,768 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:52:03,768 INFO L82 PathProgramCache]: Analyzing trace with hash 1970250622, now seen corresponding path program 1 times [2018-11-14 18:52:03,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:52:03,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:52:03,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:03,769 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:52:03,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:03,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:52:03,967 INFO L256 TraceCheckUtils]: 0: Hoare triple {1685#true} call ULTIMATE.init(); {1685#true} is VALID [2018-11-14 18:52:03,967 INFO L273 TraceCheckUtils]: 1: Hoare triple {1685#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1685#true} is VALID [2018-11-14 18:52:03,967 INFO L273 TraceCheckUtils]: 2: Hoare triple {1685#true} assume true; {1685#true} is VALID [2018-11-14 18:52:03,968 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1685#true} {1685#true} #163#return; {1685#true} is VALID [2018-11-14 18:52:03,968 INFO L256 TraceCheckUtils]: 4: Hoare triple {1685#true} call #t~ret31 := main(); {1685#true} is VALID [2018-11-14 18:52:03,968 INFO L273 TraceCheckUtils]: 5: Hoare triple {1685#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1685#true} is VALID [2018-11-14 18:52:03,969 INFO L273 TraceCheckUtils]: 6: Hoare triple {1685#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL5~0 := 8;~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:03,974 INFO L273 TraceCheckUtils]: 7: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) == 0 then 1 else 0) != 0;~i~0 := 1; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:03,979 INFO L273 TraceCheckUtils]: 8: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume true; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:03,982 INFO L273 TraceCheckUtils]: 9: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:03,982 INFO L273 TraceCheckUtils]: 10: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume ~CCCELVOL5~0 >= ~MINVAL~0;call write~int(~CCCELVOL5~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4); {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:03,983 INFO L273 TraceCheckUtils]: 11: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} call #t~mem3 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem3, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem3;call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem4, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem4;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem5, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem5;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem6, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem6; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:03,983 INFO L273 TraceCheckUtils]: 12: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:03,983 INFO L273 TraceCheckUtils]: 13: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume true; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:03,985 INFO L273 TraceCheckUtils]: 14: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:03,986 INFO L273 TraceCheckUtils]: 15: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} ~i~0 := 1; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:03,986 INFO L273 TraceCheckUtils]: 16: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume true; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:03,988 INFO L273 TraceCheckUtils]: 17: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:03,989 INFO L273 TraceCheckUtils]: 18: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4); {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:03,993 INFO L273 TraceCheckUtils]: 19: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} call #t~mem8 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem8, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem8;call #t~mem9 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem9, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem9;call #t~mem10 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem10, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem10;call #t~mem11 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem11, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem11; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:03,993 INFO L273 TraceCheckUtils]: 20: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:03,995 INFO L273 TraceCheckUtils]: 21: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume true; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:03,995 INFO L273 TraceCheckUtils]: 22: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:03,997 INFO L273 TraceCheckUtils]: 23: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} ~i~0 := 1; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:03,997 INFO L273 TraceCheckUtils]: 24: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume true; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:03,998 INFO L273 TraceCheckUtils]: 25: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:03,998 INFO L273 TraceCheckUtils]: 26: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4); {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:04,000 INFO L273 TraceCheckUtils]: 27: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} call #t~mem13 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem13, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem13;call #t~mem14 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem14, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem14;call #t~mem15 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem15, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem15;call #t~mem16 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem16, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem16; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:04,003 INFO L273 TraceCheckUtils]: 28: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:04,009 INFO L273 TraceCheckUtils]: 29: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume true; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:04,010 INFO L273 TraceCheckUtils]: 30: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:04,013 INFO L273 TraceCheckUtils]: 31: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} ~i~0 := 1; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:04,013 INFO L273 TraceCheckUtils]: 32: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume true; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:04,015 INFO L273 TraceCheckUtils]: 33: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:04,015 INFO L273 TraceCheckUtils]: 34: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4); {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:04,016 INFO L273 TraceCheckUtils]: 35: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} call #t~mem18 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem18, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem18;call #t~mem19 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem19, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem19;call #t~mem20 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem20, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem20;call #t~mem21 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem21, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem21; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:04,016 INFO L273 TraceCheckUtils]: 36: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:04,016 INFO L273 TraceCheckUtils]: 37: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume true; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:04,017 INFO L273 TraceCheckUtils]: 38: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:04,017 INFO L273 TraceCheckUtils]: 39: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} ~i~0 := 1; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:04,018 INFO L273 TraceCheckUtils]: 40: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume true; {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:04,018 INFO L273 TraceCheckUtils]: 41: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} is VALID [2018-11-14 18:52:04,019 INFO L273 TraceCheckUtils]: 42: Hoare triple {1687#(<= (+ main_~CCCELVOL1~0 1) main_~MINVAL~0)} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4); {1686#false} is VALID [2018-11-14 18:52:04,019 INFO L273 TraceCheckUtils]: 43: Hoare triple {1686#false} call #t~mem23 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem23, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem23;call #t~mem24 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem24, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem24;call #t~mem25 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem25, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem25;call #t~mem26 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem26, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem26; {1686#false} is VALID [2018-11-14 18:52:04,020 INFO L273 TraceCheckUtils]: 44: Hoare triple {1686#false} #t~post22 := ~i~0;~i~0 := #t~post22 + 1;havoc #t~post22; {1686#false} is VALID [2018-11-14 18:52:04,020 INFO L273 TraceCheckUtils]: 45: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 18:52:04,020 INFO L273 TraceCheckUtils]: 46: Hoare triple {1686#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {1686#false} is VALID [2018-11-14 18:52:04,021 INFO L273 TraceCheckUtils]: 47: Hoare triple {1686#false} ~i~0 := 0; {1686#false} is VALID [2018-11-14 18:52:04,021 INFO L273 TraceCheckUtils]: 48: Hoare triple {1686#false} assume true; {1686#false} is VALID [2018-11-14 18:52:04,022 INFO L273 TraceCheckUtils]: 49: Hoare triple {1686#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {1686#false} is VALID [2018-11-14 18:52:04,022 INFO L273 TraceCheckUtils]: 50: Hoare triple {1686#false} assume !#t~short30;call #t~mem29 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem29 == 0; {1686#false} is VALID [2018-11-14 18:52:04,022 INFO L256 TraceCheckUtils]: 51: Hoare triple {1686#false} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {1686#false} is VALID [2018-11-14 18:52:04,022 INFO L273 TraceCheckUtils]: 52: Hoare triple {1686#false} ~cond := #in~cond; {1686#false} is VALID [2018-11-14 18:52:04,023 INFO L273 TraceCheckUtils]: 53: Hoare triple {1686#false} assume ~cond == 0; {1686#false} is VALID [2018-11-14 18:52:04,023 INFO L273 TraceCheckUtils]: 54: Hoare triple {1686#false} assume !false; {1686#false} is VALID [2018-11-14 18:52:04,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 18:52:04,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:52:04,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:52:04,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-11-14 18:52:04,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:52:04,028 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:52:04,138 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:52:04,139 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:52:04,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:52:04,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:52:04,139 INFO L87 Difference]: Start difference. First operand 65 states and 75 transitions. Second operand 3 states. [2018-11-14 18:52:04,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:04,368 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2018-11-14 18:52:04,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:52:04,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2018-11-14 18:52:04,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:52:04,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:52:04,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2018-11-14 18:52:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:52:04,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2018-11-14 18:52:04,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2018-11-14 18:52:04,602 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:52:04,604 INFO L225 Difference]: With dead ends: 88 [2018-11-14 18:52:04,604 INFO L226 Difference]: Without dead ends: 65 [2018-11-14 18:52:04,605 INFO L604 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-14 18:52:04,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-14 18:52:04,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-11-14 18:52:04,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:52:04,716 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 65 states. [2018-11-14 18:52:04,716 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2018-11-14 18:52:04,717 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2018-11-14 18:52:04,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:04,719 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-11-14 18:52:04,720 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2018-11-14 18:52:04,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:04,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:04,720 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 65 states. [2018-11-14 18:52:04,721 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 65 states. [2018-11-14 18:52:04,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:04,723 INFO L93 Difference]: Finished difference Result 65 states and 74 transitions. [2018-11-14 18:52:04,724 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2018-11-14 18:52:04,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:04,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:04,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:52:04,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:52:04,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-14 18:52:04,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2018-11-14 18:52:04,727 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 55 [2018-11-14 18:52:04,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:52:04,728 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2018-11-14 18:52:04,728 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:52:04,728 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2018-11-14 18:52:04,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-14 18:52:04,729 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:52:04,729 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:52:04,729 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:52:04,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:52:04,730 INFO L82 PathProgramCache]: Analyzing trace with hash 1383444608, now seen corresponding path program 1 times [2018-11-14 18:52:04,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:52:04,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:52:04,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:04,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:52:04,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:52:05,785 WARN L179 SmtUtils]: Spent 327.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 43 [2018-11-14 18:52:06,876 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 38 [2018-11-14 18:52:09,254 INFO L256 TraceCheckUtils]: 0: Hoare triple {2017#true} call ULTIMATE.init(); {2017#true} is VALID [2018-11-14 18:52:09,255 INFO L273 TraceCheckUtils]: 1: Hoare triple {2017#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2017#true} is VALID [2018-11-14 18:52:09,255 INFO L273 TraceCheckUtils]: 2: Hoare triple {2017#true} assume true; {2017#true} is VALID [2018-11-14 18:52:09,255 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2017#true} {2017#true} #163#return; {2017#true} is VALID [2018-11-14 18:52:09,255 INFO L256 TraceCheckUtils]: 4: Hoare triple {2017#true} call #t~ret31 := main(); {2017#true} is VALID [2018-11-14 18:52:09,255 INFO L273 TraceCheckUtils]: 5: Hoare triple {2017#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2017#true} is VALID [2018-11-14 18:52:09,256 INFO L273 TraceCheckUtils]: 6: Hoare triple {2017#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL5~0 := 8;~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {2019#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) main_~CCCELVOL5~0))} is VALID [2018-11-14 18:52:09,257 INFO L273 TraceCheckUtils]: 7: Hoare triple {2019#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) main_~CCCELVOL5~0))} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) == 0 then 1 else 0) != 0;~i~0 := 1; {2020#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) (<= (+ main_~MINVAL~0 6) main_~CCCELVOL5~0))} is VALID [2018-11-14 18:52:09,258 INFO L273 TraceCheckUtils]: 8: Hoare triple {2020#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) (<= (+ main_~MINVAL~0 6) main_~CCCELVOL5~0))} assume true; {2020#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) (<= (+ main_~MINVAL~0 6) main_~CCCELVOL5~0))} is VALID [2018-11-14 18:52:09,259 INFO L273 TraceCheckUtils]: 9: Hoare triple {2020#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) (<= (+ main_~MINVAL~0 6) main_~CCCELVOL5~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2020#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) (<= (+ main_~MINVAL~0 6) main_~CCCELVOL5~0))} is VALID [2018-11-14 18:52:09,260 INFO L273 TraceCheckUtils]: 10: Hoare triple {2020#(and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))) (<= (+ main_~MINVAL~0 6) main_~CCCELVOL5~0))} assume ~CCCELVOL5~0 >= ~MINVAL~0;call write~int(~CCCELVOL5~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4); {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} is VALID [2018-11-14 18:52:09,261 INFO L273 TraceCheckUtils]: 11: Hoare triple {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} call #t~mem3 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem3, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem3;call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem4, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem4;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem5, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem5;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem6, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem6; {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} is VALID [2018-11-14 18:52:09,263 INFO L273 TraceCheckUtils]: 12: Hoare triple {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2022#(and (or (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 39) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:09,264 INFO L273 TraceCheckUtils]: 13: Hoare triple {2022#(and (or (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 39) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0))} assume true; {2022#(and (or (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 39) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:09,265 INFO L273 TraceCheckUtils]: 14: Hoare triple {2022#(and (or (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 39) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2023#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-14 18:52:09,267 INFO L273 TraceCheckUtils]: 15: Hoare triple {2023#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} ~i~0 := 1; {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} is VALID [2018-11-14 18:52:09,268 INFO L273 TraceCheckUtils]: 16: Hoare triple {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} assume true; {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} is VALID [2018-11-14 18:52:09,270 INFO L273 TraceCheckUtils]: 17: Hoare triple {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} is VALID [2018-11-14 18:52:09,272 INFO L273 TraceCheckUtils]: 18: Hoare triple {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4); {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} is VALID [2018-11-14 18:52:09,274 INFO L273 TraceCheckUtils]: 19: Hoare triple {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} call #t~mem8 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem8, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem8;call #t~mem9 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem9, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem9;call #t~mem10 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem10, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem10;call #t~mem11 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem11, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem11; {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} is VALID [2018-11-14 18:52:09,276 INFO L273 TraceCheckUtils]: 20: Hoare triple {2021#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 6) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {2024#(and (or (and (<= 1 (div (+ ~CELLCOUNT~0 3) 5)) (or (<= 2 (div (+ ~CELLCOUNT~0 3) 5)) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 1) (+ |main_~#volArray~0.offset| (- 20))))))) (<= (* 5 main_~i~0) (+ ~CELLCOUNT~0 3))) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 18:52:09,277 INFO L273 TraceCheckUtils]: 21: Hoare triple {2024#(and (or (and (<= 1 (div (+ ~CELLCOUNT~0 3) 5)) (or (<= 2 (div (+ ~CELLCOUNT~0 3) 5)) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 1) (+ |main_~#volArray~0.offset| (- 20))))))) (<= (* 5 main_~i~0) (+ ~CELLCOUNT~0 3))) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (< 0 (+ ~CELLCOUNT~0 1)))} assume true; {2024#(and (or (and (<= 1 (div (+ ~CELLCOUNT~0 3) 5)) (or (<= 2 (div (+ ~CELLCOUNT~0 3) 5)) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 1) (+ |main_~#volArray~0.offset| (- 20))))))) (<= (* 5 main_~i~0) (+ ~CELLCOUNT~0 3))) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 18:52:09,279 INFO L273 TraceCheckUtils]: 22: Hoare triple {2024#(and (or (and (<= 1 (div (+ ~CELLCOUNT~0 3) 5)) (or (<= 2 (div (+ ~CELLCOUNT~0 3) 5)) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 1) (+ |main_~#volArray~0.offset| (- 20))))))) (<= (* 5 main_~i~0) (+ ~CELLCOUNT~0 3))) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2025#(and (<= 1 (div (+ ~CELLCOUNT~0 3) 5)) (or (<= 2 (div (+ ~CELLCOUNT~0 3) 5)) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 1) (+ |main_~#volArray~0.offset| (- 20)))))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:09,281 INFO L273 TraceCheckUtils]: 23: Hoare triple {2025#(and (<= 1 (div (+ ~CELLCOUNT~0 3) 5)) (or (<= 2 (div (+ ~CELLCOUNT~0 3) 5)) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 1) (+ |main_~#volArray~0.offset| (- 20)))))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0))} ~i~0 := 1; {2026#(and (<= 1 (div (+ ~CELLCOUNT~0 3) 5)) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (or (<= 2 (div (+ ~CELLCOUNT~0 3) 5)) (and (= (* 20 main_~i~0) 20) (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))))))} is VALID [2018-11-14 18:52:09,284 INFO L273 TraceCheckUtils]: 24: Hoare triple {2026#(and (<= 1 (div (+ ~CELLCOUNT~0 3) 5)) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (or (<= 2 (div (+ ~CELLCOUNT~0 3) 5)) (and (= (* 20 main_~i~0) 20) (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))))))} assume true; {2026#(and (<= 1 (div (+ ~CELLCOUNT~0 3) 5)) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (or (<= 2 (div (+ ~CELLCOUNT~0 3) 5)) (and (= (* 20 main_~i~0) 20) (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))))))} is VALID [2018-11-14 18:52:09,288 INFO L273 TraceCheckUtils]: 25: Hoare triple {2026#(and (<= 1 (div (+ ~CELLCOUNT~0 3) 5)) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (or (<= 2 (div (+ ~CELLCOUNT~0 3) 5)) (and (= (* 20 main_~i~0) 20) (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))))))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2027#(and (or (and (= (* 20 main_~i~0) 20) (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20))))) (<= 2 (div ~CELLCOUNT~0 5))) (<= 1 (div ~CELLCOUNT~0 5)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:09,290 INFO L273 TraceCheckUtils]: 26: Hoare triple {2027#(and (or (and (= (* 20 main_~i~0) 20) (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20))))) (<= 2 (div ~CELLCOUNT~0 5))) (<= 1 (div ~CELLCOUNT~0 5)) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4); {2027#(and (or (and (= (* 20 main_~i~0) 20) (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20))))) (<= 2 (div ~CELLCOUNT~0 5))) (<= 1 (div ~CELLCOUNT~0 5)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:09,291 INFO L273 TraceCheckUtils]: 27: Hoare triple {2027#(and (or (and (= (* 20 main_~i~0) 20) (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20))))) (<= 2 (div ~CELLCOUNT~0 5))) (<= 1 (div ~CELLCOUNT~0 5)) (= |main_~#volArray~0.offset| 0))} call #t~mem13 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem13, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem13;call #t~mem14 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem14, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem14;call #t~mem15 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem15, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem15;call #t~mem16 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem16, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem16; {2027#(and (or (and (= (* 20 main_~i~0) 20) (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20))))) (<= 2 (div ~CELLCOUNT~0 5))) (<= 1 (div ~CELLCOUNT~0 5)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:09,292 INFO L273 TraceCheckUtils]: 28: Hoare triple {2027#(and (or (and (= (* 20 main_~i~0) 20) (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20))))) (<= 2 (div ~CELLCOUNT~0 5))) (<= 1 (div ~CELLCOUNT~0 5)) (= |main_~#volArray~0.offset| 0))} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {2028#(and (or (and (or (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 1) (+ |main_~#volArray~0.offset| (- 20))))) (<= 2 (div ~CELLCOUNT~0 5))) (<= 1 (div ~CELLCOUNT~0 5))) (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (<= main_~i~0 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:09,309 INFO L273 TraceCheckUtils]: 29: Hoare triple {2028#(and (or (and (or (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 1) (+ |main_~#volArray~0.offset| (- 20))))) (<= 2 (div ~CELLCOUNT~0 5))) (<= 1 (div ~CELLCOUNT~0 5))) (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (<= main_~i~0 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0))} assume true; {2028#(and (or (and (or (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 1) (+ |main_~#volArray~0.offset| (- 20))))) (<= 2 (div ~CELLCOUNT~0 5))) (<= 1 (div ~CELLCOUNT~0 5))) (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (<= main_~i~0 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:09,324 INFO L273 TraceCheckUtils]: 30: Hoare triple {2028#(and (or (and (or (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 1) (+ |main_~#volArray~0.offset| (- 20))))) (<= 2 (div ~CELLCOUNT~0 5))) (<= 1 (div ~CELLCOUNT~0 5))) (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (<= main_~i~0 (div ~CELLCOUNT~0 5))) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2029#(and (or (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 1) (+ |main_~#volArray~0.offset| (- 20))))) (<= 2 (div ~CELLCOUNT~0 5))) (<= 1 (div ~CELLCOUNT~0 5)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:09,338 INFO L273 TraceCheckUtils]: 31: Hoare triple {2029#(and (or (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 1) (+ |main_~#volArray~0.offset| (- 20))))) (<= 2 (div ~CELLCOUNT~0 5))) (<= 1 (div ~CELLCOUNT~0 5)) (= |main_~#volArray~0.offset| 0))} ~i~0 := 1; {2030#(and (or (and (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0)))) (and (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5)) (= main_~i~0 1))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:09,354 INFO L273 TraceCheckUtils]: 32: Hoare triple {2030#(and (or (and (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0)))) (and (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5)) (= main_~i~0 1))) (= |main_~#volArray~0.offset| 0))} assume true; {2030#(and (or (and (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0)))) (and (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5)) (= main_~i~0 1))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:09,363 INFO L273 TraceCheckUtils]: 33: Hoare triple {2030#(and (or (and (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0)))) (and (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5)) (= main_~i~0 1))) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2030#(and (or (and (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0)))) (and (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5)) (= main_~i~0 1))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:09,377 INFO L273 TraceCheckUtils]: 34: Hoare triple {2030#(and (or (and (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0)))) (and (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5)) (= main_~i~0 1))) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4); {2030#(and (or (and (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0)))) (and (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5)) (= main_~i~0 1))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:09,392 INFO L273 TraceCheckUtils]: 35: Hoare triple {2030#(and (or (and (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0)))) (and (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5)) (= main_~i~0 1))) (= |main_~#volArray~0.offset| 0))} call #t~mem18 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem18, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem18;call #t~mem19 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem19, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem19;call #t~mem20 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem20, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem20;call #t~mem21 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem21, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem21; {2030#(and (or (and (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0)))) (and (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5)) (= main_~i~0 1))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:09,408 INFO L273 TraceCheckUtils]: 36: Hoare triple {2030#(and (or (and (<= (+ main_~MINVAL~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0)))) (and (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5)) (= main_~i~0 1))) (= |main_~#volArray~0.offset| 0))} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {2031#(and (or (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (<= main_~i~0 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:09,422 INFO L273 TraceCheckUtils]: 37: Hoare triple {2031#(and (or (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (<= main_~i~0 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0))} assume true; {2031#(and (or (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (<= main_~i~0 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:09,438 INFO L273 TraceCheckUtils]: 38: Hoare triple {2031#(and (or (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (<= main_~i~0 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-14 18:52:09,453 INFO L273 TraceCheckUtils]: 39: Hoare triple {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} ~i~0 := 1; {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-14 18:52:09,462 INFO L273 TraceCheckUtils]: 40: Hoare triple {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} assume true; {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-14 18:52:09,475 INFO L273 TraceCheckUtils]: 41: Hoare triple {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-14 18:52:09,487 INFO L273 TraceCheckUtils]: 42: Hoare triple {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4); {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-14 18:52:09,488 INFO L273 TraceCheckUtils]: 43: Hoare triple {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} call #t~mem23 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem23, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem23;call #t~mem24 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem24, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem24;call #t~mem25 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem25, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem25;call #t~mem26 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem26, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem26; {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-14 18:52:09,489 INFO L273 TraceCheckUtils]: 44: Hoare triple {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} #t~post22 := ~i~0;~i~0 := #t~post22 + 1;havoc #t~post22; {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-14 18:52:09,489 INFO L273 TraceCheckUtils]: 45: Hoare triple {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} assume true; {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-14 18:52:09,491 INFO L273 TraceCheckUtils]: 46: Hoare triple {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-14 18:52:09,491 INFO L273 TraceCheckUtils]: 47: Hoare triple {2032#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} ~i~0 := 0; {2033#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 4 main_~i~0)))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:09,493 INFO L273 TraceCheckUtils]: 48: Hoare triple {2033#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 4 main_~i~0)))) (= main_~i~0 0))} assume true; {2033#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 4 main_~i~0)))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:09,494 INFO L273 TraceCheckUtils]: 49: Hoare triple {2033#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 4 main_~i~0)))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {2034#(and (= |main_~#volArray~0.offset| 0) |main_#t~short30| (= main_~i~0 0))} is VALID [2018-11-14 18:52:09,494 INFO L273 TraceCheckUtils]: 50: Hoare triple {2034#(and (= |main_~#volArray~0.offset| 0) |main_#t~short30| (= main_~i~0 0))} assume !#t~short30;call #t~mem29 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem29 == 0; {2018#false} is VALID [2018-11-14 18:52:09,494 INFO L256 TraceCheckUtils]: 51: Hoare triple {2018#false} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {2018#false} is VALID [2018-11-14 18:52:09,495 INFO L273 TraceCheckUtils]: 52: Hoare triple {2018#false} ~cond := #in~cond; {2018#false} is VALID [2018-11-14 18:52:09,495 INFO L273 TraceCheckUtils]: 53: Hoare triple {2018#false} assume ~cond == 0; {2018#false} is VALID [2018-11-14 18:52:09,495 INFO L273 TraceCheckUtils]: 54: Hoare triple {2018#false} assume !false; {2018#false} is VALID [2018-11-14 18:52:09,516 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:52:09,516 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:52:09,516 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-14 18:52:09,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:52:09,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:52:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:52:09,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:52:09,969 INFO L477 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 16 treesize of output 13 [2018-11-14 18:52:09,976 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-14 18:52:09,977 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:09,981 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:10,030 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-14 18:52:10,031 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-11-14 18:52:10,045 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:52:10,355 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:52:10,357 INFO L477 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 181 treesize of output 284 [2018-11-14 18:52:10,491 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:10,492 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:10,493 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:10,500 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 101 [2018-11-14 18:52:10,537 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:10,538 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:10,539 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:10,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 65 [2018-11-14 18:52:10,563 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:10,565 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:10,566 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:10,574 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 47 [2018-11-14 18:52:10,616 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:10,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 23 [2018-11-14 18:52:10,625 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:10,632 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:10,635 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:10,641 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:10,643 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:10,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:10,650 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:187, output treesize:14 [2018-11-14 18:52:10,747 INFO L477 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 24 treesize of output 19 [2018-11-14 18:52:10,754 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:10,757 INFO L477 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 19 treesize of output 29 [2018-11-14 18:52:10,760 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:10,767 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:10,779 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-14 18:52:10,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2018-11-14 18:52:10,784 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:52:10,804 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:52:10,806 INFO L477 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 271 treesize of output 464 [2018-11-14 18:52:10,834 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:10,837 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:10,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 176 treesize of output 165 [2018-11-14 18:52:10,929 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:10,930 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:10,931 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:10,932 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:10,934 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:10,986 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 138 [2018-11-14 18:52:11,068 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,070 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,071 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,072 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,073 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 108 [2018-11-14 18:52:11,106 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,108 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,128 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 59 [2018-11-14 18:52:11,131 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:11,144 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:11,177 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:11,197 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,198 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,199 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,208 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 98 [2018-11-14 18:52:11,234 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,235 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,236 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 68 [2018-11-14 18:52:11,314 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-11-14 18:52:11,326 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:11,332 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:11,336 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:11,343 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:11,346 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:11,357 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-14 18:52:11,357 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:280, output treesize:14 [2018-11-14 18:52:11,360 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:52:11,392 INFO L477 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 24 treesize of output 19 [2018-11-14 18:52:11,398 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,402 INFO L477 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 19 treesize of output 29 [2018-11-14 18:52:11,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:11,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:11,422 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-14 18:52:11,423 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2018-11-14 18:52:11,428 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:52:11,447 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:52:11,449 INFO L477 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 271 treesize of output 464 [2018-11-14 18:52:11,546 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,559 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,584 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 176 treesize of output 165 [2018-11-14 18:52:11,651 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,652 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,653 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 104 [2018-11-14 18:52:11,697 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,698 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,699 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,707 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 68 [2018-11-14 18:52:11,714 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-11-14 18:52:11,722 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:11,728 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:11,734 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:11,786 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,787 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,789 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,791 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,793 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,813 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 103 treesize of output 143 [2018-11-14 18:52:11,877 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,882 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,884 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,886 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,888 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,907 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 113 [2018-11-14 18:52:11,933 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,938 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:11,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 64 [2018-11-14 18:52:11,968 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:12,016 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:12,026 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:12,043 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:52:12,051 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:12,068 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-14 18:52:12,068 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:280, output treesize:14 [2018-11-14 18:52:12,071 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:52:12,185 INFO L477 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 24 treesize of output 19 [2018-11-14 18:52:12,281 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:12,285 INFO L477 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 19 treesize of output 29 [2018-11-14 18:52:12,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:12,299 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:12,312 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-14 18:52:12,312 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:33, output treesize:17 [2018-11-14 18:52:12,316 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:52:12,340 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:52:12,341 INFO L477 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 271 treesize of output 464 [2018-11-14 18:52:12,369 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:12,371 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:12,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 176 treesize of output 165 [2018-11-14 18:52:12,504 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:12,505 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:12,506 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:12,513 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 104 [2018-11-14 18:52:12,547 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:12,548 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:12,549 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:12,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 68 [2018-11-14 18:52:12,567 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:12,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-11-14 18:52:12,575 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:12,582 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:12,588 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:12,611 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:12,612 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:12,613 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:12,622 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 98 [2018-11-14 18:52:12,653 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:12,654 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:12,655 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:12,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 68 [2018-11-14 18:52:12,672 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:12,677 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 29 [2018-11-14 18:52:12,680 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:12,687 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:12,691 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:12,698 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:12,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:12,712 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-14 18:52:12,713 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 2 variables, input treesize:280, output treesize:14 [2018-11-14 18:52:12,716 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:52:12,764 INFO L477 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 24 treesize of output 19 [2018-11-14 18:52:12,776 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:12,777 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:12,779 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 37 [2018-11-14 18:52:12,782 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:12,792 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:12,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:12,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:33, output treesize:29 [2018-11-14 18:52:12,874 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:52:12,877 INFO L477 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 283 treesize of output 474 [2018-11-14 18:52:12,914 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:12,916 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:12,919 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:12,920 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:12,921 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:12,923 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:12,948 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 186 treesize of output 210 [2018-11-14 18:52:13,014 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:13,016 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:13,017 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:13,019 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:13,020 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:13,022 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:13,023 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:13,039 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 158 [2018-11-14 18:52:13,100 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:13,101 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:13,103 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:13,104 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:13,105 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:13,107 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:13,112 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:13,150 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 128 [2018-11-14 18:52:13,223 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:13,226 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:13,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 81 [2018-11-14 18:52:13,246 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:13,263 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:13,271 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:13,279 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:13,288 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:13,303 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-14 18:52:13,303 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:292, output treesize:29 [2018-11-14 18:52:13,747 INFO L256 TraceCheckUtils]: 0: Hoare triple {2017#true} call ULTIMATE.init(); {2017#true} is VALID [2018-11-14 18:52:13,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {2017#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2017#true} is VALID [2018-11-14 18:52:13,748 INFO L273 TraceCheckUtils]: 2: Hoare triple {2017#true} assume true; {2017#true} is VALID [2018-11-14 18:52:13,748 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2017#true} {2017#true} #163#return; {2017#true} is VALID [2018-11-14 18:52:13,748 INFO L256 TraceCheckUtils]: 4: Hoare triple {2017#true} call #t~ret31 := main(); {2017#true} is VALID [2018-11-14 18:52:13,748 INFO L273 TraceCheckUtils]: 5: Hoare triple {2017#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2017#true} is VALID [2018-11-14 18:52:13,749 INFO L273 TraceCheckUtils]: 6: Hoare triple {2017#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL5~0 := 8;~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {2056#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 8 main_~CCCELVOL5~0))} is VALID [2018-11-14 18:52:13,750 INFO L273 TraceCheckUtils]: 7: Hoare triple {2056#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 8 main_~CCCELVOL5~0))} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) == 0 then 1 else 0) != 0;~i~0 := 1; {2060#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 8 main_~CCCELVOL5~0))} is VALID [2018-11-14 18:52:13,750 INFO L273 TraceCheckUtils]: 8: Hoare triple {2060#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 8 main_~CCCELVOL5~0))} assume true; {2060#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 8 main_~CCCELVOL5~0))} is VALID [2018-11-14 18:52:13,751 INFO L273 TraceCheckUtils]: 9: Hoare triple {2060#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 8 main_~CCCELVOL5~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2060#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 8 main_~CCCELVOL5~0))} is VALID [2018-11-14 18:52:13,752 INFO L273 TraceCheckUtils]: 10: Hoare triple {2060#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 8 main_~CCCELVOL5~0))} assume ~CCCELVOL5~0 >= ~MINVAL~0;call write~int(~CCCELVOL5~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4); {2070#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,753 INFO L273 TraceCheckUtils]: 11: Hoare triple {2070#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (= |main_~#volArray~0.offset| 0))} call #t~mem3 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem3, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem3;call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem4, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem4;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem5, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem5;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem6, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem6; {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,754 INFO L273 TraceCheckUtils]: 12: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,756 INFO L273 TraceCheckUtils]: 13: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume true; {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,757 INFO L273 TraceCheckUtils]: 14: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,758 INFO L273 TraceCheckUtils]: 15: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} ~i~0 := 1; {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,759 INFO L273 TraceCheckUtils]: 16: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume true; {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,760 INFO L273 TraceCheckUtils]: 17: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,763 INFO L273 TraceCheckUtils]: 18: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4); {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,764 INFO L273 TraceCheckUtils]: 19: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} call #t~mem8 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem8, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem8;call #t~mem9 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem9, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem9;call #t~mem10 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem10, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem10;call #t~mem11 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem11, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem11; {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,765 INFO L273 TraceCheckUtils]: 20: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,766 INFO L273 TraceCheckUtils]: 21: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume true; {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,768 INFO L273 TraceCheckUtils]: 22: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,770 INFO L273 TraceCheckUtils]: 23: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} ~i~0 := 1; {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,771 INFO L273 TraceCheckUtils]: 24: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume true; {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,772 INFO L273 TraceCheckUtils]: 25: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,773 INFO L273 TraceCheckUtils]: 26: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4); {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,775 INFO L273 TraceCheckUtils]: 27: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} call #t~mem13 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem13, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem13;call #t~mem14 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem14, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem14;call #t~mem15 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem15, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem15;call #t~mem16 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem16, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem16; {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,776 INFO L273 TraceCheckUtils]: 28: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,776 INFO L273 TraceCheckUtils]: 29: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume true; {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,778 INFO L273 TraceCheckUtils]: 30: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,778 INFO L273 TraceCheckUtils]: 31: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} ~i~0 := 1; {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,779 INFO L273 TraceCheckUtils]: 32: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume true; {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,780 INFO L273 TraceCheckUtils]: 33: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,782 INFO L273 TraceCheckUtils]: 34: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4); {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,783 INFO L273 TraceCheckUtils]: 35: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} call #t~mem18 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem18, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem18;call #t~mem19 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem19, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem19;call #t~mem20 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem20, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem20;call #t~mem21 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem21, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem21; {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,784 INFO L273 TraceCheckUtils]: 36: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,785 INFO L273 TraceCheckUtils]: 37: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume true; {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,786 INFO L273 TraceCheckUtils]: 38: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,787 INFO L273 TraceCheckUtils]: 39: Hoare triple {2074#(and (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} ~i~0 := 1; {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,788 INFO L273 TraceCheckUtils]: 40: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume true; {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,789 INFO L273 TraceCheckUtils]: 41: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,791 INFO L273 TraceCheckUtils]: 42: Hoare triple {2087#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4); {2169#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,793 INFO L273 TraceCheckUtils]: 43: Hoare triple {2169#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} call #t~mem23 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem23, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem23;call #t~mem24 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem24, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem24;call #t~mem25 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem25, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem25;call #t~mem26 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem26, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem26; {2173#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,794 INFO L273 TraceCheckUtils]: 44: Hoare triple {2173#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} #t~post22 := ~i~0;~i~0 := #t~post22 + 1;havoc #t~post22; {2173#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,796 INFO L273 TraceCheckUtils]: 45: Hoare triple {2173#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume true; {2173#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,797 INFO L273 TraceCheckUtils]: 46: Hoare triple {2173#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2173#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:13,798 INFO L273 TraceCheckUtils]: 47: Hoare triple {2173#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0))} ~i~0 := 0; {2186#(and (exists ((v_prenex_4 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_4) (- 4)))) (<= 1 v_prenex_4))) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 18:52:13,799 INFO L273 TraceCheckUtils]: 48: Hoare triple {2186#(and (exists ((v_prenex_4 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_4) (- 4)))) (<= 1 v_prenex_4))) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume true; {2186#(and (exists ((v_prenex_4 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_4) (- 4)))) (<= 1 v_prenex_4))) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 18:52:13,801 INFO L273 TraceCheckUtils]: 49: Hoare triple {2186#(and (exists ((v_prenex_4 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_4) (- 4)))) (<= 1 v_prenex_4))) (<= main_~MINVAL~0 2) (<= 8 (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {2193#|main_#t~short30|} is VALID [2018-11-14 18:52:13,801 INFO L273 TraceCheckUtils]: 50: Hoare triple {2193#|main_#t~short30|} assume !#t~short30;call #t~mem29 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem29 == 0; {2018#false} is VALID [2018-11-14 18:52:13,802 INFO L256 TraceCheckUtils]: 51: Hoare triple {2018#false} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {2018#false} is VALID [2018-11-14 18:52:13,802 INFO L273 TraceCheckUtils]: 52: Hoare triple {2018#false} ~cond := #in~cond; {2018#false} is VALID [2018-11-14 18:52:13,802 INFO L273 TraceCheckUtils]: 53: Hoare triple {2018#false} assume ~cond == 0; {2018#false} is VALID [2018-11-14 18:52:13,803 INFO L273 TraceCheckUtils]: 54: Hoare triple {2018#false} assume !false; {2018#false} is VALID [2018-11-14 18:52:13,820 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-14 18:52:13,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:52:13,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 11] total 27 [2018-11-14 18:52:13,844 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 55 [2018-11-14 18:52:13,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:52:13,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-14 18:52:14,075 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:52:14,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-14 18:52:14,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-14 18:52:14,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=584, Unknown=0, NotChecked=0, Total=702 [2018-11-14 18:52:14,077 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand 27 states. [2018-11-14 18:52:19,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:19,345 INFO L93 Difference]: Finished difference Result 150 states and 176 transitions. [2018-11-14 18:52:19,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-14 18:52:19,345 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 55 [2018-11-14 18:52:19,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:52:19,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 18:52:19,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 160 transitions. [2018-11-14 18:52:19,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 18:52:19,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 160 transitions. [2018-11-14 18:52:19,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 160 transitions. [2018-11-14 18:52:19,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:52:19,643 INFO L225 Difference]: With dead ends: 150 [2018-11-14 18:52:19,644 INFO L226 Difference]: Without dead ends: 95 [2018-11-14 18:52:19,645 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 47 SyntacticMatches, 13 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 471 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=401, Invalid=1239, Unknown=0, NotChecked=0, Total=1640 [2018-11-14 18:52:19,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-14 18:52:19,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 68. [2018-11-14 18:52:19,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:52:19,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 68 states. [2018-11-14 18:52:19,810 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 68 states. [2018-11-14 18:52:19,810 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 68 states. [2018-11-14 18:52:19,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:19,815 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2018-11-14 18:52:19,815 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2018-11-14 18:52:19,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:19,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:19,816 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 95 states. [2018-11-14 18:52:19,816 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 95 states. [2018-11-14 18:52:19,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:19,820 INFO L93 Difference]: Finished difference Result 95 states and 109 transitions. [2018-11-14 18:52:19,821 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 109 transitions. [2018-11-14 18:52:19,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:19,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:19,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:52:19,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:52:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-14 18:52:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2018-11-14 18:52:19,824 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 55 [2018-11-14 18:52:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:52:19,825 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2018-11-14 18:52:19,825 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-14 18:52:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2018-11-14 18:52:19,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-11-14 18:52:19,826 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:52:19,826 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:52:19,826 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:52:19,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:52:19,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1855390773, now seen corresponding path program 1 times [2018-11-14 18:52:19,827 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:52:19,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:52:19,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:19,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:52:19,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:19,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:52:20,378 WARN L179 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2018-11-14 18:52:21,070 WARN L179 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 16 [2018-11-14 18:52:22,200 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 52 [2018-11-14 18:52:22,496 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 36 [2018-11-14 18:52:23,492 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 40 [2018-11-14 18:52:24,278 INFO L256 TraceCheckUtils]: 0: Hoare triple {2702#true} call ULTIMATE.init(); {2702#true} is VALID [2018-11-14 18:52:24,278 INFO L273 TraceCheckUtils]: 1: Hoare triple {2702#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2702#true} is VALID [2018-11-14 18:52:24,279 INFO L273 TraceCheckUtils]: 2: Hoare triple {2702#true} assume true; {2702#true} is VALID [2018-11-14 18:52:24,279 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2702#true} {2702#true} #163#return; {2702#true} is VALID [2018-11-14 18:52:24,279 INFO L256 TraceCheckUtils]: 4: Hoare triple {2702#true} call #t~ret31 := main(); {2702#true} is VALID [2018-11-14 18:52:24,279 INFO L273 TraceCheckUtils]: 5: Hoare triple {2702#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2702#true} is VALID [2018-11-14 18:52:24,281 INFO L273 TraceCheckUtils]: 6: Hoare triple {2702#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL5~0 := 8;~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {2704#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))} is VALID [2018-11-14 18:52:24,282 INFO L273 TraceCheckUtils]: 7: Hoare triple {2704#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) == 0 then 1 else 0) != 0;~i~0 := 1; {2705#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))} is VALID [2018-11-14 18:52:24,283 INFO L273 TraceCheckUtils]: 8: Hoare triple {2705#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))} assume true; {2705#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))} is VALID [2018-11-14 18:52:24,284 INFO L273 TraceCheckUtils]: 9: Hoare triple {2705#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2705#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))} is VALID [2018-11-14 18:52:24,284 INFO L273 TraceCheckUtils]: 10: Hoare triple {2705#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))} assume ~CCCELVOL5~0 >= ~MINVAL~0;call write~int(~CCCELVOL5~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4); {2705#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))} is VALID [2018-11-14 18:52:24,286 INFO L273 TraceCheckUtils]: 11: Hoare triple {2705#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))} call #t~mem3 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem3, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem3;call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem4, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem4;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem5, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem5;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem6, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem6; {2705#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))} is VALID [2018-11-14 18:52:24,287 INFO L273 TraceCheckUtils]: 12: Hoare triple {2705#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2706#(and (or (and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0) (<= (* 5 main_~i~0) 10)) (<= (+ (div (+ (* 5 main_~i~0) (+ (- ~CELLCOUNT~0) 1)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 18:52:24,288 INFO L273 TraceCheckUtils]: 13: Hoare triple {2706#(and (or (and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0) (<= (* 5 main_~i~0) 10)) (<= (+ (div (+ (* 5 main_~i~0) (+ (- ~CELLCOUNT~0) 1)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (< 0 (+ ~CELLCOUNT~0 1)))} assume true; {2706#(and (or (and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0) (<= (* 5 main_~i~0) 10)) (<= (+ (div (+ (* 5 main_~i~0) (+ (- ~CELLCOUNT~0) 1)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 18:52:24,290 INFO L273 TraceCheckUtils]: 14: Hoare triple {2706#(and (or (and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0) (<= (* 5 main_~i~0) 10)) (<= (+ (div (+ (* 5 main_~i~0) (+ (- ~CELLCOUNT~0) 1)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2707#(and (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= 1 (div (+ ~CELLCOUNT~0 3) 5)) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:24,291 INFO L273 TraceCheckUtils]: 15: Hoare triple {2707#(and (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= 1 (div (+ ~CELLCOUNT~0 3) 5)) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} ~i~0 := 1; {2708#(and (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= 2 ~CELLCOUNT~0) (= (* 20 main_~i~0) (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:24,301 INFO L273 TraceCheckUtils]: 16: Hoare triple {2708#(and (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= 2 ~CELLCOUNT~0) (= (* 20 main_~i~0) (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume true; {2708#(and (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= 2 ~CELLCOUNT~0) (= (* 20 main_~i~0) (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:24,302 INFO L273 TraceCheckUtils]: 17: Hoare triple {2708#(and (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= 2 ~CELLCOUNT~0) (= (* 20 main_~i~0) (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2708#(and (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= 2 ~CELLCOUNT~0) (= (* 20 main_~i~0) (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:24,303 INFO L273 TraceCheckUtils]: 18: Hoare triple {2708#(and (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= 2 ~CELLCOUNT~0) (= (* 20 main_~i~0) (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5))) (<= (+ main_~MINVAL~0 3) main_~CCCELVOL4~0))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4); {2709#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= (+ main_~MINVAL~0 3) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (<= 2 ~CELLCOUNT~0) (= (* 20 main_~i~0) (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5))))))} is VALID [2018-11-14 18:52:24,304 INFO L273 TraceCheckUtils]: 19: Hoare triple {2709#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= (+ main_~MINVAL~0 3) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (<= 2 ~CELLCOUNT~0) (= (* 20 main_~i~0) (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5))))))} call #t~mem8 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem8, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem8;call #t~mem9 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem9, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem9;call #t~mem10 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem10, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem10;call #t~mem11 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem11, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem11; {2709#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= (+ main_~MINVAL~0 3) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (<= 2 ~CELLCOUNT~0) (= (* 20 main_~i~0) (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5))))))} is VALID [2018-11-14 18:52:24,307 INFO L273 TraceCheckUtils]: 20: Hoare triple {2709#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= (+ main_~MINVAL~0 3) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 8)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 20)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (<= 2 ~CELLCOUNT~0) (= (* 20 main_~i~0) (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5))))))} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {2710#(and (<= (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) (div (+ ~CELLCOUNT~0 3) 5)) (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5)) (+ |main_~#volArray~0.offset| (- 16))))) (<= (* 5 main_~i~0) (+ ~CELLCOUNT~0 3))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:24,308 INFO L273 TraceCheckUtils]: 21: Hoare triple {2710#(and (<= (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) (div (+ ~CELLCOUNT~0 3) 5)) (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5)) (+ |main_~#volArray~0.offset| (- 16))))) (<= (* 5 main_~i~0) (+ ~CELLCOUNT~0 3))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume true; {2710#(and (<= (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) (div (+ ~CELLCOUNT~0 3) 5)) (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5)) (+ |main_~#volArray~0.offset| (- 16))))) (<= (* 5 main_~i~0) (+ ~CELLCOUNT~0 3))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:24,310 INFO L273 TraceCheckUtils]: 22: Hoare triple {2710#(and (<= (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) (div (+ ~CELLCOUNT~0 3) 5)) (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5)) (+ |main_~#volArray~0.offset| (- 16))))) (<= (* 5 main_~i~0) (+ ~CELLCOUNT~0 3))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2711#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5)) (+ |main_~#volArray~0.offset| (- 16))))))))} is VALID [2018-11-14 18:52:24,312 INFO L273 TraceCheckUtils]: 23: Hoare triple {2711#(and (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (or (<= (+ (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)) (and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 (div (+ (* 5 (div ~CELLCOUNT~0 5)) (+ (- ~CELLCOUNT~0) 6)) 5)) (+ |main_~#volArray~0.offset| (- 16))))))))} ~i~0 := 1; {2712#(and (or (and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ (* 5 main_~i~0) 2) ~CELLCOUNT~0)) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:24,313 INFO L273 TraceCheckUtils]: 24: Hoare triple {2712#(and (or (and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ (* 5 main_~i~0) 2) ~CELLCOUNT~0)) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume true; {2712#(and (or (and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ (* 5 main_~i~0) 2) ~CELLCOUNT~0)) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:24,314 INFO L273 TraceCheckUtils]: 25: Hoare triple {2712#(and (or (and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ (* 5 main_~i~0) 2) ~CELLCOUNT~0)) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} is VALID [2018-11-14 18:52:24,315 INFO L273 TraceCheckUtils]: 26: Hoare triple {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4); {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} is VALID [2018-11-14 18:52:24,317 INFO L273 TraceCheckUtils]: 27: Hoare triple {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} call #t~mem13 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem13, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem13;call #t~mem14 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem14, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem14;call #t~mem15 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem15, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem15;call #t~mem16 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem16, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem16; {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} is VALID [2018-11-14 18:52:24,319 INFO L273 TraceCheckUtils]: 28: Hoare triple {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {2714#(or (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (and (<= 1 (div ~CELLCOUNT~0 5)) (= (+ (* 20 (div ~CELLCOUNT~0 5)) 20) (* 20 main_~i~0)) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 20) (div ~CELLCOUNT~0 5)) (- 16))))) (<= (+ main_~i~0 1) (* 2 (div ~CELLCOUNT~0 5))) (<= main_~i~0 (div ~CELLCOUNT~0 5)))} is VALID [2018-11-14 18:52:24,319 INFO L273 TraceCheckUtils]: 29: Hoare triple {2714#(or (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (and (<= 1 (div ~CELLCOUNT~0 5)) (= (+ (* 20 (div ~CELLCOUNT~0 5)) 20) (* 20 main_~i~0)) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 20) (div ~CELLCOUNT~0 5)) (- 16))))) (<= (+ main_~i~0 1) (* 2 (div ~CELLCOUNT~0 5))) (<= main_~i~0 (div ~CELLCOUNT~0 5)))} assume true; {2714#(or (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (and (<= 1 (div ~CELLCOUNT~0 5)) (= (+ (* 20 (div ~CELLCOUNT~0 5)) 20) (* 20 main_~i~0)) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 20) (div ~CELLCOUNT~0 5)) (- 16))))) (<= (+ main_~i~0 1) (* 2 (div ~CELLCOUNT~0 5))) (<= main_~i~0 (div ~CELLCOUNT~0 5)))} is VALID [2018-11-14 18:52:24,322 INFO L273 TraceCheckUtils]: 30: Hoare triple {2714#(or (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (and (<= 1 (div ~CELLCOUNT~0 5)) (= (+ (* 20 (div ~CELLCOUNT~0 5)) 20) (* 20 main_~i~0)) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (* (- 20) (div ~CELLCOUNT~0 5)) (- 16))))) (<= (+ main_~i~0 1) (* 2 (div ~CELLCOUNT~0 5))) (<= main_~i~0 (div ~CELLCOUNT~0 5)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:24,322 INFO L273 TraceCheckUtils]: 31: Hoare triple {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} ~i~0 := 1; {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:24,323 INFO L273 TraceCheckUtils]: 32: Hoare triple {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} assume true; {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:24,324 INFO L273 TraceCheckUtils]: 33: Hoare triple {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:24,326 INFO L273 TraceCheckUtils]: 34: Hoare triple {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4); {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:24,327 INFO L273 TraceCheckUtils]: 35: Hoare triple {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} call #t~mem18 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem18, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem18;call #t~mem19 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem19, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem19;call #t~mem20 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem20, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem20;call #t~mem21 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem21, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem21; {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:24,328 INFO L273 TraceCheckUtils]: 36: Hoare triple {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:24,328 INFO L273 TraceCheckUtils]: 37: Hoare triple {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} assume true; {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:24,329 INFO L273 TraceCheckUtils]: 38: Hoare triple {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:24,330 INFO L273 TraceCheckUtils]: 39: Hoare triple {2715#(and (<= 1 (div ~CELLCOUNT~0 5)) (or (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (+ (* 20 1) (- 16))))) (<= 2 (div ~CELLCOUNT~0 5))))} ~i~0 := 1; {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} is VALID [2018-11-14 18:52:24,331 INFO L273 TraceCheckUtils]: 40: Hoare triple {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} assume true; {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} is VALID [2018-11-14 18:52:24,333 INFO L273 TraceCheckUtils]: 41: Hoare triple {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} is VALID [2018-11-14 18:52:24,337 INFO L273 TraceCheckUtils]: 42: Hoare triple {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4); {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} is VALID [2018-11-14 18:52:24,338 INFO L273 TraceCheckUtils]: 43: Hoare triple {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} call #t~mem23 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem23, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem23;call #t~mem24 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem24, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem24;call #t~mem25 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem25, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem25;call #t~mem26 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem26, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem26; {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} is VALID [2018-11-14 18:52:24,352 INFO L273 TraceCheckUtils]: 44: Hoare triple {2713#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ main_~MINVAL~0 3) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)) main_~CCCELVOL3~0) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (<= (+ main_~i~0 1) (div ~CELLCOUNT~0 5))) (= main_~i~0 1))} #t~post22 := ~i~0;~i~0 := #t~post22 + 1;havoc #t~post22; {2716#(or (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16)))))) (<= main_~i~0 (div ~CELLCOUNT~0 5)))} is VALID [2018-11-14 18:52:24,353 INFO L273 TraceCheckUtils]: 45: Hoare triple {2716#(or (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16)))))) (<= main_~i~0 (div ~CELLCOUNT~0 5)))} assume true; {2716#(or (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16)))))) (<= main_~i~0 (div ~CELLCOUNT~0 5)))} is VALID [2018-11-14 18:52:24,354 INFO L273 TraceCheckUtils]: 46: Hoare triple {2716#(or (and (< ~CELLCOUNT~0 0) (not (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5)))) (<= main_~i~0 (+ (div ~CELLCOUNT~0 5) 1))) (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16)))))) (<= main_~i~0 (div ~CELLCOUNT~0 5)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2717#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))))} is VALID [2018-11-14 18:52:24,355 INFO L273 TraceCheckUtils]: 47: Hoare triple {2717#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))))} ~i~0 := 0; {2718#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:24,355 INFO L273 TraceCheckUtils]: 48: Hoare triple {2718#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} assume true; {2718#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:24,356 INFO L273 TraceCheckUtils]: 49: Hoare triple {2718#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {2718#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:24,357 INFO L273 TraceCheckUtils]: 50: Hoare triple {2718#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} assume #t~short30; {2718#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:24,357 INFO L256 TraceCheckUtils]: 51: Hoare triple {2718#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {2702#true} is VALID [2018-11-14 18:52:24,357 INFO L273 TraceCheckUtils]: 52: Hoare triple {2702#true} ~cond := #in~cond; {2702#true} is VALID [2018-11-14 18:52:24,357 INFO L273 TraceCheckUtils]: 53: Hoare triple {2702#true} assume !(~cond == 0); {2702#true} is VALID [2018-11-14 18:52:24,357 INFO L273 TraceCheckUtils]: 54: Hoare triple {2702#true} assume true; {2702#true} is VALID [2018-11-14 18:52:24,358 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {2702#true} {2718#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} #167#return; {2718#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:24,358 INFO L273 TraceCheckUtils]: 56: Hoare triple {2718#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} havoc #t~mem28;havoc #t~short30;havoc #t~mem29; {2718#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:24,359 INFO L273 TraceCheckUtils]: 57: Hoare triple {2718#(and (<= 1 (div ~CELLCOUNT~0 5)) (<= (* 5 (div ~CELLCOUNT~0 5)) 5) (<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 5) (+ |main_~#volArray~0.offset| (- 16))))) (= main_~i~0 0))} #t~post27 := ~i~0;~i~0 := #t~post27 + 1;havoc #t~post27; {2719#(<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 4 main_~i~0))))} is VALID [2018-11-14 18:52:24,360 INFO L273 TraceCheckUtils]: 58: Hoare triple {2719#(<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 4 main_~i~0))))} assume true; {2719#(<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 4 main_~i~0))))} is VALID [2018-11-14 18:52:24,361 INFO L273 TraceCheckUtils]: 59: Hoare triple {2719#(<= (+ main_~MINVAL~0 3) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 4 main_~i~0))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {2720#|main_#t~short30|} is VALID [2018-11-14 18:52:24,361 INFO L273 TraceCheckUtils]: 60: Hoare triple {2720#|main_#t~short30|} assume !#t~short30;call #t~mem29 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem29 == 0; {2703#false} is VALID [2018-11-14 18:52:24,362 INFO L256 TraceCheckUtils]: 61: Hoare triple {2703#false} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {2703#false} is VALID [2018-11-14 18:52:24,362 INFO L273 TraceCheckUtils]: 62: Hoare triple {2703#false} ~cond := #in~cond; {2703#false} is VALID [2018-11-14 18:52:24,362 INFO L273 TraceCheckUtils]: 63: Hoare triple {2703#false} assume ~cond == 0; {2703#false} is VALID [2018-11-14 18:52:24,362 INFO L273 TraceCheckUtils]: 64: Hoare triple {2703#false} assume !false; {2703#false} is VALID [2018-11-14 18:52:24,388 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:52:24,388 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:52:24,388 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-14 18:52:24,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:52:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:52:24,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:52:24,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:52:24,567 INFO L477 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 16 treesize of output 13 [2018-11-14 18:52:24,571 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-14 18:52:24,573 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:24,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:24,586 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-14 18:52:24,587 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-11-14 18:52:24,591 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:52:24,651 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:52:24,653 INFO L477 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 151 treesize of output 222 [2018-11-14 18:52:24,846 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 26 [2018-11-14 18:52:24,931 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:24,953 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:24,978 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:24,995 INFO L303 Elim1Store]: Index analysis took 101 ms [2018-11-14 18:52:24,997 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 101 [2018-11-14 18:52:25,012 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:25,013 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:25,014 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:25,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 71 [2018-11-14 18:52:25,039 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:25,040 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:25,041 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:25,048 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 53 [2018-11-14 18:52:25,054 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:25,058 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2018-11-14 18:52:25,060 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:25,067 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:25,069 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:25,072 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:25,074 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:25,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:25,081 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:157, output treesize:16 [2018-11-14 18:52:25,201 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-11-14 18:52:25,207 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:25,210 INFO L477 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 21 treesize of output 33 [2018-11-14 18:52:25,212 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:25,218 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:25,229 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-14 18:52:25,229 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2018-11-14 18:52:25,233 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:52:25,256 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:52:25,257 INFO L477 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 273 treesize of output 466 [2018-11-14 18:52:25,279 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:25,280 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:25,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 153 [2018-11-14 18:52:25,317 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:25,320 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:25,342 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 111 [2018-11-14 18:52:25,924 WARN L179 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 39 [2018-11-14 18:52:25,929 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:25,930 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:25,931 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:25,938 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 80 [2018-11-14 18:52:25,943 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:25,947 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-11-14 18:52:25,950 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:25,958 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:25,978 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:25,979 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:25,980 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:25,981 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:25,984 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:25,995 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 119 [2018-11-14 18:52:26,004 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,005 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 68 [2018-11-14 18:52:26,015 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:26,028 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:26,040 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-14 18:52:26,046 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:26,049 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:26,058 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-14 18:52:26,059 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 2 variables, input treesize:282, output treesize:16 [2018-11-14 18:52:26,061 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:52:26,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-11-14 18:52:26,101 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,104 INFO L477 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 21 treesize of output 33 [2018-11-14 18:52:26,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:26,115 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:26,127 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-14 18:52:26,127 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2018-11-14 18:52:26,132 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:52:26,329 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:52:26,341 INFO L477 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 273 treesize of output 466 [2018-11-14 18:52:26,367 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,368 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,381 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 178 treesize of output 153 [2018-11-14 18:52:26,408 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,410 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,429 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 88 treesize of output 96 [2018-11-14 18:52:26,453 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,454 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,455 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,468 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 74 [2018-11-14 18:52:26,475 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,478 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-11-14 18:52:26,480 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:26,487 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:26,494 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:26,496 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:26,498 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:26,508 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-14 18:52:26,508 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:282, output treesize:16 [2018-11-14 18:52:26,511 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:52:26,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-11-14 18:52:26,544 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,546 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 43 [2018-11-14 18:52:26,550 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:26,559 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:26,571 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:26,571 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-14 18:52:26,633 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:52:26,634 INFO L477 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 285 treesize of output 476 [2018-11-14 18:52:26,666 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,667 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,669 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,670 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,671 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,675 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,687 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 217 [2018-11-14 18:52:26,726 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,728 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,729 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,730 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,731 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,736 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 156 [2018-11-14 18:52:26,801 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,801 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,802 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,804 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,805 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,806 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,808 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 138 [2018-11-14 18:52:26,830 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,831 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:26,838 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 89 [2018-11-14 18:52:26,842 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:26,859 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:26,865 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:26,871 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:26,879 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:26,890 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-14 18:52:26,891 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 2 variables, input treesize:294, output treesize:31 [2018-11-14 18:52:27,518 INFO L256 TraceCheckUtils]: 0: Hoare triple {2702#true} call ULTIMATE.init(); {2702#true} is VALID [2018-11-14 18:52:27,518 INFO L273 TraceCheckUtils]: 1: Hoare triple {2702#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2702#true} is VALID [2018-11-14 18:52:27,518 INFO L273 TraceCheckUtils]: 2: Hoare triple {2702#true} assume true; {2702#true} is VALID [2018-11-14 18:52:27,519 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2702#true} {2702#true} #163#return; {2702#true} is VALID [2018-11-14 18:52:27,519 INFO L256 TraceCheckUtils]: 4: Hoare triple {2702#true} call #t~ret31 := main(); {2702#true} is VALID [2018-11-14 18:52:27,519 INFO L273 TraceCheckUtils]: 5: Hoare triple {2702#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2702#true} is VALID [2018-11-14 18:52:27,520 INFO L273 TraceCheckUtils]: 6: Hoare triple {2702#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL5~0 := 8;~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-14 18:52:27,521 INFO L273 TraceCheckUtils]: 7: Hoare triple {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) == 0 then 1 else 0) != 0;~i~0 := 1; {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-14 18:52:27,521 INFO L273 TraceCheckUtils]: 8: Hoare triple {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} assume true; {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-14 18:52:27,522 INFO L273 TraceCheckUtils]: 9: Hoare triple {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-14 18:52:27,522 INFO L273 TraceCheckUtils]: 10: Hoare triple {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} assume ~CCCELVOL5~0 >= ~MINVAL~0;call write~int(~CCCELVOL5~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4); {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-14 18:52:27,525 INFO L273 TraceCheckUtils]: 11: Hoare triple {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} call #t~mem3 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem3, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem3;call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem4, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem4;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem5, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem5;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem6, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem6; {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-14 18:52:27,526 INFO L273 TraceCheckUtils]: 12: Hoare triple {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-14 18:52:27,526 INFO L273 TraceCheckUtils]: 13: Hoare triple {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} assume true; {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-14 18:52:27,527 INFO L273 TraceCheckUtils]: 14: Hoare triple {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-14 18:52:27,527 INFO L273 TraceCheckUtils]: 15: Hoare triple {2742#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} ~i~0 := 1; {2770#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-14 18:52:27,528 INFO L273 TraceCheckUtils]: 16: Hoare triple {2770#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} assume true; {2770#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-14 18:52:27,528 INFO L273 TraceCheckUtils]: 17: Hoare triple {2770#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2770#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} is VALID [2018-11-14 18:52:27,529 INFO L273 TraceCheckUtils]: 18: Hoare triple {2770#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 5 main_~CCCELVOL4~0))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4); {2780#(and (<= main_~MINVAL~0 2) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,532 INFO L273 TraceCheckUtils]: 19: Hoare triple {2780#(and (<= main_~MINVAL~0 2) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 16)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} call #t~mem8 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem8, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem8;call #t~mem9 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem9, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem9;call #t~mem10 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem10, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem10;call #t~mem11 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem11, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem11; {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,533 INFO L273 TraceCheckUtils]: 20: Hoare triple {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,534 INFO L273 TraceCheckUtils]: 21: Hoare triple {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume true; {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,534 INFO L273 TraceCheckUtils]: 22: Hoare triple {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,536 INFO L273 TraceCheckUtils]: 23: Hoare triple {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} ~i~0 := 1; {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,536 INFO L273 TraceCheckUtils]: 24: Hoare triple {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume true; {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,538 INFO L273 TraceCheckUtils]: 25: Hoare triple {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,540 INFO L273 TraceCheckUtils]: 26: Hoare triple {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4); {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,540 INFO L273 TraceCheckUtils]: 27: Hoare triple {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} call #t~mem13 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem13, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem13;call #t~mem14 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem14, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem14;call #t~mem15 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem15, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem15;call #t~mem16 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem16, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem16; {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,541 INFO L273 TraceCheckUtils]: 28: Hoare triple {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,541 INFO L273 TraceCheckUtils]: 29: Hoare triple {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume true; {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,543 INFO L273 TraceCheckUtils]: 30: Hoare triple {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,543 INFO L273 TraceCheckUtils]: 31: Hoare triple {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} ~i~0 := 1; {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,545 INFO L273 TraceCheckUtils]: 32: Hoare triple {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume true; {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,546 INFO L273 TraceCheckUtils]: 33: Hoare triple {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,565 INFO L273 TraceCheckUtils]: 34: Hoare triple {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4); {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,572 INFO L273 TraceCheckUtils]: 35: Hoare triple {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} call #t~mem18 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem18, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem18;call #t~mem19 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem19, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem19;call #t~mem20 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem20, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem20;call #t~mem21 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem21, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem21; {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,573 INFO L273 TraceCheckUtils]: 36: Hoare triple {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,574 INFO L273 TraceCheckUtils]: 37: Hoare triple {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume true; {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,574 INFO L273 TraceCheckUtils]: 38: Hoare triple {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,575 INFO L273 TraceCheckUtils]: 39: Hoare triple {2784#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} ~i~0 := 1; {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,575 INFO L273 TraceCheckUtils]: 40: Hoare triple {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume true; {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,576 INFO L273 TraceCheckUtils]: 41: Hoare triple {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,577 INFO L273 TraceCheckUtils]: 42: Hoare triple {2797#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4); {2855#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,578 INFO L273 TraceCheckUtils]: 43: Hoare triple {2855#(and (<= 1 main_~i~0) (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (= |main_~#volArray~0.offset| 0))} call #t~mem23 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem23, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem23;call #t~mem24 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem24, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem24;call #t~mem25 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem25, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem25;call #t~mem26 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem26, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem26; {2859#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,578 INFO L273 TraceCheckUtils]: 44: Hoare triple {2859#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0))} #t~post22 := ~i~0;~i~0 := #t~post22 + 1;havoc #t~post22; {2859#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,579 INFO L273 TraceCheckUtils]: 45: Hoare triple {2859#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0))} assume true; {2859#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,580 INFO L273 TraceCheckUtils]: 46: Hoare triple {2859#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {2859#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:27,582 INFO L273 TraceCheckUtils]: 47: Hoare triple {2859#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0))} ~i~0 := 0; {2872#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} is VALID [2018-11-14 18:52:27,583 INFO L273 TraceCheckUtils]: 48: Hoare triple {2872#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} assume true; {2872#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} is VALID [2018-11-14 18:52:27,585 INFO L273 TraceCheckUtils]: 49: Hoare triple {2872#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {2872#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} is VALID [2018-11-14 18:52:27,586 INFO L273 TraceCheckUtils]: 50: Hoare triple {2872#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} assume #t~short30; {2872#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} is VALID [2018-11-14 18:52:27,588 INFO L256 TraceCheckUtils]: 51: Hoare triple {2872#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {2885#(exists ((v_prenex_6 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (<= 1 v_prenex_6) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* 20 v_prenex_6) (- 4))))))} is VALID [2018-11-14 18:52:27,589 INFO L273 TraceCheckUtils]: 52: Hoare triple {2885#(exists ((v_prenex_6 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (<= 1 v_prenex_6) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* 20 v_prenex_6) (- 4))))))} ~cond := #in~cond; {2885#(exists ((v_prenex_6 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (<= 1 v_prenex_6) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* 20 v_prenex_6) (- 4))))))} is VALID [2018-11-14 18:52:27,589 INFO L273 TraceCheckUtils]: 53: Hoare triple {2885#(exists ((v_prenex_6 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (<= 1 v_prenex_6) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* 20 v_prenex_6) (- 4))))))} assume !(~cond == 0); {2885#(exists ((v_prenex_6 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (<= 1 v_prenex_6) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* 20 v_prenex_6) (- 4))))))} is VALID [2018-11-14 18:52:27,590 INFO L273 TraceCheckUtils]: 54: Hoare triple {2885#(exists ((v_prenex_6 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (<= 1 v_prenex_6) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* 20 v_prenex_6) (- 4))))))} assume true; {2885#(exists ((v_prenex_6 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (<= 1 v_prenex_6) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* 20 v_prenex_6) (- 4))))))} is VALID [2018-11-14 18:52:27,591 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {2885#(exists ((v_prenex_6 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (<= 1 v_prenex_6) (<= 5 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* 20 v_prenex_6) (- 4))))))} {2872#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} #167#return; {2872#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} is VALID [2018-11-14 18:52:27,591 INFO L273 TraceCheckUtils]: 56: Hoare triple {2872#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} havoc #t~mem28;havoc #t~short30;havoc #t~mem29; {2872#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} is VALID [2018-11-14 18:52:27,592 INFO L273 TraceCheckUtils]: 57: Hoare triple {2872#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} #t~post27 := ~i~0;~i~0 := #t~post27 + 1;havoc #t~post27; {2904#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} is VALID [2018-11-14 18:52:27,593 INFO L273 TraceCheckUtils]: 58: Hoare triple {2904#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} assume true; {2904#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} is VALID [2018-11-14 18:52:27,594 INFO L273 TraceCheckUtils]: 59: Hoare triple {2904#(and (<= 5 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_6 Int)) (and (<= 1 v_prenex_6) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_6) (- 4)))))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {2720#|main_#t~short30|} is VALID [2018-11-14 18:52:27,595 INFO L273 TraceCheckUtils]: 60: Hoare triple {2720#|main_#t~short30|} assume !#t~short30;call #t~mem29 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem29 == 0; {2703#false} is VALID [2018-11-14 18:52:27,595 INFO L256 TraceCheckUtils]: 61: Hoare triple {2703#false} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {2703#false} is VALID [2018-11-14 18:52:27,595 INFO L273 TraceCheckUtils]: 62: Hoare triple {2703#false} ~cond := #in~cond; {2703#false} is VALID [2018-11-14 18:52:27,595 INFO L273 TraceCheckUtils]: 63: Hoare triple {2703#false} assume ~cond == 0; {2703#false} is VALID [2018-11-14 18:52:27,596 INFO L273 TraceCheckUtils]: 64: Hoare triple {2703#false} assume !false; {2703#false} is VALID [2018-11-14 18:52:27,612 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 18:52:27,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:52:27,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 13] total 29 [2018-11-14 18:52:27,634 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 65 [2018-11-14 18:52:27,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:52:27,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-14 18:52:27,941 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:52:27,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-14 18:52:27,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-14 18:52:27,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=706, Unknown=0, NotChecked=0, Total=812 [2018-11-14 18:52:27,943 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand 29 states. [2018-11-14 18:52:28,810 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 45 [2018-11-14 18:52:30,312 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 34 [2018-11-14 18:52:33,526 WARN L179 SmtUtils]: Spent 430.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 39 [2018-11-14 18:52:35,622 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 41 [2018-11-14 18:52:36,973 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 35 [2018-11-14 18:52:39,148 WARN L179 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 34 [2018-11-14 18:52:40,592 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 42 [2018-11-14 18:52:41,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:41,978 INFO L93 Difference]: Finished difference Result 183 states and 219 transitions. [2018-11-14 18:52:41,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-14 18:52:41,978 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 65 [2018-11-14 18:52:41,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:52:41,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 18:52:41,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 211 transitions. [2018-11-14 18:52:41,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 18:52:41,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 211 transitions. [2018-11-14 18:52:41,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 211 transitions. [2018-11-14 18:52:42,493 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:52:42,497 INFO L225 Difference]: With dead ends: 183 [2018-11-14 18:52:42,497 INFO L226 Difference]: Without dead ends: 166 [2018-11-14 18:52:42,498 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 56 SyntacticMatches, 15 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=882, Invalid=2778, Unknown=0, NotChecked=0, Total=3660 [2018-11-14 18:52:42,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-11-14 18:52:42,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 74. [2018-11-14 18:52:42,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:52:42,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand 74 states. [2018-11-14 18:52:42,868 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 74 states. [2018-11-14 18:52:42,869 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 74 states. [2018-11-14 18:52:42,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:42,876 INFO L93 Difference]: Finished difference Result 166 states and 199 transitions. [2018-11-14 18:52:42,877 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 199 transitions. [2018-11-14 18:52:42,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:42,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:42,878 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 166 states. [2018-11-14 18:52:42,878 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 166 states. [2018-11-14 18:52:42,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:42,885 INFO L93 Difference]: Finished difference Result 166 states and 199 transitions. [2018-11-14 18:52:42,885 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 199 transitions. [2018-11-14 18:52:42,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:42,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:42,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:52:42,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:52:42,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 18:52:42,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions. [2018-11-14 18:52:42,890 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 65 [2018-11-14 18:52:42,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:52:42,890 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions. [2018-11-14 18:52:42,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-14 18:52:42,890 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2018-11-14 18:52:42,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-14 18:52:42,891 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:52:42,892 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:52:42,892 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:52:42,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:52:42,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1678056106, now seen corresponding path program 2 times [2018-11-14 18:52:42,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:52:42,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:52:42,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:42,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:52:42,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:42,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:52:44,191 INFO L256 TraceCheckUtils]: 0: Hoare triple {3655#true} call ULTIMATE.init(); {3655#true} is VALID [2018-11-14 18:52:44,191 INFO L273 TraceCheckUtils]: 1: Hoare triple {3655#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {3655#true} is VALID [2018-11-14 18:52:44,191 INFO L273 TraceCheckUtils]: 2: Hoare triple {3655#true} assume true; {3655#true} is VALID [2018-11-14 18:52:44,192 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3655#true} {3655#true} #163#return; {3655#true} is VALID [2018-11-14 18:52:44,192 INFO L256 TraceCheckUtils]: 4: Hoare triple {3655#true} call #t~ret31 := main(); {3655#true} is VALID [2018-11-14 18:52:44,192 INFO L273 TraceCheckUtils]: 5: Hoare triple {3655#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {3655#true} is VALID [2018-11-14 18:52:44,199 INFO L273 TraceCheckUtils]: 6: Hoare triple {3655#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL5~0 := 8;~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {3657#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (<= main_~CCCELVOL5~0 8) (<= 8 main_~CCCELVOL5~0))} is VALID [2018-11-14 18:52:44,200 INFO L273 TraceCheckUtils]: 7: Hoare triple {3657#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (<= main_~CCCELVOL5~0 8) (<= 8 main_~CCCELVOL5~0))} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) == 0 then 1 else 0) != 0;~i~0 := 1; {3658#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= main_~CCCELVOL5~0 8) (<= 8 main_~CCCELVOL5~0))} is VALID [2018-11-14 18:52:44,201 INFO L273 TraceCheckUtils]: 8: Hoare triple {3658#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= main_~CCCELVOL5~0 8) (<= 8 main_~CCCELVOL5~0))} assume true; {3658#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= main_~CCCELVOL5~0 8) (<= 8 main_~CCCELVOL5~0))} is VALID [2018-11-14 18:52:44,201 INFO L273 TraceCheckUtils]: 9: Hoare triple {3658#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= main_~CCCELVOL5~0 8) (<= 8 main_~CCCELVOL5~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3658#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= main_~CCCELVOL5~0 8) (<= 8 main_~CCCELVOL5~0))} is VALID [2018-11-14 18:52:44,202 INFO L273 TraceCheckUtils]: 10: Hoare triple {3658#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= main_~CCCELVOL5~0 8) (<= 8 main_~CCCELVOL5~0))} assume ~CCCELVOL5~0 >= ~MINVAL~0;call write~int(~CCCELVOL5~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4); {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:44,203 INFO L273 TraceCheckUtils]: 11: Hoare triple {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} call #t~mem3 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem3, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem3;call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem4, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem4;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem5, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem5;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem6, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem6; {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:44,204 INFO L273 TraceCheckUtils]: 12: Hoare triple {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:44,204 INFO L273 TraceCheckUtils]: 13: Hoare triple {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume true; {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:44,205 INFO L273 TraceCheckUtils]: 14: Hoare triple {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:44,207 INFO L273 TraceCheckUtils]: 15: Hoare triple {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} ~i~0 := 1; {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:44,208 INFO L273 TraceCheckUtils]: 16: Hoare triple {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume true; {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:44,211 INFO L273 TraceCheckUtils]: 17: Hoare triple {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:44,212 INFO L273 TraceCheckUtils]: 18: Hoare triple {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4); {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:44,213 INFO L273 TraceCheckUtils]: 19: Hoare triple {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} call #t~mem8 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem8, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem8;call #t~mem9 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem9, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem9;call #t~mem10 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem10, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem10;call #t~mem11 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem11, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem11; {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:44,213 INFO L273 TraceCheckUtils]: 20: Hoare triple {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:44,214 INFO L273 TraceCheckUtils]: 21: Hoare triple {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume true; {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:44,214 INFO L273 TraceCheckUtils]: 22: Hoare triple {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is VALID [2018-11-14 18:52:44,215 INFO L273 TraceCheckUtils]: 23: Hoare triple {3659#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} ~i~0 := 1; {3660#(and (or (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= 0 ~CELLCOUNT~0)) (or (and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:44,216 INFO L273 TraceCheckUtils]: 24: Hoare triple {3660#(and (or (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= 0 ~CELLCOUNT~0)) (or (and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))) (= |main_~#volArray~0.offset| 0))} assume true; {3660#(and (or (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= 0 ~CELLCOUNT~0)) (or (and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:44,217 INFO L273 TraceCheckUtils]: 25: Hoare triple {3660#(and (or (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= 0 ~CELLCOUNT~0)) (or (and (<= 2 ~CELLCOUNT~0) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3661#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:44,219 INFO L273 TraceCheckUtils]: 26: Hoare triple {3661#(and (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~MINVAL~0 5) main_~CCCELVOL3~0) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4); {3662#(and (= |main_~#volArray~0.offset| 0) (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~MINVAL~0 5) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 4)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))))} is VALID [2018-11-14 18:52:44,221 INFO L273 TraceCheckUtils]: 27: Hoare triple {3662#(and (= |main_~#volArray~0.offset| 0) (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~MINVAL~0 5) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 4)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))))} call #t~mem13 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem13, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem13;call #t~mem14 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem14, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem14;call #t~mem15 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem15, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem15;call #t~mem16 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem16, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem16; {3662#(and (= |main_~#volArray~0.offset| 0) (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~MINVAL~0 5) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 4)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))))} is VALID [2018-11-14 18:52:44,223 INFO L273 TraceCheckUtils]: 28: Hoare triple {3662#(and (= |main_~#volArray~0.offset| 0) (or (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 19)) (and (<= (+ main_~MINVAL~0 5) (select (store (store (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 8)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 4)) (select (store (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 20)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 4)))) (+ (* 20 main_~i~0) |main_~#volArray~0.offset| (- 12)))) (= 20 (+ |main_~#volArray~0.offset| (* 20 main_~i~0))))))} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {3663#(and (= |main_~#volArray~0.offset| 0) (or (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 39))))} is VALID [2018-11-14 18:52:44,224 INFO L273 TraceCheckUtils]: 29: Hoare triple {3663#(and (= |main_~#volArray~0.offset| 0) (or (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 39))))} assume true; {3663#(and (= |main_~#volArray~0.offset| 0) (or (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 39))))} is VALID [2018-11-14 18:52:44,225 INFO L273 TraceCheckUtils]: 30: Hoare triple {3663#(and (= |main_~#volArray~0.offset| 0) (or (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (and (<= 1 (div ~CELLCOUNT~0 5)) (<= (+ |main_~#volArray~0.offset| (* 20 main_~i~0)) 39))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:44,226 INFO L273 TraceCheckUtils]: 31: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} ~i~0 := 1; {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:44,227 INFO L273 TraceCheckUtils]: 32: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} assume true; {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:44,228 INFO L273 TraceCheckUtils]: 33: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:44,229 INFO L273 TraceCheckUtils]: 34: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4); {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:44,230 INFO L273 TraceCheckUtils]: 35: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} call #t~mem18 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem18, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem18;call #t~mem19 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem19, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem19;call #t~mem20 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem20, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem20;call #t~mem21 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem21, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem21; {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:44,231 INFO L273 TraceCheckUtils]: 36: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:44,232 INFO L273 TraceCheckUtils]: 37: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} assume true; {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:44,233 INFO L273 TraceCheckUtils]: 38: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:44,233 INFO L273 TraceCheckUtils]: 39: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} ~i~0 := 1; {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:44,236 INFO L273 TraceCheckUtils]: 40: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} assume true; {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:44,237 INFO L273 TraceCheckUtils]: 41: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:44,240 INFO L273 TraceCheckUtils]: 42: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4); {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:44,240 INFO L273 TraceCheckUtils]: 43: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} call #t~mem23 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem23, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem23;call #t~mem24 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem24, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem24;call #t~mem25 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem25, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem25;call #t~mem26 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem26, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem26; {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:44,241 INFO L273 TraceCheckUtils]: 44: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} #t~post22 := ~i~0;~i~0 := #t~post22 + 1;havoc #t~post22; {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:44,242 INFO L273 TraceCheckUtils]: 45: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} assume true; {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:44,243 INFO L273 TraceCheckUtils]: 46: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:44,243 INFO L273 TraceCheckUtils]: 47: Hoare triple {3664#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0))} ~i~0 := 0; {3665#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 18:52:44,244 INFO L273 TraceCheckUtils]: 48: Hoare triple {3665#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume true; {3665#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 18:52:44,245 INFO L273 TraceCheckUtils]: 49: Hoare triple {3665#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {3665#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 18:52:44,246 INFO L273 TraceCheckUtils]: 50: Hoare triple {3665#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume #t~short30; {3665#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 18:52:44,246 INFO L256 TraceCheckUtils]: 51: Hoare triple {3665#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {3655#true} is VALID [2018-11-14 18:52:44,246 INFO L273 TraceCheckUtils]: 52: Hoare triple {3655#true} ~cond := #in~cond; {3655#true} is VALID [2018-11-14 18:52:44,247 INFO L273 TraceCheckUtils]: 53: Hoare triple {3655#true} assume !(~cond == 0); {3655#true} is VALID [2018-11-14 18:52:44,247 INFO L273 TraceCheckUtils]: 54: Hoare triple {3655#true} assume true; {3655#true} is VALID [2018-11-14 18:52:44,248 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {3655#true} {3665#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} #167#return; {3665#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 18:52:44,249 INFO L273 TraceCheckUtils]: 56: Hoare triple {3665#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} havoc #t~mem28;havoc #t~short30;havoc #t~mem29; {3665#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 18:52:44,250 INFO L273 TraceCheckUtils]: 57: Hoare triple {3665#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) 8)) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} #t~post27 := ~i~0;~i~0 := #t~post27 + 1;havoc #t~post27; {3666#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-14 18:52:44,250 INFO L273 TraceCheckUtils]: 58: Hoare triple {3666#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) 4))))} assume true; {3666#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-14 18:52:44,251 INFO L273 TraceCheckUtils]: 59: Hoare triple {3666#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) 4))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {3666#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-14 18:52:44,252 INFO L273 TraceCheckUtils]: 60: Hoare triple {3666#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) 4))))} assume #t~short30; {3666#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-14 18:52:44,252 INFO L256 TraceCheckUtils]: 61: Hoare triple {3666#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) 4))))} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {3655#true} is VALID [2018-11-14 18:52:44,253 INFO L273 TraceCheckUtils]: 62: Hoare triple {3655#true} ~cond := #in~cond; {3655#true} is VALID [2018-11-14 18:52:44,253 INFO L273 TraceCheckUtils]: 63: Hoare triple {3655#true} assume !(~cond == 0); {3655#true} is VALID [2018-11-14 18:52:44,253 INFO L273 TraceCheckUtils]: 64: Hoare triple {3655#true} assume true; {3655#true} is VALID [2018-11-14 18:52:44,254 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {3655#true} {3666#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) 4))))} #167#return; {3666#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-14 18:52:44,255 INFO L273 TraceCheckUtils]: 66: Hoare triple {3666#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) 4))))} havoc #t~mem28;havoc #t~short30;havoc #t~mem29; {3666#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) 4))))} is VALID [2018-11-14 18:52:44,256 INFO L273 TraceCheckUtils]: 67: Hoare triple {3666#(and (= |main_~#volArray~0.offset| 0) (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) 4))))} #t~post27 := ~i~0;~i~0 := #t~post27 + 1;havoc #t~post27; {3667#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 4 main_~i~0)))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:44,257 INFO L273 TraceCheckUtils]: 68: Hoare triple {3667#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 4 main_~i~0)))) (= |main_~#volArray~0.offset| 0))} assume true; {3667#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 4 main_~i~0)))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:44,258 INFO L273 TraceCheckUtils]: 69: Hoare triple {3667#(and (<= (+ main_~MINVAL~0 5) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 4 main_~i~0)))) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {3668#(and (= |main_~#volArray~0.offset| 0) |main_#t~short30|)} is VALID [2018-11-14 18:52:44,258 INFO L273 TraceCheckUtils]: 70: Hoare triple {3668#(and (= |main_~#volArray~0.offset| 0) |main_#t~short30|)} assume !#t~short30;call #t~mem29 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem29 == 0; {3656#false} is VALID [2018-11-14 18:52:44,259 INFO L256 TraceCheckUtils]: 71: Hoare triple {3656#false} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {3656#false} is VALID [2018-11-14 18:52:44,259 INFO L273 TraceCheckUtils]: 72: Hoare triple {3656#false} ~cond := #in~cond; {3656#false} is VALID [2018-11-14 18:52:44,259 INFO L273 TraceCheckUtils]: 73: Hoare triple {3656#false} assume ~cond == 0; {3656#false} is VALID [2018-11-14 18:52:44,259 INFO L273 TraceCheckUtils]: 74: Hoare triple {3656#false} assume !false; {3656#false} is VALID [2018-11-14 18:52:44,278 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-14 18:52:44,278 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 18:52:44,278 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-14 18:52:44,287 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:52:44,329 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:52:44,329 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:52:44,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:52:44,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:52:44,507 INFO L477 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 16 treesize of output 13 [2018-11-14 18:52:44,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-14 18:52:44,516 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:44,518 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:44,531 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-14 18:52:44,531 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-11-14 18:52:44,536 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:52:44,580 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:52:44,582 INFO L477 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 151 treesize of output 222 [2018-11-14 18:52:44,606 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:44,607 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:44,608 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:44,618 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 96 treesize of output 101 [2018-11-14 18:52:44,633 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:44,634 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:44,635 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:44,643 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 71 [2018-11-14 18:52:44,660 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:44,661 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:44,663 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:44,670 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 53 [2018-11-14 18:52:44,685 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:44,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 27 [2018-11-14 18:52:44,694 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:44,699 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:44,702 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:44,704 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:44,707 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:44,714 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:44,715 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 1 variables, input treesize:157, output treesize:16 [2018-11-14 18:52:44,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-11-14 18:52:44,814 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:44,817 INFO L477 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 21 treesize of output 33 [2018-11-14 18:52:44,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:44,827 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:44,838 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-14 18:52:44,839 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2018-11-14 18:52:44,843 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:52:44,862 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:52:44,864 INFO L477 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 273 treesize of output 466 [2018-11-14 18:52:44,888 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:44,889 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:44,890 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:44,898 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 164 [2018-11-14 18:52:44,925 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:44,927 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:44,937 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 93 [2018-11-14 18:52:44,964 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:44,966 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:44,990 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 81 [2018-11-14 18:52:45,004 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,005 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,013 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 68 [2018-11-14 18:52:45,018 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:45,043 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,047 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 33 [2018-11-14 18:52:45,050 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:45,059 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:45,072 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:45,078 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:45,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:45,088 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-14 18:52:45,088 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:282, output treesize:16 [2018-11-14 18:52:45,091 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 18:52:45,123 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-11-14 18:52:45,129 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,130 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,133 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 43 [2018-11-14 18:52:45,136 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:45,145 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:45,157 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:45,158 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-14 18:52:45,216 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 18:52:45,218 INFO L477 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 285 treesize of output 476 [2018-11-14 18:52:45,251 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,253 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,254 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,255 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,256 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,257 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,261 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 188 treesize of output 228 [2018-11-14 18:52:45,314 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,315 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,316 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,317 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,319 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,323 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,335 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 157 [2018-11-14 18:52:45,377 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,378 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,379 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,380 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,384 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,388 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,410 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 53 treesize of output 141 [2018-11-14 18:52:45,429 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,430 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,433 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 131 treesize of output 135 [2018-11-14 18:52:45,446 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:45,496 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,497 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,498 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,501 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 18:52:45,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 89 [2018-11-14 18:52:45,509 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-14 18:52:45,528 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:45,535 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:45,541 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:45,547 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 18:52:45,561 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-14 18:52:45,561 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 2 variables, input treesize:294, output treesize:31 [2018-11-14 18:52:46,212 INFO L256 TraceCheckUtils]: 0: Hoare triple {3655#true} call ULTIMATE.init(); {3655#true} is VALID [2018-11-14 18:52:46,213 INFO L273 TraceCheckUtils]: 1: Hoare triple {3655#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {3655#true} is VALID [2018-11-14 18:52:46,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {3655#true} assume true; {3655#true} is VALID [2018-11-14 18:52:46,213 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3655#true} {3655#true} #163#return; {3655#true} is VALID [2018-11-14 18:52:46,213 INFO L256 TraceCheckUtils]: 4: Hoare triple {3655#true} call #t~ret31 := main(); {3655#true} is VALID [2018-11-14 18:52:46,213 INFO L273 TraceCheckUtils]: 5: Hoare triple {3655#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {3655#true} is VALID [2018-11-14 18:52:46,214 INFO L273 TraceCheckUtils]: 6: Hoare triple {3655#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL5~0 := 8;~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 18:52:46,215 INFO L273 TraceCheckUtils]: 7: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) == 0 then 1 else 0) != 0;~i~0 := 1; {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 18:52:46,216 INFO L273 TraceCheckUtils]: 8: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume true; {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 18:52:46,216 INFO L273 TraceCheckUtils]: 9: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 18:52:46,217 INFO L273 TraceCheckUtils]: 10: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume ~CCCELVOL5~0 >= ~MINVAL~0;call write~int(~CCCELVOL5~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4); {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 18:52:46,217 INFO L273 TraceCheckUtils]: 11: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} call #t~mem3 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem3, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem3;call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem4, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem4;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem5, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem5;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem6, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem6; {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 18:52:46,218 INFO L273 TraceCheckUtils]: 12: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 18:52:46,218 INFO L273 TraceCheckUtils]: 13: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume true; {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 18:52:46,219 INFO L273 TraceCheckUtils]: 14: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 18:52:46,220 INFO L273 TraceCheckUtils]: 15: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} ~i~0 := 1; {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 18:52:46,221 INFO L273 TraceCheckUtils]: 16: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume true; {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 18:52:46,221 INFO L273 TraceCheckUtils]: 17: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 18:52:46,222 INFO L273 TraceCheckUtils]: 18: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4); {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 18:52:46,223 INFO L273 TraceCheckUtils]: 19: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} call #t~mem8 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem8, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem8;call #t~mem9 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem9, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem9;call #t~mem10 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem10, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem10;call #t~mem11 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem11, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem11; {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 18:52:46,224 INFO L273 TraceCheckUtils]: 20: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} #t~post7 := ~i~0;~i~0 := #t~post7 + 1;havoc #t~post7; {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 18:52:46,225 INFO L273 TraceCheckUtils]: 21: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume true; {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 18:52:46,226 INFO L273 TraceCheckUtils]: 22: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 18:52:46,226 INFO L273 TraceCheckUtils]: 23: Hoare triple {3690#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} ~i~0 := 1; {3742#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 18:52:46,227 INFO L273 TraceCheckUtils]: 24: Hoare triple {3742#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume true; {3742#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 18:52:46,228 INFO L273 TraceCheckUtils]: 25: Hoare triple {3742#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3742#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 18:52:46,229 INFO L273 TraceCheckUtils]: 26: Hoare triple {3742#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4); {3752#(and (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 18:52:46,230 INFO L273 TraceCheckUtils]: 27: Hoare triple {3752#(and (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 12)))) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} call #t~mem13 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem13, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem13;call #t~mem14 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem14, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem14;call #t~mem15 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem15, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem15;call #t~mem16 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem16, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem16; {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,231 INFO L273 TraceCheckUtils]: 28: Hoare triple {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} #t~post12 := ~i~0;~i~0 := #t~post12 + 1;havoc #t~post12; {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,232 INFO L273 TraceCheckUtils]: 29: Hoare triple {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume true; {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,233 INFO L273 TraceCheckUtils]: 30: Hoare triple {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,234 INFO L273 TraceCheckUtils]: 31: Hoare triple {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} ~i~0 := 1; {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,234 INFO L273 TraceCheckUtils]: 32: Hoare triple {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume true; {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,235 INFO L273 TraceCheckUtils]: 33: Hoare triple {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,237 INFO L273 TraceCheckUtils]: 34: Hoare triple {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4); {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,238 INFO L273 TraceCheckUtils]: 35: Hoare triple {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} call #t~mem18 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem18, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem18;call #t~mem19 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem19, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem19;call #t~mem20 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem20, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem20;call #t~mem21 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem21, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem21; {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,238 INFO L273 TraceCheckUtils]: 36: Hoare triple {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} #t~post17 := ~i~0;~i~0 := #t~post17 + 1;havoc #t~post17; {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,239 INFO L273 TraceCheckUtils]: 37: Hoare triple {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume true; {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,240 INFO L273 TraceCheckUtils]: 38: Hoare triple {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,241 INFO L273 TraceCheckUtils]: 39: Hoare triple {3756#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} ~i~0 := 1; {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,242 INFO L273 TraceCheckUtils]: 40: Hoare triple {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume true; {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,242 INFO L273 TraceCheckUtils]: 41: Hoare triple {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,244 INFO L273 TraceCheckUtils]: 42: Hoare triple {3769#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4); {3803#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,246 INFO L273 TraceCheckUtils]: 43: Hoare triple {3803#(and (<= 1 main_~i~0) (<= main_~MINVAL~0 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} call #t~mem23 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);call write~int(#t~mem23, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4);havoc #t~mem23;call #t~mem24 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem24, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem24;call #t~mem25 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem25, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem25;call #t~mem26 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem26, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem26; {3807#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,247 INFO L273 TraceCheckUtils]: 44: Hoare triple {3807#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} #t~post22 := ~i~0;~i~0 := #t~post22 + 1;havoc #t~post22; {3807#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,248 INFO L273 TraceCheckUtils]: 45: Hoare triple {3807#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume true; {3807#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,249 INFO L273 TraceCheckUtils]: 46: Hoare triple {3807#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {3807#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,250 INFO L273 TraceCheckUtils]: 47: Hoare triple {3807#(and (<= main_~MINVAL~0 2) (exists ((main_~i~0 Int)) (and (<= 1 main_~i~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 main_~i~0) (- 4)))))) (= |main_~#volArray~0.offset| 0) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} ~i~0 := 0; {3820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:46,251 INFO L273 TraceCheckUtils]: 48: Hoare triple {3820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 0))} assume true; {3820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:46,252 INFO L273 TraceCheckUtils]: 49: Hoare triple {3820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {3820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:46,253 INFO L273 TraceCheckUtils]: 50: Hoare triple {3820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 0))} assume #t~short30; {3820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:46,255 INFO L256 TraceCheckUtils]: 51: Hoare triple {3820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} is VALID [2018-11-14 18:52:46,256 INFO L273 TraceCheckUtils]: 52: Hoare triple {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} ~cond := #in~cond; {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} is VALID [2018-11-14 18:52:46,257 INFO L273 TraceCheckUtils]: 53: Hoare triple {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} assume !(~cond == 0); {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} is VALID [2018-11-14 18:52:46,257 INFO L273 TraceCheckUtils]: 54: Hoare triple {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} assume true; {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} is VALID [2018-11-14 18:52:46,258 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} {3820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 0))} #167#return; {3820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:46,258 INFO L273 TraceCheckUtils]: 56: Hoare triple {3820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 0))} havoc #t~mem28;havoc #t~short30;havoc #t~mem29; {3820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 0))} is VALID [2018-11-14 18:52:46,259 INFO L273 TraceCheckUtils]: 57: Hoare triple {3820#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 0))} #t~post27 := ~i~0;~i~0 := #t~post27 + 1;havoc #t~post27; {3852#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,260 INFO L273 TraceCheckUtils]: 58: Hoare triple {3852#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume true; {3852#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,261 INFO L273 TraceCheckUtils]: 59: Hoare triple {3852#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {3852#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,262 INFO L273 TraceCheckUtils]: 60: Hoare triple {3852#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume #t~short30; {3852#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,264 INFO L256 TraceCheckUtils]: 61: Hoare triple {3852#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} is VALID [2018-11-14 18:52:46,265 INFO L273 TraceCheckUtils]: 62: Hoare triple {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} ~cond := #in~cond; {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} is VALID [2018-11-14 18:52:46,266 INFO L273 TraceCheckUtils]: 63: Hoare triple {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} assume !(~cond == 0); {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} is VALID [2018-11-14 18:52:46,266 INFO L273 TraceCheckUtils]: 64: Hoare triple {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} assume true; {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} is VALID [2018-11-14 18:52:46,267 INFO L268 TraceCheckUtils]: 65: Hoare quadruple {3833#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int) (v_prenex_10 Int)) (and (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* 20 v_prenex_10) (- 4))) 0) (<= 1 v_prenex_10)))} {3852#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} #167#return; {3852#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,268 INFO L273 TraceCheckUtils]: 66: Hoare triple {3852#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} havoc #t~mem28;havoc #t~short30;havoc #t~mem29; {3852#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,270 INFO L273 TraceCheckUtils]: 67: Hoare triple {3852#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} #t~post27 := ~i~0;~i~0 := #t~post27 + 1;havoc #t~post27; {3883#(and (= main_~i~0 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,271 INFO L273 TraceCheckUtils]: 68: Hoare triple {3883#(and (= main_~i~0 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume true; {3883#(and (= main_~i~0 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} is VALID [2018-11-14 18:52:46,272 INFO L273 TraceCheckUtils]: 69: Hoare triple {3883#(and (= main_~i~0 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_10 Int)) (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 20 v_prenex_10) (- 4)))) (<= 1 v_prenex_10))) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem28 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem28 >= ~MINVAL~0; {3890#|main_#t~short30|} is VALID [2018-11-14 18:52:46,273 INFO L273 TraceCheckUtils]: 70: Hoare triple {3890#|main_#t~short30|} assume !#t~short30;call #t~mem29 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short30 := #t~mem29 == 0; {3656#false} is VALID [2018-11-14 18:52:46,273 INFO L256 TraceCheckUtils]: 71: Hoare triple {3656#false} call __VERIFIER_assert((if #t~short30 then 1 else 0)); {3656#false} is VALID [2018-11-14 18:52:46,273 INFO L273 TraceCheckUtils]: 72: Hoare triple {3656#false} ~cond := #in~cond; {3656#false} is VALID [2018-11-14 18:52:46,273 INFO L273 TraceCheckUtils]: 73: Hoare triple {3656#false} assume ~cond == 0; {3656#false} is VALID [2018-11-14 18:52:46,274 INFO L273 TraceCheckUtils]: 74: Hoare triple {3656#false} assume !false; {3656#false} is VALID [2018-11-14 18:52:46,297 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 18:52:46,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:52:46,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-11-14 18:52:46,320 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 75 [2018-11-14 18:52:46,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:52:46,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 18:52:46,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:52:46,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 18:52:46,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 18:52:46,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2018-11-14 18:52:46,492 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand 26 states. [2018-11-14 18:52:52,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:52,771 INFO L93 Difference]: Finished difference Result 165 states and 191 transitions. [2018-11-14 18:52:52,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 18:52:52,771 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 75 [2018-11-14 18:52:52,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:52:52,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 18:52:52,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 169 transitions. [2018-11-14 18:52:52,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 18:52:52,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 169 transitions. [2018-11-14 18:52:52,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 169 transitions. [2018-11-14 18:52:53,213 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:52:53,216 INFO L225 Difference]: With dead ends: 165 [2018-11-14 18:52:53,216 INFO L226 Difference]: Without dead ends: 117 [2018-11-14 18:52:53,217 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 62 SyntacticMatches, 10 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 402 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=406, Invalid=1400, Unknown=0, NotChecked=0, Total=1806 [2018-11-14 18:52:53,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-14 18:52:53,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 80. [2018-11-14 18:52:53,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:52:53,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 80 states. [2018-11-14 18:52:53,459 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 80 states. [2018-11-14 18:52:53,460 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 80 states. [2018-11-14 18:52:53,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:53,465 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2018-11-14 18:52:53,465 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 132 transitions. [2018-11-14 18:52:53,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:53,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:53,466 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 117 states. [2018-11-14 18:52:53,466 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 117 states. [2018-11-14 18:52:53,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:52:53,470 INFO L93 Difference]: Finished difference Result 117 states and 132 transitions. [2018-11-14 18:52:53,471 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 132 transitions. [2018-11-14 18:52:53,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:52:53,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:52:53,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:52:53,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:52:53,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 18:52:53,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2018-11-14 18:52:53,474 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 75 [2018-11-14 18:52:53,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:52:53,475 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2018-11-14 18:52:53,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 18:52:53,475 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2018-11-14 18:52:53,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-14 18:52:53,476 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:52:53,476 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:52:53,477 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:52:53,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:52:53,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1680514337, now seen corresponding path program 3 times [2018-11-14 18:52:53,477 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:52:53,477 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:52:53,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:53,478 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:52:53,478 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:52:53,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:52:54,673 INFO L256 TraceCheckUtils]: 0: Hoare triple {4483#true} call ULTIMATE.init(); {4483#true} is VALID [2018-11-14 18:52:54,674 INFO L273 TraceCheckUtils]: 1: Hoare triple {4483#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {4483#true} is VALID [2018-11-14 18:52:54,674 INFO L273 TraceCheckUtils]: 2: Hoare triple {4483#true} assume true; {4483#true} is VALID [2018-11-14 18:52:54,674 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4483#true} {4483#true} #163#return; {4483#true} is VALID [2018-11-14 18:52:54,675 INFO L256 TraceCheckUtils]: 4: Hoare triple {4483#true} call #t~ret31 := main(); {4483#true} is VALID [2018-11-14 18:52:54,675 INFO L273 TraceCheckUtils]: 5: Hoare triple {4483#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {4483#true} is VALID [2018-11-14 18:52:54,676 INFO L273 TraceCheckUtils]: 6: Hoare triple {4483#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL5~0 := 8;~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {4485#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0))} is VALID [2018-11-14 18:52:54,677 INFO L273 TraceCheckUtils]: 7: Hoare triple {4485#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0))} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 % 5 - 5 else ~CELLCOUNT~0 % 5) == 0 then 1 else 0) != 0;~i~0 := 1; {4486#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0))} is VALID [2018-11-14 18:52:54,677 INFO L273 TraceCheckUtils]: 8: Hoare triple {4486#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0))} assume true; {4486#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0))} is VALID [2018-11-14 18:52:54,678 INFO L273 TraceCheckUtils]: 9: Hoare triple {4486#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 5 != 0 then ~CELLCOUNT~0 / 5 + 1 else ~CELLCOUNT~0 / 5)); {4486#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0))} is VALID [2018-11-14 18:52:54,679 INFO L273 TraceCheckUtils]: 10: Hoare triple {4486#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0))} assume ~CCCELVOL5~0 >= ~MINVAL~0;call write~int(~CCCELVOL5~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 5) * 4, 4); {4486#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0))} is VALID [2018-11-14 18:52:54,679 INFO L273 TraceCheckUtils]: 11: Hoare triple {4486#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0))} call #t~mem3 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);call write~int(#t~mem3, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 4) * 4, 4);havoc #t~mem3;call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);call write~int(#t~mem4, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 3) * 4, 4);havoc #t~mem4;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);call write~int(#t~mem5, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 2) * 4, 4);havoc #t~mem5;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);call write~int(#t~mem6, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 5 - 1) * 4, 4);havoc #t~mem6; {4486#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0))} is VALID [2018-11-14 18:52:54,681 INFO L273 TraceCheckUtils]: 12: Hoare triple {4486#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))) (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4487#(and (or (and (<= (div (+ (* 5 main_~i~0) (+ (- ~CELLCOUNT~0) 1)) 5) (div (+ ~CELLCOUNT~0 3) 5)) (or (and (<= (+ main_~MINVAL~0 1) main_~CCCELVOL2~0) (= 20 (* 20 (div (+ ~CELLCOUNT~0 3) 5)))) (<= (+ (div (+ (* 5 main_~i~0) (+ (- ~CELLCOUNT~0) 1)) 5) 1) (div (+ ~CELLCOUNT~0 3) 5)))) (<= (* 5 main_~i~0) (+ ~CELLCOUNT~0 3))) (= ~CELLCOUNT~0 (* 5 (div ~CELLCOUNT~0 5))))} is INVALID [2018-11-14 18:52:54,683 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: invalid Hoare triple in Craig at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckUtils.checkInterpolantsInductivityForward(TraceCheckUtils.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:276) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 18:52:54,687 INFO L168 Benchmark]: Toolchain (without parser) took 58884.46 ms. Allocated memory was 1.5 GB in the beginning and 2.8 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -481.5 MB). Peak memory consumption was 816.1 MB. Max. memory is 7.1 GB. [2018-11-14 18:52:54,688 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 18:52:54,688 INFO L168 Benchmark]: CACSL2BoogieTranslator took 500.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 18:52:54,688 INFO L168 Benchmark]: Boogie Preprocessor took 169.69 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -793.5 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. [2018-11-14 18:52:54,689 INFO L168 Benchmark]: RCFGBuilder took 1291.01 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 55.0 MB). Peak memory consumption was 55.0 MB. Max. memory is 7.1 GB. [2018-11-14 18:52:54,689 INFO L168 Benchmark]: TraceAbstraction took 56919.16 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 563.6 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 246.4 MB). Peak memory consumption was 810.0 MB. Max. memory is 7.1 GB. [2018-11-14 18:52:54,691 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 500.35 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 169.69 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 734.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -793.5 MB). Peak memory consumption was 14.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1291.01 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 55.0 MB). Peak memory consumption was 55.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 56919.16 ms. Allocated memory was 2.3 GB in the beginning and 2.8 GB in the end (delta: 563.6 MB). Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 246.4 MB). Peak memory consumption was 810.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: invalid Hoare triple in Craig de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: invalid Hoare triple in Craig: de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckUtils.checkInterpolantsInductivityForward(TraceCheckUtils.java:199) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...