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/nr3_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:10:43,339 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:10:43,341 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:10:43,354 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:10:43,354 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:10:43,355 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:10:43,356 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:10:43,358 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:10:43,360 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:10:43,361 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:10:43,362 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:10:43,362 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:10:43,363 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:10:43,364 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:10:43,365 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:10:43,366 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:10:43,367 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:10:43,369 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:10:43,371 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:10:43,373 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:10:43,374 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:10:43,375 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:10:43,378 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:10:43,378 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:10:43,378 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:10:43,379 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:10:43,380 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:10:43,381 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:10:43,382 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:10:43,384 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:10:43,384 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:10:43,385 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:10:43,385 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:10:43,386 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:10:43,387 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:10:43,387 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:10:43,391 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-18 23:10:43,418 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:10:43,418 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:10:43,419 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:10:43,419 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:10:43,420 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:10:43,420 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:10:43,420 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:10:43,421 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:10:43,422 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:10:43,422 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:10:43,422 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:10:43,422 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:10:43,422 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:10:43,423 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:10:43,423 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:10:43,423 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:10:43,423 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:10:43,423 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:10:43,424 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:10:43,425 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:10:43,425 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:10:43,425 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:10:43,425 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:10:43,426 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:10:43,426 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:10:43,426 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:10:43,426 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:10:43,426 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:10:43,427 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:10:43,427 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:10:43,428 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:10:43,488 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:10:43,504 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:10:43,508 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:10:43,510 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:10:43,510 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:10:43,511 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/nr3_true-unreach-call.i [2018-11-18 23:10:43,575 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/435b410e5/91c246ec782944c18fc6a032fd9287ff/FLAGb8d50a236 [2018-11-18 23:10:44,006 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:10:44,007 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr3_true-unreach-call.i [2018-11-18 23:10:44,013 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/435b410e5/91c246ec782944c18fc6a032fd9287ff/FLAGb8d50a236 [2018-11-18 23:10:44,384 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/435b410e5/91c246ec782944c18fc6a032fd9287ff [2018-11-18 23:10:44,395 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:10:44,397 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:10:44,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:10:44,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:10:44,402 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:10:44,404 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:10:44" (1/1) ... [2018-11-18 23:10:44,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25d4ca26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:10:44, skipping insertion in model container [2018-11-18 23:10:44,407 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:10:44" (1/1) ... [2018-11-18 23:10:44,417 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:10:44,446 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:10:44,706 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:10:44,713 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:10:44,749 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:10:44,780 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:10:44,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:10:44 WrapperNode [2018-11-18 23:10:44,780 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:10:44,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:10:44,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:10:44,781 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:10:44,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:10:44" (1/1) ... [2018-11-18 23:10:44,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:10:44" (1/1) ... [2018-11-18 23:10:44,809 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:10:44" (1/1) ... [2018-11-18 23:10:44,810 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:10:44" (1/1) ... [2018-11-18 23:10:44,830 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:10:44" (1/1) ... [2018-11-18 23:10:44,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:10:44" (1/1) ... [2018-11-18 23:10:44,850 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:10:44" (1/1) ... [2018-11-18 23:10:44,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:10:44,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:10:44,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:10:44,858 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:10:44,859 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:10:44" (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-18 23:10:44,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:10:44,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:10:44,995 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 23:10:44,995 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:10:44,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:10:44,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-18 23:10:44,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 23:10:44,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 23:10:44,996 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:10:44,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 23:10:44,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 23:10:44,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 23:10:44,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 23:10:44,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:10:44,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:10:44,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 23:10:45,661 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:10:45,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:10:45 BoogieIcfgContainer [2018-11-18 23:10:45,662 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:10:45,663 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:10:45,663 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:10:45,667 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:10:45,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:10:44" (1/3) ... [2018-11-18 23:10:45,668 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3874a9d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:10:45, skipping insertion in model container [2018-11-18 23:10:45,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:10:44" (2/3) ... [2018-11-18 23:10:45,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3874a9d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:10:45, skipping insertion in model container [2018-11-18 23:10:45,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:10:45" (3/3) ... [2018-11-18 23:10:45,670 INFO L112 eAbstractionObserver]: Analyzing ICFG nr3_true-unreach-call.i [2018-11-18 23:10:45,681 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:10:45,690 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:10:45,707 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:10:45,740 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:10:45,741 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:10:45,741 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:10:45,742 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:10:45,742 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:10:45,742 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:10:45,742 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:10:45,743 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:10:45,743 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:10:45,762 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-18 23:10:45,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 23:10:45,769 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:10:45,770 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:10:45,772 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:10:45,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:10:45,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1065126958, now seen corresponding path program 1 times [2018-11-18 23:10:45,781 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:10:45,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:10:45,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:10:45,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:10:45,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:10:45,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:10:46,017 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-18 23:10:46,022 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-18 23:10:46,022 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-18 23:10:46,023 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #86#return; {37#true} is VALID [2018-11-18 23:10:46,024 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret8 := main(); {37#true} is VALID [2018-11-18 23:10:46,024 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-18 23:10:46,025 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {37#true} is VALID [2018-11-18 23:10:46,025 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {37#true} is VALID [2018-11-18 23:10:46,037 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-18 23:10:46,037 INFO L273 TraceCheckUtils]: 9: Hoare triple {38#false} ~i~0 := 0; {38#false} is VALID [2018-11-18 23:10:46,038 INFO L273 TraceCheckUtils]: 10: Hoare triple {38#false} assume true; {38#false} is VALID [2018-11-18 23:10:46,038 INFO L273 TraceCheckUtils]: 11: Hoare triple {38#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {38#false} is VALID [2018-11-18 23:10:46,038 INFO L273 TraceCheckUtils]: 12: Hoare triple {38#false} assume #t~short7; {38#false} is VALID [2018-11-18 23:10:46,039 INFO L256 TraceCheckUtils]: 13: Hoare triple {38#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {38#false} is VALID [2018-11-18 23:10:46,039 INFO L273 TraceCheckUtils]: 14: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2018-11-18 23:10:46,039 INFO L273 TraceCheckUtils]: 15: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2018-11-18 23:10:46,040 INFO L273 TraceCheckUtils]: 16: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-18 23:10:46,043 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-18 23:10:46,046 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:10:46,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 23:10:46,051 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-18 23:10:46,054 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:10:46,058 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 23:10:46,282 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-18 23:10:46,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 23:10:46,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 23:10:46,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:10:46,295 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-18 23:10:46,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:10:46,499 INFO L93 Difference]: Finished difference Result 60 states and 79 transitions. [2018-11-18 23:10:46,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 23:10:46,499 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-18 23:10:46,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:10:46,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:10:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2018-11-18 23:10:46,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:10:46,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2018-11-18 23:10:46,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 79 transitions. [2018-11-18 23:10:46,984 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-18 23:10:46,995 INFO L225 Difference]: With dead ends: 60 [2018-11-18 23:10:46,995 INFO L226 Difference]: Without dead ends: 28 [2018-11-18 23:10:46,999 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-18 23:10:47,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-18 23:10:47,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-18 23:10:47,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:10:47,044 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-18 23:10:47,044 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-18 23:10:47,045 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-18 23:10:47,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:10:47,050 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-18 23:10:47,050 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-18 23:10:47,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:10:47,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:10:47,051 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-18 23:10:47,051 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-18 23:10:47,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:10:47,055 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-18 23:10:47,055 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-18 23:10:47,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:10:47,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:10:47,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:10:47,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:10:47,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-18 23:10:47,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-18 23:10:47,061 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 17 [2018-11-18 23:10:47,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:10:47,062 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-18 23:10:47,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 23:10:47,062 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-18 23:10:47,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 23:10:47,063 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:10:47,063 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-18 23:10:47,064 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:10:47,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:10:47,064 INFO L82 PathProgramCache]: Analyzing trace with hash -832945488, now seen corresponding path program 1 times [2018-11-18 23:10:47,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:10:47,065 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:10:47,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:10:47,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:10:47,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:10:47,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:10:47,242 INFO L256 TraceCheckUtils]: 0: Hoare triple {208#true} call ULTIMATE.init(); {208#true} is VALID [2018-11-18 23:10:47,243 INFO L273 TraceCheckUtils]: 1: Hoare triple {208#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {208#true} is VALID [2018-11-18 23:10:47,243 INFO L273 TraceCheckUtils]: 2: Hoare triple {208#true} assume true; {208#true} is VALID [2018-11-18 23:10:47,243 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {208#true} {208#true} #86#return; {208#true} is VALID [2018-11-18 23:10:47,246 INFO L256 TraceCheckUtils]: 4: Hoare triple {208#true} call #t~ret8 := main(); {208#true} is VALID [2018-11-18 23:10:47,246 INFO L273 TraceCheckUtils]: 5: Hoare triple {208#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {208#true} is VALID [2018-11-18 23:10:47,246 INFO L273 TraceCheckUtils]: 6: Hoare triple {208#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {208#true} is VALID [2018-11-18 23:10:47,247 INFO L273 TraceCheckUtils]: 7: Hoare triple {208#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {208#true} is VALID [2018-11-18 23:10:47,247 INFO L273 TraceCheckUtils]: 8: Hoare triple {208#true} assume true; {208#true} is VALID [2018-11-18 23:10:47,247 INFO L273 TraceCheckUtils]: 9: Hoare triple {208#true} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {208#true} is VALID [2018-11-18 23:10:47,248 INFO L273 TraceCheckUtils]: 10: Hoare triple {208#true} ~i~0 := 0; {208#true} is VALID [2018-11-18 23:10:47,248 INFO L273 TraceCheckUtils]: 11: Hoare triple {208#true} assume true; {208#true} is VALID [2018-11-18 23:10:47,248 INFO L273 TraceCheckUtils]: 12: Hoare triple {208#true} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {208#true} is VALID [2018-11-18 23:10:47,255 INFO L273 TraceCheckUtils]: 13: Hoare triple {208#true} assume #t~short7; {210#|main_#t~short7|} is VALID [2018-11-18 23:10:47,256 INFO L256 TraceCheckUtils]: 14: Hoare triple {210#|main_#t~short7|} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {211#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-18 23:10:47,274 INFO L273 TraceCheckUtils]: 15: Hoare triple {211#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {212#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-18 23:10:47,288 INFO L273 TraceCheckUtils]: 16: Hoare triple {212#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {209#false} is VALID [2018-11-18 23:10:47,288 INFO L273 TraceCheckUtils]: 17: Hoare triple {209#false} assume !false; {209#false} is VALID [2018-11-18 23:10:47,290 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-18 23:10:47,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:10:47,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 23:10:47,292 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-18 23:10:47,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:10:47,294 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 23:10:47,338 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-18 23:10:47,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 23:10:47,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 23:10:47,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:10:47,340 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 5 states. [2018-11-18 23:10:47,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:10:47,983 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-18 23:10:47,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 23:10:47,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-11-18 23:10:47,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:10:47,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:10:47,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2018-11-18 23:10:47,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:10:47,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2018-11-18 23:10:47,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2018-11-18 23:10:48,048 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:10:48,050 INFO L225 Difference]: With dead ends: 36 [2018-11-18 23:10:48,051 INFO L226 Difference]: Without dead ends: 34 [2018-11-18 23:10:48,052 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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-18 23:10:48,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-18 23:10:48,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-18 23:10:48,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:10:48,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-18 23:10:48,070 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-18 23:10:48,070 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-18 23:10:48,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:10:48,073 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-18 23:10:48,073 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-18 23:10:48,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:10:48,073 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:10:48,074 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-18 23:10:48,074 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-18 23:10:48,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:10:48,077 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-18 23:10:48,077 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-18 23:10:48,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:10:48,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:10:48,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:10:48,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:10:48,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-18 23:10:48,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-18 23:10:48,081 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 18 [2018-11-18 23:10:48,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:10:48,082 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-18 23:10:48,082 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 23:10:48,082 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-18 23:10:48,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-18 23:10:48,083 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:10:48,083 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-18 23:10:48,083 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:10:48,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:10:48,084 INFO L82 PathProgramCache]: Analyzing trace with hash -831098446, now seen corresponding path program 1 times [2018-11-18 23:10:48,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:10:48,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:10:48,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:10:48,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:10:48,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:10:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:10:48,317 INFO L256 TraceCheckUtils]: 0: Hoare triple {376#true} call ULTIMATE.init(); {376#true} is VALID [2018-11-18 23:10:48,317 INFO L273 TraceCheckUtils]: 1: Hoare triple {376#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {376#true} is VALID [2018-11-18 23:10:48,317 INFO L273 TraceCheckUtils]: 2: Hoare triple {376#true} assume true; {376#true} is VALID [2018-11-18 23:10:48,318 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {376#true} {376#true} #86#return; {376#true} is VALID [2018-11-18 23:10:48,318 INFO L256 TraceCheckUtils]: 4: Hoare triple {376#true} call #t~ret8 := main(); {376#true} is VALID [2018-11-18 23:10:48,318 INFO L273 TraceCheckUtils]: 5: Hoare triple {376#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {376#true} is VALID [2018-11-18 23:10:48,319 INFO L273 TraceCheckUtils]: 6: Hoare triple {376#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {378#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-18 23:10:48,320 INFO L273 TraceCheckUtils]: 7: Hoare triple {378#(<= 2 ~CELLCOUNT~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {379#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-18 23:10:48,321 INFO L273 TraceCheckUtils]: 8: Hoare triple {379#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume true; {379#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-18 23:10:48,322 INFO L273 TraceCheckUtils]: 9: Hoare triple {379#(and (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {377#false} is VALID [2018-11-18 23:10:48,322 INFO L273 TraceCheckUtils]: 10: Hoare triple {377#false} ~i~0 := 0; {377#false} is VALID [2018-11-18 23:10:48,322 INFO L273 TraceCheckUtils]: 11: Hoare triple {377#false} assume true; {377#false} is VALID [2018-11-18 23:10:48,322 INFO L273 TraceCheckUtils]: 12: Hoare triple {377#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {377#false} is VALID [2018-11-18 23:10:48,323 INFO L273 TraceCheckUtils]: 13: Hoare triple {377#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {377#false} is VALID [2018-11-18 23:10:48,323 INFO L256 TraceCheckUtils]: 14: Hoare triple {377#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {377#false} is VALID [2018-11-18 23:10:48,324 INFO L273 TraceCheckUtils]: 15: Hoare triple {377#false} ~cond := #in~cond; {377#false} is VALID [2018-11-18 23:10:48,324 INFO L273 TraceCheckUtils]: 16: Hoare triple {377#false} assume 0 == ~cond; {377#false} is VALID [2018-11-18 23:10:48,325 INFO L273 TraceCheckUtils]: 17: Hoare triple {377#false} assume !false; {377#false} is VALID [2018-11-18 23:10:48,326 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-18 23:10:48,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:10:48,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 23:10:48,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-18 23:10:48,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:10:48,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:10:48,391 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-18 23:10:48,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:10:48,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:10:48,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:10:48,392 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-11-18 23:10:48,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:10:48,609 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-11-18 23:10:48,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:10:48,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-18 23:10:48,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:10:48,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:10:48,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-18 23:10:48,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:10:48,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-18 23:10:48,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2018-11-18 23:10:48,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:10:48,741 INFO L225 Difference]: With dead ends: 58 [2018-11-18 23:10:48,741 INFO L226 Difference]: Without dead ends: 40 [2018-11-18 23:10:48,742 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:10:48,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-18 23:10:48,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 35. [2018-11-18 23:10:48,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:10:48,803 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 35 states. [2018-11-18 23:10:48,803 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 35 states. [2018-11-18 23:10:48,803 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 35 states. [2018-11-18 23:10:48,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:10:48,806 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-18 23:10:48,807 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-18 23:10:48,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:10:48,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:10:48,808 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 40 states. [2018-11-18 23:10:48,808 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 40 states. [2018-11-18 23:10:48,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:10:48,811 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2018-11-18 23:10:48,811 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-18 23:10:48,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:10:48,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:10:48,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:10:48,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:10:48,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-18 23:10:48,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-18 23:10:48,815 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 18 [2018-11-18 23:10:48,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:10:48,815 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-18 23:10:48,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:10:48,816 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-18 23:10:48,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-18 23:10:48,817 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:10:48,817 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] [2018-11-18 23:10:48,817 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:10:48,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:10:48,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1996039917, now seen corresponding path program 1 times [2018-11-18 23:10:48,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:10:48,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:10:48,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:10:48,819 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:10:48,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:10:48,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:10:48,900 INFO L256 TraceCheckUtils]: 0: Hoare triple {585#true} call ULTIMATE.init(); {585#true} is VALID [2018-11-18 23:10:48,900 INFO L273 TraceCheckUtils]: 1: Hoare triple {585#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {585#true} is VALID [2018-11-18 23:10:48,901 INFO L273 TraceCheckUtils]: 2: Hoare triple {585#true} assume true; {585#true} is VALID [2018-11-18 23:10:48,901 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {585#true} {585#true} #86#return; {585#true} is VALID [2018-11-18 23:10:48,902 INFO L256 TraceCheckUtils]: 4: Hoare triple {585#true} call #t~ret8 := main(); {585#true} is VALID [2018-11-18 23:10:48,902 INFO L273 TraceCheckUtils]: 5: Hoare triple {585#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {585#true} is VALID [2018-11-18 23:10:48,903 INFO L273 TraceCheckUtils]: 6: Hoare triple {585#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {585#true} is VALID [2018-11-18 23:10:48,903 INFO L273 TraceCheckUtils]: 7: Hoare triple {585#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {585#true} is VALID [2018-11-18 23:10:48,903 INFO L273 TraceCheckUtils]: 8: Hoare triple {585#true} assume true; {585#true} is VALID [2018-11-18 23:10:48,911 INFO L273 TraceCheckUtils]: 9: Hoare triple {585#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {587#(<= 3 main_~j~0)} is VALID [2018-11-18 23:10:48,913 INFO L273 TraceCheckUtils]: 10: Hoare triple {587#(<= 3 main_~j~0)} assume true; {587#(<= 3 main_~j~0)} is VALID [2018-11-18 23:10:48,913 INFO L273 TraceCheckUtils]: 11: Hoare triple {587#(<= 3 main_~j~0)} assume !(~j~0 >= 1); {586#false} is VALID [2018-11-18 23:10:48,914 INFO L273 TraceCheckUtils]: 12: Hoare triple {586#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {586#false} is VALID [2018-11-18 23:10:48,914 INFO L273 TraceCheckUtils]: 13: Hoare triple {586#false} assume true; {586#false} is VALID [2018-11-18 23:10:48,914 INFO L273 TraceCheckUtils]: 14: Hoare triple {586#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {586#false} is VALID [2018-11-18 23:10:48,914 INFO L273 TraceCheckUtils]: 15: Hoare triple {586#false} ~i~0 := 0; {586#false} is VALID [2018-11-18 23:10:48,915 INFO L273 TraceCheckUtils]: 16: Hoare triple {586#false} assume true; {586#false} is VALID [2018-11-18 23:10:48,915 INFO L273 TraceCheckUtils]: 17: Hoare triple {586#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {586#false} is VALID [2018-11-18 23:10:48,915 INFO L273 TraceCheckUtils]: 18: Hoare triple {586#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {586#false} is VALID [2018-11-18 23:10:48,915 INFO L256 TraceCheckUtils]: 19: Hoare triple {586#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {586#false} is VALID [2018-11-18 23:10:48,916 INFO L273 TraceCheckUtils]: 20: Hoare triple {586#false} ~cond := #in~cond; {586#false} is VALID [2018-11-18 23:10:48,916 INFO L273 TraceCheckUtils]: 21: Hoare triple {586#false} assume 0 == ~cond; {586#false} is VALID [2018-11-18 23:10:48,916 INFO L273 TraceCheckUtils]: 22: Hoare triple {586#false} assume !false; {586#false} is VALID [2018-11-18 23:10:48,918 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-18 23:10:48,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:10:48,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:10:48,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 23:10:48,919 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:10:48,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:10:48,995 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:10:48,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:10:48,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:10:48,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:10:48,996 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 3 states. [2018-11-18 23:10:49,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:10:49,108 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-11-18 23:10:49,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:10:49,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-11-18 23:10:49,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:10:49,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:10:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-18 23:10:49,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:10:49,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-18 23:10:49,114 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2018-11-18 23:10:49,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:10:49,192 INFO L225 Difference]: With dead ends: 64 [2018-11-18 23:10:49,192 INFO L226 Difference]: Without dead ends: 39 [2018-11-18 23:10:49,193 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-18 23:10:49,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-18 23:10:49,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2018-11-18 23:10:49,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:10:49,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 37 states. [2018-11-18 23:10:49,230 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 37 states. [2018-11-18 23:10:49,230 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 37 states. [2018-11-18 23:10:49,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:10:49,232 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-18 23:10:49,232 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-18 23:10:49,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:10:49,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:10:49,234 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 39 states. [2018-11-18 23:10:49,234 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 39 states. [2018-11-18 23:10:49,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:10:49,236 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-18 23:10:49,237 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-18 23:10:49,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:10:49,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:10:49,238 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:10:49,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:10:49,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 23:10:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-18 23:10:49,240 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 23 [2018-11-18 23:10:49,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:10:49,241 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-18 23:10:49,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:10:49,241 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-18 23:10:49,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-18 23:10:49,242 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:10:49,242 INFO L375 BasicCegarLoop]: trace histogram [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-18 23:10:49,243 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:10:49,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:10:49,243 INFO L82 PathProgramCache]: Analyzing trace with hash -995813500, now seen corresponding path program 1 times [2018-11-18 23:10:49,243 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:10:49,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:10:49,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:10:49,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:10:49,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:10:49,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:10:49,341 INFO L256 TraceCheckUtils]: 0: Hoare triple {802#true} call ULTIMATE.init(); {802#true} is VALID [2018-11-18 23:10:49,341 INFO L273 TraceCheckUtils]: 1: Hoare triple {802#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {802#true} is VALID [2018-11-18 23:10:49,341 INFO L273 TraceCheckUtils]: 2: Hoare triple {802#true} assume true; {802#true} is VALID [2018-11-18 23:10:49,342 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {802#true} {802#true} #86#return; {802#true} is VALID [2018-11-18 23:10:49,342 INFO L256 TraceCheckUtils]: 4: Hoare triple {802#true} call #t~ret8 := main(); {802#true} is VALID [2018-11-18 23:10:49,342 INFO L273 TraceCheckUtils]: 5: Hoare triple {802#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {802#true} is VALID [2018-11-18 23:10:49,342 INFO L273 TraceCheckUtils]: 6: Hoare triple {802#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {802#true} is VALID [2018-11-18 23:10:49,343 INFO L273 TraceCheckUtils]: 7: Hoare triple {802#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {802#true} is VALID [2018-11-18 23:10:49,343 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#true} assume true; {802#true} is VALID [2018-11-18 23:10:49,344 INFO L273 TraceCheckUtils]: 9: Hoare triple {802#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {804#(<= 3 main_~j~0)} is VALID [2018-11-18 23:10:49,348 INFO L273 TraceCheckUtils]: 10: Hoare triple {804#(<= 3 main_~j~0)} assume true; {804#(<= 3 main_~j~0)} is VALID [2018-11-18 23:10:49,348 INFO L273 TraceCheckUtils]: 11: Hoare triple {804#(<= 3 main_~j~0)} assume !!(~j~0 >= 1); {804#(<= 3 main_~j~0)} is VALID [2018-11-18 23:10:49,351 INFO L273 TraceCheckUtils]: 12: Hoare triple {804#(<= 3 main_~j~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {804#(<= 3 main_~j~0)} is VALID [2018-11-18 23:10:49,353 INFO L273 TraceCheckUtils]: 13: Hoare triple {804#(<= 3 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {805#(<= 2 main_~j~0)} is VALID [2018-11-18 23:10:49,357 INFO L273 TraceCheckUtils]: 14: Hoare triple {805#(<= 2 main_~j~0)} assume true; {805#(<= 2 main_~j~0)} is VALID [2018-11-18 23:10:49,357 INFO L273 TraceCheckUtils]: 15: Hoare triple {805#(<= 2 main_~j~0)} assume !(~j~0 >= 1); {803#false} is VALID [2018-11-18 23:10:49,358 INFO L273 TraceCheckUtils]: 16: Hoare triple {803#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {803#false} is VALID [2018-11-18 23:10:49,358 INFO L273 TraceCheckUtils]: 17: Hoare triple {803#false} assume true; {803#false} is VALID [2018-11-18 23:10:49,358 INFO L273 TraceCheckUtils]: 18: Hoare triple {803#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {803#false} is VALID [2018-11-18 23:10:49,359 INFO L273 TraceCheckUtils]: 19: Hoare triple {803#false} ~i~0 := 0; {803#false} is VALID [2018-11-18 23:10:49,359 INFO L273 TraceCheckUtils]: 20: Hoare triple {803#false} assume true; {803#false} is VALID [2018-11-18 23:10:49,359 INFO L273 TraceCheckUtils]: 21: Hoare triple {803#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {803#false} is VALID [2018-11-18 23:10:49,360 INFO L273 TraceCheckUtils]: 22: Hoare triple {803#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {803#false} is VALID [2018-11-18 23:10:49,360 INFO L256 TraceCheckUtils]: 23: Hoare triple {803#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {803#false} is VALID [2018-11-18 23:10:49,360 INFO L273 TraceCheckUtils]: 24: Hoare triple {803#false} ~cond := #in~cond; {803#false} is VALID [2018-11-18 23:10:49,361 INFO L273 TraceCheckUtils]: 25: Hoare triple {803#false} assume 0 == ~cond; {803#false} is VALID [2018-11-18 23:10:49,361 INFO L273 TraceCheckUtils]: 26: Hoare triple {803#false} assume !false; {803#false} is VALID [2018-11-18 23:10:49,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:10:49,363 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:10:49,363 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-18 23:10:49,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:10:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:10:49,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:10:49,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:10:49,749 INFO L256 TraceCheckUtils]: 0: Hoare triple {802#true} call ULTIMATE.init(); {802#true} is VALID [2018-11-18 23:10:49,749 INFO L273 TraceCheckUtils]: 1: Hoare triple {802#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {802#true} is VALID [2018-11-18 23:10:49,750 INFO L273 TraceCheckUtils]: 2: Hoare triple {802#true} assume true; {802#true} is VALID [2018-11-18 23:10:49,750 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {802#true} {802#true} #86#return; {802#true} is VALID [2018-11-18 23:10:49,750 INFO L256 TraceCheckUtils]: 4: Hoare triple {802#true} call #t~ret8 := main(); {802#true} is VALID [2018-11-18 23:10:49,751 INFO L273 TraceCheckUtils]: 5: Hoare triple {802#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {802#true} is VALID [2018-11-18 23:10:49,751 INFO L273 TraceCheckUtils]: 6: Hoare triple {802#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {802#true} is VALID [2018-11-18 23:10:49,751 INFO L273 TraceCheckUtils]: 7: Hoare triple {802#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {802#true} is VALID [2018-11-18 23:10:49,752 INFO L273 TraceCheckUtils]: 8: Hoare triple {802#true} assume true; {802#true} is VALID [2018-11-18 23:10:49,755 INFO L273 TraceCheckUtils]: 9: Hoare triple {802#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {804#(<= 3 main_~j~0)} is VALID [2018-11-18 23:10:49,757 INFO L273 TraceCheckUtils]: 10: Hoare triple {804#(<= 3 main_~j~0)} assume true; {804#(<= 3 main_~j~0)} is VALID [2018-11-18 23:10:49,757 INFO L273 TraceCheckUtils]: 11: Hoare triple {804#(<= 3 main_~j~0)} assume !!(~j~0 >= 1); {804#(<= 3 main_~j~0)} is VALID [2018-11-18 23:10:49,759 INFO L273 TraceCheckUtils]: 12: Hoare triple {804#(<= 3 main_~j~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {804#(<= 3 main_~j~0)} is VALID [2018-11-18 23:10:49,761 INFO L273 TraceCheckUtils]: 13: Hoare triple {804#(<= 3 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {805#(<= 2 main_~j~0)} is VALID [2018-11-18 23:10:49,761 INFO L273 TraceCheckUtils]: 14: Hoare triple {805#(<= 2 main_~j~0)} assume true; {805#(<= 2 main_~j~0)} is VALID [2018-11-18 23:10:49,763 INFO L273 TraceCheckUtils]: 15: Hoare triple {805#(<= 2 main_~j~0)} assume !(~j~0 >= 1); {803#false} is VALID [2018-11-18 23:10:49,763 INFO L273 TraceCheckUtils]: 16: Hoare triple {803#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {803#false} is VALID [2018-11-18 23:10:49,763 INFO L273 TraceCheckUtils]: 17: Hoare triple {803#false} assume true; {803#false} is VALID [2018-11-18 23:10:49,763 INFO L273 TraceCheckUtils]: 18: Hoare triple {803#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {803#false} is VALID [2018-11-18 23:10:49,764 INFO L273 TraceCheckUtils]: 19: Hoare triple {803#false} ~i~0 := 0; {803#false} is VALID [2018-11-18 23:10:49,764 INFO L273 TraceCheckUtils]: 20: Hoare triple {803#false} assume true; {803#false} is VALID [2018-11-18 23:10:49,764 INFO L273 TraceCheckUtils]: 21: Hoare triple {803#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {803#false} is VALID [2018-11-18 23:10:49,765 INFO L273 TraceCheckUtils]: 22: Hoare triple {803#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {803#false} is VALID [2018-11-18 23:10:49,765 INFO L256 TraceCheckUtils]: 23: Hoare triple {803#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {803#false} is VALID [2018-11-18 23:10:49,765 INFO L273 TraceCheckUtils]: 24: Hoare triple {803#false} ~cond := #in~cond; {803#false} is VALID [2018-11-18 23:10:49,766 INFO L273 TraceCheckUtils]: 25: Hoare triple {803#false} assume 0 == ~cond; {803#false} is VALID [2018-11-18 23:10:49,766 INFO L273 TraceCheckUtils]: 26: Hoare triple {803#false} assume !false; {803#false} is VALID [2018-11-18 23:10:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:10:49,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:10:49,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-18 23:10:49,791 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-18 23:10:49,791 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:10:49,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:10:49,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:10:49,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:10:49,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:10:49,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:10:49,879 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 4 states. [2018-11-18 23:10:50,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:10:50,322 INFO L93 Difference]: Finished difference Result 70 states and 81 transitions. [2018-11-18 23:10:50,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:10:50,323 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-18 23:10:50,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:10:50,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:10:50,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2018-11-18 23:10:50,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:10:50,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2018-11-18 23:10:50,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2018-11-18 23:10:50,466 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:10:50,468 INFO L225 Difference]: With dead ends: 70 [2018-11-18 23:10:50,468 INFO L226 Difference]: Without dead ends: 43 [2018-11-18 23:10:50,468 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:10:50,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-18 23:10:50,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-11-18 23:10:50,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:10:50,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 41 states. [2018-11-18 23:10:50,519 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 41 states. [2018-11-18 23:10:50,519 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 41 states. [2018-11-18 23:10:50,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:10:50,521 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-18 23:10:50,522 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-18 23:10:50,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:10:50,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:10:50,523 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 43 states. [2018-11-18 23:10:50,523 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 43 states. [2018-11-18 23:10:50,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:10:50,525 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2018-11-18 23:10:50,526 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-18 23:10:50,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:10:50,526 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:10:50,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:10:50,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:10:50,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-18 23:10:50,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-11-18 23:10:50,529 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 27 [2018-11-18 23:10:50,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:10:50,529 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-18 23:10:50,530 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:10:50,530 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-18 23:10:50,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 23:10:50,531 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:10:50,531 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] [2018-11-18 23:10:50,531 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:10:50,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:10:50,532 INFO L82 PathProgramCache]: Analyzing trace with hash -2094472037, now seen corresponding path program 2 times [2018-11-18 23:10:50,532 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:10:50,532 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:10:50,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:10:50,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:10:50,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:10:50,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:10:50,728 INFO L256 TraceCheckUtils]: 0: Hoare triple {1119#true} call ULTIMATE.init(); {1119#true} is VALID [2018-11-18 23:10:50,728 INFO L273 TraceCheckUtils]: 1: Hoare triple {1119#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1119#true} is VALID [2018-11-18 23:10:50,729 INFO L273 TraceCheckUtils]: 2: Hoare triple {1119#true} assume true; {1119#true} is VALID [2018-11-18 23:10:50,729 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1119#true} {1119#true} #86#return; {1119#true} is VALID [2018-11-18 23:10:50,729 INFO L256 TraceCheckUtils]: 4: Hoare triple {1119#true} call #t~ret8 := main(); {1119#true} is VALID [2018-11-18 23:10:50,730 INFO L273 TraceCheckUtils]: 5: Hoare triple {1119#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1119#true} is VALID [2018-11-18 23:10:50,730 INFO L273 TraceCheckUtils]: 6: Hoare triple {1119#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {1119#true} is VALID [2018-11-18 23:10:50,730 INFO L273 TraceCheckUtils]: 7: Hoare triple {1119#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {1119#true} is VALID [2018-11-18 23:10:50,730 INFO L273 TraceCheckUtils]: 8: Hoare triple {1119#true} assume true; {1119#true} is VALID [2018-11-18 23:10:50,731 INFO L273 TraceCheckUtils]: 9: Hoare triple {1119#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {1121#(<= 3 main_~j~0)} is VALID [2018-11-18 23:10:50,731 INFO L273 TraceCheckUtils]: 10: Hoare triple {1121#(<= 3 main_~j~0)} assume true; {1121#(<= 3 main_~j~0)} is VALID [2018-11-18 23:10:50,732 INFO L273 TraceCheckUtils]: 11: Hoare triple {1121#(<= 3 main_~j~0)} assume !!(~j~0 >= 1); {1121#(<= 3 main_~j~0)} is VALID [2018-11-18 23:10:50,732 INFO L273 TraceCheckUtils]: 12: Hoare triple {1121#(<= 3 main_~j~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {1121#(<= 3 main_~j~0)} is VALID [2018-11-18 23:10:50,733 INFO L273 TraceCheckUtils]: 13: Hoare triple {1121#(<= 3 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1122#(<= 2 main_~j~0)} is VALID [2018-11-18 23:10:50,733 INFO L273 TraceCheckUtils]: 14: Hoare triple {1122#(<= 2 main_~j~0)} assume true; {1122#(<= 2 main_~j~0)} is VALID [2018-11-18 23:10:50,734 INFO L273 TraceCheckUtils]: 15: Hoare triple {1122#(<= 2 main_~j~0)} assume !!(~j~0 >= 1); {1122#(<= 2 main_~j~0)} is VALID [2018-11-18 23:10:50,734 INFO L273 TraceCheckUtils]: 16: Hoare triple {1122#(<= 2 main_~j~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {1122#(<= 2 main_~j~0)} is VALID [2018-11-18 23:10:50,735 INFO L273 TraceCheckUtils]: 17: Hoare triple {1122#(<= 2 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1123#(<= 1 main_~j~0)} is VALID [2018-11-18 23:10:50,736 INFO L273 TraceCheckUtils]: 18: Hoare triple {1123#(<= 1 main_~j~0)} assume true; {1123#(<= 1 main_~j~0)} is VALID [2018-11-18 23:10:50,737 INFO L273 TraceCheckUtils]: 19: Hoare triple {1123#(<= 1 main_~j~0)} assume !(~j~0 >= 1); {1120#false} is VALID [2018-11-18 23:10:50,737 INFO L273 TraceCheckUtils]: 20: Hoare triple {1120#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1120#false} is VALID [2018-11-18 23:10:50,737 INFO L273 TraceCheckUtils]: 21: Hoare triple {1120#false} assume true; {1120#false} is VALID [2018-11-18 23:10:50,738 INFO L273 TraceCheckUtils]: 22: Hoare triple {1120#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {1120#false} is VALID [2018-11-18 23:10:50,738 INFO L273 TraceCheckUtils]: 23: Hoare triple {1120#false} ~i~0 := 0; {1120#false} is VALID [2018-11-18 23:10:50,739 INFO L273 TraceCheckUtils]: 24: Hoare triple {1120#false} assume true; {1120#false} is VALID [2018-11-18 23:10:50,739 INFO L273 TraceCheckUtils]: 25: Hoare triple {1120#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {1120#false} is VALID [2018-11-18 23:10:50,740 INFO L273 TraceCheckUtils]: 26: Hoare triple {1120#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {1120#false} is VALID [2018-11-18 23:10:50,740 INFO L256 TraceCheckUtils]: 27: Hoare triple {1120#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {1120#false} is VALID [2018-11-18 23:10:50,741 INFO L273 TraceCheckUtils]: 28: Hoare triple {1120#false} ~cond := #in~cond; {1120#false} is VALID [2018-11-18 23:10:50,741 INFO L273 TraceCheckUtils]: 29: Hoare triple {1120#false} assume 0 == ~cond; {1120#false} is VALID [2018-11-18 23:10:50,741 INFO L273 TraceCheckUtils]: 30: Hoare triple {1120#false} assume !false; {1120#false} is VALID [2018-11-18 23:10:50,743 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:10:50,743 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:10:50,744 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-18 23:10:50,752 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:10:50,790 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:10:50,790 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:10:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:10:50,806 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:10:51,082 INFO L256 TraceCheckUtils]: 0: Hoare triple {1119#true} call ULTIMATE.init(); {1119#true} is VALID [2018-11-18 23:10:51,082 INFO L273 TraceCheckUtils]: 1: Hoare triple {1119#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1119#true} is VALID [2018-11-18 23:10:51,082 INFO L273 TraceCheckUtils]: 2: Hoare triple {1119#true} assume true; {1119#true} is VALID [2018-11-18 23:10:51,083 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1119#true} {1119#true} #86#return; {1119#true} is VALID [2018-11-18 23:10:51,083 INFO L256 TraceCheckUtils]: 4: Hoare triple {1119#true} call #t~ret8 := main(); {1119#true} is VALID [2018-11-18 23:10:51,083 INFO L273 TraceCheckUtils]: 5: Hoare triple {1119#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1119#true} is VALID [2018-11-18 23:10:51,083 INFO L273 TraceCheckUtils]: 6: Hoare triple {1119#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {1119#true} is VALID [2018-11-18 23:10:51,083 INFO L273 TraceCheckUtils]: 7: Hoare triple {1119#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {1119#true} is VALID [2018-11-18 23:10:51,084 INFO L273 TraceCheckUtils]: 8: Hoare triple {1119#true} assume true; {1119#true} is VALID [2018-11-18 23:10:51,084 INFO L273 TraceCheckUtils]: 9: Hoare triple {1119#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {1121#(<= 3 main_~j~0)} is VALID [2018-11-18 23:10:51,085 INFO L273 TraceCheckUtils]: 10: Hoare triple {1121#(<= 3 main_~j~0)} assume true; {1121#(<= 3 main_~j~0)} is VALID [2018-11-18 23:10:51,085 INFO L273 TraceCheckUtils]: 11: Hoare triple {1121#(<= 3 main_~j~0)} assume !!(~j~0 >= 1); {1121#(<= 3 main_~j~0)} is VALID [2018-11-18 23:10:51,088 INFO L273 TraceCheckUtils]: 12: Hoare triple {1121#(<= 3 main_~j~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {1121#(<= 3 main_~j~0)} is VALID [2018-11-18 23:10:51,089 INFO L273 TraceCheckUtils]: 13: Hoare triple {1121#(<= 3 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1122#(<= 2 main_~j~0)} is VALID [2018-11-18 23:10:51,089 INFO L273 TraceCheckUtils]: 14: Hoare triple {1122#(<= 2 main_~j~0)} assume true; {1122#(<= 2 main_~j~0)} is VALID [2018-11-18 23:10:51,090 INFO L273 TraceCheckUtils]: 15: Hoare triple {1122#(<= 2 main_~j~0)} assume !!(~j~0 >= 1); {1122#(<= 2 main_~j~0)} is VALID [2018-11-18 23:10:51,091 INFO L273 TraceCheckUtils]: 16: Hoare triple {1122#(<= 2 main_~j~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {1122#(<= 2 main_~j~0)} is VALID [2018-11-18 23:10:51,092 INFO L273 TraceCheckUtils]: 17: Hoare triple {1122#(<= 2 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1123#(<= 1 main_~j~0)} is VALID [2018-11-18 23:10:51,092 INFO L273 TraceCheckUtils]: 18: Hoare triple {1123#(<= 1 main_~j~0)} assume true; {1123#(<= 1 main_~j~0)} is VALID [2018-11-18 23:10:51,093 INFO L273 TraceCheckUtils]: 19: Hoare triple {1123#(<= 1 main_~j~0)} assume !(~j~0 >= 1); {1120#false} is VALID [2018-11-18 23:10:51,093 INFO L273 TraceCheckUtils]: 20: Hoare triple {1120#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1120#false} is VALID [2018-11-18 23:10:51,094 INFO L273 TraceCheckUtils]: 21: Hoare triple {1120#false} assume true; {1120#false} is VALID [2018-11-18 23:10:51,094 INFO L273 TraceCheckUtils]: 22: Hoare triple {1120#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {1120#false} is VALID [2018-11-18 23:10:51,094 INFO L273 TraceCheckUtils]: 23: Hoare triple {1120#false} ~i~0 := 0; {1120#false} is VALID [2018-11-18 23:10:51,095 INFO L273 TraceCheckUtils]: 24: Hoare triple {1120#false} assume true; {1120#false} is VALID [2018-11-18 23:10:51,095 INFO L273 TraceCheckUtils]: 25: Hoare triple {1120#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {1120#false} is VALID [2018-11-18 23:10:51,095 INFO L273 TraceCheckUtils]: 26: Hoare triple {1120#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {1120#false} is VALID [2018-11-18 23:10:51,096 INFO L256 TraceCheckUtils]: 27: Hoare triple {1120#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {1120#false} is VALID [2018-11-18 23:10:51,096 INFO L273 TraceCheckUtils]: 28: Hoare triple {1120#false} ~cond := #in~cond; {1120#false} is VALID [2018-11-18 23:10:51,096 INFO L273 TraceCheckUtils]: 29: Hoare triple {1120#false} assume 0 == ~cond; {1120#false} is VALID [2018-11-18 23:10:51,097 INFO L273 TraceCheckUtils]: 30: Hoare triple {1120#false} assume !false; {1120#false} is VALID [2018-11-18 23:10:51,098 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:10:51,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:10:51,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-18 23:10:51,123 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-18 23:10:51,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:10:51,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 23:10:51,155 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:10:51,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 23:10:51,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 23:10:51,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:10:51,157 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 5 states. [2018-11-18 23:10:51,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:10:51,378 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-11-18 23:10:51,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:10:51,378 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-11-18 23:10:51,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:10:51,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:10:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2018-11-18 23:10:51,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:10:51,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 69 transitions. [2018-11-18 23:10:51,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 69 transitions. [2018-11-18 23:10:51,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:10:51,484 INFO L225 Difference]: With dead ends: 76 [2018-11-18 23:10:51,484 INFO L226 Difference]: Without dead ends: 45 [2018-11-18 23:10:51,485 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:10:51,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-18 23:10:51,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-18 23:10:51,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:10:51,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 45 states. [2018-11-18 23:10:51,576 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-18 23:10:51,576 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-18 23:10:51,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:10:51,578 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-18 23:10:51,578 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-18 23:10:51,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:10:51,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:10:51,579 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 45 states. [2018-11-18 23:10:51,579 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 45 states. [2018-11-18 23:10:51,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:10:51,582 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2018-11-18 23:10:51,582 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-18 23:10:51,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:10:51,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:10:51,583 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:10:51,583 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:10:51,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-18 23:10:51,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2018-11-18 23:10:51,585 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 31 [2018-11-18 23:10:51,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:10:51,585 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2018-11-18 23:10:51,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 23:10:51,586 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2018-11-18 23:10:51,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 23:10:51,586 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:10:51,587 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:10:51,587 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:10:51,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:10:51,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1841148366, now seen corresponding path program 3 times [2018-11-18 23:10:51,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:10:51,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:10:51,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:10:51,589 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:10:51,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:10:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:10:51,750 INFO L256 TraceCheckUtils]: 0: Hoare triple {1466#true} call ULTIMATE.init(); {1466#true} is VALID [2018-11-18 23:10:51,751 INFO L273 TraceCheckUtils]: 1: Hoare triple {1466#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1466#true} is VALID [2018-11-18 23:10:51,751 INFO L273 TraceCheckUtils]: 2: Hoare triple {1466#true} assume true; {1466#true} is VALID [2018-11-18 23:10:51,752 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1466#true} {1466#true} #86#return; {1466#true} is VALID [2018-11-18 23:10:51,752 INFO L256 TraceCheckUtils]: 4: Hoare triple {1466#true} call #t~ret8 := main(); {1466#true} is VALID [2018-11-18 23:10:51,752 INFO L273 TraceCheckUtils]: 5: Hoare triple {1466#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1466#true} is VALID [2018-11-18 23:10:51,753 INFO L273 TraceCheckUtils]: 6: Hoare triple {1466#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {1468#(<= 2 main_~MINVAL~0)} is VALID [2018-11-18 23:10:51,758 INFO L273 TraceCheckUtils]: 7: Hoare triple {1468#(<= 2 main_~MINVAL~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {1468#(<= 2 main_~MINVAL~0)} is VALID [2018-11-18 23:10:51,758 INFO L273 TraceCheckUtils]: 8: Hoare triple {1468#(<= 2 main_~MINVAL~0)} assume true; {1468#(<= 2 main_~MINVAL~0)} is VALID [2018-11-18 23:10:51,759 INFO L273 TraceCheckUtils]: 9: Hoare triple {1468#(<= 2 main_~MINVAL~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {1469#(<= main_~j~0 (+ main_~MINVAL~0 1))} is VALID [2018-11-18 23:10:51,759 INFO L273 TraceCheckUtils]: 10: Hoare triple {1469#(<= main_~j~0 (+ main_~MINVAL~0 1))} assume true; {1469#(<= main_~j~0 (+ main_~MINVAL~0 1))} is VALID [2018-11-18 23:10:51,766 INFO L273 TraceCheckUtils]: 11: Hoare triple {1469#(<= main_~j~0 (+ main_~MINVAL~0 1))} assume !!(~j~0 >= 1); {1469#(<= main_~j~0 (+ main_~MINVAL~0 1))} is VALID [2018-11-18 23:10:51,766 INFO L273 TraceCheckUtils]: 12: Hoare triple {1469#(<= main_~j~0 (+ main_~MINVAL~0 1))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {1469#(<= main_~j~0 (+ main_~MINVAL~0 1))} is VALID [2018-11-18 23:10:51,767 INFO L273 TraceCheckUtils]: 13: Hoare triple {1469#(<= main_~j~0 (+ main_~MINVAL~0 1))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1470#(<= main_~j~0 main_~MINVAL~0)} is VALID [2018-11-18 23:10:51,767 INFO L273 TraceCheckUtils]: 14: Hoare triple {1470#(<= main_~j~0 main_~MINVAL~0)} assume true; {1470#(<= main_~j~0 main_~MINVAL~0)} is VALID [2018-11-18 23:10:51,768 INFO L273 TraceCheckUtils]: 15: Hoare triple {1470#(<= main_~j~0 main_~MINVAL~0)} assume !!(~j~0 >= 1); {1470#(<= main_~j~0 main_~MINVAL~0)} is VALID [2018-11-18 23:10:51,768 INFO L273 TraceCheckUtils]: 16: Hoare triple {1470#(<= main_~j~0 main_~MINVAL~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {1470#(<= main_~j~0 main_~MINVAL~0)} is VALID [2018-11-18 23:10:51,770 INFO L273 TraceCheckUtils]: 17: Hoare triple {1470#(<= main_~j~0 main_~MINVAL~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1471#(<= (+ main_~j~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:10:51,771 INFO L273 TraceCheckUtils]: 18: Hoare triple {1471#(<= (+ main_~j~0 1) main_~MINVAL~0)} assume true; {1471#(<= (+ main_~j~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:10:51,772 INFO L273 TraceCheckUtils]: 19: Hoare triple {1471#(<= (+ main_~j~0 1) main_~MINVAL~0)} assume !!(~j~0 >= 1); {1471#(<= (+ main_~j~0 1) main_~MINVAL~0)} is VALID [2018-11-18 23:10:51,772 INFO L273 TraceCheckUtils]: 20: Hoare triple {1471#(<= (+ main_~j~0 1) main_~MINVAL~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {1467#false} is VALID [2018-11-18 23:10:51,773 INFO L273 TraceCheckUtils]: 21: Hoare triple {1467#false} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1467#false} is VALID [2018-11-18 23:10:51,773 INFO L273 TraceCheckUtils]: 22: Hoare triple {1467#false} assume true; {1467#false} is VALID [2018-11-18 23:10:51,773 INFO L273 TraceCheckUtils]: 23: Hoare triple {1467#false} assume !(~j~0 >= 1); {1467#false} is VALID [2018-11-18 23:10:51,773 INFO L273 TraceCheckUtils]: 24: Hoare triple {1467#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1467#false} is VALID [2018-11-18 23:10:51,774 INFO L273 TraceCheckUtils]: 25: Hoare triple {1467#false} assume true; {1467#false} is VALID [2018-11-18 23:10:51,774 INFO L273 TraceCheckUtils]: 26: Hoare triple {1467#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {1467#false} is VALID [2018-11-18 23:10:51,775 INFO L273 TraceCheckUtils]: 27: Hoare triple {1467#false} ~i~0 := 0; {1467#false} is VALID [2018-11-18 23:10:51,775 INFO L273 TraceCheckUtils]: 28: Hoare triple {1467#false} assume true; {1467#false} is VALID [2018-11-18 23:10:51,775 INFO L273 TraceCheckUtils]: 29: Hoare triple {1467#false} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {1467#false} is VALID [2018-11-18 23:10:51,776 INFO L273 TraceCheckUtils]: 30: Hoare triple {1467#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {1467#false} is VALID [2018-11-18 23:10:51,776 INFO L256 TraceCheckUtils]: 31: Hoare triple {1467#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {1467#false} is VALID [2018-11-18 23:10:51,776 INFO L273 TraceCheckUtils]: 32: Hoare triple {1467#false} ~cond := #in~cond; {1467#false} is VALID [2018-11-18 23:10:51,776 INFO L273 TraceCheckUtils]: 33: Hoare triple {1467#false} assume 0 == ~cond; {1467#false} is VALID [2018-11-18 23:10:51,777 INFO L273 TraceCheckUtils]: 34: Hoare triple {1467#false} assume !false; {1467#false} is VALID [2018-11-18 23:10:51,779 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:10:51,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:10:51,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-18 23:10:51,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-11-18 23:10:51,780 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:10:51,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 23:10:51,824 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:10:51,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 23:10:51,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 23:10:51,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:10:51,826 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand 6 states. [2018-11-18 23:10:52,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:10:52,110 INFO L93 Difference]: Finished difference Result 85 states and 98 transitions. [2018-11-18 23:10:52,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 23:10:52,110 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 35 [2018-11-18 23:10:52,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:10:52,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:10:52,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2018-11-18 23:10:52,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:10:52,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2018-11-18 23:10:52,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2018-11-18 23:10:52,323 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-18 23:10:52,325 INFO L225 Difference]: With dead ends: 85 [2018-11-18 23:10:52,325 INFO L226 Difference]: Without dead ends: 50 [2018-11-18 23:10:52,326 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-11-18 23:10:52,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-18 23:10:52,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-18 23:10:52,410 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:10:52,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 49 states. [2018-11-18 23:10:52,410 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 49 states. [2018-11-18 23:10:52,410 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 49 states. [2018-11-18 23:10:52,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:10:52,414 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-11-18 23:10:52,414 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-11-18 23:10:52,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:10:52,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:10:52,415 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 50 states. [2018-11-18 23:10:52,415 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 50 states. [2018-11-18 23:10:52,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:10:52,417 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-11-18 23:10:52,417 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2018-11-18 23:10:52,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:10:52,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:10:52,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:10:52,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:10:52,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-18 23:10:52,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-11-18 23:10:52,420 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 35 [2018-11-18 23:10:52,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:10:52,421 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-18 23:10:52,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 23:10:52,421 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-18 23:10:52,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-18 23:10:52,422 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:10:52,422 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 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-18 23:10:52,422 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:10:52,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:10:52,423 INFO L82 PathProgramCache]: Analyzing trace with hash 1173955252, now seen corresponding path program 1 times [2018-11-18 23:10:52,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:10:52,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:10:52,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:10:52,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:10:52,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:10:52,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:10:53,041 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 28 [2018-11-18 23:10:54,377 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 19 [2018-11-18 23:10:54,630 INFO L256 TraceCheckUtils]: 0: Hoare triple {1756#true} call ULTIMATE.init(); {1756#true} is VALID [2018-11-18 23:10:54,630 INFO L273 TraceCheckUtils]: 1: Hoare triple {1756#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1756#true} is VALID [2018-11-18 23:10:54,630 INFO L273 TraceCheckUtils]: 2: Hoare triple {1756#true} assume true; {1756#true} is VALID [2018-11-18 23:10:54,631 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1756#true} {1756#true} #86#return; {1756#true} is VALID [2018-11-18 23:10:54,631 INFO L256 TraceCheckUtils]: 4: Hoare triple {1756#true} call #t~ret8 := main(); {1756#true} is VALID [2018-11-18 23:10:54,631 INFO L273 TraceCheckUtils]: 5: Hoare triple {1756#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1756#true} is VALID [2018-11-18 23:10:54,632 INFO L273 TraceCheckUtils]: 6: Hoare triple {1756#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {1758#(and (<= 2 ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:10:54,633 INFO L273 TraceCheckUtils]: 7: Hoare triple {1758#(and (<= 2 ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {1759#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-18 23:10:54,633 INFO L273 TraceCheckUtils]: 8: Hoare triple {1759#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume true; {1759#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-18 23:10:54,635 INFO L273 TraceCheckUtils]: 9: Hoare triple {1759#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {1760#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~j~0 3) (= |main_~#volArray~0.offset| 0) (<= 3 main_~j~0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))} is VALID [2018-11-18 23:10:54,636 INFO L273 TraceCheckUtils]: 10: Hoare triple {1760#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~j~0 3) (= |main_~#volArray~0.offset| 0) (<= 3 main_~j~0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))} assume true; {1760#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~j~0 3) (= |main_~#volArray~0.offset| 0) (<= 3 main_~j~0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))} is VALID [2018-11-18 23:10:54,637 INFO L273 TraceCheckUtils]: 11: Hoare triple {1760#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~j~0 3) (= |main_~#volArray~0.offset| 0) (<= 3 main_~j~0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))} assume !!(~j~0 >= 1); {1760#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~j~0 3) (= |main_~#volArray~0.offset| 0) (<= 3 main_~j~0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))} is VALID [2018-11-18 23:10:54,638 INFO L273 TraceCheckUtils]: 12: Hoare triple {1760#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~j~0 3) (= |main_~#volArray~0.offset| 0) (<= 3 main_~j~0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {1761#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))} is VALID [2018-11-18 23:10:54,640 INFO L273 TraceCheckUtils]: 13: Hoare triple {1761#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1762#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)))} is VALID [2018-11-18 23:10:54,641 INFO L273 TraceCheckUtils]: 14: Hoare triple {1762#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)))} assume true; {1762#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)))} is VALID [2018-11-18 23:10:54,642 INFO L273 TraceCheckUtils]: 15: Hoare triple {1762#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)))} assume !!(~j~0 >= 1); {1762#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)))} is VALID [2018-11-18 23:10:54,644 INFO L273 TraceCheckUtils]: 16: Hoare triple {1762#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {1763#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-18 23:10:54,645 INFO L273 TraceCheckUtils]: 17: Hoare triple {1763#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1764#(and (or (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) (* 4 main_~j~0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-18 23:10:54,646 INFO L273 TraceCheckUtils]: 18: Hoare triple {1764#(and (or (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) (* 4 main_~j~0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume true; {1764#(and (or (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) (* 4 main_~j~0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-18 23:10:54,647 INFO L273 TraceCheckUtils]: 19: Hoare triple {1764#(and (or (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) (* 4 main_~j~0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume !!(~j~0 >= 1); {1764#(and (or (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) (* 4 main_~j~0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-18 23:10:54,648 INFO L273 TraceCheckUtils]: 20: Hoare triple {1764#(and (or (<= (+ main_~MINVAL~0 1) (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) (* 4 main_~j~0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {1765#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (or (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))) (= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) (* 4 main_~j~0))) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:10:54,649 INFO L273 TraceCheckUtils]: 21: Hoare triple {1765#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (or (and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))) (= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) (* 4 main_~j~0))) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (< 0 (+ ~CELLCOUNT~0 1)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1766#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:10:54,650 INFO L273 TraceCheckUtils]: 22: Hoare triple {1766#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (< 0 (+ ~CELLCOUNT~0 1)))} assume true; {1766#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:10:54,651 INFO L273 TraceCheckUtils]: 23: Hoare triple {1766#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~j~0 >= 1); {1766#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:10:54,652 INFO L273 TraceCheckUtils]: 24: Hoare triple {1766#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (< 0 (+ ~CELLCOUNT~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1767#(and (= |main_~#volArray~0.offset| 0) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) 23)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:10:54,653 INFO L273 TraceCheckUtils]: 25: Hoare triple {1767#(and (= |main_~#volArray~0.offset| 0) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) 23)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (< 0 (+ ~CELLCOUNT~0 1)))} assume true; {1767#(and (= |main_~#volArray~0.offset| 0) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) 23)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-18 23:10:54,656 INFO L273 TraceCheckUtils]: 26: Hoare triple {1767#(and (= |main_~#volArray~0.offset| 0) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (+ |main_~#volArray~0.offset| (* 12 main_~i~0)) 23)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {1768#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:10:54,660 INFO L273 TraceCheckUtils]: 27: Hoare triple {1768#(and (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0))} ~i~0 := 0; {1769#(and (or (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-18 23:10:54,663 INFO L273 TraceCheckUtils]: 28: Hoare triple {1769#(and (or (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume true; {1769#(and (or (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-18 23:10:54,665 INFO L273 TraceCheckUtils]: 29: Hoare triple {1769#(and (or (<= (+ main_~MINVAL~0 1) (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {1770#(and (or |main_#t~short7| (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-18 23:10:54,667 INFO L273 TraceCheckUtils]: 30: Hoare triple {1770#(and (or |main_#t~short7| (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {1771#|main_#t~short7|} is VALID [2018-11-18 23:10:54,668 INFO L256 TraceCheckUtils]: 31: Hoare triple {1771#|main_#t~short7|} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {1772#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2018-11-18 23:10:54,669 INFO L273 TraceCheckUtils]: 32: Hoare triple {1772#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1773#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2018-11-18 23:10:54,669 INFO L273 TraceCheckUtils]: 33: Hoare triple {1773#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1757#false} is VALID [2018-11-18 23:10:54,669 INFO L273 TraceCheckUtils]: 34: Hoare triple {1757#false} assume !false; {1757#false} is VALID [2018-11-18 23:10:54,680 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:10:54,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:10:54,680 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-18 23:10:54,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:10:54,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:10:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:10:54,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:10:54,902 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 18 treesize of output 15 [2018-11-18 23:10:54,926 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 15 treesize of output 14 [2018-11-18 23:10:54,928 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:10:54,936 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:10:54,949 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:10:54,949 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-11-18 23:10:55,044 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 31 treesize of output 26 [2018-11-18 23:10:55,056 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:10:55,058 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:10:55,059 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 26 treesize of output 56 [2018-11-18 23:10:55,061 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:10:55,069 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:10:55,247 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:10:55,248 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:43, output treesize:39 [2018-11-18 23:10:55,252 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:10:55,481 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 36 treesize of output 29 [2018-11-18 23:10:55,488 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:10:55,492 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:10:55,495 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:10:55,518 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 4 case distinctions, treesize of input 29 treesize of output 68 [2018-11-18 23:10:55,522 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 4 xjuncts. [2018-11-18 23:10:55,568 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 23:10:55,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2018-11-18 23:10:55,644 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:45, output treesize:100 [2018-11-18 23:10:55,668 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:10:56,758 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 50 [2018-11-18 23:10:56,873 INFO L256 TraceCheckUtils]: 0: Hoare triple {1756#true} call ULTIMATE.init(); {1756#true} is VALID [2018-11-18 23:10:56,874 INFO L273 TraceCheckUtils]: 1: Hoare triple {1756#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1756#true} is VALID [2018-11-18 23:10:56,874 INFO L273 TraceCheckUtils]: 2: Hoare triple {1756#true} assume true; {1756#true} is VALID [2018-11-18 23:10:56,874 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1756#true} {1756#true} #86#return; {1756#true} is VALID [2018-11-18 23:10:56,875 INFO L256 TraceCheckUtils]: 4: Hoare triple {1756#true} call #t~ret8 := main(); {1756#true} is VALID [2018-11-18 23:10:56,875 INFO L273 TraceCheckUtils]: 5: Hoare triple {1756#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1756#true} is VALID [2018-11-18 23:10:56,875 INFO L273 TraceCheckUtils]: 6: Hoare triple {1756#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {1795#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:10:56,876 INFO L273 TraceCheckUtils]: 7: Hoare triple {1795#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {1799#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:10:56,876 INFO L273 TraceCheckUtils]: 8: Hoare triple {1799#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume true; {1799#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:10:56,877 INFO L273 TraceCheckUtils]: 9: Hoare triple {1799#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {1806#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:10:56,878 INFO L273 TraceCheckUtils]: 10: Hoare triple {1806#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume true; {1806#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:10:56,878 INFO L273 TraceCheckUtils]: 11: Hoare triple {1806#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~j~0 >= 1); {1806#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:10:56,879 INFO L273 TraceCheckUtils]: 12: Hoare triple {1806#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {1816#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:10:56,879 INFO L273 TraceCheckUtils]: 13: Hoare triple {1816#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (= |main_~#volArray~0.offset| 0))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1820#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 12)))) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 2))} is VALID [2018-11-18 23:10:56,880 INFO L273 TraceCheckUtils]: 14: Hoare triple {1820#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 12)))) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 2))} assume true; {1820#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 12)))) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 2))} is VALID [2018-11-18 23:10:56,881 INFO L273 TraceCheckUtils]: 15: Hoare triple {1820#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 12)))) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 2))} assume !!(~j~0 >= 1); {1820#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 12)))) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 2))} is VALID [2018-11-18 23:10:56,883 INFO L273 TraceCheckUtils]: 16: Hoare triple {1820#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 12)))) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 2))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {1830#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 12)))) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (<= main_~j~0 2))))} is VALID [2018-11-18 23:10:56,884 INFO L273 TraceCheckUtils]: 17: Hoare triple {1830#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 12)))) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (<= main_~j~0 2))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1830#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 12)))) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (<= main_~j~0 2))))} is VALID [2018-11-18 23:10:56,886 INFO L273 TraceCheckUtils]: 18: Hoare triple {1830#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 12)))) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (<= main_~j~0 2))))} assume true; {1830#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 12)))) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (<= main_~j~0 2))))} is VALID [2018-11-18 23:10:56,887 INFO L273 TraceCheckUtils]: 19: Hoare triple {1830#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 12)))) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (<= main_~j~0 2))))} assume !!(~j~0 >= 1); {1830#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 12)))) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (<= main_~j~0 2))))} is VALID [2018-11-18 23:10:56,889 INFO L273 TraceCheckUtils]: 20: Hoare triple {1830#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= 3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 12)))) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (<= main_~j~0 2))))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {1843#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_3 Int)) (and (<= v_prenex_3 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 12)) v_prenex_3))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) v_prenex_1) (<= v_prenex_1 2))) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (exists ((v_prenex_2 Int)) (and (<= v_prenex_2 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 12)) 0))) (= |main_~#volArray~0.offset| 0)))} is VALID [2018-11-18 23:10:56,890 INFO L273 TraceCheckUtils]: 21: Hoare triple {1843#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_3 Int)) (and (<= v_prenex_3 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 12)) v_prenex_3))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) v_prenex_1) (<= v_prenex_1 2))) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (exists ((v_prenex_2 Int)) (and (<= v_prenex_2 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 12)) 0))) (= |main_~#volArray~0.offset| 0)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1843#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_3 Int)) (and (<= v_prenex_3 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 12)) v_prenex_3))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) v_prenex_1) (<= v_prenex_1 2))) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (exists ((v_prenex_2 Int)) (and (<= v_prenex_2 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 12)) 0))) (= |main_~#volArray~0.offset| 0)))} is VALID [2018-11-18 23:10:56,891 INFO L273 TraceCheckUtils]: 22: Hoare triple {1843#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_3 Int)) (and (<= v_prenex_3 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 12)) v_prenex_3))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) v_prenex_1) (<= v_prenex_1 2))) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (exists ((v_prenex_2 Int)) (and (<= v_prenex_2 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 12)) 0))) (= |main_~#volArray~0.offset| 0)))} assume true; {1843#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_3 Int)) (and (<= v_prenex_3 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 12)) v_prenex_3))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) v_prenex_1) (<= v_prenex_1 2))) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (exists ((v_prenex_2 Int)) (and (<= v_prenex_2 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 12)) 0))) (= |main_~#volArray~0.offset| 0)))} is VALID [2018-11-18 23:10:56,891 INFO L273 TraceCheckUtils]: 23: Hoare triple {1843#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_3 Int)) (and (<= v_prenex_3 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 12)) v_prenex_3))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) v_prenex_1) (<= v_prenex_1 2))) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (exists ((v_prenex_2 Int)) (and (<= v_prenex_2 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 12)) 0))) (= |main_~#volArray~0.offset| 0)))} assume !(~j~0 >= 1); {1843#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_3 Int)) (and (<= v_prenex_3 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 12)) v_prenex_3))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) v_prenex_1) (<= v_prenex_1 2))) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (exists ((v_prenex_2 Int)) (and (<= v_prenex_2 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 12)) 0))) (= |main_~#volArray~0.offset| 0)))} is VALID [2018-11-18 23:10:56,892 INFO L273 TraceCheckUtils]: 24: Hoare triple {1843#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_3 Int)) (and (<= v_prenex_3 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 12)) v_prenex_3))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) v_prenex_1) (<= v_prenex_1 2))) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (exists ((v_prenex_2 Int)) (and (<= v_prenex_2 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 12)) 0))) (= |main_~#volArray~0.offset| 0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1843#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_3 Int)) (and (<= v_prenex_3 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 12)) v_prenex_3))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) v_prenex_1) (<= v_prenex_1 2))) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (exists ((v_prenex_2 Int)) (and (<= v_prenex_2 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 12)) 0))) (= |main_~#volArray~0.offset| 0)))} is VALID [2018-11-18 23:10:56,893 INFO L273 TraceCheckUtils]: 25: Hoare triple {1843#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_3 Int)) (and (<= v_prenex_3 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 12)) v_prenex_3))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) v_prenex_1) (<= v_prenex_1 2))) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (exists ((v_prenex_2 Int)) (and (<= v_prenex_2 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 12)) 0))) (= |main_~#volArray~0.offset| 0)))} assume true; {1843#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_3 Int)) (and (<= v_prenex_3 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 12)) v_prenex_3))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) v_prenex_1) (<= v_prenex_1 2))) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (exists ((v_prenex_2 Int)) (and (<= v_prenex_2 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 12)) 0))) (= |main_~#volArray~0.offset| 0)))} is VALID [2018-11-18 23:10:56,893 INFO L273 TraceCheckUtils]: 26: Hoare triple {1843#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_3 Int)) (and (<= v_prenex_3 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 12)) v_prenex_3))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) v_prenex_1) (<= v_prenex_1 2))) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (exists ((v_prenex_2 Int)) (and (<= v_prenex_2 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 12)) 0))) (= |main_~#volArray~0.offset| 0)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {1843#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_3 Int)) (and (<= v_prenex_3 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 12)) v_prenex_3))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) v_prenex_1) (<= v_prenex_1 2))) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (exists ((v_prenex_2 Int)) (and (<= v_prenex_2 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 12)) 0))) (= |main_~#volArray~0.offset| 0)))} is VALID [2018-11-18 23:10:56,896 INFO L273 TraceCheckUtils]: 27: Hoare triple {1843#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_3 Int)) (and (<= v_prenex_3 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 12)) v_prenex_3))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) v_prenex_1) (<= v_prenex_1 2))) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (exists ((v_prenex_2 Int)) (and (<= v_prenex_2 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 12)) 0))) (= |main_~#volArray~0.offset| 0)))} ~i~0 := 0; {1865#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (exists ((v_prenex_2 Int)) (and (<= v_prenex_2 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 12)) 0))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) v_prenex_1) (<= v_prenex_1 2))) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0)) (= main_~i~0 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_3 Int)) (and (<= v_prenex_3 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 12)) v_prenex_3))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (= main_~i~0 0)))} is VALID [2018-11-18 23:10:56,897 INFO L273 TraceCheckUtils]: 28: Hoare triple {1865#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (exists ((v_prenex_2 Int)) (and (<= v_prenex_2 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 12)) 0))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) v_prenex_1) (<= v_prenex_1 2))) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0)) (= main_~i~0 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_3 Int)) (and (<= v_prenex_3 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 12)) v_prenex_3))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (= main_~i~0 0)))} assume true; {1865#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (exists ((v_prenex_2 Int)) (and (<= v_prenex_2 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 12)) 0))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) v_prenex_1) (<= v_prenex_1 2))) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0)) (= main_~i~0 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_3 Int)) (and (<= v_prenex_3 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 12)) v_prenex_3))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (= main_~i~0 0)))} is VALID [2018-11-18 23:10:56,900 INFO L273 TraceCheckUtils]: 29: Hoare triple {1865#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (exists ((v_prenex_2 Int)) (and (<= v_prenex_2 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 12)) 0))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_1 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 12)) v_prenex_1) (<= v_prenex_1 2))) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0)) (= main_~i~0 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_3 Int)) (and (<= v_prenex_3 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 12)) v_prenex_3))) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (= main_~i~0 0)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {1872#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) |main_#t~short7| (exists ((v_prenex_4 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_4) 12)) 0)) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_7 Int)) (and (<= v_prenex_7 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_7) 12)) v_prenex_7))) (= main_~i~0 0)) (and (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (exists ((v_prenex_6 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_6) 12)) v_prenex_6) (<= v_prenex_6 2))) (= main_~i~0 0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) |main_#t~short7| (exists ((v_prenex_5 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_5) 12)) 0) (<= v_prenex_5 2))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0)))} is VALID [2018-11-18 23:10:56,901 INFO L273 TraceCheckUtils]: 30: Hoare triple {1872#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) |main_#t~short7| (exists ((v_prenex_4 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_4) 12)) 0)) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_7 Int)) (and (<= v_prenex_7 2) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_7) 12)) v_prenex_7))) (= main_~i~0 0)) (and (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (exists ((v_prenex_6 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_6) 12)) v_prenex_6) (<= v_prenex_6 2))) (= main_~i~0 0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 3) |main_#t~short7| (exists ((v_prenex_5 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_5) 12)) 0) (<= v_prenex_5 2))) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0)))} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {1771#|main_#t~short7|} is VALID [2018-11-18 23:10:56,902 INFO L256 TraceCheckUtils]: 31: Hoare triple {1771#|main_#t~short7|} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {1879#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-18 23:10:56,903 INFO L273 TraceCheckUtils]: 32: Hoare triple {1879#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1883#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-18 23:10:56,904 INFO L273 TraceCheckUtils]: 33: Hoare triple {1883#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1757#false} is VALID [2018-11-18 23:10:56,904 INFO L273 TraceCheckUtils]: 34: Hoare triple {1757#false} assume !false; {1757#false} is VALID [2018-11-18 23:10:56,920 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:10:56,941 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:10:56,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 29 [2018-11-18 23:10:56,941 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2018-11-18 23:10:56,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:10:56,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-18 23:10:57,043 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:10:57,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-18 23:10:57,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-18 23:10:57,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=695, Unknown=0, NotChecked=0, Total=812 [2018-11-18 23:10:57,045 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 29 states. [2018-11-18 23:10:59,500 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 57 [2018-11-18 23:11:04,111 WARN L180 SmtUtils]: Spent 4.39 s on a formula simplification. DAG size of input: 107 DAG size of output: 59 [2018-11-18 23:11:04,781 WARN L180 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 58 [2018-11-18 23:11:05,818 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 59 [2018-11-18 23:11:06,249 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2018-11-18 23:11:09,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:11:09,173 INFO L93 Difference]: Finished difference Result 194 states and 232 transitions. [2018-11-18 23:11:09,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-18 23:11:09,173 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 35 [2018-11-18 23:11:09,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:11:09,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 23:11:09,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 170 transitions. [2018-11-18 23:11:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-18 23:11:09,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 170 transitions. [2018-11-18 23:11:09,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 170 transitions. [2018-11-18 23:11:09,492 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-18 23:11:09,497 INFO L225 Difference]: With dead ends: 194 [2018-11-18 23:11:09,497 INFO L226 Difference]: Without dead ends: 155 [2018-11-18 23:11:09,498 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=382, Invalid=1970, Unknown=0, NotChecked=0, Total=2352 [2018-11-18 23:11:09,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-18 23:11:09,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 77. [2018-11-18 23:11:09,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:11:09,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand 77 states. [2018-11-18 23:11:09,674 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 77 states. [2018-11-18 23:11:09,675 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 77 states. [2018-11-18 23:11:09,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:11:09,683 INFO L93 Difference]: Finished difference Result 155 states and 186 transitions. [2018-11-18 23:11:09,683 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 186 transitions. [2018-11-18 23:11:09,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:11:09,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:11:09,684 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 155 states. [2018-11-18 23:11:09,685 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 155 states. [2018-11-18 23:11:09,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:11:09,691 INFO L93 Difference]: Finished difference Result 155 states and 186 transitions. [2018-11-18 23:11:09,692 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 186 transitions. [2018-11-18 23:11:09,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:11:09,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:11:09,693 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:11:09,693 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:11:09,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-11-18 23:11:09,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 87 transitions. [2018-11-18 23:11:09,696 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 87 transitions. Word has length 35 [2018-11-18 23:11:09,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:11:09,696 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 87 transitions. [2018-11-18 23:11:09,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-18 23:11:09,696 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 87 transitions. [2018-11-18 23:11:09,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-18 23:11:09,697 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:11:09,697 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 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-18 23:11:09,698 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:11:09,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:11:09,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1865605921, now seen corresponding path program 1 times [2018-11-18 23:11:09,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:11:09,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:11:09,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:11:09,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:11:09,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:11:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:11:10,851 INFO L256 TraceCheckUtils]: 0: Hoare triple {2595#true} call ULTIMATE.init(); {2595#true} is VALID [2018-11-18 23:11:10,852 INFO L273 TraceCheckUtils]: 1: Hoare triple {2595#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2595#true} is VALID [2018-11-18 23:11:10,852 INFO L273 TraceCheckUtils]: 2: Hoare triple {2595#true} assume true; {2595#true} is VALID [2018-11-18 23:11:10,853 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2595#true} {2595#true} #86#return; {2595#true} is VALID [2018-11-18 23:11:10,853 INFO L256 TraceCheckUtils]: 4: Hoare triple {2595#true} call #t~ret8 := main(); {2595#true} is VALID [2018-11-18 23:11:10,853 INFO L273 TraceCheckUtils]: 5: Hoare triple {2595#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2595#true} is VALID [2018-11-18 23:11:10,854 INFO L273 TraceCheckUtils]: 6: Hoare triple {2595#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {2597#(and (<= 2 ~CELLCOUNT~0) (<= main_~MINVAL~0 2))} is VALID [2018-11-18 23:11:10,855 INFO L273 TraceCheckUtils]: 7: Hoare triple {2597#(and (<= 2 ~CELLCOUNT~0) (<= main_~MINVAL~0 2))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {2598#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-18 23:11:10,856 INFO L273 TraceCheckUtils]: 8: Hoare triple {2598#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume true; {2598#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-18 23:11:10,857 INFO L273 TraceCheckUtils]: 9: Hoare triple {2598#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {2599#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~j~0 3) (= main_~i~0 1) (<= 3 main_~j~0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-18 23:11:10,857 INFO L273 TraceCheckUtils]: 10: Hoare triple {2599#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~j~0 3) (= main_~i~0 1) (<= 3 main_~j~0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume true; {2599#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~j~0 3) (= main_~i~0 1) (<= 3 main_~j~0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-18 23:11:10,858 INFO L273 TraceCheckUtils]: 11: Hoare triple {2599#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~j~0 3) (= main_~i~0 1) (<= 3 main_~j~0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume !!(~j~0 >= 1); {2599#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~j~0 3) (= main_~i~0 1) (<= 3 main_~j~0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-18 23:11:10,860 INFO L273 TraceCheckUtils]: 12: Hoare triple {2599#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~j~0 3) (= main_~i~0 1) (<= 3 main_~j~0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {2599#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~j~0 3) (= main_~i~0 1) (<= 3 main_~j~0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-18 23:11:10,865 INFO L273 TraceCheckUtils]: 13: Hoare triple {2599#(and (<= (+ main_~MINVAL~0 1) main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~j~0 3) (= main_~i~0 1) (<= 3 main_~j~0) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2600#(and (<= 2 main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (<= main_~MINVAL~0 main_~j~0) (<= main_~j~0 2) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-18 23:11:10,866 INFO L273 TraceCheckUtils]: 14: Hoare triple {2600#(and (<= 2 main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (<= main_~MINVAL~0 main_~j~0) (<= main_~j~0 2) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume true; {2600#(and (<= 2 main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (<= main_~MINVAL~0 main_~j~0) (<= main_~j~0 2) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-18 23:11:10,866 INFO L273 TraceCheckUtils]: 15: Hoare triple {2600#(and (<= 2 main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (<= main_~MINVAL~0 main_~j~0) (<= main_~j~0 2) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume !!(~j~0 >= 1); {2600#(and (<= 2 main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (<= main_~MINVAL~0 main_~j~0) (<= main_~j~0 2) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-18 23:11:10,867 INFO L273 TraceCheckUtils]: 16: Hoare triple {2600#(and (<= 2 main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (<= main_~MINVAL~0 main_~j~0) (<= main_~j~0 2) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {2601#(and (<= 2 main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (<= main_~MINVAL~0 main_~j~0) (<= main_~j~0 2) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))))} is VALID [2018-11-18 23:11:10,868 INFO L273 TraceCheckUtils]: 17: Hoare triple {2601#(and (<= 2 main_~j~0) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (<= main_~MINVAL~0 main_~j~0) (<= main_~j~0 2) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2602#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-18 23:11:10,869 INFO L273 TraceCheckUtils]: 18: Hoare triple {2602#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume true; {2602#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-18 23:11:10,870 INFO L273 TraceCheckUtils]: 19: Hoare triple {2602#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume !!(~j~0 >= 1); {2602#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-18 23:11:10,872 INFO L273 TraceCheckUtils]: 20: Hoare triple {2602#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 12 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {2603#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-18 23:11:10,873 INFO L273 TraceCheckUtils]: 21: Hoare triple {2603#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2603#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-18 23:11:10,873 INFO L273 TraceCheckUtils]: 22: Hoare triple {2603#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume true; {2603#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-18 23:11:10,874 INFO L273 TraceCheckUtils]: 23: Hoare triple {2603#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} assume !(~j~0 >= 1); {2603#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} is VALID [2018-11-18 23:11:10,876 INFO L273 TraceCheckUtils]: 24: Hoare triple {2603#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 2)) (+ |main_~#volArray~0.offset| (* 12 main_~i~0))))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (= main_~i~0 1) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2604#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (* 3 main_~i~0) 6) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (* 3 main_~i~0) 5)))} is VALID [2018-11-18 23:11:10,877 INFO L273 TraceCheckUtils]: 25: Hoare triple {2604#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (* 3 main_~i~0) 6) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (* 3 main_~i~0) 5)))} assume true; {2604#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (* 3 main_~i~0) 6) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (* 3 main_~i~0) 5)))} is VALID [2018-11-18 23:11:10,878 INFO L273 TraceCheckUtils]: 26: Hoare triple {2604#(and (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (* 3 main_~i~0) 6) (= ~CELLCOUNT~0 (* 3 (div ~CELLCOUNT~0 3))) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (* 3 main_~i~0) 5)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {2605#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1))} is VALID [2018-11-18 23:11:10,879 INFO L273 TraceCheckUtils]: 27: Hoare triple {2605#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1))} ~i~0 := 0; {2606#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1) (= main_~i~0 0))} is VALID [2018-11-18 23:11:10,880 INFO L273 TraceCheckUtils]: 28: Hoare triple {2606#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1) (= main_~i~0 0))} assume true; {2606#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1) (= main_~i~0 0))} is VALID [2018-11-18 23:11:10,881 INFO L273 TraceCheckUtils]: 29: Hoare triple {2606#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {2606#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1) (= main_~i~0 0))} is VALID [2018-11-18 23:11:10,882 INFO L273 TraceCheckUtils]: 30: Hoare triple {2606#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1) (= main_~i~0 0))} assume #t~short7; {2606#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1) (= main_~i~0 0))} is VALID [2018-11-18 23:11:10,882 INFO L256 TraceCheckUtils]: 31: Hoare triple {2606#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2595#true} is VALID [2018-11-18 23:11:10,882 INFO L273 TraceCheckUtils]: 32: Hoare triple {2595#true} ~cond := #in~cond; {2595#true} is VALID [2018-11-18 23:11:10,883 INFO L273 TraceCheckUtils]: 33: Hoare triple {2595#true} assume !(0 == ~cond); {2595#true} is VALID [2018-11-18 23:11:10,883 INFO L273 TraceCheckUtils]: 34: Hoare triple {2595#true} assume true; {2595#true} is VALID [2018-11-18 23:11:10,884 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2595#true} {2606#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1) (= main_~i~0 0))} #90#return; {2606#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1) (= main_~i~0 0))} is VALID [2018-11-18 23:11:10,885 INFO L273 TraceCheckUtils]: 36: Hoare triple {2606#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1) (= main_~i~0 0))} havoc #t~mem6;havoc #t~short7;havoc #t~mem5; {2606#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1) (= main_~i~0 0))} is VALID [2018-11-18 23:11:10,886 INFO L273 TraceCheckUtils]: 37: Hoare triple {2606#(and (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (<= (+ (div ~CELLCOUNT~0 3) 2) ~CELLCOUNT~0) (<= (div (+ (* (- 3) (div ~CELLCOUNT~0 3)) (+ (* 3 ~CELLCOUNT~0) (- 3))) 2) 1) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2607#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-18 23:11:10,886 INFO L273 TraceCheckUtils]: 38: Hoare triple {2607#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume true; {2607#(<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-18 23:11:10,887 INFO L273 TraceCheckUtils]: 39: Hoare triple {2607#(<= 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~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {2608#|main_#t~short7|} is VALID [2018-11-18 23:11:10,887 INFO L273 TraceCheckUtils]: 40: Hoare triple {2608#|main_#t~short7|} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {2596#false} is VALID [2018-11-18 23:11:10,888 INFO L256 TraceCheckUtils]: 41: Hoare triple {2596#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2596#false} is VALID [2018-11-18 23:11:10,888 INFO L273 TraceCheckUtils]: 42: Hoare triple {2596#false} ~cond := #in~cond; {2596#false} is VALID [2018-11-18 23:11:10,888 INFO L273 TraceCheckUtils]: 43: Hoare triple {2596#false} assume 0 == ~cond; {2596#false} is VALID [2018-11-18 23:11:10,888 INFO L273 TraceCheckUtils]: 44: Hoare triple {2596#false} assume !false; {2596#false} is VALID [2018-11-18 23:11:10,898 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:11:10,898 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 23:11:10,898 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-18 23:11:10,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:11:10,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:11:10,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:11:10,956 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:11:11,236 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 18 treesize of output 15 [2018-11-18 23:11:11,241 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 15 treesize of output 14 [2018-11-18 23:11:11,243 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:11:11,246 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:11,258 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:11,258 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2018-11-18 23:11:11,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2018-11-18 23:11:11,389 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:11:11,390 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 23:11:11,391 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 43 [2018-11-18 23:11:11,394 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 23:11:11,404 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 23:11:11,417 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-18 23:11:11,417 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:35, output treesize:31 [2018-11-18 23:11:11,422 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-18 23:11:12,002 INFO L256 TraceCheckUtils]: 0: Hoare triple {2595#true} call ULTIMATE.init(); {2595#true} is VALID [2018-11-18 23:11:12,003 INFO L273 TraceCheckUtils]: 1: Hoare triple {2595#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2595#true} is VALID [2018-11-18 23:11:12,003 INFO L273 TraceCheckUtils]: 2: Hoare triple {2595#true} assume true; {2595#true} is VALID [2018-11-18 23:11:12,003 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2595#true} {2595#true} #86#return; {2595#true} is VALID [2018-11-18 23:11:12,003 INFO L256 TraceCheckUtils]: 4: Hoare triple {2595#true} call #t~ret8 := main(); {2595#true} is VALID [2018-11-18 23:11:12,003 INFO L273 TraceCheckUtils]: 5: Hoare triple {2595#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2595#true} is VALID [2018-11-18 23:11:12,004 INFO L273 TraceCheckUtils]: 6: Hoare triple {2595#true} assume ~CELLCOUNT~0 > 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {2630#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:11:12,005 INFO L273 TraceCheckUtils]: 7: Hoare triple {2630#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then ~CELLCOUNT~0 % 3 - 3 else ~CELLCOUNT~0 % 3) then 1 else 0);~i~0 := 1; {2634#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:11:12,005 INFO L273 TraceCheckUtils]: 8: Hoare triple {2634#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume true; {2634#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:11:12,006 INFO L273 TraceCheckUtils]: 9: Hoare triple {2634#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3));~j~0 := 3; {2641#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:11:12,006 INFO L273 TraceCheckUtils]: 10: Hoare triple {2641#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume true; {2641#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:11:12,007 INFO L273 TraceCheckUtils]: 11: Hoare triple {2641#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~j~0 >= 1); {2641#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:11:12,007 INFO L273 TraceCheckUtils]: 12: Hoare triple {2641#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {2641#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:11:12,008 INFO L273 TraceCheckUtils]: 13: Hoare triple {2641#(and (= main_~j~0 3) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2654#(and (= 2 main_~j~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:11:12,009 INFO L273 TraceCheckUtils]: 14: Hoare triple {2654#(and (= 2 main_~j~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume true; {2654#(and (= 2 main_~j~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:11:12,010 INFO L273 TraceCheckUtils]: 15: Hoare triple {2654#(and (= 2 main_~j~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~j~0 >= 1); {2654#(and (= 2 main_~j~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:11:12,011 INFO L273 TraceCheckUtils]: 16: Hoare triple {2654#(and (= 2 main_~j~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {2664#(and (= 2 main_~j~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:11:12,013 INFO L273 TraceCheckUtils]: 17: Hoare triple {2664#(and (= 2 main_~j~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (* (- 4) main_~j~0)))) (= |main_~#volArray~0.offset| 0))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2668#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 2) (<= main_~MINVAL~0 2) (<= main_~j~0 1) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:11:12,014 INFO L273 TraceCheckUtils]: 18: Hoare triple {2668#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 2) (<= main_~MINVAL~0 2) (<= main_~j~0 1) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume true; {2668#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 2) (<= main_~MINVAL~0 2) (<= main_~j~0 1) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:11:12,015 INFO L273 TraceCheckUtils]: 19: Hoare triple {2668#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 2) (<= main_~MINVAL~0 2) (<= main_~j~0 1) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~j~0 >= 1); {2668#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 2) (<= main_~MINVAL~0 2) (<= main_~j~0 1) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-18 23:11:12,017 INFO L273 TraceCheckUtils]: 20: Hoare triple {2668#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 12 main_~i~0) (- 8))) 2) (<= main_~MINVAL~0 2) (<= main_~j~0 1) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (3 * ~i~0 - ~j~0), 4); {2678#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} is VALID [2018-11-18 23:11:12,018 INFO L273 TraceCheckUtils]: 21: Hoare triple {2678#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2678#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} is VALID [2018-11-18 23:11:12,019 INFO L273 TraceCheckUtils]: 22: Hoare triple {2678#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} assume true; {2678#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} is VALID [2018-11-18 23:11:12,021 INFO L273 TraceCheckUtils]: 23: Hoare triple {2678#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} assume !(~j~0 >= 1); {2678#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} is VALID [2018-11-18 23:11:12,022 INFO L273 TraceCheckUtils]: 24: Hoare triple {2678#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2678#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} is VALID [2018-11-18 23:11:12,042 INFO L273 TraceCheckUtils]: 25: Hoare triple {2678#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} assume true; {2678#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} is VALID [2018-11-18 23:11:12,045 INFO L273 TraceCheckUtils]: 26: Hoare triple {2678#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 3 then 1 + ~CELLCOUNT~0 / 3 else ~CELLCOUNT~0 / 3)); {2678#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} is VALID [2018-11-18 23:11:12,046 INFO L273 TraceCheckUtils]: 27: Hoare triple {2678#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} ~i~0 := 0; {2700#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} is VALID [2018-11-18 23:11:12,047 INFO L273 TraceCheckUtils]: 28: Hoare triple {2700#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} assume true; {2700#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} is VALID [2018-11-18 23:11:12,048 INFO L273 TraceCheckUtils]: 29: Hoare triple {2700#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {2700#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} is VALID [2018-11-18 23:11:12,050 INFO L273 TraceCheckUtils]: 30: Hoare triple {2700#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} assume #t~short7; {2700#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} is VALID [2018-11-18 23:11:12,053 INFO L256 TraceCheckUtils]: 31: Hoare triple {2700#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2713#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (= 2 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (<= main_~j~0 1) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) main_~j~0) 12)))))} is VALID [2018-11-18 23:11:12,053 INFO L273 TraceCheckUtils]: 32: Hoare triple {2713#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (= 2 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (<= main_~j~0 1) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) main_~j~0) 12)))))} ~cond := #in~cond; {2713#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (= 2 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (<= main_~j~0 1) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) main_~j~0) 12)))))} is VALID [2018-11-18 23:11:12,054 INFO L273 TraceCheckUtils]: 33: Hoare triple {2713#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (= 2 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (<= main_~j~0 1) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) main_~j~0) 12)))))} assume !(0 == ~cond); {2713#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (= 2 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (<= main_~j~0 1) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) main_~j~0) 12)))))} is VALID [2018-11-18 23:11:12,055 INFO L273 TraceCheckUtils]: 34: Hoare triple {2713#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (= 2 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (<= main_~j~0 1) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) main_~j~0) 12)))))} assume true; {2713#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (= 2 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (<= main_~j~0 1) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) main_~j~0) 12)))))} is VALID [2018-11-18 23:11:12,056 INFO L268 TraceCheckUtils]: 35: Hoare quadruple {2713#(exists ((main_~j~0 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_1| Int)) (and (= 2 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) 4)) (<= main_~j~0 1) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ (* (- 4) main_~j~0) 12)))))} {2700#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} #90#return; {2700#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} is VALID [2018-11-18 23:11:12,064 INFO L273 TraceCheckUtils]: 36: Hoare triple {2700#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} havoc #t~mem6;havoc #t~short7;havoc #t~mem5; {2700#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} is VALID [2018-11-18 23:11:12,065 INFO L273 TraceCheckUtils]: 37: Hoare triple {2700#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2732#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} is VALID [2018-11-18 23:11:12,066 INFO L273 TraceCheckUtils]: 38: Hoare triple {2732#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} assume true; {2732#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} is VALID [2018-11-18 23:11:12,067 INFO L273 TraceCheckUtils]: 39: Hoare triple {2732#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 12)) 0))))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {2608#|main_#t~short7|} is VALID [2018-11-18 23:11:12,067 INFO L273 TraceCheckUtils]: 40: Hoare triple {2608#|main_#t~short7|} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {2596#false} is VALID [2018-11-18 23:11:12,068 INFO L256 TraceCheckUtils]: 41: Hoare triple {2596#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2596#false} is VALID [2018-11-18 23:11:12,068 INFO L273 TraceCheckUtils]: 42: Hoare triple {2596#false} ~cond := #in~cond; {2596#false} is VALID [2018-11-18 23:11:12,068 INFO L273 TraceCheckUtils]: 43: Hoare triple {2596#false} assume 0 == ~cond; {2596#false} is VALID [2018-11-18 23:11:12,068 INFO L273 TraceCheckUtils]: 44: Hoare triple {2596#false} assume !false; {2596#false} is VALID [2018-11-18 23:11:12,081 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 3 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:11:12,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 23:11:12,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 24 [2018-11-18 23:11:12,102 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2018-11-18 23:11:12,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:11:12,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-18 23:11:12,222 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-18 23:11:12,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-18 23:11:12,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-18 23:11:12,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=467, Unknown=0, NotChecked=0, Total=552 [2018-11-18 23:11:12,224 INFO L87 Difference]: Start difference. First operand 77 states and 87 transitions. Second operand 24 states. [2018-11-18 23:11:16,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:11:16,796 INFO L93 Difference]: Finished difference Result 218 states and 253 transitions. [2018-11-18 23:11:16,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-18 23:11:16,796 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2018-11-18 23:11:16,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:11:16,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 23:11:16,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 140 transitions. [2018-11-18 23:11:16,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 23:11:16,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 140 transitions. [2018-11-18 23:11:16,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 140 transitions. [2018-11-18 23:11:17,022 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:11:17,026 INFO L225 Difference]: With dead ends: 218 [2018-11-18 23:11:17,026 INFO L226 Difference]: Without dead ends: 158 [2018-11-18 23:11:17,028 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 401 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=318, Invalid=1404, Unknown=0, NotChecked=0, Total=1722 [2018-11-18 23:11:17,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-11-18 23:11:17,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 112. [2018-11-18 23:11:17,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:11:17,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand 112 states. [2018-11-18 23:11:17,408 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 112 states. [2018-11-18 23:11:17,408 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 112 states. [2018-11-18 23:11:17,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:11:17,415 INFO L93 Difference]: Finished difference Result 158 states and 182 transitions. [2018-11-18 23:11:17,415 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 182 transitions. [2018-11-18 23:11:17,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:11:17,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:11:17,416 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 158 states. [2018-11-18 23:11:17,416 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 158 states. [2018-11-18 23:11:17,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:11:17,422 INFO L93 Difference]: Finished difference Result 158 states and 182 transitions. [2018-11-18 23:11:17,422 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 182 transitions. [2018-11-18 23:11:17,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:11:17,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:11:17,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:11:17,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:11:17,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-11-18 23:11:17,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 127 transitions. [2018-11-18 23:11:17,427 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 127 transitions. Word has length 45 [2018-11-18 23:11:17,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:11:17,428 INFO L480 AbstractCegarLoop]: Abstraction has 112 states and 127 transitions. [2018-11-18 23:11:17,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-18 23:11:17,428 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 127 transitions. [2018-11-18 23:11:17,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-18 23:11:17,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:11:17,429 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 6, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:11:17,429 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:11:17,429 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:11:17,429 INFO L82 PathProgramCache]: Analyzing trace with hash -382577166, now seen corresponding path program 2 times [2018-11-18 23:11:17,429 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:11:17,430 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:11:17,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:11:17,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:11:17,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:11:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:11:18,255 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-18 23:11:18,260 INFO L168 Benchmark]: Toolchain (without parser) took 33863.96 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.1 GB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -325.4 MB). Peak memory consumption was 754.1 MB. Max. memory is 7.1 GB. [2018-11-18 23:11:18,261 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 23:11:18,261 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.67 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-18 23:11:18,262 INFO L168 Benchmark]: Boogie Preprocessor took 75.86 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-18 23:11:18,262 INFO L168 Benchmark]: RCFGBuilder took 804.83 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -739.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. [2018-11-18 23:11:18,263 INFO L168 Benchmark]: TraceAbstraction took 32595.27 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 373.3 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 403.6 MB). Peak memory consumption was 776.9 MB. Max. memory is 7.1 GB. [2018-11-18 23:11:18,266 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 382.67 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 75.86 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 804.83 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 706.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -739.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32595.27 ms. Allocated memory was 2.2 GB in the beginning and 2.6 GB in the end (delta: 373.3 MB). Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 403.6 MB). Peak memory consumption was 776.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:87) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...