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.epf -i ../../../trunk/examples/svcomp/array-tiling/pr4_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:05:09,666 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:05:09,668 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:05:09,680 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:05:09,681 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:05:09,682 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:05:09,683 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:05:09,686 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:05:09,688 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:05:09,689 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:05:09,690 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:05:09,690 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:05:09,691 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:05:09,693 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:05:09,694 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:05:09,695 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:05:09,696 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:05:09,699 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:05:09,701 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:05:09,706 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:05:09,711 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:05:09,713 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:05:09,718 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:05:09,719 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:05:09,719 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:05:09,725 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:05:09,726 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:05:09,727 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:05:09,730 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:05:09,731 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:05:09,734 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:05:09,735 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:05:09,735 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:05:09,735 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:05:09,736 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:05:09,739 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:05:09,740 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:05:09,758 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:05:09,758 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:05:09,759 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:05:09,759 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:05:09,760 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:05:09,760 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:05:09,760 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:05:09,760 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:05:09,761 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:05:09,761 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:05:09,761 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:05:09,761 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:05:09,761 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:05:09,761 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:05:09,762 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:05:09,762 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:05:09,762 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:05:09,762 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:05:09,762 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:05:09,763 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:05:09,763 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:05:09,763 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:05:09,763 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:05:09,763 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:05:09,764 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:05:09,764 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:05:09,764 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:05:09,764 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:05:09,764 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:05:09,764 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:05:09,821 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:05:09,843 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:05:09,846 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:05:09,849 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:05:09,849 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:05:09,850 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/pr4_true-unreach-call.i [2018-11-14 17:05:09,922 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5506c84dd/7ebfb968f0af4dd6a057b8132e6dd567/FLAGb664942bf [2018-11-14 17:05:10,402 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:05:10,402 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/pr4_true-unreach-call.i [2018-11-14 17:05:10,410 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5506c84dd/7ebfb968f0af4dd6a057b8132e6dd567/FLAGb664942bf [2018-11-14 17:05:10,428 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5506c84dd/7ebfb968f0af4dd6a057b8132e6dd567 [2018-11-14 17:05:10,438 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:05:10,439 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:05:10,441 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:05:10,441 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:05:10,445 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:05:10,446 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:05:10" (1/1) ... [2018-11-14 17:05:10,450 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@74986fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:05:10, skipping insertion in model container [2018-11-14 17:05:10,451 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:05:10" (1/1) ... [2018-11-14 17:05:10,461 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:05:10,495 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:05:10,724 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:05:10,729 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:05:10,778 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:05:10,811 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:05:10,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:05:10 WrapperNode [2018-11-14 17:05:10,812 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:05:10,813 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:05:10,813 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:05:10,813 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:05:10,830 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:05:10" (1/1) ... [2018-11-14 17:05:10,830 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:05:10" (1/1) ... [2018-11-14 17:05:10,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:05:10" (1/1) ... [2018-11-14 17:05:10,842 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:05:10" (1/1) ... [2018-11-14 17:05:10,874 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:05:10" (1/1) ... [2018-11-14 17:05:10,892 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:05:10" (1/1) ... [2018-11-14 17:05:10,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:05:10" (1/1) ... [2018-11-14 17:05:10,901 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:05:10,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:05:10,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:05:10,906 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:05:10,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:05:10" (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 17:05:11,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:05:11,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:05:11,064 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:05:11,065 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:05:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:05:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 17:05:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:05:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:05:11,065 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:05:11,066 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:05:11,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:05:11,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:05:11,066 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:05:11,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:05:11,066 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:05:11,066 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:05:11,948 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:05:11,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:05:11 BoogieIcfgContainer [2018-11-14 17:05:11,949 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:05:11,950 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:05:11,950 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:05:11,955 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:05:11,955 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:05:10" (1/3) ... [2018-11-14 17:05:11,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a51d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:05:11, skipping insertion in model container [2018-11-14 17:05:11,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:05:10" (2/3) ... [2018-11-14 17:05:11,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11a51d0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:05:11, skipping insertion in model container [2018-11-14 17:05:11,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:05:11" (3/3) ... [2018-11-14 17:05:11,959 INFO L112 eAbstractionObserver]: Analyzing ICFG pr4_true-unreach-call.i [2018-11-14 17:05:11,970 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:05:11,980 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:05:11,998 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:05:12,042 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:05:12,043 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:05:12,044 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:05:12,044 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:05:12,044 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:05:12,045 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:05:12,045 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:05:12,045 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:05:12,045 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:05:12,070 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-14 17:05:12,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 17:05:12,079 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:05:12,081 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:05:12,086 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:05:12,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:05:12,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1675708158, now seen corresponding path program 1 times [2018-11-14 17:05:12,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:05:12,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:05:12,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:12,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:05:12,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:05:12,299 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-14 17:05:12,302 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {37#true} is VALID [2018-11-14 17:05:12,303 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 17:05:12,304 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #91#return; {37#true} is VALID [2018-11-14 17:05:12,304 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret7 := main(); {37#true} is VALID [2018-11-14 17:05:12,304 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {37#true} is VALID [2018-11-14 17:05:12,304 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {37#true} is VALID [2018-11-14 17:05:12,305 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#true} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) == 0 then 1 else 0) != 0;~i~0 := 1; {37#true} is VALID [2018-11-14 17:05:12,306 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-14 17:05:12,307 INFO L273 TraceCheckUtils]: 9: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2018-11-14 17:05:12,307 INFO L273 TraceCheckUtils]: 10: Hoare triple {38#false} assume true; {38#false} is VALID [2018-11-14 17:05:12,307 INFO L273 TraceCheckUtils]: 11: Hoare triple {38#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {38#false} is VALID [2018-11-14 17:05:12,308 INFO L273 TraceCheckUtils]: 12: Hoare triple {38#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {38#false} is VALID [2018-11-14 17:05:12,308 INFO L256 TraceCheckUtils]: 13: Hoare triple {38#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {38#false} is VALID [2018-11-14 17:05:12,308 INFO L273 TraceCheckUtils]: 14: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2018-11-14 17:05:12,309 INFO L273 TraceCheckUtils]: 15: Hoare triple {38#false} assume ~cond == 0; {38#false} is VALID [2018-11-14 17:05:12,309 INFO L273 TraceCheckUtils]: 16: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-14 17:05:12,312 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 17:05:12,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:05:12,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:05:12,320 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-14 17:05:12,326 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:05:12,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:05:12,453 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:05:12,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:05:12,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:05:12,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:05:12,480 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-14 17:05:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:12,777 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2018-11-14 17:05:12,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:05:12,777 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-14 17:05:12,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:05:12,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:05:12,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2018-11-14 17:05:12,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:05:12,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 68 transitions. [2018-11-14 17:05:12,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 68 transitions. [2018-11-14 17:05:13,042 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:05:13,054 INFO L225 Difference]: With dead ends: 53 [2018-11-14 17:05:13,055 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 17:05:13,058 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 17:05:13,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 17:05:13,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-14 17:05:13,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:05:13,106 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-14 17:05:13,106 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 17:05:13,107 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 17:05:13,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:13,111 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-11-14 17:05:13,111 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-14 17:05:13,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:13,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:13,113 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 17:05:13,113 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 17:05:13,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:13,119 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-11-14 17:05:13,120 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-14 17:05:13,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:13,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:13,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:05:13,122 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:05:13,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 17:05:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2018-11-14 17:05:13,135 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 17 [2018-11-14 17:05:13,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:05:13,135 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-14 17:05:13,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:05:13,135 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-14 17:05:13,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 17:05:13,136 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:05:13,141 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:05:13,141 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:05:13,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:05:13,142 INFO L82 PathProgramCache]: Analyzing trace with hash -391908819, now seen corresponding path program 1 times [2018-11-14 17:05:13,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:05:13,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:05:13,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:13,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:05:13,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:13,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:05:13,567 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 11 [2018-11-14 17:05:13,574 INFO L256 TraceCheckUtils]: 0: Hoare triple {197#true} call ULTIMATE.init(); {197#true} is VALID [2018-11-14 17:05:13,574 INFO L273 TraceCheckUtils]: 1: Hoare triple {197#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {197#true} is VALID [2018-11-14 17:05:13,574 INFO L273 TraceCheckUtils]: 2: Hoare triple {197#true} assume true; {197#true} is VALID [2018-11-14 17:05:13,575 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {197#true} {197#true} #91#return; {197#true} is VALID [2018-11-14 17:05:13,575 INFO L256 TraceCheckUtils]: 4: Hoare triple {197#true} call #t~ret7 := main(); {197#true} is VALID [2018-11-14 17:05:13,575 INFO L273 TraceCheckUtils]: 5: Hoare triple {197#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {197#true} is VALID [2018-11-14 17:05:13,576 INFO L273 TraceCheckUtils]: 6: Hoare triple {197#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {199#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-14 17:05:13,577 INFO L273 TraceCheckUtils]: 7: Hoare triple {199#(<= 2 ~CELLCOUNT~0)} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) == 0 then 1 else 0) != 0;~i~0 := 1; {200#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-14 17:05:13,578 INFO L273 TraceCheckUtils]: 8: Hoare triple {200#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} assume true; {200#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-14 17:05:13,582 INFO L273 TraceCheckUtils]: 9: Hoare triple {200#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {198#false} is VALID [2018-11-14 17:05:13,582 INFO L273 TraceCheckUtils]: 10: Hoare triple {198#false} ~i~0 := 0; {198#false} is VALID [2018-11-14 17:05:13,582 INFO L273 TraceCheckUtils]: 11: Hoare triple {198#false} assume true; {198#false} is VALID [2018-11-14 17:05:13,583 INFO L273 TraceCheckUtils]: 12: Hoare triple {198#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {198#false} is VALID [2018-11-14 17:05:13,583 INFO L273 TraceCheckUtils]: 13: Hoare triple {198#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {198#false} is VALID [2018-11-14 17:05:13,583 INFO L256 TraceCheckUtils]: 14: Hoare triple {198#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {198#false} is VALID [2018-11-14 17:05:13,584 INFO L273 TraceCheckUtils]: 15: Hoare triple {198#false} ~cond := #in~cond; {198#false} is VALID [2018-11-14 17:05:13,584 INFO L273 TraceCheckUtils]: 16: Hoare triple {198#false} assume ~cond == 0; {198#false} is VALID [2018-11-14 17:05:13,584 INFO L273 TraceCheckUtils]: 17: Hoare triple {198#false} assume !false; {198#false} is VALID [2018-11-14 17:05:13,586 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 17:05:13,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:05:13,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:05:13,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-14 17:05:13,589 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:05:13,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:05:13,631 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:05:13,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:05:13,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:05:13,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:05:13,633 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 4 states. [2018-11-14 17:05:14,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:14,294 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2018-11-14 17:05:14,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:05:14,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-14 17:05:14,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:05:14,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:05:14,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2018-11-14 17:05:14,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:05:14,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2018-11-14 17:05:14,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 60 transitions. [2018-11-14 17:05:14,420 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:05:14,422 INFO L225 Difference]: With dead ends: 48 [2018-11-14 17:05:14,422 INFO L226 Difference]: Without dead ends: 35 [2018-11-14 17:05:14,423 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:05:14,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-14 17:05:14,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 30. [2018-11-14 17:05:14,443 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:05:14,443 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 30 states. [2018-11-14 17:05:14,443 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 30 states. [2018-11-14 17:05:14,443 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 30 states. [2018-11-14 17:05:14,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:14,446 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2018-11-14 17:05:14,446 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2018-11-14 17:05:14,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:14,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:14,447 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 35 states. [2018-11-14 17:05:14,447 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 35 states. [2018-11-14 17:05:14,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:14,450 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2018-11-14 17:05:14,450 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 45 transitions. [2018-11-14 17:05:14,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:14,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:14,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:05:14,452 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:05:14,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 17:05:14,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2018-11-14 17:05:14,454 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 18 [2018-11-14 17:05:14,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:05:14,455 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2018-11-14 17:05:14,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:05:14,455 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2018-11-14 17:05:14,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 17:05:14,456 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:05:14,456 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] [2018-11-14 17:05:14,456 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:05:14,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:05:14,457 INFO L82 PathProgramCache]: Analyzing trace with hash 721099660, now seen corresponding path program 1 times [2018-11-14 17:05:14,457 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:05:14,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:05:14,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:14,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:05:14,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:14,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:05:14,566 INFO L256 TraceCheckUtils]: 0: Hoare triple {372#true} call ULTIMATE.init(); {372#true} is VALID [2018-11-14 17:05:14,567 INFO L273 TraceCheckUtils]: 1: Hoare triple {372#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {372#true} is VALID [2018-11-14 17:05:14,567 INFO L273 TraceCheckUtils]: 2: Hoare triple {372#true} assume true; {372#true} is VALID [2018-11-14 17:05:14,567 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {372#true} {372#true} #91#return; {372#true} is VALID [2018-11-14 17:05:14,568 INFO L256 TraceCheckUtils]: 4: Hoare triple {372#true} call #t~ret7 := main(); {372#true} is VALID [2018-11-14 17:05:14,568 INFO L273 TraceCheckUtils]: 5: Hoare triple {372#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {372#true} is VALID [2018-11-14 17:05:14,569 INFO L273 TraceCheckUtils]: 6: Hoare triple {372#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {374#(<= (+ main_~CCCELVOL4~0 2) main_~CCCELVOL3~0)} is VALID [2018-11-14 17:05:14,569 INFO L273 TraceCheckUtils]: 7: Hoare triple {374#(<= (+ main_~CCCELVOL4~0 2) main_~CCCELVOL3~0)} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) == 0 then 1 else 0) != 0;~i~0 := 1; {374#(<= (+ main_~CCCELVOL4~0 2) main_~CCCELVOL3~0)} is VALID [2018-11-14 17:05:14,570 INFO L273 TraceCheckUtils]: 8: Hoare triple {374#(<= (+ main_~CCCELVOL4~0 2) main_~CCCELVOL3~0)} assume true; {374#(<= (+ main_~CCCELVOL4~0 2) main_~CCCELVOL3~0)} is VALID [2018-11-14 17:05:14,573 INFO L273 TraceCheckUtils]: 9: Hoare triple {374#(<= (+ main_~CCCELVOL4~0 2) main_~CCCELVOL3~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {374#(<= (+ main_~CCCELVOL4~0 2) main_~CCCELVOL3~0)} is VALID [2018-11-14 17:05:14,593 INFO L273 TraceCheckUtils]: 10: Hoare triple {374#(<= (+ main_~CCCELVOL4~0 2) main_~CCCELVOL3~0)} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {375#(<= (+ main_~MINVAL~0 2) main_~CCCELVOL3~0)} is VALID [2018-11-14 17:05:14,605 INFO L273 TraceCheckUtils]: 11: Hoare triple {375#(<= (+ main_~MINVAL~0 2) main_~CCCELVOL3~0)} assume !(~CCCELVOL3~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 3) * 4, 4); {373#false} is VALID [2018-11-14 17:05:14,606 INFO L273 TraceCheckUtils]: 12: Hoare triple {373#false} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 2) * 4, 4); {373#false} is VALID [2018-11-14 17:05:14,606 INFO L273 TraceCheckUtils]: 13: Hoare triple {373#false} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {373#false} is VALID [2018-11-14 17:05:14,606 INFO L273 TraceCheckUtils]: 14: Hoare triple {373#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {373#false} is VALID [2018-11-14 17:05:14,607 INFO L273 TraceCheckUtils]: 15: Hoare triple {373#false} assume true; {373#false} is VALID [2018-11-14 17:05:14,607 INFO L273 TraceCheckUtils]: 16: Hoare triple {373#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {373#false} is VALID [2018-11-14 17:05:14,607 INFO L273 TraceCheckUtils]: 17: Hoare triple {373#false} ~i~0 := 0; {373#false} is VALID [2018-11-14 17:05:14,608 INFO L273 TraceCheckUtils]: 18: Hoare triple {373#false} assume true; {373#false} is VALID [2018-11-14 17:05:14,608 INFO L273 TraceCheckUtils]: 19: Hoare triple {373#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {373#false} is VALID [2018-11-14 17:05:14,608 INFO L273 TraceCheckUtils]: 20: Hoare triple {373#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {373#false} is VALID [2018-11-14 17:05:14,609 INFO L256 TraceCheckUtils]: 21: Hoare triple {373#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {373#false} is VALID [2018-11-14 17:05:14,609 INFO L273 TraceCheckUtils]: 22: Hoare triple {373#false} ~cond := #in~cond; {373#false} is VALID [2018-11-14 17:05:14,609 INFO L273 TraceCheckUtils]: 23: Hoare triple {373#false} assume ~cond == 0; {373#false} is VALID [2018-11-14 17:05:14,610 INFO L273 TraceCheckUtils]: 24: Hoare triple {373#false} assume !false; {373#false} is VALID [2018-11-14 17:05:14,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:05:14,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:05:14,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:05:14,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-14 17:05:14,613 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:05:14,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:05:14,654 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 17:05:14,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:05:14,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:05:14,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:05:14,656 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 4 states. [2018-11-14 17:05:14,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:14,966 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2018-11-14 17:05:14,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:05:14,966 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-14 17:05:14,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:05:14,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:05:14,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2018-11-14 17:05:14,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:05:14,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 81 transitions. [2018-11-14 17:05:14,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 81 transitions. [2018-11-14 17:05:15,156 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 17:05:15,159 INFO L225 Difference]: With dead ends: 64 [2018-11-14 17:05:15,159 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 17:05:15,160 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:05:15,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 17:05:15,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 37. [2018-11-14 17:05:15,201 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:05:15,201 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 37 states. [2018-11-14 17:05:15,201 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 37 states. [2018-11-14 17:05:15,202 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 37 states. [2018-11-14 17:05:15,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:15,207 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2018-11-14 17:05:15,207 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2018-11-14 17:05:15,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:15,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:15,208 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 44 states. [2018-11-14 17:05:15,209 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 44 states. [2018-11-14 17:05:15,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:15,212 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2018-11-14 17:05:15,212 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2018-11-14 17:05:15,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:15,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:15,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:05:15,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:05:15,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 17:05:15,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2018-11-14 17:05:15,216 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 25 [2018-11-14 17:05:15,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:05:15,217 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2018-11-14 17:05:15,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:05:15,217 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2018-11-14 17:05:15,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 17:05:15,218 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:05:15,218 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] [2018-11-14 17:05:15,219 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:05:15,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:05:15,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1732216910, now seen corresponding path program 1 times [2018-11-14 17:05:15,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:05:15,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:05:15,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:15,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:05:15,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:15,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:05:16,150 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 25 [2018-11-14 17:05:16,333 INFO L256 TraceCheckUtils]: 0: Hoare triple {595#true} call ULTIMATE.init(); {595#true} is VALID [2018-11-14 17:05:16,333 INFO L273 TraceCheckUtils]: 1: Hoare triple {595#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {595#true} is VALID [2018-11-14 17:05:16,333 INFO L273 TraceCheckUtils]: 2: Hoare triple {595#true} assume true; {595#true} is VALID [2018-11-14 17:05:16,334 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {595#true} {595#true} #91#return; {595#true} is VALID [2018-11-14 17:05:16,334 INFO L256 TraceCheckUtils]: 4: Hoare triple {595#true} call #t~ret7 := main(); {595#true} is VALID [2018-11-14 17:05:16,334 INFO L273 TraceCheckUtils]: 5: Hoare triple {595#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {595#true} is VALID [2018-11-14 17:05:16,336 INFO L273 TraceCheckUtils]: 6: Hoare triple {595#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {597#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:16,337 INFO L273 TraceCheckUtils]: 7: Hoare triple {597#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0))} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) == 0 then 1 else 0) != 0;~i~0 := 1; {598#(and (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} is VALID [2018-11-14 17:05:16,338 INFO L273 TraceCheckUtils]: 8: Hoare triple {598#(and (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} assume true; {598#(and (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} is VALID [2018-11-14 17:05:16,340 INFO L273 TraceCheckUtils]: 9: Hoare triple {598#(and (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {598#(and (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} is VALID [2018-11-14 17:05:16,342 INFO L273 TraceCheckUtils]: 10: Hoare triple {598#(and (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {599#(and (or (not (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0)))) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) main_~CCCELVOL3~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} is VALID [2018-11-14 17:05:16,344 INFO L273 TraceCheckUtils]: 11: Hoare triple {599#(and (or (not (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0)))) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) main_~CCCELVOL3~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 3) * 4, 4); {599#(and (or (not (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0)))) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) main_~CCCELVOL3~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} is VALID [2018-11-14 17:05:16,345 INFO L273 TraceCheckUtils]: 12: Hoare triple {599#(and (or (not (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0)))) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) main_~CCCELVOL3~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 2) * 4, 4); {599#(and (or (not (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0)))) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) main_~CCCELVOL3~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} is VALID [2018-11-14 17:05:16,347 INFO L273 TraceCheckUtils]: 13: Hoare triple {599#(and (or (not (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0)))) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) main_~CCCELVOL3~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {599#(and (or (not (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0)))) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) main_~CCCELVOL3~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} is VALID [2018-11-14 17:05:16,349 INFO L273 TraceCheckUtils]: 14: Hoare triple {599#(and (or (not (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0)))) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) main_~CCCELVOL3~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16))))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (= 16 (+ |main_~#volArray~0.offset| (* 16 main_~i~0))) (and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= 2 ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 16 main_~i~0)) 15))))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {600#(and (= |main_~#volArray~0.offset| 0) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:16,351 INFO L273 TraceCheckUtils]: 15: Hoare triple {600#(and (= |main_~#volArray~0.offset| 0) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))))) (< 0 (+ ~CELLCOUNT~0 1)))} assume true; {600#(and (= |main_~#volArray~0.offset| 0) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:16,353 INFO L273 TraceCheckUtils]: 16: Hoare triple {600#(and (= |main_~#volArray~0.offset| 0) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {601#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-14 17:05:16,354 INFO L273 TraceCheckUtils]: 17: Hoare triple {601#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} ~i~0 := 0; {602#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 17:05:16,355 INFO L273 TraceCheckUtils]: 18: Hoare triple {602#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} assume true; {602#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 17:05:16,356 INFO L273 TraceCheckUtils]: 19: Hoare triple {602#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {603#(and |main_#t~short6| (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:05:16,359 INFO L273 TraceCheckUtils]: 20: Hoare triple {603#(and |main_#t~short6| (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {596#false} is VALID [2018-11-14 17:05:16,359 INFO L256 TraceCheckUtils]: 21: Hoare triple {596#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {596#false} is VALID [2018-11-14 17:05:16,359 INFO L273 TraceCheckUtils]: 22: Hoare triple {596#false} ~cond := #in~cond; {596#false} is VALID [2018-11-14 17:05:16,360 INFO L273 TraceCheckUtils]: 23: Hoare triple {596#false} assume ~cond == 0; {596#false} is VALID [2018-11-14 17:05:16,360 INFO L273 TraceCheckUtils]: 24: Hoare triple {596#false} assume !false; {596#false} is VALID [2018-11-14 17:05:16,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:05:16,367 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:05:16,367 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 17:05:16,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:05:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:05:16,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:05:16,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:05:16,678 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 17:05:16,687 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 17:05:16,694 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:05:16,698 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:16,722 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 17:05:16,722 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-14 17:05:16,725 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:05:16,868 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 29 treesize of output 24 [2018-11-14 17:05:16,877 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:16,885 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 24 treesize of output 39 [2018-11-14 17:05:16,890 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:05:16,901 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:16,914 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 17:05:16,914 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2018-11-14 17:05:16,918 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:05:16,951 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 29 treesize of output 24 [2018-11-14 17:05:16,961 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:16,964 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 24 treesize of output 39 [2018-11-14 17:05:16,967 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:05:16,977 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:16,990 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 17:05:16,991 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:19 [2018-11-14 17:05:17,000 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:05:17,033 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 21 treesize of output 16 [2018-11-14 17:05:17,049 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:17,053 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 16 treesize of output 23 [2018-11-14 17:05:17,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:05:17,065 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:17,075 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 17:05:17,076 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:24, output treesize:11 [2018-11-14 17:05:17,080 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:05:17,227 INFO L256 TraceCheckUtils]: 0: Hoare triple {595#true} call ULTIMATE.init(); {595#true} is VALID [2018-11-14 17:05:17,227 INFO L273 TraceCheckUtils]: 1: Hoare triple {595#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {595#true} is VALID [2018-11-14 17:05:17,227 INFO L273 TraceCheckUtils]: 2: Hoare triple {595#true} assume true; {595#true} is VALID [2018-11-14 17:05:17,228 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {595#true} {595#true} #91#return; {595#true} is VALID [2018-11-14 17:05:17,228 INFO L256 TraceCheckUtils]: 4: Hoare triple {595#true} call #t~ret7 := main(); {595#true} is VALID [2018-11-14 17:05:17,229 INFO L273 TraceCheckUtils]: 5: Hoare triple {595#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {595#true} is VALID [2018-11-14 17:05:17,229 INFO L273 TraceCheckUtils]: 6: Hoare triple {595#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {625#(= |main_~#volArray~0.offset| 0)} is VALID [2018-11-14 17:05:17,230 INFO L273 TraceCheckUtils]: 7: Hoare triple {625#(= |main_~#volArray~0.offset| 0)} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) == 0 then 1 else 0) != 0;~i~0 := 1; {629#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:17,231 INFO L273 TraceCheckUtils]: 8: Hoare triple {629#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume true; {629#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:17,232 INFO L273 TraceCheckUtils]: 9: Hoare triple {629#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {629#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:17,234 INFO L273 TraceCheckUtils]: 10: Hoare triple {629#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {639#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:17,236 INFO L273 TraceCheckUtils]: 11: Hoare triple {639#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 3) * 4, 4); {639#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:17,237 INFO L273 TraceCheckUtils]: 12: Hoare triple {639#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= 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 * 4 - 2) * 4, 4); {639#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:17,239 INFO L273 TraceCheckUtils]: 13: Hoare triple {639#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {601#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-14 17:05:17,240 INFO L273 TraceCheckUtils]: 14: Hoare triple {601#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {601#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-14 17:05:17,241 INFO L273 TraceCheckUtils]: 15: Hoare triple {601#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} assume true; {601#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-14 17:05:17,242 INFO L273 TraceCheckUtils]: 16: Hoare triple {601#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {601#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-14 17:05:17,244 INFO L273 TraceCheckUtils]: 17: Hoare triple {601#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} ~i~0 := 0; {602#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 17:05:17,245 INFO L273 TraceCheckUtils]: 18: Hoare triple {602#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} assume true; {602#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 17:05:17,246 INFO L273 TraceCheckUtils]: 19: Hoare triple {602#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {667#|main_#t~short6|} is VALID [2018-11-14 17:05:17,247 INFO L273 TraceCheckUtils]: 20: Hoare triple {667#|main_#t~short6|} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {596#false} is VALID [2018-11-14 17:05:17,248 INFO L256 TraceCheckUtils]: 21: Hoare triple {596#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {596#false} is VALID [2018-11-14 17:05:17,248 INFO L273 TraceCheckUtils]: 22: Hoare triple {596#false} ~cond := #in~cond; {596#false} is VALID [2018-11-14 17:05:17,249 INFO L273 TraceCheckUtils]: 23: Hoare triple {596#false} assume ~cond == 0; {596#false} is VALID [2018-11-14 17:05:17,249 INFO L273 TraceCheckUtils]: 24: Hoare triple {596#false} assume !false; {596#false} is VALID [2018-11-14 17:05:17,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:05:17,285 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:05:17,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2018-11-14 17:05:17,286 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-11-14 17:05:17,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:05:17,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 17:05:17,352 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:05:17,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 17:05:17,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 17:05:17,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-11-14 17:05:17,354 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand 13 states. [2018-11-14 17:05:19,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:19,638 INFO L93 Difference]: Finished difference Result 90 states and 120 transitions. [2018-11-14 17:05:19,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 17:05:19,638 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 25 [2018-11-14 17:05:19,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:05:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 17:05:19,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2018-11-14 17:05:19,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 17:05:19,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2018-11-14 17:05:19,658 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 109 transitions. [2018-11-14 17:05:19,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:05:19,903 INFO L225 Difference]: With dead ends: 90 [2018-11-14 17:05:19,904 INFO L226 Difference]: Without dead ends: 78 [2018-11-14 17:05:19,905 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 20 SyntacticMatches, 5 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2018-11-14 17:05:19,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-11-14 17:05:20,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 49. [2018-11-14 17:05:20,061 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:05:20,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand 49 states. [2018-11-14 17:05:20,061 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 49 states. [2018-11-14 17:05:20,062 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 49 states. [2018-11-14 17:05:20,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:20,069 INFO L93 Difference]: Finished difference Result 78 states and 106 transitions. [2018-11-14 17:05:20,069 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 106 transitions. [2018-11-14 17:05:20,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:20,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:20,071 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 78 states. [2018-11-14 17:05:20,071 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 78 states. [2018-11-14 17:05:20,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:20,106 INFO L93 Difference]: Finished difference Result 78 states and 106 transitions. [2018-11-14 17:05:20,106 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 106 transitions. [2018-11-14 17:05:20,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:20,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:20,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:05:20,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:05:20,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-14 17:05:20,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 64 transitions. [2018-11-14 17:05:20,114 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 64 transitions. Word has length 25 [2018-11-14 17:05:20,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:05:20,114 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 64 transitions. [2018-11-14 17:05:20,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 17:05:20,115 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 64 transitions. [2018-11-14 17:05:20,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 17:05:20,116 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:05:20,116 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] [2018-11-14 17:05:20,116 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:05:20,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:05:20,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1730369868, now seen corresponding path program 1 times [2018-11-14 17:05:20,122 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:05:20,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:05:20,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:20,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:05:20,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:20,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:05:20,293 INFO L256 TraceCheckUtils]: 0: Hoare triple {1030#true} call ULTIMATE.init(); {1030#true} is VALID [2018-11-14 17:05:20,294 INFO L273 TraceCheckUtils]: 1: Hoare triple {1030#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1030#true} is VALID [2018-11-14 17:05:20,294 INFO L273 TraceCheckUtils]: 2: Hoare triple {1030#true} assume true; {1030#true} is VALID [2018-11-14 17:05:20,294 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1030#true} {1030#true} #91#return; {1030#true} is VALID [2018-11-14 17:05:20,294 INFO L256 TraceCheckUtils]: 4: Hoare triple {1030#true} call #t~ret7 := main(); {1030#true} is VALID [2018-11-14 17:05:20,295 INFO L273 TraceCheckUtils]: 5: Hoare triple {1030#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1030#true} is VALID [2018-11-14 17:05:20,295 INFO L273 TraceCheckUtils]: 6: Hoare triple {1030#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {1030#true} is VALID [2018-11-14 17:05:20,295 INFO L273 TraceCheckUtils]: 7: Hoare triple {1030#true} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) == 0 then 1 else 0) != 0;~i~0 := 1; {1030#true} is VALID [2018-11-14 17:05:20,296 INFO L273 TraceCheckUtils]: 8: Hoare triple {1030#true} assume true; {1030#true} is VALID [2018-11-14 17:05:20,296 INFO L273 TraceCheckUtils]: 9: Hoare triple {1030#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {1030#true} is VALID [2018-11-14 17:05:20,296 INFO L273 TraceCheckUtils]: 10: Hoare triple {1030#true} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {1030#true} is VALID [2018-11-14 17:05:20,296 INFO L273 TraceCheckUtils]: 11: Hoare triple {1030#true} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 3) * 4, 4); {1030#true} is VALID [2018-11-14 17:05:20,297 INFO L273 TraceCheckUtils]: 12: Hoare triple {1030#true} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 2) * 4, 4); {1030#true} is VALID [2018-11-14 17:05:20,297 INFO L273 TraceCheckUtils]: 13: Hoare triple {1030#true} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {1030#true} is VALID [2018-11-14 17:05:20,297 INFO L273 TraceCheckUtils]: 14: Hoare triple {1030#true} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1030#true} is VALID [2018-11-14 17:05:20,297 INFO L273 TraceCheckUtils]: 15: Hoare triple {1030#true} assume true; {1030#true} is VALID [2018-11-14 17:05:20,298 INFO L273 TraceCheckUtils]: 16: Hoare triple {1030#true} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {1030#true} is VALID [2018-11-14 17:05:20,298 INFO L273 TraceCheckUtils]: 17: Hoare triple {1030#true} ~i~0 := 0; {1030#true} is VALID [2018-11-14 17:05:20,298 INFO L273 TraceCheckUtils]: 18: Hoare triple {1030#true} assume true; {1030#true} is VALID [2018-11-14 17:05:20,298 INFO L273 TraceCheckUtils]: 19: Hoare triple {1030#true} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {1030#true} is VALID [2018-11-14 17:05:20,312 INFO L273 TraceCheckUtils]: 20: Hoare triple {1030#true} assume #t~short6; {1032#|main_#t~short6|} is VALID [2018-11-14 17:05:20,313 INFO L256 TraceCheckUtils]: 21: Hoare triple {1032#|main_#t~short6|} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {1033#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:05:20,314 INFO L273 TraceCheckUtils]: 22: Hoare triple {1033#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1034#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-14 17:05:20,316 INFO L273 TraceCheckUtils]: 23: Hoare triple {1034#(not (= __VERIFIER_assert_~cond 0))} assume ~cond == 0; {1031#false} is VALID [2018-11-14 17:05:20,316 INFO L273 TraceCheckUtils]: 24: Hoare triple {1031#false} assume !false; {1031#false} is VALID [2018-11-14 17:05:20,317 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 17:05:20,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:05:20,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:05:20,318 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-14 17:05:20,318 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:05:20,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:05:20,347 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:05:20,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:05:20,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:05:20,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:05:20,348 INFO L87 Difference]: Start difference. First operand 49 states and 64 transitions. Second operand 5 states. [2018-11-14 17:05:20,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:20,549 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2018-11-14 17:05:20,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:05:20,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-11-14 17:05:20,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:05:20,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:05:20,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-14 17:05:20,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:05:20,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2018-11-14 17:05:20,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2018-11-14 17:05:20,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:05:20,642 INFO L225 Difference]: With dead ends: 57 [2018-11-14 17:05:20,642 INFO L226 Difference]: Without dead ends: 55 [2018-11-14 17:05:20,643 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 17:05:20,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-14 17:05:20,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-14 17:05:20,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:05:20,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 54 states. [2018-11-14 17:05:20,689 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 54 states. [2018-11-14 17:05:20,689 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 54 states. [2018-11-14 17:05:20,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:20,693 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2018-11-14 17:05:20,693 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2018-11-14 17:05:20,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:20,694 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:20,694 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 55 states. [2018-11-14 17:05:20,694 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 55 states. [2018-11-14 17:05:20,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:20,697 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2018-11-14 17:05:20,697 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 70 transitions. [2018-11-14 17:05:20,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:20,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:20,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:05:20,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:05:20,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 17:05:20,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2018-11-14 17:05:20,701 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 25 [2018-11-14 17:05:20,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:05:20,701 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2018-11-14 17:05:20,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:05:20,701 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2018-11-14 17:05:20,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 17:05:20,702 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:05:20,702 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] [2018-11-14 17:05:20,703 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:05:20,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:05:20,703 INFO L82 PathProgramCache]: Analyzing trace with hash -558764018, now seen corresponding path program 1 times [2018-11-14 17:05:20,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:05:20,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:05:20,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:20,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:05:20,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:05:20,780 INFO L256 TraceCheckUtils]: 0: Hoare triple {1288#true} call ULTIMATE.init(); {1288#true} is VALID [2018-11-14 17:05:20,780 INFO L273 TraceCheckUtils]: 1: Hoare triple {1288#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1288#true} is VALID [2018-11-14 17:05:20,781 INFO L273 TraceCheckUtils]: 2: Hoare triple {1288#true} assume true; {1288#true} is VALID [2018-11-14 17:05:20,781 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1288#true} {1288#true} #91#return; {1288#true} is VALID [2018-11-14 17:05:20,781 INFO L256 TraceCheckUtils]: 4: Hoare triple {1288#true} call #t~ret7 := main(); {1288#true} is VALID [2018-11-14 17:05:20,781 INFO L273 TraceCheckUtils]: 5: Hoare triple {1288#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1288#true} is VALID [2018-11-14 17:05:20,782 INFO L273 TraceCheckUtils]: 6: Hoare triple {1288#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {1290#(<= (+ main_~CCCELVOL1~0 4) main_~CCCELVOL4~0)} is VALID [2018-11-14 17:05:20,783 INFO L273 TraceCheckUtils]: 7: Hoare triple {1290#(<= (+ main_~CCCELVOL1~0 4) main_~CCCELVOL4~0)} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) == 0 then 1 else 0) != 0;~i~0 := 1; {1290#(<= (+ main_~CCCELVOL1~0 4) main_~CCCELVOL4~0)} is VALID [2018-11-14 17:05:20,783 INFO L273 TraceCheckUtils]: 8: Hoare triple {1290#(<= (+ main_~CCCELVOL1~0 4) main_~CCCELVOL4~0)} assume true; {1290#(<= (+ main_~CCCELVOL1~0 4) main_~CCCELVOL4~0)} is VALID [2018-11-14 17:05:20,786 INFO L273 TraceCheckUtils]: 9: Hoare triple {1290#(<= (+ main_~CCCELVOL1~0 4) main_~CCCELVOL4~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {1290#(<= (+ main_~CCCELVOL1~0 4) main_~CCCELVOL4~0)} is VALID [2018-11-14 17:05:20,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {1290#(<= (+ main_~CCCELVOL1~0 4) main_~CCCELVOL4~0)} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {1291#(<= (+ main_~CCCELVOL1~0 5) main_~MINVAL~0)} is VALID [2018-11-14 17:05:20,788 INFO L273 TraceCheckUtils]: 11: Hoare triple {1291#(<= (+ main_~CCCELVOL1~0 5) main_~MINVAL~0)} assume !(~CCCELVOL3~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 3) * 4, 4); {1291#(<= (+ main_~CCCELVOL1~0 5) main_~MINVAL~0)} is VALID [2018-11-14 17:05:20,788 INFO L273 TraceCheckUtils]: 12: Hoare triple {1291#(<= (+ main_~CCCELVOL1~0 5) main_~MINVAL~0)} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 2) * 4, 4); {1291#(<= (+ main_~CCCELVOL1~0 5) main_~MINVAL~0)} is VALID [2018-11-14 17:05:20,790 INFO L273 TraceCheckUtils]: 13: Hoare triple {1291#(<= (+ main_~CCCELVOL1~0 5) main_~MINVAL~0)} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {1289#false} is VALID [2018-11-14 17:05:20,790 INFO L273 TraceCheckUtils]: 14: Hoare triple {1289#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1289#false} is VALID [2018-11-14 17:05:20,790 INFO L273 TraceCheckUtils]: 15: Hoare triple {1289#false} assume true; {1289#false} is VALID [2018-11-14 17:05:20,790 INFO L273 TraceCheckUtils]: 16: Hoare triple {1289#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {1289#false} is VALID [2018-11-14 17:05:20,791 INFO L273 TraceCheckUtils]: 17: Hoare triple {1289#false} ~i~0 := 0; {1289#false} is VALID [2018-11-14 17:05:20,791 INFO L273 TraceCheckUtils]: 18: Hoare triple {1289#false} assume true; {1289#false} is VALID [2018-11-14 17:05:20,791 INFO L273 TraceCheckUtils]: 19: Hoare triple {1289#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {1289#false} is VALID [2018-11-14 17:05:20,791 INFO L273 TraceCheckUtils]: 20: Hoare triple {1289#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {1289#false} is VALID [2018-11-14 17:05:20,792 INFO L256 TraceCheckUtils]: 21: Hoare triple {1289#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {1289#false} is VALID [2018-11-14 17:05:20,792 INFO L273 TraceCheckUtils]: 22: Hoare triple {1289#false} ~cond := #in~cond; {1289#false} is VALID [2018-11-14 17:05:20,792 INFO L273 TraceCheckUtils]: 23: Hoare triple {1289#false} assume ~cond == 0; {1289#false} is VALID [2018-11-14 17:05:20,792 INFO L273 TraceCheckUtils]: 24: Hoare triple {1289#false} assume !false; {1289#false} is VALID [2018-11-14 17:05:20,793 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:05:20,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:05:20,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:05:20,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-14 17:05:20,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:05:20,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:05:20,820 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 17:05:20,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:05:20,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:05:20,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:05:20,821 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 4 states. [2018-11-14 17:05:21,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:21,086 INFO L93 Difference]: Finished difference Result 93 states and 121 transitions. [2018-11-14 17:05:21,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:05:21,086 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-14 17:05:21,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:05:21,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:05:21,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2018-11-14 17:05:21,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:05:21,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 80 transitions. [2018-11-14 17:05:21,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 80 transitions. [2018-11-14 17:05:21,205 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:05:21,208 INFO L225 Difference]: With dead ends: 93 [2018-11-14 17:05:21,208 INFO L226 Difference]: Without dead ends: 61 [2018-11-14 17:05:21,209 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:05:21,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-14 17:05:21,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2018-11-14 17:05:21,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:05:21,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 54 states. [2018-11-14 17:05:21,319 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 54 states. [2018-11-14 17:05:21,319 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 54 states. [2018-11-14 17:05:21,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:21,322 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2018-11-14 17:05:21,322 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2018-11-14 17:05:21,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:21,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:21,323 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 61 states. [2018-11-14 17:05:21,323 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 61 states. [2018-11-14 17:05:21,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:21,326 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2018-11-14 17:05:21,327 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 77 transitions. [2018-11-14 17:05:21,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:21,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:21,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:05:21,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:05:21,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 17:05:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 67 transitions. [2018-11-14 17:05:21,330 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 67 transitions. Word has length 25 [2018-11-14 17:05:21,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:05:21,330 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 67 transitions. [2018-11-14 17:05:21,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:05:21,330 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 67 transitions. [2018-11-14 17:05:21,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 17:05:21,331 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:05:21,331 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] [2018-11-14 17:05:21,331 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:05:21,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:05:21,332 INFO L82 PathProgramCache]: Analyzing trace with hash -300598580, now seen corresponding path program 1 times [2018-11-14 17:05:21,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:05:21,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:05:21,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:21,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:05:21,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:05:21,408 INFO L256 TraceCheckUtils]: 0: Hoare triple {1603#true} call ULTIMATE.init(); {1603#true} is VALID [2018-11-14 17:05:21,408 INFO L273 TraceCheckUtils]: 1: Hoare triple {1603#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1603#true} is VALID [2018-11-14 17:05:21,408 INFO L273 TraceCheckUtils]: 2: Hoare triple {1603#true} assume true; {1603#true} is VALID [2018-11-14 17:05:21,409 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1603#true} {1603#true} #91#return; {1603#true} is VALID [2018-11-14 17:05:21,409 INFO L256 TraceCheckUtils]: 4: Hoare triple {1603#true} call #t~ret7 := main(); {1603#true} is VALID [2018-11-14 17:05:21,409 INFO L273 TraceCheckUtils]: 5: Hoare triple {1603#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1603#true} is VALID [2018-11-14 17:05:21,410 INFO L273 TraceCheckUtils]: 6: Hoare triple {1603#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {1605#(<= (+ main_~CCCELVOL2~0 2) main_~CCCELVOL4~0)} is VALID [2018-11-14 17:05:21,410 INFO L273 TraceCheckUtils]: 7: Hoare triple {1605#(<= (+ main_~CCCELVOL2~0 2) main_~CCCELVOL4~0)} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) == 0 then 1 else 0) != 0;~i~0 := 1; {1605#(<= (+ main_~CCCELVOL2~0 2) main_~CCCELVOL4~0)} is VALID [2018-11-14 17:05:21,418 INFO L273 TraceCheckUtils]: 8: Hoare triple {1605#(<= (+ main_~CCCELVOL2~0 2) main_~CCCELVOL4~0)} assume true; {1605#(<= (+ main_~CCCELVOL2~0 2) main_~CCCELVOL4~0)} is VALID [2018-11-14 17:05:21,419 INFO L273 TraceCheckUtils]: 9: Hoare triple {1605#(<= (+ main_~CCCELVOL2~0 2) main_~CCCELVOL4~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {1605#(<= (+ main_~CCCELVOL2~0 2) main_~CCCELVOL4~0)} is VALID [2018-11-14 17:05:21,422 INFO L273 TraceCheckUtils]: 10: Hoare triple {1605#(<= (+ main_~CCCELVOL2~0 2) main_~CCCELVOL4~0)} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {1606#(<= (+ main_~CCCELVOL2~0 3) main_~MINVAL~0)} is VALID [2018-11-14 17:05:21,422 INFO L273 TraceCheckUtils]: 11: Hoare triple {1606#(<= (+ main_~CCCELVOL2~0 3) main_~MINVAL~0)} assume !(~CCCELVOL3~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 3) * 4, 4); {1606#(<= (+ main_~CCCELVOL2~0 3) main_~MINVAL~0)} is VALID [2018-11-14 17:05:21,423 INFO L273 TraceCheckUtils]: 12: Hoare triple {1606#(<= (+ main_~CCCELVOL2~0 3) main_~MINVAL~0)} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 2) * 4, 4); {1604#false} is VALID [2018-11-14 17:05:21,423 INFO L273 TraceCheckUtils]: 13: Hoare triple {1604#false} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {1604#false} is VALID [2018-11-14 17:05:21,423 INFO L273 TraceCheckUtils]: 14: Hoare triple {1604#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1604#false} is VALID [2018-11-14 17:05:21,423 INFO L273 TraceCheckUtils]: 15: Hoare triple {1604#false} assume true; {1604#false} is VALID [2018-11-14 17:05:21,424 INFO L273 TraceCheckUtils]: 16: Hoare triple {1604#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {1604#false} is VALID [2018-11-14 17:05:21,424 INFO L273 TraceCheckUtils]: 17: Hoare triple {1604#false} ~i~0 := 0; {1604#false} is VALID [2018-11-14 17:05:21,424 INFO L273 TraceCheckUtils]: 18: Hoare triple {1604#false} assume true; {1604#false} is VALID [2018-11-14 17:05:21,424 INFO L273 TraceCheckUtils]: 19: Hoare triple {1604#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {1604#false} is VALID [2018-11-14 17:05:21,425 INFO L273 TraceCheckUtils]: 20: Hoare triple {1604#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {1604#false} is VALID [2018-11-14 17:05:21,425 INFO L256 TraceCheckUtils]: 21: Hoare triple {1604#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {1604#false} is VALID [2018-11-14 17:05:21,425 INFO L273 TraceCheckUtils]: 22: Hoare triple {1604#false} ~cond := #in~cond; {1604#false} is VALID [2018-11-14 17:05:21,425 INFO L273 TraceCheckUtils]: 23: Hoare triple {1604#false} assume ~cond == 0; {1604#false} is VALID [2018-11-14 17:05:21,426 INFO L273 TraceCheckUtils]: 24: Hoare triple {1604#false} assume !false; {1604#false} is VALID [2018-11-14 17:05:21,426 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:05:21,427 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:05:21,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:05:21,427 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-14 17:05:21,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:05:21,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:05:21,468 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 17:05:21,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:05:21,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:05:21,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:05:21,469 INFO L87 Difference]: Start difference. First operand 54 states and 67 transitions. Second operand 4 states. [2018-11-14 17:05:21,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:21,950 INFO L93 Difference]: Finished difference Result 93 states and 117 transitions. [2018-11-14 17:05:21,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:05:21,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-14 17:05:21,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:05:21,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:05:21,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2018-11-14 17:05:21,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:05:21,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2018-11-14 17:05:21,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2018-11-14 17:05:22,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:05:22,062 INFO L225 Difference]: With dead ends: 93 [2018-11-14 17:05:22,062 INFO L226 Difference]: Without dead ends: 61 [2018-11-14 17:05:22,063 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:05:22,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-14 17:05:22,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2018-11-14 17:05:22,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:05:22,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 54 states. [2018-11-14 17:05:22,129 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 54 states. [2018-11-14 17:05:22,129 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 54 states. [2018-11-14 17:05:22,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:22,133 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2018-11-14 17:05:22,133 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2018-11-14 17:05:22,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:22,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:22,133 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 61 states. [2018-11-14 17:05:22,134 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 61 states. [2018-11-14 17:05:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:22,136 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2018-11-14 17:05:22,136 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2018-11-14 17:05:22,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:22,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:22,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:05:22,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:05:22,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 17:05:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2018-11-14 17:05:22,139 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 25 [2018-11-14 17:05:22,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:05:22,140 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-11-14 17:05:22,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:05:22,140 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2018-11-14 17:05:22,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 17:05:22,141 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:05:22,141 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] [2018-11-14 17:05:22,141 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:05:22,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:05:22,141 INFO L82 PathProgramCache]: Analyzing trace with hash -887404594, now seen corresponding path program 1 times [2018-11-14 17:05:22,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:05:22,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:05:22,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:22,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:05:22,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:05:22,795 INFO L256 TraceCheckUtils]: 0: Hoare triple {1918#true} call ULTIMATE.init(); {1918#true} is VALID [2018-11-14 17:05:22,795 INFO L273 TraceCheckUtils]: 1: Hoare triple {1918#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1918#true} is VALID [2018-11-14 17:05:22,796 INFO L273 TraceCheckUtils]: 2: Hoare triple {1918#true} assume true; {1918#true} is VALID [2018-11-14 17:05:22,796 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1918#true} {1918#true} #91#return; {1918#true} is VALID [2018-11-14 17:05:22,796 INFO L256 TraceCheckUtils]: 4: Hoare triple {1918#true} call #t~ret7 := main(); {1918#true} is VALID [2018-11-14 17:05:22,796 INFO L273 TraceCheckUtils]: 5: Hoare triple {1918#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1918#true} is VALID [2018-11-14 17:05:22,798 INFO L273 TraceCheckUtils]: 6: Hoare triple {1918#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {1920#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:22,802 INFO L273 TraceCheckUtils]: 7: Hoare triple {1920#(and (<= 2 ~CELLCOUNT~0) (= |main_~#volArray~0.offset| 0))} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) == 0 then 1 else 0) != 0;~i~0 := 1; {1921#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:22,803 INFO L273 TraceCheckUtils]: 8: Hoare triple {1921#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} assume true; {1921#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:22,803 INFO L273 TraceCheckUtils]: 9: Hoare triple {1921#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {1921#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:22,804 INFO L273 TraceCheckUtils]: 10: Hoare triple {1921#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {1922#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:22,805 INFO L273 TraceCheckUtils]: 11: Hoare triple {1922#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~CCCELVOL3~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 3) * 4, 4); {1922#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:22,806 INFO L273 TraceCheckUtils]: 12: Hoare triple {1922#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 2) * 4, 4); {1922#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:22,807 INFO L273 TraceCheckUtils]: 13: Hoare triple {1922#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {1922#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:22,808 INFO L273 TraceCheckUtils]: 14: Hoare triple {1922#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 16)))) (< 0 (+ ~CELLCOUNT~0 1)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1923#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:22,808 INFO L273 TraceCheckUtils]: 15: Hoare triple {1923#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} assume true; {1923#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:22,810 INFO L273 TraceCheckUtils]: 16: Hoare triple {1923#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {1924#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:22,811 INFO L273 TraceCheckUtils]: 17: Hoare triple {1924#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (= |main_~#volArray~0.offset| 0))} ~i~0 := 0; {1925#(and (= |main_~#volArray~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 17:05:22,818 INFO L273 TraceCheckUtils]: 18: Hoare triple {1925#(and (= |main_~#volArray~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} assume true; {1925#(and (= |main_~#volArray~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 17:05:22,818 INFO L273 TraceCheckUtils]: 19: Hoare triple {1925#(and (= |main_~#volArray~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {1925#(and (= |main_~#volArray~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-14 17:05:22,819 INFO L273 TraceCheckUtils]: 20: Hoare triple {1925#(and (= |main_~#volArray~0.offset| 0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {1926#|main_#t~short6|} is VALID [2018-11-14 17:05:22,820 INFO L256 TraceCheckUtils]: 21: Hoare triple {1926#|main_#t~short6|} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {1927#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:05:22,820 INFO L273 TraceCheckUtils]: 22: Hoare triple {1927#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1928#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-14 17:05:22,820 INFO L273 TraceCheckUtils]: 23: Hoare triple {1928#(not (= __VERIFIER_assert_~cond 0))} assume ~cond == 0; {1919#false} is VALID [2018-11-14 17:05:22,821 INFO L273 TraceCheckUtils]: 24: Hoare triple {1919#false} assume !false; {1919#false} is VALID [2018-11-14 17:05:22,823 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:05:22,824 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:05:22,824 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 17:05:22,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:05:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:05:22,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:05:22,872 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:05:22,944 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 17:05:22,949 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 17:05:22,951 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:05:22,953 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:22,960 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:22,961 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-14 17:05:22,999 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 29 treesize of output 24 [2018-11-14 17:05:23,004 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:23,005 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 24 treesize of output 39 [2018-11-14 17:05:23,008 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:05:23,015 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:23,029 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:23,030 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-14 17:05:23,076 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 41 treesize of output 34 [2018-11-14 17:05:23,082 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:23,083 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:23,084 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:23,086 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 79 [2018-11-14 17:05:23,089 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:05:23,103 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:23,116 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:23,116 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:47, output treesize:43 [2018-11-14 17:05:23,173 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 39 treesize of output 30 [2018-11-14 17:05:23,190 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:23,192 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:23,194 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:23,195 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:23,196 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:23,197 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:23,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 77 [2018-11-14 17:05:23,202 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:05:23,225 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:23,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:23,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:42, output treesize:38 [2018-11-14 17:05:23,561 INFO L256 TraceCheckUtils]: 0: Hoare triple {1918#true} call ULTIMATE.init(); {1918#true} is VALID [2018-11-14 17:05:23,561 INFO L273 TraceCheckUtils]: 1: Hoare triple {1918#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1918#true} is VALID [2018-11-14 17:05:23,562 INFO L273 TraceCheckUtils]: 2: Hoare triple {1918#true} assume true; {1918#true} is VALID [2018-11-14 17:05:23,562 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1918#true} {1918#true} #91#return; {1918#true} is VALID [2018-11-14 17:05:23,563 INFO L256 TraceCheckUtils]: 4: Hoare triple {1918#true} call #t~ret7 := main(); {1918#true} is VALID [2018-11-14 17:05:23,563 INFO L273 TraceCheckUtils]: 5: Hoare triple {1918#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1918#true} is VALID [2018-11-14 17:05:23,563 INFO L273 TraceCheckUtils]: 6: Hoare triple {1918#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {1950#(= |main_~#volArray~0.offset| 0)} is VALID [2018-11-14 17:05:23,564 INFO L273 TraceCheckUtils]: 7: Hoare triple {1950#(= |main_~#volArray~0.offset| 0)} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) == 0 then 1 else 0) != 0;~i~0 := 1; {1954#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:23,564 INFO L273 TraceCheckUtils]: 8: Hoare triple {1954#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume true; {1954#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:23,565 INFO L273 TraceCheckUtils]: 9: Hoare triple {1954#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {1954#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:23,566 INFO L273 TraceCheckUtils]: 10: Hoare triple {1954#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {1964#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:23,567 INFO L273 TraceCheckUtils]: 11: Hoare triple {1964#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL3~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 3) * 4, 4); {1968#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12))) 0))} is VALID [2018-11-14 17:05:23,569 INFO L273 TraceCheckUtils]: 12: Hoare triple {1968#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12))) 0))} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 2) * 4, 4); {1972#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 8))) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12))) 0))} is VALID [2018-11-14 17:05:23,571 INFO L273 TraceCheckUtils]: 13: Hoare triple {1972#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 16)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 8))) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12))) 0))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {1976#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0))} is VALID [2018-11-14 17:05:23,572 INFO L273 TraceCheckUtils]: 14: Hoare triple {1976#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {1976#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0))} is VALID [2018-11-14 17:05:23,573 INFO L273 TraceCheckUtils]: 15: Hoare triple {1976#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0))} assume true; {1976#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0))} is VALID [2018-11-14 17:05:23,574 INFO L273 TraceCheckUtils]: 16: Hoare triple {1976#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {1976#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0))} is VALID [2018-11-14 17:05:23,575 INFO L273 TraceCheckUtils]: 17: Hoare triple {1976#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0))} ~i~0 := 0; {1989#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (= main_~i~0 0))} is VALID [2018-11-14 17:05:23,583 INFO L273 TraceCheckUtils]: 18: Hoare triple {1989#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (= main_~i~0 0))} assume true; {1989#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (= main_~i~0 0))} is VALID [2018-11-14 17:05:23,584 INFO L273 TraceCheckUtils]: 19: Hoare triple {1989#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {1989#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (= main_~i~0 0))} is VALID [2018-11-14 17:05:23,584 INFO L273 TraceCheckUtils]: 20: Hoare triple {1989#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (= main_~i~0 0))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {1926#|main_#t~short6|} is VALID [2018-11-14 17:05:23,585 INFO L256 TraceCheckUtils]: 21: Hoare triple {1926#|main_#t~short6|} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {2002#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:05:23,586 INFO L273 TraceCheckUtils]: 22: Hoare triple {2002#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {2006#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:05:23,587 INFO L273 TraceCheckUtils]: 23: Hoare triple {2006#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {1919#false} is VALID [2018-11-14 17:05:23,587 INFO L273 TraceCheckUtils]: 24: Hoare triple {1919#false} assume !false; {1919#false} is VALID [2018-11-14 17:05:23,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:05:23,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:05:23,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2018-11-14 17:05:23,612 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 25 [2018-11-14 17:05:23,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:05:23,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 17:05:23,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:05:23,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 17:05:23,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 17:05:23,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2018-11-14 17:05:23,664 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand 20 states. [2018-11-14 17:05:27,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:27,325 INFO L93 Difference]: Finished difference Result 126 states and 160 transitions. [2018-11-14 17:05:27,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-14 17:05:27,325 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 25 [2018-11-14 17:05:27,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:05:27,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 17:05:27,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 138 transitions. [2018-11-14 17:05:27,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 17:05:27,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 138 transitions. [2018-11-14 17:05:27,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 138 transitions. [2018-11-14 17:05:27,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:05:27,529 INFO L225 Difference]: With dead ends: 126 [2018-11-14 17:05:27,529 INFO L226 Difference]: Without dead ends: 124 [2018-11-14 17:05:27,530 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 17 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=289, Invalid=1117, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 17:05:27,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-11-14 17:05:27,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 72. [2018-11-14 17:05:27,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:05:27,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand 72 states. [2018-11-14 17:05:27,713 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 72 states. [2018-11-14 17:05:27,713 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 72 states. [2018-11-14 17:05:27,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:27,719 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2018-11-14 17:05:27,719 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 158 transitions. [2018-11-14 17:05:27,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:27,719 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:27,719 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 124 states. [2018-11-14 17:05:27,720 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 124 states. [2018-11-14 17:05:27,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:27,725 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2018-11-14 17:05:27,725 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 158 transitions. [2018-11-14 17:05:27,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:27,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:27,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:05:27,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:05:27,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-14 17:05:27,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 89 transitions. [2018-11-14 17:05:27,729 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 89 transitions. Word has length 25 [2018-11-14 17:05:27,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:05:27,729 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 89 transitions. [2018-11-14 17:05:27,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 17:05:27,729 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 89 transitions. [2018-11-14 17:05:27,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:05:27,730 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:05:27,730 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-14 17:05:27,731 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:05:27,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:05:27,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1219897167, now seen corresponding path program 1 times [2018-11-14 17:05:27,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:05:27,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:05:27,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:27,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:05:27,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:27,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:05:27,799 INFO L256 TraceCheckUtils]: 0: Hoare triple {2546#true} call ULTIMATE.init(); {2546#true} is VALID [2018-11-14 17:05:27,799 INFO L273 TraceCheckUtils]: 1: Hoare triple {2546#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2546#true} is VALID [2018-11-14 17:05:27,799 INFO L273 TraceCheckUtils]: 2: Hoare triple {2546#true} assume true; {2546#true} is VALID [2018-11-14 17:05:27,800 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2546#true} {2546#true} #91#return; {2546#true} is VALID [2018-11-14 17:05:27,800 INFO L256 TraceCheckUtils]: 4: Hoare triple {2546#true} call #t~ret7 := main(); {2546#true} is VALID [2018-11-14 17:05:27,800 INFO L273 TraceCheckUtils]: 5: Hoare triple {2546#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2546#true} is VALID [2018-11-14 17:05:27,800 INFO L273 TraceCheckUtils]: 6: Hoare triple {2546#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {2546#true} is VALID [2018-11-14 17:05:27,800 INFO L273 TraceCheckUtils]: 7: Hoare triple {2546#true} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) == 0 then 1 else 0) != 0;~i~0 := 1; {2546#true} is VALID [2018-11-14 17:05:27,801 INFO L273 TraceCheckUtils]: 8: Hoare triple {2546#true} assume true; {2546#true} is VALID [2018-11-14 17:05:27,801 INFO L273 TraceCheckUtils]: 9: Hoare triple {2546#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {2546#true} is VALID [2018-11-14 17:05:27,807 INFO L273 TraceCheckUtils]: 10: Hoare triple {2546#true} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} is VALID [2018-11-14 17:05:27,807 INFO L273 TraceCheckUtils]: 11: Hoare triple {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 3) * 4, 4); {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} is VALID [2018-11-14 17:05:27,808 INFO L273 TraceCheckUtils]: 12: Hoare triple {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 2) * 4, 4); {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} is VALID [2018-11-14 17:05:27,808 INFO L273 TraceCheckUtils]: 13: Hoare triple {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} is VALID [2018-11-14 17:05:27,809 INFO L273 TraceCheckUtils]: 14: Hoare triple {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} is VALID [2018-11-14 17:05:27,809 INFO L273 TraceCheckUtils]: 15: Hoare triple {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} assume true; {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} is VALID [2018-11-14 17:05:27,809 INFO L273 TraceCheckUtils]: 16: Hoare triple {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} is VALID [2018-11-14 17:05:27,810 INFO L273 TraceCheckUtils]: 17: Hoare triple {2548#(< main_~MINVAL~0 (+ main_~CCCELVOL4~0 1))} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {2547#false} is VALID [2018-11-14 17:05:27,810 INFO L273 TraceCheckUtils]: 18: Hoare triple {2547#false} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 3) * 4, 4); {2547#false} is VALID [2018-11-14 17:05:27,810 INFO L273 TraceCheckUtils]: 19: Hoare triple {2547#false} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 2) * 4, 4); {2547#false} is VALID [2018-11-14 17:05:27,811 INFO L273 TraceCheckUtils]: 20: Hoare triple {2547#false} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {2547#false} is VALID [2018-11-14 17:05:27,811 INFO L273 TraceCheckUtils]: 21: Hoare triple {2547#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2547#false} is VALID [2018-11-14 17:05:27,811 INFO L273 TraceCheckUtils]: 22: Hoare triple {2547#false} assume true; {2547#false} is VALID [2018-11-14 17:05:27,812 INFO L273 TraceCheckUtils]: 23: Hoare triple {2547#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {2547#false} is VALID [2018-11-14 17:05:27,812 INFO L273 TraceCheckUtils]: 24: Hoare triple {2547#false} ~i~0 := 0; {2547#false} is VALID [2018-11-14 17:05:27,812 INFO L273 TraceCheckUtils]: 25: Hoare triple {2547#false} assume true; {2547#false} is VALID [2018-11-14 17:05:27,813 INFO L273 TraceCheckUtils]: 26: Hoare triple {2547#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {2547#false} is VALID [2018-11-14 17:05:27,813 INFO L273 TraceCheckUtils]: 27: Hoare triple {2547#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {2547#false} is VALID [2018-11-14 17:05:27,813 INFO L256 TraceCheckUtils]: 28: Hoare triple {2547#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {2547#false} is VALID [2018-11-14 17:05:27,813 INFO L273 TraceCheckUtils]: 29: Hoare triple {2547#false} ~cond := #in~cond; {2547#false} is VALID [2018-11-14 17:05:27,814 INFO L273 TraceCheckUtils]: 30: Hoare triple {2547#false} assume ~cond == 0; {2547#false} is VALID [2018-11-14 17:05:27,814 INFO L273 TraceCheckUtils]: 31: Hoare triple {2547#false} assume !false; {2547#false} is VALID [2018-11-14 17:05:27,815 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:05:27,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:05:27,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:05:27,815 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-14 17:05:27,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:05:27,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:05:27,884 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:05:27,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:05:27,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:05:27,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:05:27,885 INFO L87 Difference]: Start difference. First operand 72 states and 89 transitions. Second operand 3 states. [2018-11-14 17:05:28,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:28,124 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2018-11-14 17:05:28,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:05:28,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-14 17:05:28,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:05:28,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:05:28,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-14 17:05:28,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:05:28,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-14 17:05:28,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 75 transitions. [2018-11-14 17:05:28,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:05:28,224 INFO L225 Difference]: With dead ends: 104 [2018-11-14 17:05:28,224 INFO L226 Difference]: Without dead ends: 79 [2018-11-14 17:05:28,225 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 17:05:28,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-14 17:05:28,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 72. [2018-11-14 17:05:28,370 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:05:28,371 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 72 states. [2018-11-14 17:05:28,371 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 72 states. [2018-11-14 17:05:28,371 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 72 states. [2018-11-14 17:05:28,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:28,375 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2018-11-14 17:05:28,375 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2018-11-14 17:05:28,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:28,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:28,376 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 79 states. [2018-11-14 17:05:28,376 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 79 states. [2018-11-14 17:05:28,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:28,378 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2018-11-14 17:05:28,378 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2018-11-14 17:05:28,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:28,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:28,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:05:28,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:05:28,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-14 17:05:28,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2018-11-14 17:05:28,380 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 32 [2018-11-14 17:05:28,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:05:28,381 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2018-11-14 17:05:28,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:05:28,381 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2018-11-14 17:05:28,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:05:28,382 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:05:28,382 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-14 17:05:28,382 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:05:28,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:05:28,382 INFO L82 PathProgramCache]: Analyzing trace with hash 634725197, now seen corresponding path program 1 times [2018-11-14 17:05:28,382 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:05:28,383 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:05:28,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:28,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:05:28,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:28,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:05:28,432 INFO L256 TraceCheckUtils]: 0: Hoare triple {2930#true} call ULTIMATE.init(); {2930#true} is VALID [2018-11-14 17:05:28,432 INFO L273 TraceCheckUtils]: 1: Hoare triple {2930#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2930#true} is VALID [2018-11-14 17:05:28,432 INFO L273 TraceCheckUtils]: 2: Hoare triple {2930#true} assume true; {2930#true} is VALID [2018-11-14 17:05:28,432 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2930#true} {2930#true} #91#return; {2930#true} is VALID [2018-11-14 17:05:28,433 INFO L256 TraceCheckUtils]: 4: Hoare triple {2930#true} call #t~ret7 := main(); {2930#true} is VALID [2018-11-14 17:05:28,433 INFO L273 TraceCheckUtils]: 5: Hoare triple {2930#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2930#true} is VALID [2018-11-14 17:05:28,433 INFO L273 TraceCheckUtils]: 6: Hoare triple {2930#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {2930#true} is VALID [2018-11-14 17:05:28,433 INFO L273 TraceCheckUtils]: 7: Hoare triple {2930#true} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) == 0 then 1 else 0) != 0;~i~0 := 1; {2930#true} is VALID [2018-11-14 17:05:28,433 INFO L273 TraceCheckUtils]: 8: Hoare triple {2930#true} assume true; {2930#true} is VALID [2018-11-14 17:05:28,433 INFO L273 TraceCheckUtils]: 9: Hoare triple {2930#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {2930#true} is VALID [2018-11-14 17:05:28,440 INFO L273 TraceCheckUtils]: 10: Hoare triple {2930#true} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:05:28,441 INFO L273 TraceCheckUtils]: 11: Hoare triple {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} assume !(~CCCELVOL3~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 3) * 4, 4); {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:05:28,441 INFO L273 TraceCheckUtils]: 12: Hoare triple {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 2) * 4, 4); {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:05:28,441 INFO L273 TraceCheckUtils]: 13: Hoare triple {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:05:28,463 INFO L273 TraceCheckUtils]: 14: Hoare triple {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:05:28,476 INFO L273 TraceCheckUtils]: 15: Hoare triple {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} assume true; {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:05:28,492 INFO L273 TraceCheckUtils]: 16: Hoare triple {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:05:28,501 INFO L273 TraceCheckUtils]: 17: Hoare triple {2932#(<= (+ main_~CCCELVOL4~0 1) main_~MINVAL~0)} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {2931#false} is VALID [2018-11-14 17:05:28,501 INFO L273 TraceCheckUtils]: 18: Hoare triple {2931#false} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 3) * 4, 4); {2931#false} is VALID [2018-11-14 17:05:28,501 INFO L273 TraceCheckUtils]: 19: Hoare triple {2931#false} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 2) * 4, 4); {2931#false} is VALID [2018-11-14 17:05:28,502 INFO L273 TraceCheckUtils]: 20: Hoare triple {2931#false} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {2931#false} is VALID [2018-11-14 17:05:28,502 INFO L273 TraceCheckUtils]: 21: Hoare triple {2931#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {2931#false} is VALID [2018-11-14 17:05:28,502 INFO L273 TraceCheckUtils]: 22: Hoare triple {2931#false} assume true; {2931#false} is VALID [2018-11-14 17:05:28,502 INFO L273 TraceCheckUtils]: 23: Hoare triple {2931#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {2931#false} is VALID [2018-11-14 17:05:28,502 INFO L273 TraceCheckUtils]: 24: Hoare triple {2931#false} ~i~0 := 0; {2931#false} is VALID [2018-11-14 17:05:28,503 INFO L273 TraceCheckUtils]: 25: Hoare triple {2931#false} assume true; {2931#false} is VALID [2018-11-14 17:05:28,503 INFO L273 TraceCheckUtils]: 26: Hoare triple {2931#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {2931#false} is VALID [2018-11-14 17:05:28,503 INFO L273 TraceCheckUtils]: 27: Hoare triple {2931#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {2931#false} is VALID [2018-11-14 17:05:28,503 INFO L256 TraceCheckUtils]: 28: Hoare triple {2931#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {2931#false} is VALID [2018-11-14 17:05:28,503 INFO L273 TraceCheckUtils]: 29: Hoare triple {2931#false} ~cond := #in~cond; {2931#false} is VALID [2018-11-14 17:05:28,504 INFO L273 TraceCheckUtils]: 30: Hoare triple {2931#false} assume ~cond == 0; {2931#false} is VALID [2018-11-14 17:05:28,504 INFO L273 TraceCheckUtils]: 31: Hoare triple {2931#false} assume !false; {2931#false} is VALID [2018-11-14 17:05:28,505 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:05:28,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:05:28,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:05:28,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-14 17:05:28,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:05:28,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:05:28,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:05:28,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:05:28,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:05:28,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:05:28,545 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand 3 states. [2018-11-14 17:05:28,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:28,884 INFO L93 Difference]: Finished difference Result 96 states and 115 transitions. [2018-11-14 17:05:28,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:05:28,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-11-14 17:05:28,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:05:28,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:05:28,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-14 17:05:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:05:28,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2018-11-14 17:05:28,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2018-11-14 17:05:28,989 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:05:28,991 INFO L225 Difference]: With dead ends: 96 [2018-11-14 17:05:28,991 INFO L226 Difference]: Without dead ends: 71 [2018-11-14 17:05:28,992 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 17:05:28,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-14 17:05:29,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 64. [2018-11-14 17:05:29,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:05:29,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 64 states. [2018-11-14 17:05:29,248 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 64 states. [2018-11-14 17:05:29,248 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 64 states. [2018-11-14 17:05:29,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:29,251 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2018-11-14 17:05:29,251 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2018-11-14 17:05:29,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:29,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:29,252 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 71 states. [2018-11-14 17:05:29,252 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 71 states. [2018-11-14 17:05:29,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:29,254 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2018-11-14 17:05:29,254 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 86 transitions. [2018-11-14 17:05:29,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:29,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:29,255 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:05:29,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:05:29,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-14 17:05:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2018-11-14 17:05:29,256 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 32 [2018-11-14 17:05:29,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:05:29,257 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2018-11-14 17:05:29,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:05:29,257 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2018-11-14 17:05:29,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 17:05:29,257 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:05:29,258 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] [2018-11-14 17:05:29,258 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:05:29,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:05:29,258 INFO L82 PathProgramCache]: Analyzing trace with hash -500679399, now seen corresponding path program 1 times [2018-11-14 17:05:29,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:05:29,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:05:29,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:29,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:05:29,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:29,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:05:30,134 INFO L256 TraceCheckUtils]: 0: Hoare triple {3280#true} call ULTIMATE.init(); {3280#true} is VALID [2018-11-14 17:05:30,134 INFO L273 TraceCheckUtils]: 1: Hoare triple {3280#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {3280#true} is VALID [2018-11-14 17:05:30,134 INFO L273 TraceCheckUtils]: 2: Hoare triple {3280#true} assume true; {3280#true} is VALID [2018-11-14 17:05:30,135 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3280#true} {3280#true} #91#return; {3280#true} is VALID [2018-11-14 17:05:30,135 INFO L256 TraceCheckUtils]: 4: Hoare triple {3280#true} call #t~ret7 := main(); {3280#true} is VALID [2018-11-14 17:05:30,135 INFO L273 TraceCheckUtils]: 5: Hoare triple {3280#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {3280#true} is VALID [2018-11-14 17:05:30,136 INFO L273 TraceCheckUtils]: 6: Hoare triple {3280#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {3282#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~CCCELVOL1~0 6) main_~CCCELVOL3~0))} is VALID [2018-11-14 17:05:30,136 INFO L273 TraceCheckUtils]: 7: Hoare triple {3282#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~CCCELVOL1~0 6) main_~CCCELVOL3~0))} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) == 0 then 1 else 0) != 0;~i~0 := 1; {3283#(and (<= (+ main_~CCCELVOL1~0 6) main_~CCCELVOL3~0) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:30,138 INFO L273 TraceCheckUtils]: 8: Hoare triple {3283#(and (<= (+ main_~CCCELVOL1~0 6) main_~CCCELVOL3~0) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume true; {3283#(and (<= (+ main_~CCCELVOL1~0 6) main_~CCCELVOL3~0) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:30,139 INFO L273 TraceCheckUtils]: 9: Hoare triple {3283#(and (<= (+ main_~CCCELVOL1~0 6) main_~CCCELVOL3~0) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {3283#(and (<= (+ main_~CCCELVOL1~0 6) main_~CCCELVOL3~0) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:30,140 INFO L273 TraceCheckUtils]: 10: Hoare triple {3283#(and (<= (+ main_~CCCELVOL1~0 6) main_~CCCELVOL3~0) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {3283#(and (<= (+ main_~CCCELVOL1~0 6) main_~CCCELVOL3~0) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:30,142 INFO L273 TraceCheckUtils]: 11: Hoare triple {3283#(and (<= (+ main_~CCCELVOL1~0 6) main_~CCCELVOL3~0) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 3) * 4, 4); {3284#(and (= main_~i~0 1) (<= (+ main_~CCCELVOL1~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:30,143 INFO L273 TraceCheckUtils]: 12: Hoare triple {3284#(and (= main_~i~0 1) (<= (+ main_~CCCELVOL1~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (< 0 (+ ~CELLCOUNT~0 1)))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 2) * 4, 4); {3284#(and (= main_~i~0 1) (<= (+ main_~CCCELVOL1~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:30,145 INFO L273 TraceCheckUtils]: 13: Hoare triple {3284#(and (= main_~i~0 1) (<= (+ main_~CCCELVOL1~0 6) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)) main_~CCCELVOL2~0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (< 0 (+ ~CELLCOUNT~0 1)))} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {3285#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:30,146 INFO L273 TraceCheckUtils]: 14: Hoare triple {3285#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3286#(and (or (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4)))) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12)))))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:30,147 INFO L273 TraceCheckUtils]: 15: Hoare triple {3286#(and (or (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4)))) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12)))))) (< 0 (+ ~CELLCOUNT~0 1)))} assume true; {3286#(and (or (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4)))) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12)))))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:30,148 INFO L273 TraceCheckUtils]: 16: Hoare triple {3286#(and (or (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4)))) (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12)))))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {3287#(<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12)))))} is VALID [2018-11-14 17:05:30,149 INFO L273 TraceCheckUtils]: 17: Hoare triple {3287#(<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12)))))} ~i~0 := 0; {3288#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} is VALID [2018-11-14 17:05:30,149 INFO L273 TraceCheckUtils]: 18: Hoare triple {3288#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} assume true; {3288#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} is VALID [2018-11-14 17:05:30,150 INFO L273 TraceCheckUtils]: 19: Hoare triple {3288#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {3288#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} is VALID [2018-11-14 17:05:30,151 INFO L273 TraceCheckUtils]: 20: Hoare triple {3288#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} assume #t~short6; {3288#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} is VALID [2018-11-14 17:05:30,151 INFO L256 TraceCheckUtils]: 21: Hoare triple {3288#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {3280#true} is VALID [2018-11-14 17:05:30,152 INFO L273 TraceCheckUtils]: 22: Hoare triple {3280#true} ~cond := #in~cond; {3280#true} is VALID [2018-11-14 17:05:30,152 INFO L273 TraceCheckUtils]: 23: Hoare triple {3280#true} assume !(~cond == 0); {3280#true} is VALID [2018-11-14 17:05:30,152 INFO L273 TraceCheckUtils]: 24: Hoare triple {3280#true} assume true; {3280#true} is VALID [2018-11-14 17:05:30,153 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {3280#true} {3288#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} #95#return; {3288#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} is VALID [2018-11-14 17:05:30,154 INFO L273 TraceCheckUtils]: 26: Hoare triple {3288#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} havoc #t~short6;havoc #t~mem4;havoc #t~mem5; {3288#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} is VALID [2018-11-14 17:05:30,155 INFO L273 TraceCheckUtils]: 27: Hoare triple {3288#(and (<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3289#(<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-14 17:05:30,155 INFO L273 TraceCheckUtils]: 28: Hoare triple {3289#(<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume true; {3289#(<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-14 17:05:30,156 INFO L273 TraceCheckUtils]: 29: Hoare triple {3289#(<= (+ main_~MINVAL~0 6) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {3290#|main_#t~short6|} is VALID [2018-11-14 17:05:30,156 INFO L273 TraceCheckUtils]: 30: Hoare triple {3290#|main_#t~short6|} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {3281#false} is VALID [2018-11-14 17:05:30,156 INFO L256 TraceCheckUtils]: 31: Hoare triple {3281#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {3281#false} is VALID [2018-11-14 17:05:30,157 INFO L273 TraceCheckUtils]: 32: Hoare triple {3281#false} ~cond := #in~cond; {3281#false} is VALID [2018-11-14 17:05:30,157 INFO L273 TraceCheckUtils]: 33: Hoare triple {3281#false} assume ~cond == 0; {3281#false} is VALID [2018-11-14 17:05:30,157 INFO L273 TraceCheckUtils]: 34: Hoare triple {3281#false} assume !false; {3281#false} is VALID [2018-11-14 17:05:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:05:30,161 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:05:30,161 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 17:05:30,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:05:30,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:05:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:05:30,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:05:30,516 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 17:05:30,522 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 17:05:30,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:05:30,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:30,547 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 17:05:30,548 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-11-14 17:05:30,550 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:05:30,596 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 29 treesize of output 24 [2018-11-14 17:05:30,601 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:30,605 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 24 treesize of output 39 [2018-11-14 17:05:30,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:05:30,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:30,628 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 17:05:30,629 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:38, output treesize:22 [2018-11-14 17:05:30,633 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:05:30,648 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 23 treesize of output 18 [2018-11-14 17:05:30,654 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:30,657 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 18 treesize of output 27 [2018-11-14 17:05:30,659 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:05:30,667 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:30,677 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 17:05:30,678 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:16 [2018-11-14 17:05:30,681 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:05:30,919 INFO L256 TraceCheckUtils]: 0: Hoare triple {3280#true} call ULTIMATE.init(); {3280#true} is VALID [2018-11-14 17:05:30,919 INFO L273 TraceCheckUtils]: 1: Hoare triple {3280#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {3280#true} is VALID [2018-11-14 17:05:30,920 INFO L273 TraceCheckUtils]: 2: Hoare triple {3280#true} assume true; {3280#true} is VALID [2018-11-14 17:05:30,920 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3280#true} {3280#true} #91#return; {3280#true} is VALID [2018-11-14 17:05:30,920 INFO L256 TraceCheckUtils]: 4: Hoare triple {3280#true} call #t~ret7 := main(); {3280#true} is VALID [2018-11-14 17:05:30,920 INFO L273 TraceCheckUtils]: 5: Hoare triple {3280#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {3280#true} is VALID [2018-11-14 17:05:30,921 INFO L273 TraceCheckUtils]: 6: Hoare triple {3280#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {3312#(and (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0) (<= main_~CCCELVOL4~0 5))} is VALID [2018-11-14 17:05:30,922 INFO L273 TraceCheckUtils]: 7: Hoare triple {3312#(and (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0) (<= main_~CCCELVOL4~0 5))} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) == 0 then 1 else 0) != 0;~i~0 := 1; {3316#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0) (<= main_~CCCELVOL4~0 5))} is VALID [2018-11-14 17:05:30,922 INFO L273 TraceCheckUtils]: 8: Hoare triple {3316#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0) (<= main_~CCCELVOL4~0 5))} assume true; {3316#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0) (<= main_~CCCELVOL4~0 5))} is VALID [2018-11-14 17:05:30,923 INFO L273 TraceCheckUtils]: 9: Hoare triple {3316#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0) (<= main_~CCCELVOL4~0 5))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {3316#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0) (<= main_~CCCELVOL4~0 5))} is VALID [2018-11-14 17:05:30,924 INFO L273 TraceCheckUtils]: 10: Hoare triple {3316#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0) (<= main_~CCCELVOL4~0 5))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {3326#(and (<= main_~MINVAL~0 5) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 7 main_~CCCELVOL3~0))} is VALID [2018-11-14 17:05:30,924 INFO L273 TraceCheckUtils]: 11: Hoare triple {3326#(and (<= main_~MINVAL~0 5) (= 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 * 4 - 3) * 4, 4); {3330#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:30,926 INFO L273 TraceCheckUtils]: 12: Hoare triple {3330#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= 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 * 4 - 2) * 4, 4); {3330#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:30,927 INFO L273 TraceCheckUtils]: 13: Hoare triple {3330#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {3337#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:30,928 INFO L273 TraceCheckUtils]: 14: Hoare triple {3337#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {3337#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:30,928 INFO L273 TraceCheckUtils]: 15: Hoare triple {3337#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0))} assume true; {3337#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:30,929 INFO L273 TraceCheckUtils]: 16: Hoare triple {3337#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {3337#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:30,930 INFO L273 TraceCheckUtils]: 17: Hoare triple {3337#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0))} ~i~0 := 0; {3350#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:05:30,931 INFO L273 TraceCheckUtils]: 18: Hoare triple {3350#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume true; {3350#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:05:30,932 INFO L273 TraceCheckUtils]: 19: Hoare triple {3350#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {3350#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:05:30,932 INFO L273 TraceCheckUtils]: 20: Hoare triple {3350#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume #t~short6; {3350#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:05:30,934 INFO L256 TraceCheckUtils]: 21: Hoare triple {3350#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {3363#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)))} is VALID [2018-11-14 17:05:30,935 INFO L273 TraceCheckUtils]: 22: Hoare triple {3363#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)))} ~cond := #in~cond; {3363#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)))} is VALID [2018-11-14 17:05:30,935 INFO L273 TraceCheckUtils]: 23: Hoare triple {3363#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)))} assume !(~cond == 0); {3363#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)))} is VALID [2018-11-14 17:05:30,936 INFO L273 TraceCheckUtils]: 24: Hoare triple {3363#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)))} assume true; {3363#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)))} is VALID [2018-11-14 17:05:30,937 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {3363#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (<= 7 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)))} {3350#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} #95#return; {3350#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:05:30,937 INFO L273 TraceCheckUtils]: 26: Hoare triple {3350#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} havoc #t~short6;havoc #t~mem4;havoc #t~mem5; {3350#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:05:30,938 INFO L273 TraceCheckUtils]: 27: Hoare triple {3350#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {3330#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:30,939 INFO L273 TraceCheckUtils]: 28: Hoare triple {3330#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume true; {3330#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:30,941 INFO L273 TraceCheckUtils]: 29: Hoare triple {3330#(and (<= main_~MINVAL~0 5) (<= 7 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {3290#|main_#t~short6|} is VALID [2018-11-14 17:05:30,942 INFO L273 TraceCheckUtils]: 30: Hoare triple {3290#|main_#t~short6|} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {3281#false} is VALID [2018-11-14 17:05:30,942 INFO L256 TraceCheckUtils]: 31: Hoare triple {3281#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {3281#false} is VALID [2018-11-14 17:05:30,942 INFO L273 TraceCheckUtils]: 32: Hoare triple {3281#false} ~cond := #in~cond; {3281#false} is VALID [2018-11-14 17:05:30,942 INFO L273 TraceCheckUtils]: 33: Hoare triple {3281#false} assume ~cond == 0; {3281#false} is VALID [2018-11-14 17:05:30,943 INFO L273 TraceCheckUtils]: 34: Hoare triple {3281#false} assume !false; {3281#false} is VALID [2018-11-14 17:05:30,948 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:05:30,976 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:05:30,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2018-11-14 17:05:30,976 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-11-14 17:05:30,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:05:30,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 17:05:31,185 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:05:31,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 17:05:31,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 17:05:31,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=263, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:05:31,186 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand 18 states. [2018-11-14 17:05:50,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:50,453 INFO L93 Difference]: Finished difference Result 169 states and 205 transitions. [2018-11-14 17:05:50,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-14 17:05:50,453 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-11-14 17:05:50,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:05:50,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:05:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 161 transitions. [2018-11-14 17:05:50,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:05:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 161 transitions. [2018-11-14 17:05:50,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 161 transitions. [2018-11-14 17:05:50,736 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:05:50,740 INFO L225 Difference]: With dead ends: 169 [2018-11-14 17:05:50,740 INFO L226 Difference]: Without dead ends: 152 [2018-11-14 17:05:50,741 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=342, Invalid=1218, Unknown=0, NotChecked=0, Total=1560 [2018-11-14 17:05:50,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-11-14 17:05:51,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 97. [2018-11-14 17:05:51,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:05:51,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand 97 states. [2018-11-14 17:05:51,025 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 97 states. [2018-11-14 17:05:51,025 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 97 states. [2018-11-14 17:05:51,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:51,030 INFO L93 Difference]: Finished difference Result 152 states and 185 transitions. [2018-11-14 17:05:51,030 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 185 transitions. [2018-11-14 17:05:51,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:51,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:51,031 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 152 states. [2018-11-14 17:05:51,031 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 152 states. [2018-11-14 17:05:51,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:51,036 INFO L93 Difference]: Finished difference Result 152 states and 185 transitions. [2018-11-14 17:05:51,036 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 185 transitions. [2018-11-14 17:05:51,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:51,037 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:51,037 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:05:51,037 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:05:51,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-11-14 17:05:51,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 116 transitions. [2018-11-14 17:05:51,040 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 116 transitions. Word has length 35 [2018-11-14 17:05:51,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:05:51,040 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 116 transitions. [2018-11-14 17:05:51,040 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 17:05:51,040 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 116 transitions. [2018-11-14 17:05:51,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-14 17:05:51,041 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:05:51,041 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:05:51,041 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:05:51,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:05:51,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1068389213, now seen corresponding path program 1 times [2018-11-14 17:05:51,042 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:05:51,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:05:51,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:51,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:05:51,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:05:51,628 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 8 [2018-11-14 17:05:51,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {4088#true} call ULTIMATE.init(); {4088#true} is VALID [2018-11-14 17:05:51,869 INFO L273 TraceCheckUtils]: 1: Hoare triple {4088#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {4088#true} is VALID [2018-11-14 17:05:51,869 INFO L273 TraceCheckUtils]: 2: Hoare triple {4088#true} assume true; {4088#true} is VALID [2018-11-14 17:05:51,869 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4088#true} {4088#true} #91#return; {4088#true} is VALID [2018-11-14 17:05:51,870 INFO L256 TraceCheckUtils]: 4: Hoare triple {4088#true} call #t~ret7 := main(); {4088#true} is VALID [2018-11-14 17:05:51,870 INFO L273 TraceCheckUtils]: 5: Hoare triple {4088#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {4088#true} is VALID [2018-11-14 17:05:51,871 INFO L273 TraceCheckUtils]: 6: Hoare triple {4088#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {4090#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-14 17:05:51,872 INFO L273 TraceCheckUtils]: 7: Hoare triple {4090#(<= 2 ~CELLCOUNT~0)} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) == 0 then 1 else 0) != 0;~i~0 := 1; {4091#(and (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:51,872 INFO L273 TraceCheckUtils]: 8: Hoare triple {4091#(and (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume true; {4091#(and (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:51,873 INFO L273 TraceCheckUtils]: 9: Hoare triple {4091#(and (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {4091#(and (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:51,873 INFO L273 TraceCheckUtils]: 10: Hoare triple {4091#(and (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {4091#(and (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:51,874 INFO L273 TraceCheckUtils]: 11: Hoare triple {4091#(and (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 3) * 4, 4); {4092#(and (= main_~i~0 1) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)) 0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:51,875 INFO L273 TraceCheckUtils]: 12: Hoare triple {4092#(and (= main_~i~0 1) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)) 0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 2) * 4, 4); {4092#(and (= main_~i~0 1) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)) 0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:51,880 INFO L273 TraceCheckUtils]: 13: Hoare triple {4092#(and (= main_~i~0 1) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)) 0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {4092#(and (= main_~i~0 1) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)) 0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-14 17:05:51,884 INFO L273 TraceCheckUtils]: 14: Hoare triple {4092#(and (= main_~i~0 1) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)) 0) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (< 0 (+ ~CELLCOUNT~0 1)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4093#(and (< 0 (+ ~CELLCOUNT~0 1)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))))))} is VALID [2018-11-14 17:05:51,886 INFO L273 TraceCheckUtils]: 15: Hoare triple {4093#(and (< 0 (+ ~CELLCOUNT~0 1)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))))))} assume true; {4093#(and (< 0 (+ ~CELLCOUNT~0 1)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))))))} is VALID [2018-11-14 17:05:51,887 INFO L273 TraceCheckUtils]: 16: Hoare triple {4093#(and (< 0 (+ ~CELLCOUNT~0 1)) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (and (<= (* 4 main_~i~0) (+ ~CELLCOUNT~0 2)) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {4094#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12)))))} is VALID [2018-11-14 17:05:51,889 INFO L273 TraceCheckUtils]: 17: Hoare triple {4094#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12)))))} ~i~0 := 0; {4095#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} is VALID [2018-11-14 17:05:51,890 INFO L273 TraceCheckUtils]: 18: Hoare triple {4095#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} assume true; {4095#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} is VALID [2018-11-14 17:05:51,890 INFO L273 TraceCheckUtils]: 19: Hoare triple {4095#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {4095#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} is VALID [2018-11-14 17:05:51,891 INFO L273 TraceCheckUtils]: 20: Hoare triple {4095#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {4095#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} is VALID [2018-11-14 17:05:51,891 INFO L256 TraceCheckUtils]: 21: Hoare triple {4095#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {4088#true} is VALID [2018-11-14 17:05:51,891 INFO L273 TraceCheckUtils]: 22: Hoare triple {4088#true} ~cond := #in~cond; {4088#true} is VALID [2018-11-14 17:05:51,891 INFO L273 TraceCheckUtils]: 23: Hoare triple {4088#true} assume !(~cond == 0); {4088#true} is VALID [2018-11-14 17:05:51,891 INFO L273 TraceCheckUtils]: 24: Hoare triple {4088#true} assume true; {4088#true} is VALID [2018-11-14 17:05:51,893 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {4088#true} {4095#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} #95#return; {4095#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} is VALID [2018-11-14 17:05:51,893 INFO L273 TraceCheckUtils]: 26: Hoare triple {4095#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} havoc #t~short6;havoc #t~mem4;havoc #t~mem5; {4095#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} is VALID [2018-11-14 17:05:51,894 INFO L273 TraceCheckUtils]: 27: Hoare triple {4095#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 4) (+ |main_~#volArray~0.offset| (- 12))))) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4096#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-14 17:05:51,895 INFO L273 TraceCheckUtils]: 28: Hoare triple {4096#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume true; {4096#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-14 17:05:51,896 INFO L273 TraceCheckUtils]: 29: Hoare triple {4096#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {4097#|main_#t~short6|} is VALID [2018-11-14 17:05:51,896 INFO L273 TraceCheckUtils]: 30: Hoare triple {4097#|main_#t~short6|} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {4089#false} is VALID [2018-11-14 17:05:51,896 INFO L256 TraceCheckUtils]: 31: Hoare triple {4089#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {4089#false} is VALID [2018-11-14 17:05:51,897 INFO L273 TraceCheckUtils]: 32: Hoare triple {4089#false} ~cond := #in~cond; {4089#false} is VALID [2018-11-14 17:05:51,897 INFO L273 TraceCheckUtils]: 33: Hoare triple {4089#false} assume ~cond == 0; {4089#false} is VALID [2018-11-14 17:05:51,897 INFO L273 TraceCheckUtils]: 34: Hoare triple {4089#false} assume !false; {4089#false} is VALID [2018-11-14 17:05:51,901 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:05:51,902 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:05:51,902 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:05:51,911 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:05:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:05:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:05:51,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:05:52,085 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 17:05:52,091 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 17:05:52,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:05:52,096 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:52,107 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 17:05:52,108 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-14 17:05:52,112 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:05:52,154 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 29 treesize of output 24 [2018-11-14 17:05:52,162 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:52,167 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 24 treesize of output 39 [2018-11-14 17:05:52,170 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:05:52,178 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:52,187 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:52,188 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-14 17:05:52,239 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 32 treesize of output 25 [2018-11-14 17:05:52,251 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:52,255 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:52,258 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:05:52,264 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 52 [2018-11-14 17:05:52,265 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:05:52,286 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:52,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:05:52,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2018-11-14 17:05:52,776 INFO L256 TraceCheckUtils]: 0: Hoare triple {4088#true} call ULTIMATE.init(); {4088#true} is VALID [2018-11-14 17:05:52,777 INFO L273 TraceCheckUtils]: 1: Hoare triple {4088#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {4088#true} is VALID [2018-11-14 17:05:52,777 INFO L273 TraceCheckUtils]: 2: Hoare triple {4088#true} assume true; {4088#true} is VALID [2018-11-14 17:05:52,777 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4088#true} {4088#true} #91#return; {4088#true} is VALID [2018-11-14 17:05:52,778 INFO L256 TraceCheckUtils]: 4: Hoare triple {4088#true} call #t~ret7 := main(); {4088#true} is VALID [2018-11-14 17:05:52,778 INFO L273 TraceCheckUtils]: 5: Hoare triple {4088#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {4088#true} is VALID [2018-11-14 17:05:52,778 INFO L273 TraceCheckUtils]: 6: Hoare triple {4088#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {4119#(= |main_~#volArray~0.offset| 0)} is VALID [2018-11-14 17:05:52,779 INFO L273 TraceCheckUtils]: 7: Hoare triple {4119#(= |main_~#volArray~0.offset| 0)} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) == 0 then 1 else 0) != 0;~i~0 := 1; {4123#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:52,780 INFO L273 TraceCheckUtils]: 8: Hoare triple {4123#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume true; {4123#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:52,780 INFO L273 TraceCheckUtils]: 9: Hoare triple {4123#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {4123#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:52,781 INFO L273 TraceCheckUtils]: 10: Hoare triple {4123#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {4123#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:52,782 INFO L273 TraceCheckUtils]: 11: Hoare triple {4123#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 3) * 4, 4); {4136#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:52,783 INFO L273 TraceCheckUtils]: 12: Hoare triple {4136#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 2) * 4, 4); {4140#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 8))) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:05:52,785 INFO L273 TraceCheckUtils]: 13: Hoare triple {4140#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 12)))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 8))) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {4144#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-14 17:05:52,786 INFO L273 TraceCheckUtils]: 14: Hoare triple {4144#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {4144#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-14 17:05:52,786 INFO L273 TraceCheckUtils]: 15: Hoare triple {4144#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} assume true; {4144#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-14 17:05:52,788 INFO L273 TraceCheckUtils]: 16: Hoare triple {4144#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {4144#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-14 17:05:52,788 INFO L273 TraceCheckUtils]: 17: Hoare triple {4144#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} ~i~0 := 0; {4157#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} is VALID [2018-11-14 17:05:52,789 INFO L273 TraceCheckUtils]: 18: Hoare triple {4157#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} assume true; {4157#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} is VALID [2018-11-14 17:05:52,791 INFO L273 TraceCheckUtils]: 19: Hoare triple {4157#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {4157#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} is VALID [2018-11-14 17:05:52,792 INFO L273 TraceCheckUtils]: 20: Hoare triple {4157#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {4157#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} is VALID [2018-11-14 17:05:52,794 INFO L256 TraceCheckUtils]: 21: Hoare triple {4157#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {4170#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 12) 0)))} is VALID [2018-11-14 17:05:52,795 INFO L273 TraceCheckUtils]: 22: Hoare triple {4170#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 12) 0)))} ~cond := #in~cond; {4170#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 12) 0)))} is VALID [2018-11-14 17:05:52,795 INFO L273 TraceCheckUtils]: 23: Hoare triple {4170#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 12) 0)))} assume !(~cond == 0); {4170#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 12) 0)))} is VALID [2018-11-14 17:05:52,796 INFO L273 TraceCheckUtils]: 24: Hoare triple {4170#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 12) 0)))} assume true; {4170#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 12) 0)))} is VALID [2018-11-14 17:05:52,797 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {4170#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 8) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 12) 0)))} {4157#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} #95#return; {4157#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} is VALID [2018-11-14 17:05:52,797 INFO L273 TraceCheckUtils]: 26: Hoare triple {4157#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} havoc #t~short6;havoc #t~mem4;havoc #t~mem5; {4157#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} is VALID [2018-11-14 17:05:52,798 INFO L273 TraceCheckUtils]: 27: Hoare triple {4157#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {4189#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-14 17:05:52,799 INFO L273 TraceCheckUtils]: 28: Hoare triple {4189#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} assume true; {4189#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-14 17:05:52,800 INFO L273 TraceCheckUtils]: 29: Hoare triple {4189#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {4097#|main_#t~short6|} is VALID [2018-11-14 17:05:52,801 INFO L273 TraceCheckUtils]: 30: Hoare triple {4097#|main_#t~short6|} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {4089#false} is VALID [2018-11-14 17:05:52,801 INFO L256 TraceCheckUtils]: 31: Hoare triple {4089#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {4089#false} is VALID [2018-11-14 17:05:52,802 INFO L273 TraceCheckUtils]: 32: Hoare triple {4089#false} ~cond := #in~cond; {4089#false} is VALID [2018-11-14 17:05:52,802 INFO L273 TraceCheckUtils]: 33: Hoare triple {4089#false} assume ~cond == 0; {4089#false} is VALID [2018-11-14 17:05:52,802 INFO L273 TraceCheckUtils]: 34: Hoare triple {4089#false} assume !false; {4089#false} is VALID [2018-11-14 17:05:52,808 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:05:52,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:05:52,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2018-11-14 17:05:52,832 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-11-14 17:05:52,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:05:52,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-14 17:05:52,913 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:05:52,914 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-14 17:05:52,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-14 17:05:52,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2018-11-14 17:05:52,915 INFO L87 Difference]: Start difference. First operand 97 states and 116 transitions. Second operand 18 states. [2018-11-14 17:05:57,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:57,776 INFO L93 Difference]: Finished difference Result 209 states and 250 transitions. [2018-11-14 17:05:57,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-14 17:05:57,777 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 35 [2018-11-14 17:05:57,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:05:57,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:05:57,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 170 transitions. [2018-11-14 17:05:57,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 17:05:57,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 170 transitions. [2018-11-14 17:05:57,783 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 170 transitions. [2018-11-14 17:05:58,687 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:05:58,693 INFO L225 Difference]: With dead ends: 209 [2018-11-14 17:05:58,693 INFO L226 Difference]: Without dead ends: 192 [2018-11-14 17:05:58,694 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 28 SyntacticMatches, 3 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 307 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=324, Invalid=1082, Unknown=0, NotChecked=0, Total=1406 [2018-11-14 17:05:58,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-11-14 17:05:59,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 123. [2018-11-14 17:05:59,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:05:59,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand 123 states. [2018-11-14 17:05:59,247 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand 123 states. [2018-11-14 17:05:59,247 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 123 states. [2018-11-14 17:05:59,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:59,252 INFO L93 Difference]: Finished difference Result 192 states and 231 transitions. [2018-11-14 17:05:59,252 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 231 transitions. [2018-11-14 17:05:59,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:59,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:59,253 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 192 states. [2018-11-14 17:05:59,254 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 192 states. [2018-11-14 17:05:59,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:05:59,259 INFO L93 Difference]: Finished difference Result 192 states and 231 transitions. [2018-11-14 17:05:59,259 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 231 transitions. [2018-11-14 17:05:59,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:05:59,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:05:59,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:05:59,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:05:59,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-14 17:05:59,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 147 transitions. [2018-11-14 17:05:59,263 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 147 transitions. Word has length 35 [2018-11-14 17:05:59,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:05:59,264 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 147 transitions. [2018-11-14 17:05:59,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-14 17:05:59,264 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 147 transitions. [2018-11-14 17:05:59,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 17:05:59,265 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:05:59,265 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-14 17:05:59,265 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:05:59,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:05:59,265 INFO L82 PathProgramCache]: Analyzing trace with hash -907357220, now seen corresponding path program 1 times [2018-11-14 17:05:59,266 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:05:59,266 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:05:59,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:59,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:05:59,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:05:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:05:59,484 INFO L256 TraceCheckUtils]: 0: Hoare triple {5055#true} call ULTIMATE.init(); {5055#true} is VALID [2018-11-14 17:05:59,484 INFO L273 TraceCheckUtils]: 1: Hoare triple {5055#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {5055#true} is VALID [2018-11-14 17:05:59,484 INFO L273 TraceCheckUtils]: 2: Hoare triple {5055#true} assume true; {5055#true} is VALID [2018-11-14 17:05:59,485 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5055#true} {5055#true} #91#return; {5055#true} is VALID [2018-11-14 17:05:59,485 INFO L256 TraceCheckUtils]: 4: Hoare triple {5055#true} call #t~ret7 := main(); {5055#true} is VALID [2018-11-14 17:05:59,485 INFO L273 TraceCheckUtils]: 5: Hoare triple {5055#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {5055#true} is VALID [2018-11-14 17:05:59,485 INFO L273 TraceCheckUtils]: 6: Hoare triple {5055#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {5055#true} is VALID [2018-11-14 17:05:59,486 INFO L273 TraceCheckUtils]: 7: Hoare triple {5055#true} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) == 0 then 1 else 0) != 0;~i~0 := 1; {5055#true} is VALID [2018-11-14 17:05:59,486 INFO L273 TraceCheckUtils]: 8: Hoare triple {5055#true} assume true; {5055#true} is VALID [2018-11-14 17:05:59,486 INFO L273 TraceCheckUtils]: 9: Hoare triple {5055#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {5055#true} is VALID [2018-11-14 17:05:59,486 INFO L273 TraceCheckUtils]: 10: Hoare triple {5055#true} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {5055#true} is VALID [2018-11-14 17:05:59,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {5055#true} assume !(~CCCELVOL3~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 3) * 4, 4); {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:05:59,514 INFO L273 TraceCheckUtils]: 12: Hoare triple {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 2) * 4, 4); {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:05:59,522 INFO L273 TraceCheckUtils]: 13: Hoare triple {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:05:59,535 INFO L273 TraceCheckUtils]: 14: Hoare triple {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:05:59,548 INFO L273 TraceCheckUtils]: 15: Hoare triple {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} assume true; {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:05:59,560 INFO L273 TraceCheckUtils]: 16: Hoare triple {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:05:59,577 INFO L273 TraceCheckUtils]: 17: Hoare triple {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} is VALID [2018-11-14 17:05:59,586 INFO L273 TraceCheckUtils]: 18: Hoare triple {5057#(<= (+ main_~CCCELVOL3~0 1) main_~MINVAL~0)} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 3) * 4, 4); {5056#false} is VALID [2018-11-14 17:05:59,586 INFO L273 TraceCheckUtils]: 19: Hoare triple {5056#false} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 2) * 4, 4); {5056#false} is VALID [2018-11-14 17:05:59,586 INFO L273 TraceCheckUtils]: 20: Hoare triple {5056#false} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {5056#false} is VALID [2018-11-14 17:05:59,587 INFO L273 TraceCheckUtils]: 21: Hoare triple {5056#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5056#false} is VALID [2018-11-14 17:05:59,587 INFO L273 TraceCheckUtils]: 22: Hoare triple {5056#false} assume true; {5056#false} is VALID [2018-11-14 17:05:59,587 INFO L273 TraceCheckUtils]: 23: Hoare triple {5056#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {5056#false} is VALID [2018-11-14 17:05:59,587 INFO L273 TraceCheckUtils]: 24: Hoare triple {5056#false} ~i~0 := 0; {5056#false} is VALID [2018-11-14 17:05:59,587 INFO L273 TraceCheckUtils]: 25: Hoare triple {5056#false} assume true; {5056#false} is VALID [2018-11-14 17:05:59,588 INFO L273 TraceCheckUtils]: 26: Hoare triple {5056#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {5056#false} is VALID [2018-11-14 17:05:59,588 INFO L273 TraceCheckUtils]: 27: Hoare triple {5056#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {5056#false} is VALID [2018-11-14 17:05:59,588 INFO L256 TraceCheckUtils]: 28: Hoare triple {5056#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {5055#true} is VALID [2018-11-14 17:05:59,588 INFO L273 TraceCheckUtils]: 29: Hoare triple {5055#true} ~cond := #in~cond; {5055#true} is VALID [2018-11-14 17:05:59,588 INFO L273 TraceCheckUtils]: 30: Hoare triple {5055#true} assume !(~cond == 0); {5055#true} is VALID [2018-11-14 17:05:59,589 INFO L273 TraceCheckUtils]: 31: Hoare triple {5055#true} assume true; {5055#true} is VALID [2018-11-14 17:05:59,589 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {5055#true} {5056#false} #95#return; {5056#false} is VALID [2018-11-14 17:05:59,589 INFO L273 TraceCheckUtils]: 33: Hoare triple {5056#false} havoc #t~short6;havoc #t~mem4;havoc #t~mem5; {5056#false} is VALID [2018-11-14 17:05:59,589 INFO L273 TraceCheckUtils]: 34: Hoare triple {5056#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5056#false} is VALID [2018-11-14 17:05:59,589 INFO L273 TraceCheckUtils]: 35: Hoare triple {5056#false} assume true; {5056#false} is VALID [2018-11-14 17:05:59,590 INFO L273 TraceCheckUtils]: 36: Hoare triple {5056#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {5056#false} is VALID [2018-11-14 17:05:59,590 INFO L273 TraceCheckUtils]: 37: Hoare triple {5056#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {5056#false} is VALID [2018-11-14 17:05:59,590 INFO L256 TraceCheckUtils]: 38: Hoare triple {5056#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {5056#false} is VALID [2018-11-14 17:05:59,590 INFO L273 TraceCheckUtils]: 39: Hoare triple {5056#false} ~cond := #in~cond; {5056#false} is VALID [2018-11-14 17:05:59,591 INFO L273 TraceCheckUtils]: 40: Hoare triple {5056#false} assume ~cond == 0; {5056#false} is VALID [2018-11-14 17:05:59,591 INFO L273 TraceCheckUtils]: 41: Hoare triple {5056#false} assume !false; {5056#false} is VALID [2018-11-14 17:05:59,592 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 17:05:59,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:05:59,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:05:59,593 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-14 17:05:59,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:05:59,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:06:00,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:00,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:06:00,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:06:00,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:06:00,089 INFO L87 Difference]: Start difference. First operand 123 states and 147 transitions. Second operand 3 states. [2018-11-14 17:06:00,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:00,997 INFO L93 Difference]: Finished difference Result 169 states and 200 transitions. [2018-11-14 17:06:00,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:06:00,998 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-14 17:06:00,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:06:00,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:06:00,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-14 17:06:00,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:06:01,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-14 17:06:01,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 75 transitions. [2018-11-14 17:06:01,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:01,309 INFO L225 Difference]: With dead ends: 169 [2018-11-14 17:06:01,309 INFO L226 Difference]: Without dead ends: 115 [2018-11-14 17:06:01,310 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:06:01,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-11-14 17:06:01,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-11-14 17:06:01,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:06:01,968 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand 115 states. [2018-11-14 17:06:01,968 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 115 states. [2018-11-14 17:06:01,968 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 115 states. [2018-11-14 17:06:01,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:01,971 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2018-11-14 17:06:01,972 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2018-11-14 17:06:01,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:01,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:01,972 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 115 states. [2018-11-14 17:06:01,973 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 115 states. [2018-11-14 17:06:01,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:01,976 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2018-11-14 17:06:01,976 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2018-11-14 17:06:01,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:01,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:01,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:06:01,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:06:01,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-14 17:06:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 135 transitions. [2018-11-14 17:06:01,980 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 135 transitions. Word has length 42 [2018-11-14 17:06:01,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:06:01,980 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 135 transitions. [2018-11-14 17:06:01,980 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:06:01,980 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2018-11-14 17:06:01,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 17:06:01,981 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:01,981 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-14 17:06:01,981 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:01,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:01,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1742970600, now seen corresponding path program 2 times [2018-11-14 17:06:01,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:01,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:01,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:01,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:06:01,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:01,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:02,212 INFO L256 TraceCheckUtils]: 0: Hoare triple {5652#true} call ULTIMATE.init(); {5652#true} is VALID [2018-11-14 17:06:02,212 INFO L273 TraceCheckUtils]: 1: Hoare triple {5652#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {5652#true} is VALID [2018-11-14 17:06:02,213 INFO L273 TraceCheckUtils]: 2: Hoare triple {5652#true} assume true; {5652#true} is VALID [2018-11-14 17:06:02,213 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5652#true} {5652#true} #91#return; {5652#true} is VALID [2018-11-14 17:06:02,213 INFO L256 TraceCheckUtils]: 4: Hoare triple {5652#true} call #t~ret7 := main(); {5652#true} is VALID [2018-11-14 17:06:02,213 INFO L273 TraceCheckUtils]: 5: Hoare triple {5652#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {5652#true} is VALID [2018-11-14 17:06:02,213 INFO L273 TraceCheckUtils]: 6: Hoare triple {5652#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {5652#true} is VALID [2018-11-14 17:06:02,213 INFO L273 TraceCheckUtils]: 7: Hoare triple {5652#true} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) == 0 then 1 else 0) != 0;~i~0 := 1; {5652#true} is VALID [2018-11-14 17:06:02,214 INFO L273 TraceCheckUtils]: 8: Hoare triple {5652#true} assume true; {5652#true} is VALID [2018-11-14 17:06:02,214 INFO L273 TraceCheckUtils]: 9: Hoare triple {5652#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {5652#true} is VALID [2018-11-14 17:06:02,214 INFO L273 TraceCheckUtils]: 10: Hoare triple {5652#true} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {5652#true} is VALID [2018-11-14 17:06:02,232 INFO L273 TraceCheckUtils]: 11: Hoare triple {5652#true} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 3) * 4, 4); {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} is VALID [2018-11-14 17:06:02,241 INFO L273 TraceCheckUtils]: 12: Hoare triple {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 2) * 4, 4); {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} is VALID [2018-11-14 17:06:02,255 INFO L273 TraceCheckUtils]: 13: Hoare triple {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} is VALID [2018-11-14 17:06:02,264 INFO L273 TraceCheckUtils]: 14: Hoare triple {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} is VALID [2018-11-14 17:06:02,276 INFO L273 TraceCheckUtils]: 15: Hoare triple {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} assume true; {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} is VALID [2018-11-14 17:06:02,289 INFO L273 TraceCheckUtils]: 16: Hoare triple {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} is VALID [2018-11-14 17:06:02,302 INFO L273 TraceCheckUtils]: 17: Hoare triple {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} assume !(~CCCELVOL4~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} is VALID [2018-11-14 17:06:02,314 INFO L273 TraceCheckUtils]: 18: Hoare triple {5654#(< main_~MINVAL~0 (+ main_~CCCELVOL3~0 1))} assume !(~CCCELVOL3~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 3) * 4, 4); {5653#false} is VALID [2018-11-14 17:06:02,315 INFO L273 TraceCheckUtils]: 19: Hoare triple {5653#false} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 2) * 4, 4); {5653#false} is VALID [2018-11-14 17:06:02,315 INFO L273 TraceCheckUtils]: 20: Hoare triple {5653#false} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {5653#false} is VALID [2018-11-14 17:06:02,315 INFO L273 TraceCheckUtils]: 21: Hoare triple {5653#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {5653#false} is VALID [2018-11-14 17:06:02,315 INFO L273 TraceCheckUtils]: 22: Hoare triple {5653#false} assume true; {5653#false} is VALID [2018-11-14 17:06:02,316 INFO L273 TraceCheckUtils]: 23: Hoare triple {5653#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {5653#false} is VALID [2018-11-14 17:06:02,316 INFO L273 TraceCheckUtils]: 24: Hoare triple {5653#false} ~i~0 := 0; {5653#false} is VALID [2018-11-14 17:06:02,316 INFO L273 TraceCheckUtils]: 25: Hoare triple {5653#false} assume true; {5653#false} is VALID [2018-11-14 17:06:02,316 INFO L273 TraceCheckUtils]: 26: Hoare triple {5653#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {5653#false} is VALID [2018-11-14 17:06:02,316 INFO L273 TraceCheckUtils]: 27: Hoare triple {5653#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {5653#false} is VALID [2018-11-14 17:06:02,316 INFO L256 TraceCheckUtils]: 28: Hoare triple {5653#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {5652#true} is VALID [2018-11-14 17:06:02,316 INFO L273 TraceCheckUtils]: 29: Hoare triple {5652#true} ~cond := #in~cond; {5652#true} is VALID [2018-11-14 17:06:02,317 INFO L273 TraceCheckUtils]: 30: Hoare triple {5652#true} assume !(~cond == 0); {5652#true} is VALID [2018-11-14 17:06:02,317 INFO L273 TraceCheckUtils]: 31: Hoare triple {5652#true} assume true; {5652#true} is VALID [2018-11-14 17:06:02,317 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {5652#true} {5653#false} #95#return; {5653#false} is VALID [2018-11-14 17:06:02,317 INFO L273 TraceCheckUtils]: 33: Hoare triple {5653#false} havoc #t~short6;havoc #t~mem4;havoc #t~mem5; {5653#false} is VALID [2018-11-14 17:06:02,317 INFO L273 TraceCheckUtils]: 34: Hoare triple {5653#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {5653#false} is VALID [2018-11-14 17:06:02,318 INFO L273 TraceCheckUtils]: 35: Hoare triple {5653#false} assume true; {5653#false} is VALID [2018-11-14 17:06:02,318 INFO L273 TraceCheckUtils]: 36: Hoare triple {5653#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {5653#false} is VALID [2018-11-14 17:06:02,318 INFO L273 TraceCheckUtils]: 37: Hoare triple {5653#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {5653#false} is VALID [2018-11-14 17:06:02,318 INFO L256 TraceCheckUtils]: 38: Hoare triple {5653#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {5653#false} is VALID [2018-11-14 17:06:02,318 INFO L273 TraceCheckUtils]: 39: Hoare triple {5653#false} ~cond := #in~cond; {5653#false} is VALID [2018-11-14 17:06:02,319 INFO L273 TraceCheckUtils]: 40: Hoare triple {5653#false} assume ~cond == 0; {5653#false} is VALID [2018-11-14 17:06:02,319 INFO L273 TraceCheckUtils]: 41: Hoare triple {5653#false} assume !false; {5653#false} is VALID [2018-11-14 17:06:02,320 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 17:06:02,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:06:02,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:06:02,321 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-14 17:06:02,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:06:02,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:06:02,368 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:02,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:06:02,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:06:02,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:06:02,370 INFO L87 Difference]: Start difference. First operand 115 states and 135 transitions. Second operand 3 states. [2018-11-14 17:06:03,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:03,056 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2018-11-14 17:06:03,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:06:03,056 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2018-11-14 17:06:03,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:06:03,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:06:03,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-14 17:06:03,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:06:03,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2018-11-14 17:06:03,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 75 transitions. [2018-11-14 17:06:03,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:03,624 INFO L225 Difference]: With dead ends: 118 [2018-11-14 17:06:03,625 INFO L226 Difference]: Without dead ends: 90 [2018-11-14 17:06:03,625 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:06:03,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-14 17:06:04,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-14 17:06:04,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:06:04,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 89 states. [2018-11-14 17:06:04,131 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 89 states. [2018-11-14 17:06:04,132 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 89 states. [2018-11-14 17:06:04,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:04,134 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2018-11-14 17:06:04,134 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2018-11-14 17:06:04,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:04,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:04,135 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 90 states. [2018-11-14 17:06:04,135 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 90 states. [2018-11-14 17:06:04,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:04,137 INFO L93 Difference]: Finished difference Result 90 states and 105 transitions. [2018-11-14 17:06:04,137 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 105 transitions. [2018-11-14 17:06:04,138 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:04,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:04,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:06:04,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:06:04,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-14 17:06:04,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 104 transitions. [2018-11-14 17:06:04,140 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 104 transitions. Word has length 42 [2018-11-14 17:06:04,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:06:04,141 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 104 transitions. [2018-11-14 17:06:04,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:06:04,141 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 104 transitions. [2018-11-14 17:06:04,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 17:06:04,142 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:04,142 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-14 17:06:04,142 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:04,142 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:04,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1172721628, now seen corresponding path program 2 times [2018-11-14 17:06:04,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:04,143 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:04,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:04,143 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:06:04,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:04,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:04,566 WARN L179 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 8 [2018-11-14 17:06:05,222 INFO L256 TraceCheckUtils]: 0: Hoare triple {6101#true} call ULTIMATE.init(); {6101#true} is VALID [2018-11-14 17:06:05,222 INFO L273 TraceCheckUtils]: 1: Hoare triple {6101#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {6101#true} is VALID [2018-11-14 17:06:05,223 INFO L273 TraceCheckUtils]: 2: Hoare triple {6101#true} assume true; {6101#true} is VALID [2018-11-14 17:06:05,223 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6101#true} {6101#true} #91#return; {6101#true} is VALID [2018-11-14 17:06:05,223 INFO L256 TraceCheckUtils]: 4: Hoare triple {6101#true} call #t~ret7 := main(); {6101#true} is VALID [2018-11-14 17:06:05,224 INFO L273 TraceCheckUtils]: 5: Hoare triple {6101#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {6101#true} is VALID [2018-11-14 17:06:05,226 INFO L273 TraceCheckUtils]: 6: Hoare triple {6101#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {6103#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0))} is VALID [2018-11-14 17:06:05,237 INFO L273 TraceCheckUtils]: 7: Hoare triple {6103#(and (<= 2 ~CELLCOUNT~0) (<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0))} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) == 0 then 1 else 0) != 0;~i~0 := 1; {6104#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0))} is VALID [2018-11-14 17:06:05,238 INFO L273 TraceCheckUtils]: 8: Hoare triple {6104#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0))} assume true; {6104#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0))} is VALID [2018-11-14 17:06:05,238 INFO L273 TraceCheckUtils]: 9: Hoare triple {6104#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {6104#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0))} is VALID [2018-11-14 17:06:05,239 INFO L273 TraceCheckUtils]: 10: Hoare triple {6104#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {6104#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0))} is VALID [2018-11-14 17:06:05,240 INFO L273 TraceCheckUtils]: 11: Hoare triple {6104#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 3) * 4, 4); {6104#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0))} is VALID [2018-11-14 17:06:05,241 INFO L273 TraceCheckUtils]: 12: Hoare triple {6104#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 2) * 4, 4); {6105#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= (+ main_~CCCELVOL1~0 2) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 4)) main_~CCCELVOL1~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:05,242 INFO L273 TraceCheckUtils]: 13: Hoare triple {6105#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= (+ main_~CCCELVOL1~0 2) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 4)) main_~CCCELVOL1~0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {6106#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:05,244 INFO L273 TraceCheckUtils]: 14: Hoare triple {6106#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6107#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (or (<= (* 4 main_~i~0) 7) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 8)))))) (<= (* 4 main_~i~0) 8) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:05,245 INFO L273 TraceCheckUtils]: 15: Hoare triple {6107#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (or (<= (* 4 main_~i~0) 7) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 8)))))) (<= (* 4 main_~i~0) 8) (< 0 (div ~CELLCOUNT~0 4)))} assume true; {6107#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (or (<= (* 4 main_~i~0) 7) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 8)))))) (<= (* 4 main_~i~0) 8) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:05,247 INFO L273 TraceCheckUtils]: 16: Hoare triple {6107#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (or (<= (* 4 main_~i~0) 7) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 8)))))) (<= (* 4 main_~i~0) 8) (< 0 (div ~CELLCOUNT~0 4)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {6108#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:05,260 INFO L273 TraceCheckUtils]: 17: Hoare triple {6108#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} ~i~0 := 0; {6109#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:05,261 INFO L273 TraceCheckUtils]: 18: Hoare triple {6109#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} assume true; {6109#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:05,261 INFO L273 TraceCheckUtils]: 19: Hoare triple {6109#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {6109#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:05,262 INFO L273 TraceCheckUtils]: 20: Hoare triple {6109#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} assume #t~short6; {6109#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:05,262 INFO L256 TraceCheckUtils]: 21: Hoare triple {6109#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {6101#true} is VALID [2018-11-14 17:06:05,262 INFO L273 TraceCheckUtils]: 22: Hoare triple {6101#true} ~cond := #in~cond; {6101#true} is VALID [2018-11-14 17:06:05,263 INFO L273 TraceCheckUtils]: 23: Hoare triple {6101#true} assume !(~cond == 0); {6101#true} is VALID [2018-11-14 17:06:05,263 INFO L273 TraceCheckUtils]: 24: Hoare triple {6101#true} assume true; {6101#true} is VALID [2018-11-14 17:06:05,264 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {6101#true} {6109#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} #95#return; {6109#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:05,264 INFO L273 TraceCheckUtils]: 26: Hoare triple {6109#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} havoc #t~short6;havoc #t~mem4;havoc #t~mem5; {6109#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:05,265 INFO L273 TraceCheckUtils]: 27: Hoare triple {6109#(and (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6110#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:05,266 INFO L273 TraceCheckUtils]: 28: Hoare triple {6110#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} assume true; {6110#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:05,268 INFO L273 TraceCheckUtils]: 29: Hoare triple {6110#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {6110#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:05,269 INFO L273 TraceCheckUtils]: 30: Hoare triple {6110#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} assume #t~short6; {6110#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:05,269 INFO L256 TraceCheckUtils]: 31: Hoare triple {6110#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {6101#true} is VALID [2018-11-14 17:06:05,269 INFO L273 TraceCheckUtils]: 32: Hoare triple {6101#true} ~cond := #in~cond; {6101#true} is VALID [2018-11-14 17:06:05,270 INFO L273 TraceCheckUtils]: 33: Hoare triple {6101#true} assume !(~cond == 0); {6101#true} is VALID [2018-11-14 17:06:05,270 INFO L273 TraceCheckUtils]: 34: Hoare triple {6101#true} assume true; {6101#true} is VALID [2018-11-14 17:06:05,271 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {6101#true} {6110#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} #95#return; {6110#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:05,272 INFO L273 TraceCheckUtils]: 36: Hoare triple {6110#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} havoc #t~short6;havoc #t~mem4;havoc #t~mem5; {6110#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:05,274 INFO L273 TraceCheckUtils]: 37: Hoare triple {6110#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6111#(<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-14 17:06:05,275 INFO L273 TraceCheckUtils]: 38: Hoare triple {6111#(<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume true; {6111#(<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-14 17:06:05,276 INFO L273 TraceCheckUtils]: 39: Hoare triple {6111#(<= (+ main_~MINVAL~0 2) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {6112#|main_#t~short6|} is VALID [2018-11-14 17:06:05,276 INFO L273 TraceCheckUtils]: 40: Hoare triple {6112#|main_#t~short6|} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {6102#false} is VALID [2018-11-14 17:06:05,277 INFO L256 TraceCheckUtils]: 41: Hoare triple {6102#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {6102#false} is VALID [2018-11-14 17:06:05,277 INFO L273 TraceCheckUtils]: 42: Hoare triple {6102#false} ~cond := #in~cond; {6102#false} is VALID [2018-11-14 17:06:05,277 INFO L273 TraceCheckUtils]: 43: Hoare triple {6102#false} assume ~cond == 0; {6102#false} is VALID [2018-11-14 17:06:05,278 INFO L273 TraceCheckUtils]: 44: Hoare triple {6102#false} assume !false; {6102#false} is VALID [2018-11-14 17:06:05,287 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 17:06:05,288 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:06:05,288 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:06:05,300 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:06:05,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:06:05,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:06:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:05,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:06:05,490 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 17:06:05,499 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 17:06:05,504 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:06:05,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:06:05,517 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 17:06:05,517 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:29, output treesize:22 [2018-11-14 17:06:05,520 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:06:05,560 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 23 treesize of output 18 [2018-11-14 17:06:05,566 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:06:05,570 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:06:05,601 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 18 treesize of output 37 [2018-11-14 17:06:05,607 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:06:05,617 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:06:05,631 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 17:06:05,631 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:31 [2018-11-14 17:06:05,635 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:06:06,105 INFO L256 TraceCheckUtils]: 0: Hoare triple {6101#true} call ULTIMATE.init(); {6101#true} is VALID [2018-11-14 17:06:06,105 INFO L273 TraceCheckUtils]: 1: Hoare triple {6101#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {6101#true} is VALID [2018-11-14 17:06:06,106 INFO L273 TraceCheckUtils]: 2: Hoare triple {6101#true} assume true; {6101#true} is VALID [2018-11-14 17:06:06,106 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6101#true} {6101#true} #91#return; {6101#true} is VALID [2018-11-14 17:06:06,106 INFO L256 TraceCheckUtils]: 4: Hoare triple {6101#true} call #t~ret7 := main(); {6101#true} is VALID [2018-11-14 17:06:06,106 INFO L273 TraceCheckUtils]: 5: Hoare triple {6101#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {6101#true} is VALID [2018-11-14 17:06:06,107 INFO L273 TraceCheckUtils]: 6: Hoare triple {6101#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {6134#(and (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:06,107 INFO L273 TraceCheckUtils]: 7: Hoare triple {6134#(and (<= main_~CCCELVOL1~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) == 0 then 1 else 0) != 0;~i~0 := 1; {6138#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:06,108 INFO L273 TraceCheckUtils]: 8: Hoare triple {6138#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} assume true; {6138#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:06,108 INFO L273 TraceCheckUtils]: 9: Hoare triple {6138#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {6138#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:06,109 INFO L273 TraceCheckUtils]: 10: Hoare triple {6138#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {6138#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:06,109 INFO L273 TraceCheckUtils]: 11: Hoare triple {6138#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 3) * 4, 4); {6138#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:06,110 INFO L273 TraceCheckUtils]: 12: Hoare triple {6138#(and (<= main_~CCCELVOL1~0 1) (= main_~i~0 1) (<= 3 main_~CCCELVOL2~0) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 2) * 4, 4); {6154#(and (<= main_~CCCELVOL1~0 1) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 8)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:06,112 INFO L273 TraceCheckUtils]: 13: Hoare triple {6154#(and (<= main_~CCCELVOL1~0 1) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 8)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {6158#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-14 17:06:06,113 INFO L273 TraceCheckUtils]: 14: Hoare triple {6158#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {6158#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-14 17:06:06,114 INFO L273 TraceCheckUtils]: 15: Hoare triple {6158#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} assume true; {6158#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-14 17:06:06,115 INFO L273 TraceCheckUtils]: 16: Hoare triple {6158#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {6158#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-14 17:06:06,116 INFO L273 TraceCheckUtils]: 17: Hoare triple {6158#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} ~i~0 := 0; {6171#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (= main_~i~0 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-14 17:06:06,117 INFO L273 TraceCheckUtils]: 18: Hoare triple {6171#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (= main_~i~0 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} assume true; {6171#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (= main_~i~0 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-14 17:06:06,118 INFO L273 TraceCheckUtils]: 19: Hoare triple {6171#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (= main_~i~0 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {6171#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (= main_~i~0 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-14 17:06:06,118 INFO L273 TraceCheckUtils]: 20: Hoare triple {6171#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (= main_~i~0 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} assume #t~short6; {6171#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (= main_~i~0 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-14 17:06:06,120 INFO L256 TraceCheckUtils]: 21: Hoare triple {6171#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (= main_~i~0 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} is VALID [2018-11-14 17:06:06,121 INFO L273 TraceCheckUtils]: 22: Hoare triple {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} ~cond := #in~cond; {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} is VALID [2018-11-14 17:06:06,121 INFO L273 TraceCheckUtils]: 23: Hoare triple {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} assume !(~cond == 0); {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} is VALID [2018-11-14 17:06:06,122 INFO L273 TraceCheckUtils]: 24: Hoare triple {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} assume true; {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} is VALID [2018-11-14 17:06:06,122 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} {6171#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (= main_~i~0 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} #95#return; {6171#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (= main_~i~0 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-14 17:06:06,123 INFO L273 TraceCheckUtils]: 26: Hoare triple {6171#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (= main_~i~0 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} havoc #t~short6;havoc #t~mem4;havoc #t~mem5; {6171#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (= main_~i~0 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-14 17:06:06,124 INFO L273 TraceCheckUtils]: 27: Hoare triple {6171#(and (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (= main_~i~0 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6203#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-14 17:06:06,125 INFO L273 TraceCheckUtils]: 28: Hoare triple {6203#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} assume true; {6203#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-14 17:06:06,126 INFO L273 TraceCheckUtils]: 29: Hoare triple {6203#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {6203#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-14 17:06:06,127 INFO L273 TraceCheckUtils]: 30: Hoare triple {6203#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} assume #t~short6; {6203#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-14 17:06:06,129 INFO L256 TraceCheckUtils]: 31: Hoare triple {6203#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} is VALID [2018-11-14 17:06:06,129 INFO L273 TraceCheckUtils]: 32: Hoare triple {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} ~cond := #in~cond; {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} is VALID [2018-11-14 17:06:06,130 INFO L273 TraceCheckUtils]: 33: Hoare triple {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} assume !(~cond == 0); {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} is VALID [2018-11-14 17:06:06,130 INFO L273 TraceCheckUtils]: 34: Hoare triple {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} assume true; {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} is VALID [2018-11-14 17:06:06,131 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {6184#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_3| Int)) (and (<= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 12) 1) (<= 3 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_3|) 8))))} {6203#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} #95#return; {6203#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-14 17:06:06,131 INFO L273 TraceCheckUtils]: 36: Hoare triple {6203#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} havoc #t~short6;havoc #t~mem4;havoc #t~mem5; {6203#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-14 17:06:06,132 INFO L273 TraceCheckUtils]: 37: Hoare triple {6203#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {6234#(and (= main_~i~0 2) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-14 17:06:06,133 INFO L273 TraceCheckUtils]: 38: Hoare triple {6234#(and (= main_~i~0 2) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} assume true; {6234#(and (= main_~i~0 2) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} is VALID [2018-11-14 17:06:06,134 INFO L273 TraceCheckUtils]: 39: Hoare triple {6234#(and (= main_~i~0 2) (= |main_~#volArray~0.offset| 0) (<= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (<= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 1) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {6112#|main_#t~short6|} is VALID [2018-11-14 17:06:06,134 INFO L273 TraceCheckUtils]: 40: Hoare triple {6112#|main_#t~short6|} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {6102#false} is VALID [2018-11-14 17:06:06,135 INFO L256 TraceCheckUtils]: 41: Hoare triple {6102#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {6102#false} is VALID [2018-11-14 17:06:06,135 INFO L273 TraceCheckUtils]: 42: Hoare triple {6102#false} ~cond := #in~cond; {6102#false} is VALID [2018-11-14 17:06:06,135 INFO L273 TraceCheckUtils]: 43: Hoare triple {6102#false} assume ~cond == 0; {6102#false} is VALID [2018-11-14 17:06:06,135 INFO L273 TraceCheckUtils]: 44: Hoare triple {6102#false} assume !false; {6102#false} is VALID [2018-11-14 17:06:06,144 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 17:06:06,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:06:06,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2018-11-14 17:06:06,165 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2018-11-14 17:06:06,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:06:06,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-14 17:06:06,258 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:06,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-14 17:06:06,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-14 17:06:06,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-11-14 17:06:06,260 INFO L87 Difference]: Start difference. First operand 89 states and 104 transitions. Second operand 20 states. [2018-11-14 17:06:12,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:12,873 INFO L93 Difference]: Finished difference Result 246 states and 297 transitions. [2018-11-14 17:06:12,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-14 17:06:12,874 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 45 [2018-11-14 17:06:12,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:06:12,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 17:06:12,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 191 transitions. [2018-11-14 17:06:12,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 17:06:12,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 191 transitions. [2018-11-14 17:06:12,879 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 191 transitions. [2018-11-14 17:06:13,245 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:13,249 INFO L225 Difference]: With dead ends: 246 [2018-11-14 17:06:13,250 INFO L226 Difference]: Without dead ends: 212 [2018-11-14 17:06:13,251 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=399, Invalid=1581, Unknown=0, NotChecked=0, Total=1980 [2018-11-14 17:06:13,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-11-14 17:06:13,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 145. [2018-11-14 17:06:13,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:06:13,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand 145 states. [2018-11-14 17:06:13,917 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand 145 states. [2018-11-14 17:06:13,917 INFO L87 Difference]: Start difference. First operand 212 states. Second operand 145 states. [2018-11-14 17:06:13,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:13,924 INFO L93 Difference]: Finished difference Result 212 states and 254 transitions. [2018-11-14 17:06:13,924 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 254 transitions. [2018-11-14 17:06:13,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:13,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:13,925 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 212 states. [2018-11-14 17:06:13,925 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 212 states. [2018-11-14 17:06:13,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:13,931 INFO L93 Difference]: Finished difference Result 212 states and 254 transitions. [2018-11-14 17:06:13,931 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 254 transitions. [2018-11-14 17:06:13,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:13,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:13,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:06:13,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:06:13,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-11-14 17:06:13,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 173 transitions. [2018-11-14 17:06:13,935 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 173 transitions. Word has length 45 [2018-11-14 17:06:13,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:06:13,936 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 173 transitions. [2018-11-14 17:06:13,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-14 17:06:13,936 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 173 transitions. [2018-11-14 17:06:13,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 17:06:13,937 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:13,937 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-14 17:06:13,937 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:13,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:13,938 INFO L82 PathProgramCache]: Analyzing trace with hash -897962014, now seen corresponding path program 1 times [2018-11-14 17:06:13,938 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:13,938 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:13,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:13,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:06:13,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:14,280 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 3 [2018-11-14 17:06:14,734 WARN L179 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 11 [2018-11-14 17:06:15,080 INFO L256 TraceCheckUtils]: 0: Hoare triple {7224#true} call ULTIMATE.init(); {7224#true} is VALID [2018-11-14 17:06:15,081 INFO L273 TraceCheckUtils]: 1: Hoare triple {7224#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {7224#true} is VALID [2018-11-14 17:06:15,081 INFO L273 TraceCheckUtils]: 2: Hoare triple {7224#true} assume true; {7224#true} is VALID [2018-11-14 17:06:15,082 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7224#true} {7224#true} #91#return; {7224#true} is VALID [2018-11-14 17:06:15,082 INFO L256 TraceCheckUtils]: 4: Hoare triple {7224#true} call #t~ret7 := main(); {7224#true} is VALID [2018-11-14 17:06:15,082 INFO L273 TraceCheckUtils]: 5: Hoare triple {7224#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {7224#true} is VALID [2018-11-14 17:06:15,084 INFO L273 TraceCheckUtils]: 6: Hoare triple {7224#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {7226#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-14 17:06:15,085 INFO L273 TraceCheckUtils]: 7: Hoare triple {7226#(<= 2 ~CELLCOUNT~0)} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) == 0 then 1 else 0) != 0;~i~0 := 1; {7227#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:15,085 INFO L273 TraceCheckUtils]: 8: Hoare triple {7227#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} assume true; {7227#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:15,086 INFO L273 TraceCheckUtils]: 9: Hoare triple {7227#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {7227#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:15,086 INFO L273 TraceCheckUtils]: 10: Hoare triple {7227#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {7227#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:15,087 INFO L273 TraceCheckUtils]: 11: Hoare triple {7227#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 3) * 4, 4); {7227#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:15,088 INFO L273 TraceCheckUtils]: 12: Hoare triple {7227#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} assume ~CCCELVOL2~0 >= ~MINVAL~0;call write~int(~CCCELVOL2~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 2) * 4, 4); {7228#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 4)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)))))} is VALID [2018-11-14 17:06:15,090 INFO L273 TraceCheckUtils]: 13: Hoare triple {7228#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 4)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)))))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {7228#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 4)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)))))} is VALID [2018-11-14 17:06:15,091 INFO L273 TraceCheckUtils]: 14: Hoare triple {7228#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 4)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)))))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7229#(and (or (<= (* 4 main_~i~0) 7) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 8)))))) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= (* 4 main_~i~0) 8) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:15,092 INFO L273 TraceCheckUtils]: 15: Hoare triple {7229#(and (or (<= (* 4 main_~i~0) 7) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 8)))))) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= (* 4 main_~i~0) 8) (< 0 (div ~CELLCOUNT~0 4)))} assume true; {7229#(and (or (<= (* 4 main_~i~0) 7) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 8)))))) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= (* 4 main_~i~0) 8) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:15,094 INFO L273 TraceCheckUtils]: 16: Hoare triple {7229#(and (or (<= (* 4 main_~i~0) 7) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 8)))))) (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (<= (* 4 main_~i~0) 8) (< 0 (div ~CELLCOUNT~0 4)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {7230#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:15,095 INFO L273 TraceCheckUtils]: 17: Hoare triple {7230#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} ~i~0 := 0; {7231#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:15,096 INFO L273 TraceCheckUtils]: 18: Hoare triple {7231#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} assume true; {7231#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:15,097 INFO L273 TraceCheckUtils]: 19: Hoare triple {7231#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {7231#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:15,098 INFO L273 TraceCheckUtils]: 20: Hoare triple {7231#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} assume #t~short6; {7231#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:15,098 INFO L256 TraceCheckUtils]: 21: Hoare triple {7231#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {7224#true} is VALID [2018-11-14 17:06:15,098 INFO L273 TraceCheckUtils]: 22: Hoare triple {7224#true} ~cond := #in~cond; {7224#true} is VALID [2018-11-14 17:06:15,099 INFO L273 TraceCheckUtils]: 23: Hoare triple {7224#true} assume !(~cond == 0); {7224#true} is VALID [2018-11-14 17:06:15,099 INFO L273 TraceCheckUtils]: 24: Hoare triple {7224#true} assume true; {7224#true} is VALID [2018-11-14 17:06:15,100 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {7224#true} {7231#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} #95#return; {7231#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:15,101 INFO L273 TraceCheckUtils]: 26: Hoare triple {7231#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} havoc #t~short6;havoc #t~mem4;havoc #t~mem5; {7231#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:15,102 INFO L273 TraceCheckUtils]: 27: Hoare triple {7231#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7232#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:15,103 INFO L273 TraceCheckUtils]: 28: Hoare triple {7232#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} assume true; {7232#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:15,104 INFO L273 TraceCheckUtils]: 29: Hoare triple {7232#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {7232#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:15,105 INFO L273 TraceCheckUtils]: 30: Hoare triple {7232#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} assume #t~short6; {7232#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:15,105 INFO L256 TraceCheckUtils]: 31: Hoare triple {7232#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {7224#true} is VALID [2018-11-14 17:06:15,105 INFO L273 TraceCheckUtils]: 32: Hoare triple {7224#true} ~cond := #in~cond; {7224#true} is VALID [2018-11-14 17:06:15,105 INFO L273 TraceCheckUtils]: 33: Hoare triple {7224#true} assume !(~cond == 0); {7224#true} is VALID [2018-11-14 17:06:15,106 INFO L273 TraceCheckUtils]: 34: Hoare triple {7224#true} assume true; {7224#true} is VALID [2018-11-14 17:06:15,107 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {7224#true} {7232#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} #95#return; {7232#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:15,108 INFO L273 TraceCheckUtils]: 36: Hoare triple {7232#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} havoc #t~short6;havoc #t~mem4;havoc #t~mem5; {7232#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:15,108 INFO L273 TraceCheckUtils]: 37: Hoare triple {7232#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7233#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-14 17:06:15,109 INFO L273 TraceCheckUtils]: 38: Hoare triple {7233#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume true; {7233#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-14 17:06:15,109 INFO L273 TraceCheckUtils]: 39: Hoare triple {7233#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {7234#|main_#t~short6|} is VALID [2018-11-14 17:06:15,110 INFO L273 TraceCheckUtils]: 40: Hoare triple {7234#|main_#t~short6|} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {7225#false} is VALID [2018-11-14 17:06:15,110 INFO L256 TraceCheckUtils]: 41: Hoare triple {7225#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {7225#false} is VALID [2018-11-14 17:06:15,110 INFO L273 TraceCheckUtils]: 42: Hoare triple {7225#false} ~cond := #in~cond; {7225#false} is VALID [2018-11-14 17:06:15,110 INFO L273 TraceCheckUtils]: 43: Hoare triple {7225#false} assume ~cond == 0; {7225#false} is VALID [2018-11-14 17:06:15,110 INFO L273 TraceCheckUtils]: 44: Hoare triple {7225#false} assume !false; {7225#false} is VALID [2018-11-14 17:06:15,117 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 17:06:15,118 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:06:15,118 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:06:15,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:06:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:15,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:06:15,225 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 17:06:15,231 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 17:06:15,233 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:06:15,237 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:06:15,248 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 17:06:15,249 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2018-11-14 17:06:15,252 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:06:15,287 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 23 treesize of output 18 [2018-11-14 17:06:15,295 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:06:15,297 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 18 treesize of output 27 [2018-11-14 17:06:15,309 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:06:15,316 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:06:15,324 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:06:15,325 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-14 17:06:15,827 INFO L256 TraceCheckUtils]: 0: Hoare triple {7224#true} call ULTIMATE.init(); {7224#true} is VALID [2018-11-14 17:06:15,827 INFO L273 TraceCheckUtils]: 1: Hoare triple {7224#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {7224#true} is VALID [2018-11-14 17:06:15,827 INFO L273 TraceCheckUtils]: 2: Hoare triple {7224#true} assume true; {7224#true} is VALID [2018-11-14 17:06:15,827 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7224#true} {7224#true} #91#return; {7224#true} is VALID [2018-11-14 17:06:15,828 INFO L256 TraceCheckUtils]: 4: Hoare triple {7224#true} call #t~ret7 := main(); {7224#true} is VALID [2018-11-14 17:06:15,828 INFO L273 TraceCheckUtils]: 5: Hoare triple {7224#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {7224#true} is VALID [2018-11-14 17:06:15,846 INFO L273 TraceCheckUtils]: 6: Hoare triple {7224#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {7256#(= |main_~#volArray~0.offset| 0)} is VALID [2018-11-14 17:06:15,851 INFO L273 TraceCheckUtils]: 7: Hoare triple {7256#(= |main_~#volArray~0.offset| 0)} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) == 0 then 1 else 0) != 0;~i~0 := 1; {7260#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:15,851 INFO L273 TraceCheckUtils]: 8: Hoare triple {7260#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume true; {7260#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:15,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {7260#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {7260#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:15,853 INFO L273 TraceCheckUtils]: 10: Hoare triple {7260#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {7260#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:15,854 INFO L273 TraceCheckUtils]: 11: Hoare triple {7260#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 3) * 4, 4); {7260#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:15,854 INFO L273 TraceCheckUtils]: 12: Hoare triple {7260#(and (= 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 * 4 - 2) * 4, 4); {7276#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 8)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:15,855 INFO L273 TraceCheckUtils]: 13: Hoare triple {7276#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 8)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {7280#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:15,856 INFO L273 TraceCheckUtils]: 14: Hoare triple {7280#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {7280#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:15,856 INFO L273 TraceCheckUtils]: 15: Hoare triple {7280#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0))} assume true; {7280#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:15,857 INFO L273 TraceCheckUtils]: 16: Hoare triple {7280#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {7280#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:15,858 INFO L273 TraceCheckUtils]: 17: Hoare triple {7280#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0))} ~i~0 := 0; {7293#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:06:15,859 INFO L273 TraceCheckUtils]: 18: Hoare triple {7293#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume true; {7293#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:06:15,860 INFO L273 TraceCheckUtils]: 19: Hoare triple {7293#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {7293#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:06:15,860 INFO L273 TraceCheckUtils]: 20: Hoare triple {7293#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume #t~short6; {7293#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:06:15,862 INFO L256 TraceCheckUtils]: 21: Hoare triple {7293#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} is VALID [2018-11-14 17:06:15,863 INFO L273 TraceCheckUtils]: 22: Hoare triple {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} ~cond := #in~cond; {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} is VALID [2018-11-14 17:06:15,864 INFO L273 TraceCheckUtils]: 23: Hoare triple {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} assume !(~cond == 0); {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} is VALID [2018-11-14 17:06:15,864 INFO L273 TraceCheckUtils]: 24: Hoare triple {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} assume true; {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} is VALID [2018-11-14 17:06:15,865 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} {7293#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} #95#return; {7293#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:06:15,866 INFO L273 TraceCheckUtils]: 26: Hoare triple {7293#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} havoc #t~short6;havoc #t~mem4;havoc #t~mem5; {7293#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-14 17:06:15,867 INFO L273 TraceCheckUtils]: 27: Hoare triple {7293#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7325#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:15,868 INFO L273 TraceCheckUtils]: 28: Hoare triple {7325#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume true; {7325#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:15,869 INFO L273 TraceCheckUtils]: 29: Hoare triple {7325#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {7325#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:15,870 INFO L273 TraceCheckUtils]: 30: Hoare triple {7325#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume #t~short6; {7325#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:15,872 INFO L256 TraceCheckUtils]: 31: Hoare triple {7325#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} is VALID [2018-11-14 17:06:15,872 INFO L273 TraceCheckUtils]: 32: Hoare triple {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} ~cond := #in~cond; {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} is VALID [2018-11-14 17:06:15,873 INFO L273 TraceCheckUtils]: 33: Hoare triple {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} assume !(~cond == 0); {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} is VALID [2018-11-14 17:06:15,874 INFO L273 TraceCheckUtils]: 34: Hoare triple {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} assume true; {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} is VALID [2018-11-14 17:06:15,875 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {7306#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_5| Int)) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_5|) 12) 0))} {7325#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} #95#return; {7325#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:15,875 INFO L273 TraceCheckUtils]: 36: Hoare triple {7325#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} havoc #t~short6;havoc #t~mem4;havoc #t~mem5; {7325#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:15,876 INFO L273 TraceCheckUtils]: 37: Hoare triple {7325#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {7356#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:15,877 INFO L273 TraceCheckUtils]: 38: Hoare triple {7356#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0))} assume true; {7356#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:15,878 INFO L273 TraceCheckUtils]: 39: Hoare triple {7356#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8))) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {7234#|main_#t~short6|} is VALID [2018-11-14 17:06:15,879 INFO L273 TraceCheckUtils]: 40: Hoare triple {7234#|main_#t~short6|} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {7225#false} is VALID [2018-11-14 17:06:15,879 INFO L256 TraceCheckUtils]: 41: Hoare triple {7225#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {7225#false} is VALID [2018-11-14 17:06:15,879 INFO L273 TraceCheckUtils]: 42: Hoare triple {7225#false} ~cond := #in~cond; {7225#false} is VALID [2018-11-14 17:06:15,880 INFO L273 TraceCheckUtils]: 43: Hoare triple {7225#false} assume ~cond == 0; {7225#false} is VALID [2018-11-14 17:06:15,880 INFO L273 TraceCheckUtils]: 44: Hoare triple {7225#false} assume !false; {7225#false} is VALID [2018-11-14 17:06:15,886 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 17:06:15,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:06:15,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2018-11-14 17:06:15,906 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2018-11-14 17:06:15,906 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:06:15,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-14 17:06:15,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:15,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-14 17:06:15,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-14 17:06:15,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-11-14 17:06:15,997 INFO L87 Difference]: Start difference. First operand 145 states and 173 transitions. Second operand 19 states. [2018-11-14 17:06:20,134 WARN L179 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 25 [2018-11-14 17:06:25,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:25,891 INFO L93 Difference]: Finished difference Result 370 states and 446 transitions. [2018-11-14 17:06:25,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-14 17:06:25,891 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 45 [2018-11-14 17:06:25,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:06:25,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:06:25,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 226 transitions. [2018-11-14 17:06:25,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-14 17:06:25,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 226 transitions. [2018-11-14 17:06:25,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 226 transitions. [2018-11-14 17:06:26,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:26,244 INFO L225 Difference]: With dead ends: 370 [2018-11-14 17:06:26,245 INFO L226 Difference]: Without dead ends: 338 [2018-11-14 17:06:26,246 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 855 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=583, Invalid=2497, Unknown=0, NotChecked=0, Total=3080 [2018-11-14 17:06:26,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-11-14 17:06:27,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 174. [2018-11-14 17:06:27,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:06:27,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 338 states. Second operand 174 states. [2018-11-14 17:06:27,401 INFO L74 IsIncluded]: Start isIncluded. First operand 338 states. Second operand 174 states. [2018-11-14 17:06:27,401 INFO L87 Difference]: Start difference. First operand 338 states. Second operand 174 states. [2018-11-14 17:06:27,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:27,411 INFO L93 Difference]: Finished difference Result 338 states and 408 transitions. [2018-11-14 17:06:27,411 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 408 transitions. [2018-11-14 17:06:27,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:27,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:27,413 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 338 states. [2018-11-14 17:06:27,413 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 338 states. [2018-11-14 17:06:27,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:27,422 INFO L93 Difference]: Finished difference Result 338 states and 408 transitions. [2018-11-14 17:06:27,423 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 408 transitions. [2018-11-14 17:06:27,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:27,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:27,424 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:06:27,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:06:27,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-14 17:06:27,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 215 transitions. [2018-11-14 17:06:27,428 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 215 transitions. Word has length 45 [2018-11-14 17:06:27,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:06:27,429 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 215 transitions. [2018-11-14 17:06:27,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-14 17:06:27,429 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 215 transitions. [2018-11-14 17:06:27,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 17:06:27,430 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:27,430 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-14 17:06:27,430 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:27,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:27,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1245108186, now seen corresponding path program 1 times [2018-11-14 17:06:27,430 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:27,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:27,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:27,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:06:27,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:27,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:27,824 INFO L256 TraceCheckUtils]: 0: Hoare triple {8815#true} call ULTIMATE.init(); {8815#true} is VALID [2018-11-14 17:06:27,825 INFO L273 TraceCheckUtils]: 1: Hoare triple {8815#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {8815#true} is VALID [2018-11-14 17:06:27,825 INFO L273 TraceCheckUtils]: 2: Hoare triple {8815#true} assume true; {8815#true} is VALID [2018-11-14 17:06:27,825 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8815#true} {8815#true} #91#return; {8815#true} is VALID [2018-11-14 17:06:27,825 INFO L256 TraceCheckUtils]: 4: Hoare triple {8815#true} call #t~ret7 := main(); {8815#true} is VALID [2018-11-14 17:06:27,826 INFO L273 TraceCheckUtils]: 5: Hoare triple {8815#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {8815#true} is VALID [2018-11-14 17:06:27,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {8815#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {8817#(<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0)} is VALID [2018-11-14 17:06:27,858 INFO L273 TraceCheckUtils]: 7: Hoare triple {8817#(<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0)} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) == 0 then 1 else 0) != 0;~i~0 := 1; {8817#(<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0)} is VALID [2018-11-14 17:06:27,867 INFO L273 TraceCheckUtils]: 8: Hoare triple {8817#(<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0)} assume true; {8817#(<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0)} is VALID [2018-11-14 17:06:27,880 INFO L273 TraceCheckUtils]: 9: Hoare triple {8817#(<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {8817#(<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0)} is VALID [2018-11-14 17:06:27,889 INFO L273 TraceCheckUtils]: 10: Hoare triple {8817#(<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0)} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {8817#(<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0)} is VALID [2018-11-14 17:06:27,902 INFO L273 TraceCheckUtils]: 11: Hoare triple {8817#(<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0)} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 3) * 4, 4); {8817#(<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0)} is VALID [2018-11-14 17:06:27,911 INFO L273 TraceCheckUtils]: 12: Hoare triple {8817#(<= (+ main_~CCCELVOL1~0 2) main_~CCCELVOL2~0)} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 2) * 4, 4); {8818#(<= (+ main_~CCCELVOL1~0 3) main_~MINVAL~0)} is VALID [2018-11-14 17:06:27,922 INFO L273 TraceCheckUtils]: 13: Hoare triple {8818#(<= (+ main_~CCCELVOL1~0 3) main_~MINVAL~0)} assume ~CCCELVOL1~0 >= ~MINVAL~0;call write~int(~CCCELVOL1~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {8816#false} is VALID [2018-11-14 17:06:27,922 INFO L273 TraceCheckUtils]: 14: Hoare triple {8816#false} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {8816#false} is VALID [2018-11-14 17:06:27,922 INFO L273 TraceCheckUtils]: 15: Hoare triple {8816#false} assume true; {8816#false} is VALID [2018-11-14 17:06:27,923 INFO L273 TraceCheckUtils]: 16: Hoare triple {8816#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {8816#false} is VALID [2018-11-14 17:06:27,923 INFO L273 TraceCheckUtils]: 17: Hoare triple {8816#false} ~i~0 := 0; {8816#false} is VALID [2018-11-14 17:06:27,923 INFO L273 TraceCheckUtils]: 18: Hoare triple {8816#false} assume true; {8816#false} is VALID [2018-11-14 17:06:27,923 INFO L273 TraceCheckUtils]: 19: Hoare triple {8816#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {8816#false} is VALID [2018-11-14 17:06:27,923 INFO L273 TraceCheckUtils]: 20: Hoare triple {8816#false} assume #t~short6; {8816#false} is VALID [2018-11-14 17:06:27,924 INFO L256 TraceCheckUtils]: 21: Hoare triple {8816#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {8815#true} is VALID [2018-11-14 17:06:27,924 INFO L273 TraceCheckUtils]: 22: Hoare triple {8815#true} ~cond := #in~cond; {8815#true} is VALID [2018-11-14 17:06:27,924 INFO L273 TraceCheckUtils]: 23: Hoare triple {8815#true} assume !(~cond == 0); {8815#true} is VALID [2018-11-14 17:06:27,924 INFO L273 TraceCheckUtils]: 24: Hoare triple {8815#true} assume true; {8815#true} is VALID [2018-11-14 17:06:27,925 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {8815#true} {8816#false} #95#return; {8816#false} is VALID [2018-11-14 17:06:27,925 INFO L273 TraceCheckUtils]: 26: Hoare triple {8816#false} havoc #t~short6;havoc #t~mem4;havoc #t~mem5; {8816#false} is VALID [2018-11-14 17:06:27,925 INFO L273 TraceCheckUtils]: 27: Hoare triple {8816#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8816#false} is VALID [2018-11-14 17:06:27,925 INFO L273 TraceCheckUtils]: 28: Hoare triple {8816#false} assume true; {8816#false} is VALID [2018-11-14 17:06:27,925 INFO L273 TraceCheckUtils]: 29: Hoare triple {8816#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {8816#false} is VALID [2018-11-14 17:06:27,926 INFO L273 TraceCheckUtils]: 30: Hoare triple {8816#false} assume #t~short6; {8816#false} is VALID [2018-11-14 17:06:27,926 INFO L256 TraceCheckUtils]: 31: Hoare triple {8816#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {8815#true} is VALID [2018-11-14 17:06:27,926 INFO L273 TraceCheckUtils]: 32: Hoare triple {8815#true} ~cond := #in~cond; {8815#true} is VALID [2018-11-14 17:06:27,926 INFO L273 TraceCheckUtils]: 33: Hoare triple {8815#true} assume !(~cond == 0); {8815#true} is VALID [2018-11-14 17:06:27,926 INFO L273 TraceCheckUtils]: 34: Hoare triple {8815#true} assume true; {8815#true} is VALID [2018-11-14 17:06:27,927 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {8815#true} {8816#false} #95#return; {8816#false} is VALID [2018-11-14 17:06:27,927 INFO L273 TraceCheckUtils]: 36: Hoare triple {8816#false} havoc #t~short6;havoc #t~mem4;havoc #t~mem5; {8816#false} is VALID [2018-11-14 17:06:27,927 INFO L273 TraceCheckUtils]: 37: Hoare triple {8816#false} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {8816#false} is VALID [2018-11-14 17:06:27,927 INFO L273 TraceCheckUtils]: 38: Hoare triple {8816#false} assume true; {8816#false} is VALID [2018-11-14 17:06:27,927 INFO L273 TraceCheckUtils]: 39: Hoare triple {8816#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {8816#false} is VALID [2018-11-14 17:06:27,928 INFO L273 TraceCheckUtils]: 40: Hoare triple {8816#false} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {8816#false} is VALID [2018-11-14 17:06:27,928 INFO L256 TraceCheckUtils]: 41: Hoare triple {8816#false} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {8816#false} is VALID [2018-11-14 17:06:27,928 INFO L273 TraceCheckUtils]: 42: Hoare triple {8816#false} ~cond := #in~cond; {8816#false} is VALID [2018-11-14 17:06:27,928 INFO L273 TraceCheckUtils]: 43: Hoare triple {8816#false} assume ~cond == 0; {8816#false} is VALID [2018-11-14 17:06:27,928 INFO L273 TraceCheckUtils]: 44: Hoare triple {8816#false} assume !false; {8816#false} is VALID [2018-11-14 17:06:27,931 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-14 17:06:27,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:06:27,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:06:27,931 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-14 17:06:27,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:06:27,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:06:28,263 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:28,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:06:28,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:06:28,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:06:28,264 INFO L87 Difference]: Start difference. First operand 174 states and 215 transitions. Second operand 4 states. [2018-11-14 17:06:30,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:30,633 INFO L93 Difference]: Finished difference Result 280 states and 341 transitions. [2018-11-14 17:06:30,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:06:30,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-11-14 17:06:30,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:06:30,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:06:30,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2018-11-14 17:06:30,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:06:30,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2018-11-14 17:06:30,635 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 79 transitions. [2018-11-14 17:06:30,775 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:30,780 INFO L225 Difference]: With dead ends: 280 [2018-11-14 17:06:30,780 INFO L226 Difference]: Without dead ends: 200 [2018-11-14 17:06:30,781 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:06:30,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-11-14 17:06:31,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 173. [2018-11-14 17:06:31,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:06:31,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand 173 states. [2018-11-14 17:06:31,511 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand 173 states. [2018-11-14 17:06:31,512 INFO L87 Difference]: Start difference. First operand 200 states. Second operand 173 states. [2018-11-14 17:06:31,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:31,517 INFO L93 Difference]: Finished difference Result 200 states and 242 transitions. [2018-11-14 17:06:31,517 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 242 transitions. [2018-11-14 17:06:31,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:31,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:31,518 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 200 states. [2018-11-14 17:06:31,518 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 200 states. [2018-11-14 17:06:31,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:06:31,523 INFO L93 Difference]: Finished difference Result 200 states and 242 transitions. [2018-11-14 17:06:31,523 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 242 transitions. [2018-11-14 17:06:31,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:06:31,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:06:31,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:06:31,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:06:31,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-11-14 17:06:31,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 210 transitions. [2018-11-14 17:06:31,528 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 210 transitions. Word has length 45 [2018-11-14 17:06:31,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:06:31,529 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 210 transitions. [2018-11-14 17:06:31,529 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:06:31,529 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 210 transitions. [2018-11-14 17:06:31,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 17:06:31,530 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:06:31,530 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2018-11-14 17:06:31,530 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:06:31,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:06:31,530 INFO L82 PathProgramCache]: Analyzing trace with hash -970348572, now seen corresponding path program 1 times [2018-11-14 17:06:31,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:06:31,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:06:31,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:31,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:06:31,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:06:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:32,076 WARN L179 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 20 [2018-11-14 17:06:32,249 INFO L256 TraceCheckUtils]: 0: Hoare triple {9789#true} call ULTIMATE.init(); {9789#true} is VALID [2018-11-14 17:06:32,250 INFO L273 TraceCheckUtils]: 1: Hoare triple {9789#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {9789#true} is VALID [2018-11-14 17:06:32,250 INFO L273 TraceCheckUtils]: 2: Hoare triple {9789#true} assume true; {9789#true} is VALID [2018-11-14 17:06:32,250 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9789#true} {9789#true} #91#return; {9789#true} is VALID [2018-11-14 17:06:32,250 INFO L256 TraceCheckUtils]: 4: Hoare triple {9789#true} call #t~ret7 := main(); {9789#true} is VALID [2018-11-14 17:06:32,251 INFO L273 TraceCheckUtils]: 5: Hoare triple {9789#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {9789#true} is VALID [2018-11-14 17:06:32,251 INFO L273 TraceCheckUtils]: 6: Hoare triple {9789#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {9791#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-14 17:06:32,252 INFO L273 TraceCheckUtils]: 7: Hoare triple {9791#(<= 2 ~CELLCOUNT~0)} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) == 0 then 1 else 0) != 0;~i~0 := 1; {9792#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:32,253 INFO L273 TraceCheckUtils]: 8: Hoare triple {9792#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} assume true; {9792#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:32,253 INFO L273 TraceCheckUtils]: 9: Hoare triple {9792#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {9792#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:32,254 INFO L273 TraceCheckUtils]: 10: Hoare triple {9792#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {9792#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:32,255 INFO L273 TraceCheckUtils]: 11: Hoare triple {9792#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 3) * 4, 4); {9792#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:32,256 INFO L273 TraceCheckUtils]: 12: Hoare triple {9792#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (< 0 (div ~CELLCOUNT~0 4)))} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 2) * 4, 4); {9793#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 4)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)))) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:32,257 INFO L273 TraceCheckUtils]: 13: Hoare triple {9793#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 4)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)))) (< 0 (div ~CELLCOUNT~0 4)))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {9793#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 4)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)))) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:32,259 INFO L273 TraceCheckUtils]: 14: Hoare triple {9793#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (= main_~i~0 1) (= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 4)) 0) (+ (* 16 main_~i~0) |main_~#volArray~0.offset| (- 8)))) (< 0 (div ~CELLCOUNT~0 4)))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9794#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (or (<= (* 4 main_~i~0) 7) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 8)))))) (<= (* 4 main_~i~0) 8) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:32,260 INFO L273 TraceCheckUtils]: 15: Hoare triple {9794#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (or (<= (* 4 main_~i~0) 7) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 8)))))) (<= (* 4 main_~i~0) 8) (< 0 (div ~CELLCOUNT~0 4)))} assume true; {9794#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (or (<= (* 4 main_~i~0) 7) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 8)))))) (<= (* 4 main_~i~0) 8) (< 0 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:32,261 INFO L273 TraceCheckUtils]: 16: Hoare triple {9794#(and (= ~CELLCOUNT~0 (* 4 (div ~CELLCOUNT~0 4))) (or (<= (* 4 main_~i~0) 7) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 main_~i~0) (- 4))) (+ |main_~#volArray~0.offset| (- 8)))))) (<= (* 4 main_~i~0) 8) (< 0 (div ~CELLCOUNT~0 4)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {9795#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:32,262 INFO L273 TraceCheckUtils]: 17: Hoare triple {9795#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (<= 1 (div ~CELLCOUNT~0 4)))} ~i~0 := 0; {9796#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:32,263 INFO L273 TraceCheckUtils]: 18: Hoare triple {9796#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} assume true; {9796#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:32,264 INFO L273 TraceCheckUtils]: 19: Hoare triple {9796#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {9796#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:32,265 INFO L273 TraceCheckUtils]: 20: Hoare triple {9796#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} assume #t~short6; {9796#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:32,265 INFO L256 TraceCheckUtils]: 21: Hoare triple {9796#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {9789#true} is VALID [2018-11-14 17:06:32,265 INFO L273 TraceCheckUtils]: 22: Hoare triple {9789#true} ~cond := #in~cond; {9789#true} is VALID [2018-11-14 17:06:32,266 INFO L273 TraceCheckUtils]: 23: Hoare triple {9789#true} assume !(~cond == 0); {9789#true} is VALID [2018-11-14 17:06:32,266 INFO L273 TraceCheckUtils]: 24: Hoare triple {9789#true} assume true; {9789#true} is VALID [2018-11-14 17:06:32,267 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {9789#true} {9796#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} #95#return; {9796#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:32,268 INFO L273 TraceCheckUtils]: 26: Hoare triple {9796#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} havoc #t~short6;havoc #t~mem4;havoc #t~mem5; {9796#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:32,269 INFO L273 TraceCheckUtils]: 27: Hoare triple {9796#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (* 4 (div ~CELLCOUNT~0 4))) (+ |main_~#volArray~0.offset| (- 8))))) (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= main_~i~0 0) (<= 1 (div ~CELLCOUNT~0 4)))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {9797#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:32,270 INFO L273 TraceCheckUtils]: 28: Hoare triple {9797#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} assume true; {9797#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:32,271 INFO L273 TraceCheckUtils]: 29: Hoare triple {9797#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {9797#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:32,272 INFO L273 TraceCheckUtils]: 30: Hoare triple {9797#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} assume #t~short6; {9797#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:32,272 INFO L256 TraceCheckUtils]: 31: Hoare triple {9797#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {9789#true} is VALID [2018-11-14 17:06:32,272 INFO L273 TraceCheckUtils]: 32: Hoare triple {9789#true} ~cond := #in~cond; {9789#true} is VALID [2018-11-14 17:06:32,273 INFO L273 TraceCheckUtils]: 33: Hoare triple {9789#true} assume !(~cond == 0); {9789#true} is VALID [2018-11-14 17:06:32,273 INFO L273 TraceCheckUtils]: 34: Hoare triple {9789#true} assume true; {9789#true} is VALID [2018-11-14 17:06:32,289 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {9789#true} {9797#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} #95#return; {9797#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:32,298 INFO L273 TraceCheckUtils]: 36: Hoare triple {9797#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} havoc #t~short6;havoc #t~mem4;havoc #t~mem5; {9797#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} is VALID [2018-11-14 17:06:32,312 INFO L273 TraceCheckUtils]: 37: Hoare triple {9797#(and (<= (* 4 (div ~CELLCOUNT~0 4)) 4) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (+ (* 4 (div ~CELLCOUNT~0 4)) (+ main_~i~0 (- 1)))) (+ |main_~#volArray~0.offset| (- 8))))) (<= 1 (div ~CELLCOUNT~0 4)))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {9798#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-14 17:06:32,321 INFO L273 TraceCheckUtils]: 38: Hoare triple {9798#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume true; {9798#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-14 17:06:32,335 INFO L273 TraceCheckUtils]: 39: Hoare triple {9798#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {9798#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-14 17:06:32,344 INFO L273 TraceCheckUtils]: 40: Hoare triple {9798#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {9799#|main_#t~short6|} is VALID [2018-11-14 17:06:32,359 INFO L256 TraceCheckUtils]: 41: Hoare triple {9799#|main_#t~short6|} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {9800#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-14 17:06:32,368 INFO L273 TraceCheckUtils]: 42: Hoare triple {9800#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {9801#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-14 17:06:32,379 INFO L273 TraceCheckUtils]: 43: Hoare triple {9801#(not (= __VERIFIER_assert_~cond 0))} assume ~cond == 0; {9790#false} is VALID [2018-11-14 17:06:32,380 INFO L273 TraceCheckUtils]: 44: Hoare triple {9790#false} assume !false; {9790#false} is VALID [2018-11-14 17:06:32,386 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 17:06:32,386 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:06:32,386 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:06:32,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:06:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:06:32,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:06:32,488 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 17:06:32,493 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 17:06:32,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:06:32,497 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:06:32,508 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:06:32,509 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-14 17:06:32,543 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 23 treesize of output 18 [2018-11-14 17:06:32,548 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:06:32,550 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 18 treesize of output 27 [2018-11-14 17:06:32,552 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:06:32,557 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:06:32,563 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:06:32,563 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-14 17:06:32,940 INFO L256 TraceCheckUtils]: 0: Hoare triple {9789#true} call ULTIMATE.init(); {9789#true} is VALID [2018-11-14 17:06:32,941 INFO L273 TraceCheckUtils]: 1: Hoare triple {9789#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {9789#true} is VALID [2018-11-14 17:06:32,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {9789#true} assume true; {9789#true} is VALID [2018-11-14 17:06:32,941 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9789#true} {9789#true} #91#return; {9789#true} is VALID [2018-11-14 17:06:32,941 INFO L256 TraceCheckUtils]: 4: Hoare triple {9789#true} call #t~ret7 := main(); {9789#true} is VALID [2018-11-14 17:06:32,942 INFO L273 TraceCheckUtils]: 5: Hoare triple {9789#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {9789#true} is VALID [2018-11-14 17:06:32,942 INFO L273 TraceCheckUtils]: 6: Hoare triple {9789#true} assume ~CELLCOUNT~0 > 1;havoc ~MINVAL~0;havoc ~i~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(~CELLCOUNT~0 * 4);~CCCELVOL4~0 := 5;~CCCELVOL3~0 := 7;~CCCELVOL2~0 := 3;~CCCELVOL1~0 := 1; {9823#(= |main_~#volArray~0.offset| 0)} is VALID [2018-11-14 17:06:32,943 INFO L273 TraceCheckUtils]: 7: Hoare triple {9823#(= |main_~#volArray~0.offset| 0)} assume !((if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) != 0);assume (if (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 % 4 - 4 else ~CELLCOUNT~0 % 4) == 0 then 1 else 0) != 0;~i~0 := 1; {9827#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:32,943 INFO L273 TraceCheckUtils]: 8: Hoare triple {9827#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume true; {9827#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:32,944 INFO L273 TraceCheckUtils]: 9: Hoare triple {9827#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {9827#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:32,944 INFO L273 TraceCheckUtils]: 10: Hoare triple {9827#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL4~0 >= ~MINVAL~0;call write~int(~CCCELVOL4~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 4) * 4, 4); {9827#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:32,945 INFO L273 TraceCheckUtils]: 11: Hoare triple {9827#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~CCCELVOL3~0 >= ~MINVAL~0;call write~int(~CCCELVOL3~0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 3) * 4, 4); {9827#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:32,946 INFO L273 TraceCheckUtils]: 12: Hoare triple {9827#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL2~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 2) * 4, 4); {9843#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 8))) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-14 17:06:32,947 INFO L273 TraceCheckUtils]: 13: Hoare triple {9843#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 16 main_~i~0) (- 8))) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~CCCELVOL1~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + (~i~0 * 4 - 1) * 4, 4); {9847#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-14 17:06:32,948 INFO L273 TraceCheckUtils]: 14: Hoare triple {9847#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} #t~post2 := ~i~0;~i~0 := #t~post2 + 1;havoc #t~post2; {9847#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-14 17:06:32,948 INFO L273 TraceCheckUtils]: 15: Hoare triple {9847#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} assume true; {9847#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-14 17:06:32,949 INFO L273 TraceCheckUtils]: 16: Hoare triple {9847#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && ~CELLCOUNT~0 % 4 != 0 then ~CELLCOUNT~0 / 4 + 1 else ~CELLCOUNT~0 / 4)); {9847#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-14 17:06:32,950 INFO L273 TraceCheckUtils]: 17: Hoare triple {9847#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} ~i~0 := 0; {9860#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} is VALID [2018-11-14 17:06:32,951 INFO L273 TraceCheckUtils]: 18: Hoare triple {9860#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} assume true; {9860#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} is VALID [2018-11-14 17:06:32,952 INFO L273 TraceCheckUtils]: 19: Hoare triple {9860#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {9860#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} is VALID [2018-11-14 17:06:32,953 INFO L273 TraceCheckUtils]: 20: Hoare triple {9860#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} assume #t~short6; {9860#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} is VALID [2018-11-14 17:06:32,954 INFO L256 TraceCheckUtils]: 21: Hoare triple {9860#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} is VALID [2018-11-14 17:06:32,955 INFO L273 TraceCheckUtils]: 22: Hoare triple {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} ~cond := #in~cond; {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} is VALID [2018-11-14 17:06:32,955 INFO L273 TraceCheckUtils]: 23: Hoare triple {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} assume !(~cond == 0); {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} is VALID [2018-11-14 17:06:32,956 INFO L273 TraceCheckUtils]: 24: Hoare triple {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} assume true; {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} is VALID [2018-11-14 17:06:32,957 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} {9860#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} #95#return; {9860#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} is VALID [2018-11-14 17:06:32,957 INFO L273 TraceCheckUtils]: 26: Hoare triple {9860#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} havoc #t~short6;havoc #t~mem4;havoc #t~mem5; {9860#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} is VALID [2018-11-14 17:06:32,958 INFO L273 TraceCheckUtils]: 27: Hoare triple {9860#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0) (= main_~i~0 0))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {9892#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-14 17:06:32,959 INFO L273 TraceCheckUtils]: 28: Hoare triple {9892#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} assume true; {9892#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-14 17:06:32,960 INFO L273 TraceCheckUtils]: 29: Hoare triple {9892#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {9892#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-14 17:06:32,961 INFO L273 TraceCheckUtils]: 30: Hoare triple {9892#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} assume #t~short6; {9892#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-14 17:06:32,962 INFO L256 TraceCheckUtils]: 31: Hoare triple {9892#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} is VALID [2018-11-14 17:06:32,963 INFO L273 TraceCheckUtils]: 32: Hoare triple {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} ~cond := #in~cond; {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} is VALID [2018-11-14 17:06:32,963 INFO L273 TraceCheckUtils]: 33: Hoare triple {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} assume !(~cond == 0); {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} is VALID [2018-11-14 17:06:32,964 INFO L273 TraceCheckUtils]: 34: Hoare triple {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} assume true; {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} is VALID [2018-11-14 17:06:32,965 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {9873#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_7| Int)) (and (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 8)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_7|) 12))))} {9892#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} #95#return; {9892#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-14 17:06:32,965 INFO L273 TraceCheckUtils]: 36: Hoare triple {9892#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} havoc #t~short6;havoc #t~mem4;havoc #t~mem5; {9892#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-14 17:06:32,966 INFO L273 TraceCheckUtils]: 37: Hoare triple {9892#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} #t~post3 := ~i~0;~i~0 := #t~post3 + 1;havoc #t~post3; {9923#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-14 17:06:32,967 INFO L273 TraceCheckUtils]: 38: Hoare triple {9923#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} assume true; {9923#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-14 17:06:32,968 INFO L273 TraceCheckUtils]: 39: Hoare triple {9923#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem4 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem4 >= ~MINVAL~0; {9923#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} is VALID [2018-11-14 17:06:32,969 INFO L273 TraceCheckUtils]: 40: Hoare triple {9923#(and (= main_~i~0 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 12)) 0) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 8)) 0))} assume !#t~short6;call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + ~i~0 * 4, 4);#t~short6 := #t~mem5 == 0; {9799#|main_#t~short6|} is VALID [2018-11-14 17:06:32,970 INFO L256 TraceCheckUtils]: 41: Hoare triple {9799#|main_#t~short6|} call __VERIFIER_assert((if #t~short6 then 1 else 0)); {9936#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-14 17:06:32,971 INFO L273 TraceCheckUtils]: 42: Hoare triple {9936#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {9940#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-14 17:06:32,971 INFO L273 TraceCheckUtils]: 43: Hoare triple {9940#(= 1 __VERIFIER_assert_~cond)} assume ~cond == 0; {9790#false} is VALID [2018-11-14 17:06:32,971 INFO L273 TraceCheckUtils]: 44: Hoare triple {9790#false} assume !false; {9790#false} is VALID [2018-11-14 17:06:32,980 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-14 17:06:33,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:06:33,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 23 [2018-11-14 17:06:33,002 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 45 [2018-11-14 17:06:33,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:06:33,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-14 17:06:33,585 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:06:33,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-14 17:06:33,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-14 17:06:33,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=434, Unknown=0, NotChecked=0, Total=506 [2018-11-14 17:06:33,586 INFO L87 Difference]: Start difference. First operand 173 states and 210 transitions. Second operand 23 states.