java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-tiling/nr2_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:19:08,731 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:19:08,733 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:19:08,746 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:19:08,746 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:19:08,747 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:19:08,748 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:19:08,750 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:19:08,752 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:19:08,753 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:19:08,754 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:19:08,754 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:19:08,755 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:19:08,756 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:19:08,757 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:19:08,758 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:19:08,759 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:19:08,761 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:19:08,763 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:19:08,765 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:19:08,766 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:19:08,767 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:19:08,770 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:19:08,770 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:19:08,770 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:19:08,772 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:19:08,773 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:19:08,773 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:19:08,774 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:19:08,775 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:19:08,776 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:19:08,776 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:19:08,777 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:19:08,778 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:19:08,779 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:19:08,783 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:19:08,783 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:19:08,811 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:19:08,811 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:19:08,815 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:19:08,815 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:19:08,816 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:19:08,816 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:19:08,816 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:19:08,817 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:19:08,817 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:19:08,817 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:19:08,817 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:19:08,817 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:19:08,818 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:19:08,818 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:19:08,818 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:19:08,818 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:19:08,818 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:19:08,818 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:19:08,819 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:19:08,819 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:19:08,819 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:19:08,819 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:19:08,819 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:19:08,820 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:19:08,820 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:19:08,820 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:19:08,820 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:19:08,820 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:19:08,821 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:19:08,821 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:19:08,821 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:19:08,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:19:08,889 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:19:08,893 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:19:08,894 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:19:08,895 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:19:08,895 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/nr2_true-unreach-call.i [2018-11-23 12:19:08,952 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbbb2422a/8bc07dbb8c3b44fa90ac89182b1a8afc/FLAG23ea4ec58 [2018-11-23 12:19:09,389 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:19:09,389 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/nr2_true-unreach-call.i [2018-11-23 12:19:09,395 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbbb2422a/8bc07dbb8c3b44fa90ac89182b1a8afc/FLAG23ea4ec58 [2018-11-23 12:19:09,755 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fbbb2422a/8bc07dbb8c3b44fa90ac89182b1a8afc [2018-11-23 12:19:09,766 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:19:09,767 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:19:09,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:19:09,769 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:19:09,772 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:19:09,774 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:19:09" (1/1) ... [2018-11-23 12:19:09,777 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cbf4d36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:09, skipping insertion in model container [2018-11-23 12:19:09,777 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:19:09" (1/1) ... [2018-11-23 12:19:09,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:19:09,812 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:19:10,066 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:19:10,072 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:19:10,104 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:19:10,127 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:19:10,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:10 WrapperNode [2018-11-23 12:19:10,128 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:19:10,129 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:19:10,129 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:19:10,129 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:19:10,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:10" (1/1) ... [2018-11-23 12:19:10,146 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:10" (1/1) ... [2018-11-23 12:19:10,154 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:19:10,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:19:10,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:19:10,154 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:19:10,162 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:10" (1/1) ... [2018-11-23 12:19:10,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:10" (1/1) ... [2018-11-23 12:19:10,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:10" (1/1) ... [2018-11-23 12:19:10,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:10" (1/1) ... [2018-11-23 12:19:10,176 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:10" (1/1) ... [2018-11-23 12:19:10,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:10" (1/1) ... [2018-11-23 12:19:10,186 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:10" (1/1) ... [2018-11-23 12:19:10,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:19:10,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:19:10,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:19:10,189 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:19:10,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:19:10,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:19:10,326 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:19:10,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:19:10,327 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:19:10,327 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:19:10,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:19:10,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:19:10,327 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:19:10,328 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:19:10,328 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:19:10,328 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:19:10,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:19:11,007 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:19:11,011 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 12:19:11,011 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:19:11 BoogieIcfgContainer [2018-11-23 12:19:11,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:19:11,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:19:11,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:19:11,016 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:19:11,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:19:09" (1/3) ... [2018-11-23 12:19:11,017 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71153649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:19:11, skipping insertion in model container [2018-11-23 12:19:11,017 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:19:10" (2/3) ... [2018-11-23 12:19:11,018 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71153649 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:19:11, skipping insertion in model container [2018-11-23 12:19:11,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:19:11" (3/3) ... [2018-11-23 12:19:11,020 INFO L112 eAbstractionObserver]: Analyzing ICFG nr2_true-unreach-call.i [2018-11-23 12:19:11,028 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:19:11,035 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:19:11,052 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:19:11,089 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:19:11,090 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:19:11,090 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:19:11,091 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:19:11,092 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:19:11,092 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:19:11,092 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:19:11,092 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:19:11,093 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:19:11,111 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 12:19:11,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:19:11,118 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:11,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:11,120 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:11,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:11,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1453831941, now seen corresponding path program 1 times [2018-11-23 12:19:11,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:11,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:11,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:11,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:11,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:11,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:11,707 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 12:19:11,711 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {34#true} is VALID [2018-11-23 12:19:11,712 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 12:19:11,712 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #83#return; {34#true} is VALID [2018-11-23 12:19:11,712 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret8 := main(); {34#true} is VALID [2018-11-23 12:19:11,713 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {34#true} is VALID [2018-11-23 12:19:11,713 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {34#true} is VALID [2018-11-23 12:19:11,713 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) then 1 else 0);~i~0 := 1; {34#true} is VALID [2018-11-23 12:19:11,714 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#true} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {34#true} is VALID [2018-11-23 12:19:11,714 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#true} ~i~0 := 0; {34#true} is VALID [2018-11-23 12:19:11,714 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#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; {34#true} is VALID [2018-11-23 12:19:11,721 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#true} assume #t~short7; {36#|main_#t~short7|} is VALID [2018-11-23 12:19:11,723 INFO L256 TraceCheckUtils]: 12: Hoare triple {36#|main_#t~short7|} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {37#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:19:11,724 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {38#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:19:11,726 INFO L273 TraceCheckUtils]: 14: Hoare triple {38#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {35#false} is VALID [2018-11-23 12:19:11,726 INFO L273 TraceCheckUtils]: 15: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 12:19:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:11,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:19:11,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:19:11,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 12:19:11,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:11,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:19:11,838 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:11,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:19:11,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:19:11,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:19:11,849 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 5 states. [2018-11-23 12:19:12,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:12,398 INFO L93 Difference]: Finished difference Result 60 states and 81 transitions. [2018-11-23 12:19:12,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:19:12,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-23 12:19:12,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:12,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:19:12,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2018-11-23 12:19:12,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:19:12,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2018-11-23 12:19:12,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 81 transitions. [2018-11-23 12:19:12,897 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:12,910 INFO L225 Difference]: With dead ends: 60 [2018-11-23 12:19:12,910 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:19:12,914 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:19:12,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:19:13,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-11-23 12:19:13,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:13,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2018-11-23 12:19:13,106 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2018-11-23 12:19:13,106 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2018-11-23 12:19:13,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:13,113 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 12:19:13,114 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:19:13,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:13,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:13,116 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2018-11-23 12:19:13,116 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2018-11-23 12:19:13,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:13,125 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 12:19:13,126 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:19:13,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:13,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:13,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:13,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:13,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 12:19:13,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-23 12:19:13,136 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16 [2018-11-23 12:19:13,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:13,137 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-23 12:19:13,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:19:13,137 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-23 12:19:13,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:19:13,138 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:13,139 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:13,139 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:13,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:13,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1455678983, now seen corresponding path program 1 times [2018-11-23 12:19:13,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:13,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:13,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:13,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:13,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:13,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:13,380 INFO L256 TraceCheckUtils]: 0: Hoare triple {222#true} call ULTIMATE.init(); {222#true} is VALID [2018-11-23 12:19:13,381 INFO L273 TraceCheckUtils]: 1: Hoare triple {222#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {222#true} is VALID [2018-11-23 12:19:13,381 INFO L273 TraceCheckUtils]: 2: Hoare triple {222#true} assume true; {222#true} is VALID [2018-11-23 12:19:13,381 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {222#true} {222#true} #83#return; {222#true} is VALID [2018-11-23 12:19:13,382 INFO L256 TraceCheckUtils]: 4: Hoare triple {222#true} call #t~ret8 := main(); {222#true} is VALID [2018-11-23 12:19:13,382 INFO L273 TraceCheckUtils]: 5: Hoare triple {222#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {222#true} is VALID [2018-11-23 12:19:13,383 INFO L273 TraceCheckUtils]: 6: Hoare triple {222#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {224#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-23 12:19:13,385 INFO L273 TraceCheckUtils]: 7: Hoare triple {224#(<= 2 ~CELLCOUNT~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) then 1 else 0);~i~0 := 1; {225#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-23 12:19:13,387 INFO L273 TraceCheckUtils]: 8: Hoare triple {225#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {223#false} is VALID [2018-11-23 12:19:13,387 INFO L273 TraceCheckUtils]: 9: Hoare triple {223#false} ~i~0 := 0; {223#false} is VALID [2018-11-23 12:19:13,387 INFO L273 TraceCheckUtils]: 10: Hoare triple {223#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; {223#false} is VALID [2018-11-23 12:19:13,387 INFO L273 TraceCheckUtils]: 11: Hoare triple {223#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {223#false} is VALID [2018-11-23 12:19:13,388 INFO L256 TraceCheckUtils]: 12: Hoare triple {223#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {223#false} is VALID [2018-11-23 12:19:13,388 INFO L273 TraceCheckUtils]: 13: Hoare triple {223#false} ~cond := #in~cond; {223#false} is VALID [2018-11-23 12:19:13,388 INFO L273 TraceCheckUtils]: 14: Hoare triple {223#false} assume 0 == ~cond; {223#false} is VALID [2018-11-23 12:19:13,389 INFO L273 TraceCheckUtils]: 15: Hoare triple {223#false} assume !false; {223#false} is VALID [2018-11-23 12:19:13,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:13,391 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:19:13,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:19:13,394 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 12:19:13,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:13,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:19:13,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:13,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:19:13,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:19:13,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:19:13,435 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 4 states. [2018-11-23 12:19:13,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:13,720 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2018-11-23 12:19:13,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:19:13,720 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 12:19:13,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:13,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:19:13,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2018-11-23 12:19:13,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:19:13,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2018-11-23 12:19:13,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2018-11-23 12:19:13,867 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:13,870 INFO L225 Difference]: With dead ends: 52 [2018-11-23 12:19:13,870 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 12:19:13,871 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:19:13,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 12:19:13,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-11-23 12:19:13,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:13,909 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 31 states. [2018-11-23 12:19:13,910 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 31 states. [2018-11-23 12:19:13,910 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 31 states. [2018-11-23 12:19:13,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:13,914 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-23 12:19:13,914 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 12:19:13,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:13,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:13,915 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 35 states. [2018-11-23 12:19:13,915 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 35 states. [2018-11-23 12:19:13,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:13,918 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-11-23 12:19:13,918 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-23 12:19:13,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:13,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:13,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:13,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:13,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:19:13,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-11-23 12:19:13,922 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 16 [2018-11-23 12:19:13,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:13,922 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-11-23 12:19:13,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:19:13,922 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-11-23 12:19:13,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:19:13,923 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:13,924 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:13,924 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:13,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:13,924 INFO L82 PathProgramCache]: Analyzing trace with hash -2089835012, now seen corresponding path program 1 times [2018-11-23 12:19:13,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:13,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:13,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:13,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:13,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:13,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:14,010 INFO L256 TraceCheckUtils]: 0: Hoare triple {411#true} call ULTIMATE.init(); {411#true} is VALID [2018-11-23 12:19:14,010 INFO L273 TraceCheckUtils]: 1: Hoare triple {411#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {411#true} is VALID [2018-11-23 12:19:14,011 INFO L273 TraceCheckUtils]: 2: Hoare triple {411#true} assume true; {411#true} is VALID [2018-11-23 12:19:14,011 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {411#true} {411#true} #83#return; {411#true} is VALID [2018-11-23 12:19:14,011 INFO L256 TraceCheckUtils]: 4: Hoare triple {411#true} call #t~ret8 := main(); {411#true} is VALID [2018-11-23 12:19:14,011 INFO L273 TraceCheckUtils]: 5: Hoare triple {411#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {411#true} is VALID [2018-11-23 12:19:14,012 INFO L273 TraceCheckUtils]: 6: Hoare triple {411#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {411#true} is VALID [2018-11-23 12:19:14,012 INFO L273 TraceCheckUtils]: 7: Hoare triple {411#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) then 1 else 0);~i~0 := 1; {411#true} is VALID [2018-11-23 12:19:14,013 INFO L273 TraceCheckUtils]: 8: Hoare triple {411#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2));~j~0 := 2; {413#(<= 2 main_~j~0)} is VALID [2018-11-23 12:19:14,018 INFO L273 TraceCheckUtils]: 9: Hoare triple {413#(<= 2 main_~j~0)} assume !(~j~0 >= 1); {412#false} is VALID [2018-11-23 12:19:14,018 INFO L273 TraceCheckUtils]: 10: Hoare triple {412#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {412#false} is VALID [2018-11-23 12:19:14,018 INFO L273 TraceCheckUtils]: 11: Hoare triple {412#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {412#false} is VALID [2018-11-23 12:19:14,019 INFO L273 TraceCheckUtils]: 12: Hoare triple {412#false} ~i~0 := 0; {412#false} is VALID [2018-11-23 12:19:14,019 INFO L273 TraceCheckUtils]: 13: Hoare triple {412#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; {412#false} is VALID [2018-11-23 12:19:14,019 INFO L273 TraceCheckUtils]: 14: Hoare triple {412#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {412#false} is VALID [2018-11-23 12:19:14,019 INFO L256 TraceCheckUtils]: 15: Hoare triple {412#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {412#false} is VALID [2018-11-23 12:19:14,020 INFO L273 TraceCheckUtils]: 16: Hoare triple {412#false} ~cond := #in~cond; {412#false} is VALID [2018-11-23 12:19:14,020 INFO L273 TraceCheckUtils]: 17: Hoare triple {412#false} assume 0 == ~cond; {412#false} is VALID [2018-11-23 12:19:14,020 INFO L273 TraceCheckUtils]: 18: Hoare triple {412#false} assume !false; {412#false} is VALID [2018-11-23 12:19:14,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:14,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:19:14,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:19:14,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:19:14,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:14,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:19:14,061 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:14,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:19:14,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:19:14,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:19:14,063 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2018-11-23 12:19:14,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:14,202 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-23 12:19:14,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:19:14,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-11-23 12:19:14,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:14,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:19:14,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:19:14,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:19:14,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 55 transitions. [2018-11-23 12:19:14,213 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 55 transitions. [2018-11-23 12:19:14,333 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:14,336 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:19:14,336 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:19:14,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:19:14,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:19:14,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-23 12:19:14,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:14,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2018-11-23 12:19:14,386 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2018-11-23 12:19:14,386 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2018-11-23 12:19:14,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:14,389 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-23 12:19:14,389 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 12:19:14,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:14,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:14,390 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2018-11-23 12:19:14,391 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2018-11-23 12:19:14,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:14,393 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-23 12:19:14,393 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 12:19:14,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:14,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:14,394 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:14,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:14,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 12:19:14,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-23 12:19:14,397 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 19 [2018-11-23 12:19:14,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:14,398 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-23 12:19:14,398 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:19:14,398 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 12:19:14,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:19:14,399 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:14,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:14,399 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:14,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:14,400 INFO L82 PathProgramCache]: Analyzing trace with hash 1382648830, now seen corresponding path program 1 times [2018-11-23 12:19:14,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:14,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:14,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:14,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:14,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:14,512 INFO L256 TraceCheckUtils]: 0: Hoare triple {605#true} call ULTIMATE.init(); {605#true} is VALID [2018-11-23 12:19:14,513 INFO L273 TraceCheckUtils]: 1: Hoare triple {605#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {605#true} is VALID [2018-11-23 12:19:14,513 INFO L273 TraceCheckUtils]: 2: Hoare triple {605#true} assume true; {605#true} is VALID [2018-11-23 12:19:14,513 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {605#true} {605#true} #83#return; {605#true} is VALID [2018-11-23 12:19:14,514 INFO L256 TraceCheckUtils]: 4: Hoare triple {605#true} call #t~ret8 := main(); {605#true} is VALID [2018-11-23 12:19:14,514 INFO L273 TraceCheckUtils]: 5: Hoare triple {605#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {605#true} is VALID [2018-11-23 12:19:14,515 INFO L273 TraceCheckUtils]: 6: Hoare triple {605#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {607#(<= main_~MINVAL~0 2)} is VALID [2018-11-23 12:19:14,518 INFO L273 TraceCheckUtils]: 7: Hoare triple {607#(<= main_~MINVAL~0 2)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) then 1 else 0);~i~0 := 1; {607#(<= main_~MINVAL~0 2)} is VALID [2018-11-23 12:19:14,520 INFO L273 TraceCheckUtils]: 8: Hoare triple {607#(<= main_~MINVAL~0 2)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2));~j~0 := 2; {608#(<= main_~MINVAL~0 main_~j~0)} is VALID [2018-11-23 12:19:14,521 INFO L273 TraceCheckUtils]: 9: Hoare triple {608#(<= main_~MINVAL~0 main_~j~0)} assume !!(~j~0 >= 1); {608#(<= main_~MINVAL~0 main_~j~0)} is VALID [2018-11-23 12:19:14,521 INFO L273 TraceCheckUtils]: 10: Hoare triple {608#(<= main_~MINVAL~0 main_~j~0)} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {606#false} is VALID [2018-11-23 12:19:14,522 INFO L273 TraceCheckUtils]: 11: Hoare triple {606#false} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {606#false} is VALID [2018-11-23 12:19:14,522 INFO L273 TraceCheckUtils]: 12: Hoare triple {606#false} assume !(~j~0 >= 1); {606#false} is VALID [2018-11-23 12:19:14,522 INFO L273 TraceCheckUtils]: 13: Hoare triple {606#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {606#false} is VALID [2018-11-23 12:19:14,522 INFO L273 TraceCheckUtils]: 14: Hoare triple {606#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {606#false} is VALID [2018-11-23 12:19:14,523 INFO L273 TraceCheckUtils]: 15: Hoare triple {606#false} ~i~0 := 0; {606#false} is VALID [2018-11-23 12:19:14,523 INFO L273 TraceCheckUtils]: 16: Hoare triple {606#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; {606#false} is VALID [2018-11-23 12:19:14,523 INFO L273 TraceCheckUtils]: 17: Hoare triple {606#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {606#false} is VALID [2018-11-23 12:19:14,524 INFO L256 TraceCheckUtils]: 18: Hoare triple {606#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {606#false} is VALID [2018-11-23 12:19:14,524 INFO L273 TraceCheckUtils]: 19: Hoare triple {606#false} ~cond := #in~cond; {606#false} is VALID [2018-11-23 12:19:14,524 INFO L273 TraceCheckUtils]: 20: Hoare triple {606#false} assume 0 == ~cond; {606#false} is VALID [2018-11-23 12:19:14,525 INFO L273 TraceCheckUtils]: 21: Hoare triple {606#false} assume !false; {606#false} is VALID [2018-11-23 12:19:14,526 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-23 12:19:14,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:19:14,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:19:14,527 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 12:19:14,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:14,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:19:14,578 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:14,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:19:14,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:19:14,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:19:14,579 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 4 states. [2018-11-23 12:19:14,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:14,735 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-11-23 12:19:14,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:19:14,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 12:19:14,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:14,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:19:14,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2018-11-23 12:19:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:19:14,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2018-11-23 12:19:14,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2018-11-23 12:19:14,826 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:14,828 INFO L225 Difference]: With dead ends: 57 [2018-11-23 12:19:14,829 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 12:19:14,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:19:14,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 12:19:14,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-11-23 12:19:14,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:14,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2018-11-23 12:19:14,879 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2018-11-23 12:19:14,879 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2018-11-23 12:19:14,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:14,882 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:19:14,882 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:19:14,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:14,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:14,883 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2018-11-23 12:19:14,884 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2018-11-23 12:19:14,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:14,886 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 12:19:14,886 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-23 12:19:14,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:14,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:14,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:14,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:14,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 12:19:14,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 12:19:14,890 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2018-11-23 12:19:14,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:14,890 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 12:19:14,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:19:14,890 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 12:19:14,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 12:19:14,891 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:14,891 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:14,892 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:14,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:14,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1124483392, now seen corresponding path program 1 times [2018-11-23 12:19:14,892 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:14,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:14,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:14,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:14,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:14,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:15,006 INFO L256 TraceCheckUtils]: 0: Hoare triple {805#true} call ULTIMATE.init(); {805#true} is VALID [2018-11-23 12:19:15,006 INFO L273 TraceCheckUtils]: 1: Hoare triple {805#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {805#true} is VALID [2018-11-23 12:19:15,007 INFO L273 TraceCheckUtils]: 2: Hoare triple {805#true} assume true; {805#true} is VALID [2018-11-23 12:19:15,007 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {805#true} {805#true} #83#return; {805#true} is VALID [2018-11-23 12:19:15,007 INFO L256 TraceCheckUtils]: 4: Hoare triple {805#true} call #t~ret8 := main(); {805#true} is VALID [2018-11-23 12:19:15,007 INFO L273 TraceCheckUtils]: 5: Hoare triple {805#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {805#true} is VALID [2018-11-23 12:19:15,008 INFO L273 TraceCheckUtils]: 6: Hoare triple {805#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {805#true} is VALID [2018-11-23 12:19:15,008 INFO L273 TraceCheckUtils]: 7: Hoare triple {805#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) then 1 else 0);~i~0 := 1; {805#true} is VALID [2018-11-23 12:19:15,009 INFO L273 TraceCheckUtils]: 8: Hoare triple {805#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2));~j~0 := 2; {807#(<= 2 main_~j~0)} is VALID [2018-11-23 12:19:15,013 INFO L273 TraceCheckUtils]: 9: Hoare triple {807#(<= 2 main_~j~0)} assume !!(~j~0 >= 1); {807#(<= 2 main_~j~0)} is VALID [2018-11-23 12:19:15,016 INFO L273 TraceCheckUtils]: 10: Hoare triple {807#(<= 2 main_~j~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {807#(<= 2 main_~j~0)} is VALID [2018-11-23 12:19:15,017 INFO L273 TraceCheckUtils]: 11: Hoare triple {807#(<= 2 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {808#(<= 1 main_~j~0)} is VALID [2018-11-23 12:19:15,017 INFO L273 TraceCheckUtils]: 12: Hoare triple {808#(<= 1 main_~j~0)} assume !(~j~0 >= 1); {806#false} is VALID [2018-11-23 12:19:15,017 INFO L273 TraceCheckUtils]: 13: Hoare triple {806#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {806#false} is VALID [2018-11-23 12:19:15,018 INFO L273 TraceCheckUtils]: 14: Hoare triple {806#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {806#false} is VALID [2018-11-23 12:19:15,018 INFO L273 TraceCheckUtils]: 15: Hoare triple {806#false} ~i~0 := 0; {806#false} is VALID [2018-11-23 12:19:15,019 INFO L273 TraceCheckUtils]: 16: Hoare triple {806#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; {806#false} is VALID [2018-11-23 12:19:15,019 INFO L273 TraceCheckUtils]: 17: Hoare triple {806#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {806#false} is VALID [2018-11-23 12:19:15,019 INFO L256 TraceCheckUtils]: 18: Hoare triple {806#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {806#false} is VALID [2018-11-23 12:19:15,019 INFO L273 TraceCheckUtils]: 19: Hoare triple {806#false} ~cond := #in~cond; {806#false} is VALID [2018-11-23 12:19:15,020 INFO L273 TraceCheckUtils]: 20: Hoare triple {806#false} assume 0 == ~cond; {806#false} is VALID [2018-11-23 12:19:15,020 INFO L273 TraceCheckUtils]: 21: Hoare triple {806#false} assume !false; {806#false} is VALID [2018-11-23 12:19:15,021 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:15,022 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:19:15,022 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:19:15,032 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:15,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:15,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:15,080 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:19:15,209 INFO L256 TraceCheckUtils]: 0: Hoare triple {805#true} call ULTIMATE.init(); {805#true} is VALID [2018-11-23 12:19:15,210 INFO L273 TraceCheckUtils]: 1: Hoare triple {805#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {805#true} is VALID [2018-11-23 12:19:15,210 INFO L273 TraceCheckUtils]: 2: Hoare triple {805#true} assume true; {805#true} is VALID [2018-11-23 12:19:15,210 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {805#true} {805#true} #83#return; {805#true} is VALID [2018-11-23 12:19:15,211 INFO L256 TraceCheckUtils]: 4: Hoare triple {805#true} call #t~ret8 := main(); {805#true} is VALID [2018-11-23 12:19:15,211 INFO L273 TraceCheckUtils]: 5: Hoare triple {805#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {805#true} is VALID [2018-11-23 12:19:15,211 INFO L273 TraceCheckUtils]: 6: Hoare triple {805#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {805#true} is VALID [2018-11-23 12:19:15,212 INFO L273 TraceCheckUtils]: 7: Hoare triple {805#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) then 1 else 0);~i~0 := 1; {805#true} is VALID [2018-11-23 12:19:15,215 INFO L273 TraceCheckUtils]: 8: Hoare triple {805#true} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2));~j~0 := 2; {807#(<= 2 main_~j~0)} is VALID [2018-11-23 12:19:15,216 INFO L273 TraceCheckUtils]: 9: Hoare triple {807#(<= 2 main_~j~0)} assume !!(~j~0 >= 1); {807#(<= 2 main_~j~0)} is VALID [2018-11-23 12:19:15,216 INFO L273 TraceCheckUtils]: 10: Hoare triple {807#(<= 2 main_~j~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {807#(<= 2 main_~j~0)} is VALID [2018-11-23 12:19:15,221 INFO L273 TraceCheckUtils]: 11: Hoare triple {807#(<= 2 main_~j~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {808#(<= 1 main_~j~0)} is VALID [2018-11-23 12:19:15,222 INFO L273 TraceCheckUtils]: 12: Hoare triple {808#(<= 1 main_~j~0)} assume !(~j~0 >= 1); {806#false} is VALID [2018-11-23 12:19:15,222 INFO L273 TraceCheckUtils]: 13: Hoare triple {806#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {806#false} is VALID [2018-11-23 12:19:15,222 INFO L273 TraceCheckUtils]: 14: Hoare triple {806#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {806#false} is VALID [2018-11-23 12:19:15,223 INFO L273 TraceCheckUtils]: 15: Hoare triple {806#false} ~i~0 := 0; {806#false} is VALID [2018-11-23 12:19:15,223 INFO L273 TraceCheckUtils]: 16: Hoare triple {806#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; {806#false} is VALID [2018-11-23 12:19:15,223 INFO L273 TraceCheckUtils]: 17: Hoare triple {806#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {806#false} is VALID [2018-11-23 12:19:15,223 INFO L256 TraceCheckUtils]: 18: Hoare triple {806#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {806#false} is VALID [2018-11-23 12:19:15,223 INFO L273 TraceCheckUtils]: 19: Hoare triple {806#false} ~cond := #in~cond; {806#false} is VALID [2018-11-23 12:19:15,224 INFO L273 TraceCheckUtils]: 20: Hoare triple {806#false} assume 0 == ~cond; {806#false} is VALID [2018-11-23 12:19:15,224 INFO L273 TraceCheckUtils]: 21: Hoare triple {806#false} assume !false; {806#false} is VALID [2018-11-23 12:19:15,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:15,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:19:15,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-23 12:19:15,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 12:19:15,246 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:15,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:19:15,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:15,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:19:15,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:19:15,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:19:15,288 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2018-11-23 12:19:15,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:15,544 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2018-11-23 12:19:15,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:19:15,544 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 12:19:15,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:15,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:19:15,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2018-11-23 12:19:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:19:15,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2018-11-23 12:19:15,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 55 transitions. [2018-11-23 12:19:15,747 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:15,749 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:19:15,749 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 12:19:15,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:19:15,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 12:19:15,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 12:19:15,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:15,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-23 12:19:15,809 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 12:19:15,810 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 12:19:15,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:15,812 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 12:19:15,812 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 12:19:15,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:15,813 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:15,813 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 12:19:15,813 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 12:19:15,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:15,815 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-23 12:19:15,815 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 12:19:15,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:15,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:15,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:15,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:15,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 12:19:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-23 12:19:15,819 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 22 [2018-11-23 12:19:15,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:15,819 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-23 12:19:15,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:19:15,819 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-23 12:19:15,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 12:19:15,820 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:15,820 INFO L402 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] [2018-11-23 12:19:15,821 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:15,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:15,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1448609222, now seen corresponding path program 1 times [2018-11-23 12:19:15,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:15,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:15,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:15,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:15,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:16,448 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 30 [2018-11-23 12:19:17,290 INFO L256 TraceCheckUtils]: 0: Hoare triple {1074#true} call ULTIMATE.init(); {1074#true} is VALID [2018-11-23 12:19:17,291 INFO L273 TraceCheckUtils]: 1: Hoare triple {1074#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1074#true} is VALID [2018-11-23 12:19:17,291 INFO L273 TraceCheckUtils]: 2: Hoare triple {1074#true} assume true; {1074#true} is VALID [2018-11-23 12:19:17,292 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1074#true} {1074#true} #83#return; {1074#true} is VALID [2018-11-23 12:19:17,292 INFO L256 TraceCheckUtils]: 4: Hoare triple {1074#true} call #t~ret8 := main(); {1074#true} is VALID [2018-11-23 12:19:17,293 INFO L273 TraceCheckUtils]: 5: Hoare triple {1074#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1074#true} is VALID [2018-11-23 12:19:17,306 INFO L273 TraceCheckUtils]: 6: Hoare triple {1074#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {1076#(and (<= 2 ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:17,308 INFO L273 TraceCheckUtils]: 7: Hoare triple {1076#(and (<= 2 ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) then 1 else 0);~i~0 := 1; {1077#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:17,309 INFO L273 TraceCheckUtils]: 8: Hoare triple {1077#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2));~j~0 := 2; {1078#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (and (<= main_~j~0 ~CELLCOUNT~0) (< (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0))) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 8 main_~i~0)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (not (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 8 main_~i~0)))) (<= main_~MINVAL~0 main_~j~0)))} is VALID [2018-11-23 12:19:17,311 INFO L273 TraceCheckUtils]: 9: Hoare triple {1078#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (and (<= main_~j~0 ~CELLCOUNT~0) (< (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0))) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 8 main_~i~0)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (not (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 8 main_~i~0)))) (<= main_~MINVAL~0 main_~j~0)))} assume !!(~j~0 >= 1); {1078#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (and (<= main_~j~0 ~CELLCOUNT~0) (< (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0))) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 8 main_~i~0)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (not (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 8 main_~i~0)))) (<= main_~MINVAL~0 main_~j~0)))} is VALID [2018-11-23 12:19:17,312 INFO L273 TraceCheckUtils]: 10: Hoare triple {1078#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (and (<= main_~j~0 ~CELLCOUNT~0) (< (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0))) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 8 main_~i~0)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (not (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 8 main_~i~0)))) (<= main_~MINVAL~0 main_~j~0)))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {1079#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (and (<= main_~j~0 ~CELLCOUNT~0) (< (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0))) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 8 main_~i~0)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (not (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 8 main_~i~0)))) (and (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))) (<= main_~MINVAL~0 main_~j~0))))} is VALID [2018-11-23 12:19:17,317 INFO L273 TraceCheckUtils]: 11: Hoare triple {1079#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (and (<= main_~j~0 ~CELLCOUNT~0) (< (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0))) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 8 main_~i~0)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (not (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 8 main_~i~0)))) (and (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))) (<= main_~MINVAL~0 main_~j~0))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1080#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0) 1) (* 4 ~CELLCOUNT~0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:17,318 INFO L273 TraceCheckUtils]: 12: Hoare triple {1080#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0) 1) (* 4 ~CELLCOUNT~0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} assume !!(~j~0 >= 1); {1080#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0) 1) (* 4 ~CELLCOUNT~0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:17,319 INFO L273 TraceCheckUtils]: 13: Hoare triple {1080#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0) 1) (* 4 ~CELLCOUNT~0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {1081#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0) 1) (* 4 ~CELLCOUNT~0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:17,320 INFO L273 TraceCheckUtils]: 14: Hoare triple {1081#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0) 1) (* 4 ~CELLCOUNT~0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1081#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0) 1) (* 4 ~CELLCOUNT~0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:17,322 INFO L273 TraceCheckUtils]: 15: Hoare triple {1081#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0) 1) (* 4 ~CELLCOUNT~0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~j~0 >= 1); {1081#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0) 1) (* 4 ~CELLCOUNT~0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:17,323 INFO L273 TraceCheckUtils]: 16: Hoare triple {1081#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (or (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0) 1) (* 4 ~CELLCOUNT~0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1082#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (+ (* 4 ~CELLCOUNT~0) 7)) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0))))} is VALID [2018-11-23 12:19:17,325 INFO L273 TraceCheckUtils]: 17: Hoare triple {1082#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= |main_~#volArray~0.offset| 0) (< 0 (+ ~CELLCOUNT~0 1)) (or (<= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (+ (* 4 ~CELLCOUNT~0) 7)) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {1083#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-23 12:19:17,326 INFO L273 TraceCheckUtils]: 18: Hoare triple {1083#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} ~i~0 := 0; {1084#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-23 12:19:17,327 INFO L273 TraceCheckUtils]: 19: Hoare triple {1084#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|))) (= main_~i~0 0))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {1085#(and |main_#t~short7| (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 12:19:17,328 INFO L273 TraceCheckUtils]: 20: Hoare triple {1085#(and |main_#t~short7| (= |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; {1075#false} is VALID [2018-11-23 12:19:17,329 INFO L256 TraceCheckUtils]: 21: Hoare triple {1075#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {1075#false} is VALID [2018-11-23 12:19:17,329 INFO L273 TraceCheckUtils]: 22: Hoare triple {1075#false} ~cond := #in~cond; {1075#false} is VALID [2018-11-23 12:19:17,329 INFO L273 TraceCheckUtils]: 23: Hoare triple {1075#false} assume 0 == ~cond; {1075#false} is VALID [2018-11-23 12:19:17,330 INFO L273 TraceCheckUtils]: 24: Hoare triple {1075#false} assume !false; {1075#false} is VALID [2018-11-23 12:19:17,336 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:17,336 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:19:17,337 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:19:17,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:17,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:17,397 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:19:17,560 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 12:19:17,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-23 12:19:17,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:19:17,576 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:17,587 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:17,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:26, output treesize:22 [2018-11-23 12:19:17,671 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 19 [2018-11-23 12:19:17,687 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:17,698 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 29 [2018-11-23 12:19:17,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 12:19:17,724 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:19:17,751 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 2 xjuncts. [2018-11-23 12:19:17,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:30, output treesize:41 [2018-11-23 12:19:17,756 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:19:17,756 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_10|, main_~j~0]. (let ((.cse0 (select |v_#memory_int_10| |main_~#volArray~0.base|))) (and (<= main_~MINVAL~0 2) (= (store |v_#memory_int_10| |main_~#volArray~0.base| (store .cse0 (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8) 0)) |#memory_int|) (= |main_~#volArray~0.offset| 0) (= (select .cse0 |main_~#volArray~0.offset|) 2))) [2018-11-23 12:19:17,757 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~j~0]. (let ((.cse3 (select |#memory_int| |main_~#volArray~0.base|))) (let ((.cse0 (<= main_~MINVAL~0 2)) (.cse1 (= |main_~#volArray~0.offset| 0)) (.cse2 (select .cse3 |main_~#volArray~0.offset|))) (or (and .cse0 .cse1 (= .cse2 0)) (and (= (select .cse3 (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0) .cse0 .cse1 (= .cse2 2))))) [2018-11-23 12:19:18,490 INFO L256 TraceCheckUtils]: 0: Hoare triple {1074#true} call ULTIMATE.init(); {1074#true} is VALID [2018-11-23 12:19:18,491 INFO L273 TraceCheckUtils]: 1: Hoare triple {1074#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1074#true} is VALID [2018-11-23 12:19:18,491 INFO L273 TraceCheckUtils]: 2: Hoare triple {1074#true} assume true; {1074#true} is VALID [2018-11-23 12:19:18,491 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1074#true} {1074#true} #83#return; {1074#true} is VALID [2018-11-23 12:19:18,492 INFO L256 TraceCheckUtils]: 4: Hoare triple {1074#true} call #t~ret8 := main(); {1074#true} is VALID [2018-11-23 12:19:18,492 INFO L273 TraceCheckUtils]: 5: Hoare triple {1074#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1074#true} is VALID [2018-11-23 12:19:18,493 INFO L273 TraceCheckUtils]: 6: Hoare triple {1074#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {1107#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:18,493 INFO L273 TraceCheckUtils]: 7: Hoare triple {1107#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) then 1 else 0);~i~0 := 1; {1111#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:18,494 INFO L273 TraceCheckUtils]: 8: Hoare triple {1111#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2));~j~0 := 2; {1115#(and (= main_~j~0 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:18,495 INFO L273 TraceCheckUtils]: 9: Hoare triple {1115#(and (= main_~j~0 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~j~0 >= 1); {1115#(and (= main_~j~0 2) (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:18,496 INFO L273 TraceCheckUtils]: 10: Hoare triple {1115#(and (= main_~j~0 2) (<= 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 * (2 * ~i~0 - ~j~0), 4); {1122#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 8))) 2))} is VALID [2018-11-23 12:19:18,497 INFO L273 TraceCheckUtils]: 11: Hoare triple {1122#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 8))) 2))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1122#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 8))) 2))} is VALID [2018-11-23 12:19:18,498 INFO L273 TraceCheckUtils]: 12: Hoare triple {1122#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 8))) 2))} assume !!(~j~0 >= 1); {1122#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 8))) 2))} is VALID [2018-11-23 12:19:18,501 INFO L273 TraceCheckUtils]: 13: Hoare triple {1122#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 8))) 2))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {1132#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2)))} is VALID [2018-11-23 12:19:18,502 INFO L273 TraceCheckUtils]: 14: Hoare triple {1132#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1132#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2)))} is VALID [2018-11-23 12:19:18,502 INFO L273 TraceCheckUtils]: 15: Hoare triple {1132#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2)))} assume !(~j~0 >= 1); {1132#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2)))} is VALID [2018-11-23 12:19:18,503 INFO L273 TraceCheckUtils]: 16: Hoare triple {1132#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1132#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2)))} is VALID [2018-11-23 12:19:18,503 INFO L273 TraceCheckUtils]: 17: Hoare triple {1132#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {1132#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2)))} is VALID [2018-11-23 12:19:18,505 INFO L273 TraceCheckUtils]: 18: Hoare triple {1132#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2)))} ~i~0 := 0; {1148#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2) (= main_~i~0 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (= main_~i~0 0)))} is VALID [2018-11-23 12:19:18,507 INFO L273 TraceCheckUtils]: 19: Hoare triple {1148#(or (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (exists ((main_~j~0 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0)) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2) (= main_~i~0 0)) (and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (= main_~i~0 0)))} assume !!(~i~0 < ~CELLCOUNT~0);call #t~mem5 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := #t~mem5 >= ~MINVAL~0; {1152#(or (and (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (= main_~i~0 0)) (and |main_#t~short7| (exists ((v_prenex_1 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 8)) 0)) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2) (= main_~i~0 0)))} is VALID [2018-11-23 12:19:18,509 INFO L273 TraceCheckUtils]: 20: Hoare triple {1152#(or (and (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 0) (= main_~i~0 0)) (and |main_#t~short7| (exists ((v_prenex_1 Int)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_1) 8)) 0)) (= |main_~#volArray~0.offset| 0) (= (select (select |#memory_int| |main_~#volArray~0.base|) |main_~#volArray~0.offset|) 2) (= 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; {1156#|main_#t~short7|} is VALID [2018-11-23 12:19:18,510 INFO L256 TraceCheckUtils]: 21: Hoare triple {1156#|main_#t~short7|} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {1160#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:19:18,511 INFO L273 TraceCheckUtils]: 22: Hoare triple {1160#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1164#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:19:18,512 INFO L273 TraceCheckUtils]: 23: Hoare triple {1164#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1075#false} is VALID [2018-11-23 12:19:18,512 INFO L273 TraceCheckUtils]: 24: Hoare triple {1075#false} assume !false; {1075#false} is VALID [2018-11-23 12:19:18,516 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:18,536 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:19:18,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2018-11-23 12:19:18,536 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2018-11-23 12:19:18,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:18,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 12:19:18,630 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:18,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 12:19:18,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 12:19:18,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-11-23 12:19:18,632 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 22 states. [2018-11-23 12:19:20,140 WARN L180 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 41 [2018-11-23 12:19:21,566 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 36 [2018-11-23 12:19:24,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:24,614 INFO L93 Difference]: Finished difference Result 122 states and 154 transitions. [2018-11-23 12:19:24,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 12:19:24,614 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 25 [2018-11-23 12:19:24,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:24,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:19:24,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 141 transitions. [2018-11-23 12:19:24,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 12:19:24,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 141 transitions. [2018-11-23 12:19:24,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 141 transitions. [2018-11-23 12:19:24,920 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:24,923 INFO L225 Difference]: With dead ends: 122 [2018-11-23 12:19:24,923 INFO L226 Difference]: Without dead ends: 106 [2018-11-23 12:19:24,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=325, Invalid=1481, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 12:19:24,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-23 12:19:25,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 54. [2018-11-23 12:19:25,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:25,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 54 states. [2018-11-23 12:19:25,029 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 54 states. [2018-11-23 12:19:25,030 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 54 states. [2018-11-23 12:19:25,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:25,037 INFO L93 Difference]: Finished difference Result 106 states and 135 transitions. [2018-11-23 12:19:25,037 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 135 transitions. [2018-11-23 12:19:25,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:25,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:25,039 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 106 states. [2018-11-23 12:19:25,039 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 106 states. [2018-11-23 12:19:25,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:25,044 INFO L93 Difference]: Finished difference Result 106 states and 135 transitions. [2018-11-23 12:19:25,044 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 135 transitions. [2018-11-23 12:19:25,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:25,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:25,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:25,046 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:25,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:19:25,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 63 transitions. [2018-11-23 12:19:25,048 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 63 transitions. Word has length 25 [2018-11-23 12:19:25,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:25,048 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 63 transitions. [2018-11-23 12:19:25,048 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 12:19:25,048 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 63 transitions. [2018-11-23 12:19:25,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:19:25,049 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:25,049 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:25,050 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:25,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:25,050 INFO L82 PathProgramCache]: Analyzing trace with hash -2033734151, now seen corresponding path program 1 times [2018-11-23 12:19:25,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:25,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:25,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:25,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:25,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:25,673 INFO L256 TraceCheckUtils]: 0: Hoare triple {1668#true} call ULTIMATE.init(); {1668#true} is VALID [2018-11-23 12:19:25,674 INFO L273 TraceCheckUtils]: 1: Hoare triple {1668#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1668#true} is VALID [2018-11-23 12:19:25,674 INFO L273 TraceCheckUtils]: 2: Hoare triple {1668#true} assume true; {1668#true} is VALID [2018-11-23 12:19:25,674 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1668#true} {1668#true} #83#return; {1668#true} is VALID [2018-11-23 12:19:25,674 INFO L256 TraceCheckUtils]: 4: Hoare triple {1668#true} call #t~ret8 := main(); {1668#true} is VALID [2018-11-23 12:19:25,675 INFO L273 TraceCheckUtils]: 5: Hoare triple {1668#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1668#true} is VALID [2018-11-23 12:19:25,675 INFO L273 TraceCheckUtils]: 6: Hoare triple {1668#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {1670#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-23 12:19:25,676 INFO L273 TraceCheckUtils]: 7: Hoare triple {1670#(<= 2 ~CELLCOUNT~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) then 1 else 0);~i~0 := 1; {1671#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-23 12:19:25,677 INFO L273 TraceCheckUtils]: 8: Hoare triple {1671#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2));~j~0 := 2; {1671#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-23 12:19:25,678 INFO L273 TraceCheckUtils]: 9: Hoare triple {1671#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} assume !!(~j~0 >= 1); {1671#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-23 12:19:25,678 INFO L273 TraceCheckUtils]: 10: Hoare triple {1671#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {1671#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-23 12:19:25,679 INFO L273 TraceCheckUtils]: 11: Hoare triple {1671#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1671#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} is VALID [2018-11-23 12:19:25,680 INFO L273 TraceCheckUtils]: 12: Hoare triple {1671#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1))} assume !!(~j~0 >= 1); {1672#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (<= 1 main_~j~0) (= main_~i~0 1))} is VALID [2018-11-23 12:19:25,682 INFO L273 TraceCheckUtils]: 13: Hoare triple {1672#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (<= 1 main_~j~0) (= main_~i~0 1))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {1673#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (<= 1 main_~j~0) (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))))} is VALID [2018-11-23 12:19:25,684 INFO L273 TraceCheckUtils]: 14: Hoare triple {1673#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (<= 1 main_~j~0) (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1674#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= main_~i~0 1) (<= 2 (+ main_~j~0 ~CELLCOUNT~0)) (or (<= 3 (+ main_~j~0 ~CELLCOUNT~0)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 1)) (+ |main_~#volArray~0.offset| (* 8 main_~i~0)))))) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:19:25,685 INFO L273 TraceCheckUtils]: 15: Hoare triple {1674#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= main_~i~0 1) (<= 2 (+ main_~j~0 ~CELLCOUNT~0)) (or (<= 3 (+ main_~j~0 ~CELLCOUNT~0)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 1)) (+ |main_~#volArray~0.offset| (* 8 main_~i~0)))))) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~j~0 >= 1); {1675#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (or (<= 3 ~CELLCOUNT~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 1)) (+ |main_~#volArray~0.offset| (* 8 main_~i~0)))))))} is VALID [2018-11-23 12:19:25,687 INFO L273 TraceCheckUtils]: 16: Hoare triple {1675#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= 2 ~CELLCOUNT~0) (= main_~i~0 1) (or (<= 3 ~CELLCOUNT~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 1)) (+ |main_~#volArray~0.offset| (* 8 main_~i~0)))))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1676#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (< 0 (+ ~CELLCOUNT~0 1)) (or (<= (* 2 main_~i~0) (+ ~CELLCOUNT~0 1)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))) (<= (* 2 main_~i~0) (+ ~CELLCOUNT~0 2)))} is VALID [2018-11-23 12:19:25,689 INFO L273 TraceCheckUtils]: 17: Hoare triple {1676#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (< 0 (+ ~CELLCOUNT~0 1)) (or (<= (* 2 main_~i~0) (+ ~CELLCOUNT~0 1)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))) (<= (* 2 main_~i~0) (+ ~CELLCOUNT~0 2)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {1677#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-23 12:19:25,690 INFO L273 TraceCheckUtils]: 18: Hoare triple {1677#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} ~i~0 := 0; {1678#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-23 12:19:25,700 INFO L273 TraceCheckUtils]: 19: Hoare triple {1678#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= 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; {1678#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-23 12:19:25,701 INFO L273 TraceCheckUtils]: 20: Hoare triple {1678#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} assume #t~short7; {1678#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-23 12:19:25,701 INFO L256 TraceCheckUtils]: 21: Hoare triple {1678#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {1668#true} is VALID [2018-11-23 12:19:25,701 INFO L273 TraceCheckUtils]: 22: Hoare triple {1668#true} ~cond := #in~cond; {1668#true} is VALID [2018-11-23 12:19:25,701 INFO L273 TraceCheckUtils]: 23: Hoare triple {1668#true} assume !(0 == ~cond); {1668#true} is VALID [2018-11-23 12:19:25,702 INFO L273 TraceCheckUtils]: 24: Hoare triple {1668#true} assume true; {1668#true} is VALID [2018-11-23 12:19:25,703 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1668#true} {1678#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} #87#return; {1678#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-23 12:19:25,704 INFO L273 TraceCheckUtils]: 26: Hoare triple {1678#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} havoc #t~short7;havoc #t~mem6;havoc #t~mem5; {1678#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-23 12:19:25,706 INFO L273 TraceCheckUtils]: 27: Hoare triple {1678#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1679#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-23 12:19:25,706 INFO L273 TraceCheckUtils]: 28: Hoare triple {1679#(= 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; {1679#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-23 12:19:25,708 INFO L273 TraceCheckUtils]: 29: Hoare triple {1679#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {1680#|main_#t~short7|} is VALID [2018-11-23 12:19:25,709 INFO L256 TraceCheckUtils]: 30: Hoare triple {1680#|main_#t~short7|} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {1681#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:19:25,710 INFO L273 TraceCheckUtils]: 31: Hoare triple {1681#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1682#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:19:25,710 INFO L273 TraceCheckUtils]: 32: Hoare triple {1682#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1669#false} is VALID [2018-11-23 12:19:25,711 INFO L273 TraceCheckUtils]: 33: Hoare triple {1669#false} assume !false; {1669#false} is VALID [2018-11-23 12:19:25,717 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 12:19:25,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:19:25,718 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:19:25,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:25,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:25,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:25,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:19:25,917 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 12:19:25,921 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-23 12:19:25,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:19:25,929 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:25,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 12:19:25,938 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2018-11-23 12:19:25,941 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:19:25,942 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_11|, main_~j~0]. (and (= (store |v_#memory_int_11| |main_~#volArray~0.base| (store (select |v_#memory_int_11| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8) 0)) |#memory_int|) (<= main_~j~0 1) (<= 1 main_~j~0)) [2018-11-23 12:19:25,942 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~j~0]. (and (<= main_~j~0 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0) (<= 1 main_~j~0)) [2018-11-23 12:19:28,724 INFO L256 TraceCheckUtils]: 0: Hoare triple {1668#true} call ULTIMATE.init(); {1668#true} is VALID [2018-11-23 12:19:28,724 INFO L273 TraceCheckUtils]: 1: Hoare triple {1668#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {1668#true} is VALID [2018-11-23 12:19:28,725 INFO L273 TraceCheckUtils]: 2: Hoare triple {1668#true} assume true; {1668#true} is VALID [2018-11-23 12:19:28,725 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1668#true} {1668#true} #83#return; {1668#true} is VALID [2018-11-23 12:19:28,726 INFO L256 TraceCheckUtils]: 4: Hoare triple {1668#true} call #t~ret8 := main(); {1668#true} is VALID [2018-11-23 12:19:28,726 INFO L273 TraceCheckUtils]: 5: Hoare triple {1668#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {1668#true} is VALID [2018-11-23 12:19:28,726 INFO L273 TraceCheckUtils]: 6: Hoare triple {1668#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {1668#true} is VALID [2018-11-23 12:19:28,731 INFO L273 TraceCheckUtils]: 7: Hoare triple {1668#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) then 1 else 0);~i~0 := 1; {1707#(= main_~i~0 1)} is VALID [2018-11-23 12:19:28,731 INFO L273 TraceCheckUtils]: 8: Hoare triple {1707#(= main_~i~0 1)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2));~j~0 := 2; {1711#(and (= main_~i~0 1) (<= main_~j~0 2))} is VALID [2018-11-23 12:19:28,732 INFO L273 TraceCheckUtils]: 9: Hoare triple {1711#(and (= main_~i~0 1) (<= main_~j~0 2))} assume !!(~j~0 >= 1); {1711#(and (= main_~i~0 1) (<= main_~j~0 2))} is VALID [2018-11-23 12:19:28,732 INFO L273 TraceCheckUtils]: 10: Hoare triple {1711#(and (= main_~i~0 1) (<= main_~j~0 2))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {1711#(and (= main_~i~0 1) (<= main_~j~0 2))} is VALID [2018-11-23 12:19:28,733 INFO L273 TraceCheckUtils]: 11: Hoare triple {1711#(and (= main_~i~0 1) (<= main_~j~0 2))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1721#(and (<= main_~j~0 1) (= main_~i~0 1))} is VALID [2018-11-23 12:19:28,734 INFO L273 TraceCheckUtils]: 12: Hoare triple {1721#(and (<= main_~j~0 1) (= main_~i~0 1))} assume !!(~j~0 >= 1); {1725#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= main_~i~0 1))} is VALID [2018-11-23 12:19:28,734 INFO L273 TraceCheckUtils]: 13: Hoare triple {1725#(and (<= main_~j~0 1) (<= 1 main_~j~0) (= main_~i~0 1))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {1677#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-23 12:19:28,735 INFO L273 TraceCheckUtils]: 14: Hoare triple {1677#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {1677#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-23 12:19:28,736 INFO L273 TraceCheckUtils]: 15: Hoare triple {1677#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} assume !(~j~0 >= 1); {1677#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-23 12:19:28,736 INFO L273 TraceCheckUtils]: 16: Hoare triple {1677#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1677#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-23 12:19:28,737 INFO L273 TraceCheckUtils]: 17: Hoare triple {1677#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {1677#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-23 12:19:28,738 INFO L273 TraceCheckUtils]: 18: Hoare triple {1677#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} ~i~0 := 0; {1678#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-23 12:19:28,739 INFO L273 TraceCheckUtils]: 19: Hoare triple {1678#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= 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; {1678#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-23 12:19:28,740 INFO L273 TraceCheckUtils]: 20: Hoare triple {1678#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} assume #t~short7; {1678#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-23 12:19:28,743 INFO L256 TraceCheckUtils]: 21: Hoare triple {1678#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {1753#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_1| Int)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_1| 4))))} is VALID [2018-11-23 12:19:28,744 INFO L273 TraceCheckUtils]: 22: Hoare triple {1753#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_1| Int)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_1| 4))))} ~cond := #in~cond; {1753#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_1| Int)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_1| 4))))} is VALID [2018-11-23 12:19:28,744 INFO L273 TraceCheckUtils]: 23: Hoare triple {1753#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_1| Int)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_1| 4))))} assume !(0 == ~cond); {1753#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_1| Int)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_1| 4))))} is VALID [2018-11-23 12:19:28,745 INFO L273 TraceCheckUtils]: 24: Hoare triple {1753#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_1| Int)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_1| 4))))} assume true; {1753#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_1| Int)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_1| 4))))} is VALID [2018-11-23 12:19:28,746 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1753#(exists ((|v_main_~#volArray~0.base_BEFORE_CALL_1| Int) (|v_main_~#volArray~0.offset_BEFORE_CALL_1| Int)) (= 0 (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_1|) (+ |v_main_~#volArray~0.offset_BEFORE_CALL_1| 4))))} {1678#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} #87#return; {1678#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-23 12:19:28,747 INFO L273 TraceCheckUtils]: 26: Hoare triple {1678#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} havoc #t~short7;havoc #t~mem6;havoc #t~mem5; {1678#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-23 12:19:28,748 INFO L273 TraceCheckUtils]: 27: Hoare triple {1678#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1772#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))))} is VALID [2018-11-23 12:19:28,749 INFO L273 TraceCheckUtils]: 28: Hoare triple {1772#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |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; {1772#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))))} is VALID [2018-11-23 12:19:28,751 INFO L273 TraceCheckUtils]: 29: Hoare triple {1772#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))))} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {1680#|main_#t~short7|} is VALID [2018-11-23 12:19:28,752 INFO L256 TraceCheckUtils]: 30: Hoare triple {1680#|main_#t~short7|} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {1782#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:19:28,753 INFO L273 TraceCheckUtils]: 31: Hoare triple {1782#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1786#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:19:28,754 INFO L273 TraceCheckUtils]: 32: Hoare triple {1786#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1669#false} is VALID [2018-11-23 12:19:28,754 INFO L273 TraceCheckUtils]: 33: Hoare triple {1669#false} assume !false; {1669#false} is VALID [2018-11-23 12:19:28,760 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:28,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:19:28,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 23 [2018-11-23 12:19:28,780 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 34 [2018-11-23 12:19:28,781 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:28,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 12:19:28,854 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:28,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 12:19:28,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 12:19:28,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=427, Unknown=2, NotChecked=0, Total=506 [2018-11-23 12:19:28,856 INFO L87 Difference]: Start difference. First operand 54 states and 63 transitions. Second operand 23 states. [2018-11-23 12:19:39,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:39,668 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2018-11-23 12:19:39,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:19:39,669 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 34 [2018-11-23 12:19:39,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:39,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:19:39,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 99 transitions. [2018-11-23 12:19:39,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:19:39,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 99 transitions. [2018-11-23 12:19:39,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 99 transitions. [2018-11-23 12:19:39,825 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:39,829 INFO L225 Difference]: With dead ends: 105 [2018-11-23 12:19:39,829 INFO L226 Difference]: Without dead ends: 103 [2018-11-23 12:19:39,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=299, Invalid=1591, Unknown=2, NotChecked=0, Total=1892 [2018-11-23 12:19:39,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-11-23 12:19:40,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 85. [2018-11-23 12:19:40,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:40,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand 85 states. [2018-11-23 12:19:40,099 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 85 states. [2018-11-23 12:19:40,100 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 85 states. [2018-11-23 12:19:40,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:40,104 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2018-11-23 12:19:40,104 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2018-11-23 12:19:40,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:40,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:40,105 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 103 states. [2018-11-23 12:19:40,105 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 103 states. [2018-11-23 12:19:40,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:40,110 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2018-11-23 12:19:40,110 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2018-11-23 12:19:40,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:40,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:40,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:40,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:40,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 12:19:40,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2018-11-23 12:19:40,115 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 34 [2018-11-23 12:19:40,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:40,115 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2018-11-23 12:19:40,115 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 12:19:40,115 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2018-11-23 12:19:40,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:19:40,116 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:40,116 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:40,116 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:40,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:40,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1838531319, now seen corresponding path program 1 times [2018-11-23 12:19:40,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:40,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:40,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:40,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:40,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:40,268 INFO L256 TraceCheckUtils]: 0: Hoare triple {2305#true} call ULTIMATE.init(); {2305#true} is VALID [2018-11-23 12:19:40,268 INFO L273 TraceCheckUtils]: 1: Hoare triple {2305#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2305#true} is VALID [2018-11-23 12:19:40,269 INFO L273 TraceCheckUtils]: 2: Hoare triple {2305#true} assume true; {2305#true} is VALID [2018-11-23 12:19:40,269 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2305#true} {2305#true} #83#return; {2305#true} is VALID [2018-11-23 12:19:40,269 INFO L256 TraceCheckUtils]: 4: Hoare triple {2305#true} call #t~ret8 := main(); {2305#true} is VALID [2018-11-23 12:19:40,270 INFO L273 TraceCheckUtils]: 5: Hoare triple {2305#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2305#true} is VALID [2018-11-23 12:19:40,271 INFO L273 TraceCheckUtils]: 6: Hoare triple {2305#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {2307#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:40,271 INFO L273 TraceCheckUtils]: 7: Hoare triple {2307#(<= 2 main_~MINVAL~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) then 1 else 0);~i~0 := 1; {2307#(<= 2 main_~MINVAL~0)} is VALID [2018-11-23 12:19:40,272 INFO L273 TraceCheckUtils]: 8: Hoare triple {2307#(<= 2 main_~MINVAL~0)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2));~j~0 := 2; {2308#(<= main_~j~0 main_~MINVAL~0)} is VALID [2018-11-23 12:19:40,272 INFO L273 TraceCheckUtils]: 9: Hoare triple {2308#(<= main_~j~0 main_~MINVAL~0)} assume !!(~j~0 >= 1); {2308#(<= main_~j~0 main_~MINVAL~0)} is VALID [2018-11-23 12:19:40,272 INFO L273 TraceCheckUtils]: 10: Hoare triple {2308#(<= main_~j~0 main_~MINVAL~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {2308#(<= main_~j~0 main_~MINVAL~0)} is VALID [2018-11-23 12:19:40,273 INFO L273 TraceCheckUtils]: 11: Hoare triple {2308#(<= main_~j~0 main_~MINVAL~0)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2309#(<= (+ main_~j~0 1) main_~MINVAL~0)} is VALID [2018-11-23 12:19:40,273 INFO L273 TraceCheckUtils]: 12: Hoare triple {2309#(<= (+ main_~j~0 1) main_~MINVAL~0)} assume !!(~j~0 >= 1); {2309#(<= (+ main_~j~0 1) main_~MINVAL~0)} is VALID [2018-11-23 12:19:40,274 INFO L273 TraceCheckUtils]: 13: Hoare triple {2309#(<= (+ main_~j~0 1) main_~MINVAL~0)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {2306#false} is VALID [2018-11-23 12:19:40,274 INFO L273 TraceCheckUtils]: 14: Hoare triple {2306#false} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2306#false} is VALID [2018-11-23 12:19:40,274 INFO L273 TraceCheckUtils]: 15: Hoare triple {2306#false} assume !(~j~0 >= 1); {2306#false} is VALID [2018-11-23 12:19:40,275 INFO L273 TraceCheckUtils]: 16: Hoare triple {2306#false} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2306#false} is VALID [2018-11-23 12:19:40,275 INFO L273 TraceCheckUtils]: 17: Hoare triple {2306#false} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {2306#false} is VALID [2018-11-23 12:19:40,275 INFO L273 TraceCheckUtils]: 18: Hoare triple {2306#false} ~i~0 := 0; {2306#false} is VALID [2018-11-23 12:19:40,276 INFO L273 TraceCheckUtils]: 19: Hoare triple {2306#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; {2306#false} is VALID [2018-11-23 12:19:40,276 INFO L273 TraceCheckUtils]: 20: Hoare triple {2306#false} assume #t~short7; {2306#false} is VALID [2018-11-23 12:19:40,277 INFO L256 TraceCheckUtils]: 21: Hoare triple {2306#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2305#true} is VALID [2018-11-23 12:19:40,277 INFO L273 TraceCheckUtils]: 22: Hoare triple {2305#true} ~cond := #in~cond; {2305#true} is VALID [2018-11-23 12:19:40,277 INFO L273 TraceCheckUtils]: 23: Hoare triple {2305#true} assume !(0 == ~cond); {2305#true} is VALID [2018-11-23 12:19:40,277 INFO L273 TraceCheckUtils]: 24: Hoare triple {2305#true} assume true; {2305#true} is VALID [2018-11-23 12:19:40,278 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {2305#true} {2306#false} #87#return; {2306#false} is VALID [2018-11-23 12:19:40,278 INFO L273 TraceCheckUtils]: 26: Hoare triple {2306#false} havoc #t~short7;havoc #t~mem6;havoc #t~mem5; {2306#false} is VALID [2018-11-23 12:19:40,278 INFO L273 TraceCheckUtils]: 27: Hoare triple {2306#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2306#false} is VALID [2018-11-23 12:19:40,278 INFO L273 TraceCheckUtils]: 28: Hoare triple {2306#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; {2306#false} is VALID [2018-11-23 12:19:40,278 INFO L273 TraceCheckUtils]: 29: Hoare triple {2306#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {2306#false} is VALID [2018-11-23 12:19:40,279 INFO L256 TraceCheckUtils]: 30: Hoare triple {2306#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2306#false} is VALID [2018-11-23 12:19:40,279 INFO L273 TraceCheckUtils]: 31: Hoare triple {2306#false} ~cond := #in~cond; {2306#false} is VALID [2018-11-23 12:19:40,279 INFO L273 TraceCheckUtils]: 32: Hoare triple {2306#false} assume 0 == ~cond; {2306#false} is VALID [2018-11-23 12:19:40,279 INFO L273 TraceCheckUtils]: 33: Hoare triple {2306#false} assume !false; {2306#false} is VALID [2018-11-23 12:19:40,280 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 12:19:40,281 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:19:40,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:19:40,281 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-23 12:19:40,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:40,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:19:40,355 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:40,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:19:40,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:19:40,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:19:40,356 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand 5 states. [2018-11-23 12:19:40,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:40,737 INFO L93 Difference]: Finished difference Result 148 states and 175 transitions. [2018-11-23 12:19:40,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:19:40,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-23 12:19:40,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:19:40,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:19:40,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-11-23 12:19:40,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:19:40,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 54 transitions. [2018-11-23 12:19:40,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 54 transitions. [2018-11-23 12:19:40,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:19:40,800 INFO L225 Difference]: With dead ends: 148 [2018-11-23 12:19:40,801 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 12:19:40,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:19:40,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 12:19:41,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 71. [2018-11-23 12:19:41,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:19:41,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 71 states. [2018-11-23 12:19:41,014 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 71 states. [2018-11-23 12:19:41,014 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 71 states. [2018-11-23 12:19:41,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:41,018 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2018-11-23 12:19:41,018 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2018-11-23 12:19:41,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:41,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:41,018 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 76 states. [2018-11-23 12:19:41,018 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 76 states. [2018-11-23 12:19:41,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:19:41,021 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions. [2018-11-23 12:19:41,022 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions. [2018-11-23 12:19:41,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:19:41,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:19:41,022 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:19:41,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:19:41,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 12:19:41,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 80 transitions. [2018-11-23 12:19:41,025 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 80 transitions. Word has length 34 [2018-11-23 12:19:41,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:19:41,026 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 80 transitions. [2018-11-23 12:19:41,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:19:41,026 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 80 transitions. [2018-11-23 12:19:41,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:19:41,027 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:19:41,027 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:19:41,027 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:19:41,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:19:41,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1094979737, now seen corresponding path program 2 times [2018-11-23 12:19:41,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:19:41,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:19:41,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:41,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:19:41,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:19:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:42,364 INFO L256 TraceCheckUtils]: 0: Hoare triple {2772#true} call ULTIMATE.init(); {2772#true} is VALID [2018-11-23 12:19:42,365 INFO L273 TraceCheckUtils]: 1: Hoare triple {2772#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2772#true} is VALID [2018-11-23 12:19:42,365 INFO L273 TraceCheckUtils]: 2: Hoare triple {2772#true} assume true; {2772#true} is VALID [2018-11-23 12:19:42,365 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2772#true} {2772#true} #83#return; {2772#true} is VALID [2018-11-23 12:19:42,365 INFO L256 TraceCheckUtils]: 4: Hoare triple {2772#true} call #t~ret8 := main(); {2772#true} is VALID [2018-11-23 12:19:42,366 INFO L273 TraceCheckUtils]: 5: Hoare triple {2772#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2772#true} is VALID [2018-11-23 12:19:42,367 INFO L273 TraceCheckUtils]: 6: Hoare triple {2772#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {2774#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:42,367 INFO L273 TraceCheckUtils]: 7: Hoare triple {2774#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) then 1 else 0);~i~0 := 1; {2775#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:42,368 INFO L273 TraceCheckUtils]: 8: Hoare triple {2775#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2));~j~0 := 2; {2776#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 main_~j~0) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 8 main_~i~0))))} is VALID [2018-11-23 12:19:42,368 INFO L273 TraceCheckUtils]: 9: Hoare triple {2776#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 main_~j~0) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 8 main_~i~0))))} assume !!(~j~0 >= 1); {2776#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 main_~j~0) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 8 main_~i~0))))} is VALID [2018-11-23 12:19:42,370 INFO L273 TraceCheckUtils]: 10: Hoare triple {2776#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 main_~j~0) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 8 main_~i~0))))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {2777#(and (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 main_~j~0) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 8 main_~i~0))))} is VALID [2018-11-23 12:19:42,371 INFO L273 TraceCheckUtils]: 11: Hoare triple {2777#(and (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 main_~j~0) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 8 main_~i~0))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2778#(and (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:42,372 INFO L273 TraceCheckUtils]: 12: Hoare triple {2778#(and (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~j~0 >= 1); {2778#(and (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:42,374 INFO L273 TraceCheckUtils]: 13: Hoare triple {2778#(and (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (= 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 * (2 * ~i~0 - ~j~0), 4); {2779#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-23 12:19:42,374 INFO L273 TraceCheckUtils]: 14: Hoare triple {2779#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2779#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-23 12:19:42,375 INFO L273 TraceCheckUtils]: 15: Hoare triple {2779#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} assume !(~j~0 >= 1); {2779#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-23 12:19:42,376 INFO L273 TraceCheckUtils]: 16: Hoare triple {2779#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2780#(and (<= 4 (+ (* 2 main_~i~0) (div (+ (- 0) |main_~#volArray~0.offset|) 4))) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-23 12:19:42,377 INFO L273 TraceCheckUtils]: 17: Hoare triple {2780#(and (<= 4 (+ (* 2 main_~i~0) (div (+ (- 0) |main_~#volArray~0.offset|) 4))) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2));~j~0 := 2; {2781#(and (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:42,378 INFO L273 TraceCheckUtils]: 18: Hoare triple {2781#(and (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)) (= |main_~#volArray~0.offset| 0))} assume !!(~j~0 >= 1); {2781#(and (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:42,380 INFO L273 TraceCheckUtils]: 19: Hoare triple {2781#(and (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) 0)) (= |main_~#volArray~0.offset| 0))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {2782#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} is VALID [2018-11-23 12:19:42,381 INFO L273 TraceCheckUtils]: 20: Hoare triple {2782#(and (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2783#(and (or (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:42,382 INFO L273 TraceCheckUtils]: 21: Hoare triple {2783#(and (or (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0))) (= |main_~#volArray~0.offset| 0))} assume !!(~j~0 >= 1); {2783#(and (or (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:42,384 INFO L273 TraceCheckUtils]: 22: Hoare triple {2783#(and (or (<= main_~MINVAL~0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) 0)) (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0))) (= |main_~#volArray~0.offset| 0))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {2784#(and (or (and (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0))))) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:42,385 INFO L273 TraceCheckUtils]: 23: Hoare triple {2784#(and (or (and (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 main_~j~0)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0))))) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0))) (= |main_~#volArray~0.offset| 0))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2785#(and (= |main_~#volArray~0.offset| 0) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0))))} is VALID [2018-11-23 12:19:42,386 INFO L273 TraceCheckUtils]: 24: Hoare triple {2785#(and (= |main_~#volArray~0.offset| 0) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0))))} assume !(~j~0 >= 1); {2785#(and (= |main_~#volArray~0.offset| 0) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0))))} is VALID [2018-11-23 12:19:42,387 INFO L273 TraceCheckUtils]: 25: Hoare triple {2785#(and (= |main_~#volArray~0.offset| 0) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2785#(and (= |main_~#volArray~0.offset| 0) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0))))} is VALID [2018-11-23 12:19:42,387 INFO L273 TraceCheckUtils]: 26: Hoare triple {2785#(and (= |main_~#volArray~0.offset| 0) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0))))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {2785#(and (= |main_~#volArray~0.offset| 0) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0))))} is VALID [2018-11-23 12:19:42,389 INFO L273 TraceCheckUtils]: 27: Hoare triple {2785#(and (= |main_~#volArray~0.offset| 0) (or (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) 0)) (<= main_~MINVAL~0 (select (select |#memory_int| |main_~#volArray~0.base|) 0))))} ~i~0 := 0; {2786#(and (= |main_~#volArray~0.offset| 0) (or (<= main_~MINVAL~0 (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_~i~0 0))} is VALID [2018-11-23 12:19:42,390 INFO L273 TraceCheckUtils]: 28: Hoare triple {2786#(and (= |main_~#volArray~0.offset| 0) (or (<= main_~MINVAL~0 (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_~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; {2787#(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-23 12:19:42,391 INFO L273 TraceCheckUtils]: 29: Hoare triple {2787#(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; {2788#|main_#t~short7|} is VALID [2018-11-23 12:19:42,392 INFO L256 TraceCheckUtils]: 30: Hoare triple {2788#|main_#t~short7|} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2789#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:19:42,393 INFO L273 TraceCheckUtils]: 31: Hoare triple {2789#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {2790#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:19:42,393 INFO L273 TraceCheckUtils]: 32: Hoare triple {2790#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {2773#false} is VALID [2018-11-23 12:19:42,393 INFO L273 TraceCheckUtils]: 33: Hoare triple {2773#false} assume !false; {2773#false} is VALID [2018-11-23 12:19:42,399 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:42,400 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:19:42,400 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:19:42,415 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:19:42,443 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:19:42,443 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:19:42,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:19:42,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:19:42,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 15 [2018-11-23 12:19:42,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 14 [2018-11-23 12:19:42,606 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:19:42,608 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:42,621 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:42,621 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:33 [2018-11-23 12:19:42,756 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 28 [2018-11-23 12:19:42,764 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:42,765 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:42,767 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 62 [2018-11-23 12:19:42,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:19:42,786 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:42,810 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 12:19:42,810 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:56, output treesize:52 [2018-11-23 12:19:42,816 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:19:42,816 WARN L384 uantifierElimination]: Input elimination task: ∃ [main_~j~0, |v_#memory_int_13|, v_main_~j~0_11]. (let ((.cse1 (select |v_#memory_int_13| |main_~#volArray~0.base|)) (.cse0 (* 8 main_~i~0))) (and (= (+ |main_~#volArray~0.offset| .cse0) (* 4 v_main_~j~0_11)) (= |#memory_int| (store |v_#memory_int_13| |main_~#volArray~0.base| (store .cse1 (+ |main_~#volArray~0.offset| .cse0 (* (- 4) main_~j~0)) 0))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= (+ main_~j~0 1) v_main_~j~0_11) (= v_main_~j~0_11 (select .cse1 (+ |main_~#volArray~0.offset| .cse0 (* (- 4) v_main_~j~0_11)))) (<= main_~MINVAL~0 v_main_~j~0_11))) [2018-11-23 12:19:42,816 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~j~0, v_main_~j~0_11]. (let ((.cse1 (select |#memory_int| |main_~#volArray~0.base|)) (.cse0 (* 8 main_~i~0))) (and (= (+ |main_~#volArray~0.offset| .cse0) (* 4 v_main_~j~0_11)) (= main_~i~0 1) (= 0 (select .cse1 (+ |main_~#volArray~0.offset| .cse0 (* (- 4) main_~j~0)))) (= |main_~#volArray~0.offset| 0) (<= (+ main_~j~0 1) v_main_~j~0_11) (<= main_~MINVAL~0 v_main_~j~0_11) (= v_main_~j~0_11 (select .cse1 (+ |main_~#volArray~0.offset| .cse0 (* (- 4) v_main_~j~0_11)))))) [2018-11-23 12:19:43,269 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2018-11-23 12:19:43,340 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:43,342 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:43,346 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:43,361 INFO L478 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 2 case distinctions, treesize of input 36 treesize of output 98 [2018-11-23 12:19:43,367 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 12:19:43,409 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:19:43,461 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-11-23 12:19:43,461 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:67, output treesize:119 [2018-11-23 12:19:43,473 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:19:43,473 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_14|, v_prenex_2, v_main_~j~0_11]. (let ((.cse0 (select |v_#memory_int_14| |main_~#volArray~0.base|))) (and (<= 2 main_~i~0) (= |#memory_int| (store |v_#memory_int_14| |main_~#volArray~0.base| (store .cse0 (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)) main_~j~0))) (= 0 (select .cse0 (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 8))) (= (+ |main_~#volArray~0.offset| 8) (* 4 v_main_~j~0_11)) (<= (+ v_prenex_2 1) v_main_~j~0_11) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 2) (<= main_~MINVAL~0 v_main_~j~0_11) (= v_main_~j~0_11 (select .cse0 (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_11) 8))))) [2018-11-23 12:19:43,473 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~j~0_11, v_prenex_2, v_prenex_3]. (let ((.cse5 (select |#memory_int| |main_~#volArray~0.base|))) (let ((.cse0 (= main_~j~0 (select .cse5 (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0))))) (.cse1 (<= 2 main_~i~0)) (.cse2 (+ |main_~#volArray~0.offset| 8)) (.cse3 (= |main_~#volArray~0.offset| 0)) (.cse4 (<= main_~j~0 2))) (or (and .cse0 .cse1 (= .cse2 (* 4 v_prenex_3)) .cse3 .cse4 (<= main_~MINVAL~0 v_prenex_3) (<= (+ main_~j~0 3) (+ (* 2 main_~i~0) v_prenex_3)) (= v_prenex_3 (select .cse5 (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 8)))) (and .cse0 .cse1 (= .cse2 (* 4 v_main_~j~0_11)) (<= (+ v_prenex_2 1) v_main_~j~0_11) .cse3 .cse4 (= (select .cse5 (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 8)) 0) (<= main_~MINVAL~0 v_main_~j~0_11) (= v_main_~j~0_11 (select .cse5 (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_11) 8))))))) [2018-11-23 12:19:43,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-11-23 12:19:43,822 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:43,823 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:43,825 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:43,831 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:19:43,833 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 104 [2018-11-23 12:19:43,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:19:43,862 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:19:43,903 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-11-23 12:19:43,903 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:78, output treesize:65 [2018-11-23 12:19:43,913 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:19:43,914 WARN L384 uantifierElimination]: Input elimination task: ∃ [main_~i~0, main_~j~0, |v_#memory_int_15|, v_prenex_3, v_main_~j~0_12]. (let ((.cse1 (* 8 main_~i~0)) (.cse0 (select |v_#memory_int_15| |main_~#volArray~0.base|))) (and (<= main_~MINVAL~0 v_prenex_3) (<= (+ v_main_~j~0_12 3) (+ (* 2 main_~i~0) v_prenex_3)) (<= 2 main_~i~0) (<= (+ main_~j~0 1) v_main_~j~0_12) (= v_main_~j~0_12 (select .cse0 (+ |main_~#volArray~0.offset| .cse1 (* (- 4) v_main_~j~0_12)))) (= |#memory_int| (store |v_#memory_int_15| |main_~#volArray~0.base| (store .cse0 (+ |main_~#volArray~0.offset| .cse1 (* (- 4) main_~j~0)) 0))) (<= v_main_~j~0_12 2) (= |main_~#volArray~0.offset| 0) (= (select .cse0 (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 8)) v_prenex_3) (= (+ |main_~#volArray~0.offset| 8) (* 4 v_prenex_3)))) [2018-11-23 12:19:43,914 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [main_~i~0, v_main_~j~0_12, v_prenex_3, main_~j~0]. (let ((.cse1 (* 8 main_~i~0)) (.cse0 (select |#memory_int| |main_~#volArray~0.base|))) (and (<= main_~MINVAL~0 v_prenex_3) (<= 2 main_~i~0) (= v_main_~j~0_12 (select .cse0 (+ |main_~#volArray~0.offset| .cse1 (* (- 4) v_main_~j~0_12)))) (<= (+ main_~j~0 1) v_main_~j~0_12) (<= v_main_~j~0_12 2) (= 0 (select .cse0 (+ |main_~#volArray~0.offset| .cse1 (* (- 4) main_~j~0)))) (= |main_~#volArray~0.offset| 0) (= (+ |main_~#volArray~0.offset| 8) (* 4 v_prenex_3)) (= v_prenex_3 (select .cse0 (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 8))))) [2018-11-23 12:19:44,608 INFO L256 TraceCheckUtils]: 0: Hoare triple {2772#true} call ULTIMATE.init(); {2772#true} is VALID [2018-11-23 12:19:44,609 INFO L273 TraceCheckUtils]: 1: Hoare triple {2772#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {2772#true} is VALID [2018-11-23 12:19:44,609 INFO L273 TraceCheckUtils]: 2: Hoare triple {2772#true} assume true; {2772#true} is VALID [2018-11-23 12:19:44,610 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2772#true} {2772#true} #83#return; {2772#true} is VALID [2018-11-23 12:19:44,610 INFO L256 TraceCheckUtils]: 4: Hoare triple {2772#true} call #t~ret8 := main(); {2772#true} is VALID [2018-11-23 12:19:44,610 INFO L273 TraceCheckUtils]: 5: Hoare triple {2772#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {2772#true} is VALID [2018-11-23 12:19:44,612 INFO L273 TraceCheckUtils]: 6: Hoare triple {2772#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {2774#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:44,613 INFO L273 TraceCheckUtils]: 7: Hoare triple {2774#(and (<= main_~MINVAL~0 2) (= |main_~#volArray~0.offset| 0))} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) then 1 else 0);~i~0 := 1; {2775#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:44,614 INFO L273 TraceCheckUtils]: 8: Hoare triple {2775#(and (<= main_~MINVAL~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2));~j~0 := 2; {2776#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 main_~j~0) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 8 main_~i~0))))} is VALID [2018-11-23 12:19:44,615 INFO L273 TraceCheckUtils]: 9: Hoare triple {2776#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 main_~j~0) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 8 main_~i~0))))} assume !!(~j~0 >= 1); {2776#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 main_~j~0) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 8 main_~i~0))))} is VALID [2018-11-23 12:19:44,618 INFO L273 TraceCheckUtils]: 10: Hoare triple {2776#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 main_~j~0) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 8 main_~i~0))))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {2777#(and (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 main_~j~0) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 8 main_~i~0))))} is VALID [2018-11-23 12:19:44,620 INFO L273 TraceCheckUtils]: 11: Hoare triple {2777#(and (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (<= main_~MINVAL~0 main_~j~0) (= (* 4 main_~j~0) (+ |main_~#volArray~0.offset| (* 8 main_~i~0))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2827#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_11 Int)) (and (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 v_main_~j~0_11)) (<= (+ main_~j~0 1) v_main_~j~0_11) (<= main_~MINVAL~0 v_main_~j~0_11) (= v_main_~j~0_11 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_11)))))))} is VALID [2018-11-23 12:19:44,622 INFO L273 TraceCheckUtils]: 12: Hoare triple {2827#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_11 Int)) (and (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 v_main_~j~0_11)) (<= (+ main_~j~0 1) v_main_~j~0_11) (<= main_~MINVAL~0 v_main_~j~0_11) (= v_main_~j~0_11 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_11)))))))} assume !!(~j~0 >= 1); {2827#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_11 Int)) (and (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 v_main_~j~0_11)) (<= (+ main_~j~0 1) v_main_~j~0_11) (<= main_~MINVAL~0 v_main_~j~0_11) (= v_main_~j~0_11 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_11)))))))} is VALID [2018-11-23 12:19:44,623 INFO L273 TraceCheckUtils]: 13: Hoare triple {2827#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_11 Int)) (and (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 v_main_~j~0_11)) (<= (+ main_~j~0 1) v_main_~j~0_11) (<= main_~MINVAL~0 v_main_~j~0_11) (= v_main_~j~0_11 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_11)))))))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {2834#(and (exists ((main_~j~0 Int) (v_main_~j~0_11 Int)) (and (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 v_main_~j~0_11)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)))) (<= (+ main_~j~0 1) v_main_~j~0_11) (<= main_~MINVAL~0 v_main_~j~0_11) (= v_main_~j~0_11 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_11)))))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:44,625 INFO L273 TraceCheckUtils]: 14: Hoare triple {2834#(and (exists ((main_~j~0 Int) (v_main_~j~0_11 Int)) (and (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 v_main_~j~0_11)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)))) (<= (+ main_~j~0 1) v_main_~j~0_11) (<= main_~MINVAL~0 v_main_~j~0_11) (= v_main_~j~0_11 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_11)))))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2834#(and (exists ((main_~j~0 Int) (v_main_~j~0_11 Int)) (and (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 v_main_~j~0_11)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)))) (<= (+ main_~j~0 1) v_main_~j~0_11) (<= main_~MINVAL~0 v_main_~j~0_11) (= v_main_~j~0_11 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_11)))))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:44,626 INFO L273 TraceCheckUtils]: 15: Hoare triple {2834#(and (exists ((main_~j~0 Int) (v_main_~j~0_11 Int)) (and (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 v_main_~j~0_11)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)))) (<= (+ main_~j~0 1) v_main_~j~0_11) (<= main_~MINVAL~0 v_main_~j~0_11) (= v_main_~j~0_11 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_11)))))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~j~0 >= 1); {2834#(and (exists ((main_~j~0 Int) (v_main_~j~0_11 Int)) (and (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 v_main_~j~0_11)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)))) (<= (+ main_~j~0 1) v_main_~j~0_11) (<= main_~MINVAL~0 v_main_~j~0_11) (= v_main_~j~0_11 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_11)))))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:44,629 INFO L273 TraceCheckUtils]: 16: Hoare triple {2834#(and (exists ((main_~j~0 Int) (v_main_~j~0_11 Int)) (and (= (+ |main_~#volArray~0.offset| (* 8 main_~i~0)) (* 4 v_main_~j~0_11)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)))) (<= (+ main_~j~0 1) v_main_~j~0_11) (<= main_~MINVAL~0 v_main_~j~0_11) (= v_main_~j~0_11 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_11)))))) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2844#(and (exists ((main_~j~0 Int) (v_main_~j~0_11 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0) (= (+ |main_~#volArray~0.offset| 8) (* 4 v_main_~j~0_11)) (<= (+ main_~j~0 1) v_main_~j~0_11) (<= main_~MINVAL~0 v_main_~j~0_11) (= v_main_~j~0_11 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_11) 8))))) (<= 2 main_~i~0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:44,631 INFO L273 TraceCheckUtils]: 17: Hoare triple {2844#(and (exists ((main_~j~0 Int) (v_main_~j~0_11 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) main_~j~0) 8)) 0) (= (+ |main_~#volArray~0.offset| 8) (* 4 v_main_~j~0_11)) (<= (+ main_~j~0 1) v_main_~j~0_11) (<= main_~MINVAL~0 v_main_~j~0_11) (= v_main_~j~0_11 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_11) 8))))) (<= 2 main_~i~0) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2));~j~0 := 2; {2848#(and (exists ((v_prenex_2 Int) (v_main_~j~0_11 Int)) (and (= (+ |main_~#volArray~0.offset| 8) (* 4 v_main_~j~0_11)) (<= (+ v_prenex_2 1) v_main_~j~0_11) (<= main_~MINVAL~0 v_main_~j~0_11) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 8)) 0) (= v_main_~j~0_11 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_11) 8))))) (<= 2 main_~i~0) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 2))} is VALID [2018-11-23 12:19:44,633 INFO L273 TraceCheckUtils]: 18: Hoare triple {2848#(and (exists ((v_prenex_2 Int) (v_main_~j~0_11 Int)) (and (= (+ |main_~#volArray~0.offset| 8) (* 4 v_main_~j~0_11)) (<= (+ v_prenex_2 1) v_main_~j~0_11) (<= main_~MINVAL~0 v_main_~j~0_11) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 8)) 0) (= v_main_~j~0_11 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_11) 8))))) (<= 2 main_~i~0) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 2))} assume !!(~j~0 >= 1); {2848#(and (exists ((v_prenex_2 Int) (v_main_~j~0_11 Int)) (and (= (+ |main_~#volArray~0.offset| 8) (* 4 v_main_~j~0_11)) (<= (+ v_prenex_2 1) v_main_~j~0_11) (<= main_~MINVAL~0 v_main_~j~0_11) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 8)) 0) (= v_main_~j~0_11 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_11) 8))))) (<= 2 main_~i~0) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 2))} is VALID [2018-11-23 12:19:44,653 INFO L273 TraceCheckUtils]: 19: Hoare triple {2848#(and (exists ((v_prenex_2 Int) (v_main_~j~0_11 Int)) (and (= (+ |main_~#volArray~0.offset| 8) (* 4 v_main_~j~0_11)) (<= (+ v_prenex_2 1) v_main_~j~0_11) (<= main_~MINVAL~0 v_main_~j~0_11) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_2) 8)) 0) (= v_main_~j~0_11 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_main_~j~0_11) 8))))) (<= 2 main_~i~0) (= |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 * (2 * ~i~0 - ~j~0), 4); {2855#(and (exists ((v_prenex_3 Int)) (and (<= main_~MINVAL~0 v_prenex_3) (<= (+ main_~j~0 3) (+ (* 2 main_~i~0) v_prenex_3)) (= v_prenex_3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 8))) (= (+ |main_~#volArray~0.offset| 8) (* 4 v_prenex_3)))) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)))) (<= 2 main_~i~0) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 2))} is VALID [2018-11-23 12:19:44,668 INFO L273 TraceCheckUtils]: 20: Hoare triple {2855#(and (exists ((v_prenex_3 Int)) (and (<= main_~MINVAL~0 v_prenex_3) (<= (+ main_~j~0 3) (+ (* 2 main_~i~0) v_prenex_3)) (= v_prenex_3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 8))) (= (+ |main_~#volArray~0.offset| 8) (* 4 v_prenex_3)))) (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)))) (<= 2 main_~i~0) (= |main_~#volArray~0.offset| 0) (<= main_~j~0 2))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2859#(and (<= 2 main_~i~0) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_3 Int) (v_main_~j~0_12 Int)) (and (<= main_~MINVAL~0 v_prenex_3) (<= (+ v_main_~j~0_12 3) (+ (* 2 main_~i~0) v_prenex_3)) (<= (+ main_~j~0 1) v_main_~j~0_12) (= v_main_~j~0_12 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_12)))) (<= v_main_~j~0_12 2) (= v_prenex_3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 8))) (= (+ |main_~#volArray~0.offset| 8) (* 4 v_prenex_3)))))} is VALID [2018-11-23 12:19:44,686 INFO L273 TraceCheckUtils]: 21: Hoare triple {2859#(and (<= 2 main_~i~0) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_3 Int) (v_main_~j~0_12 Int)) (and (<= main_~MINVAL~0 v_prenex_3) (<= (+ v_main_~j~0_12 3) (+ (* 2 main_~i~0) v_prenex_3)) (<= (+ main_~j~0 1) v_main_~j~0_12) (= v_main_~j~0_12 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_12)))) (<= v_main_~j~0_12 2) (= v_prenex_3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 8))) (= (+ |main_~#volArray~0.offset| 8) (* 4 v_prenex_3)))))} assume !!(~j~0 >= 1); {2859#(and (<= 2 main_~i~0) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_3 Int) (v_main_~j~0_12 Int)) (and (<= main_~MINVAL~0 v_prenex_3) (<= (+ v_main_~j~0_12 3) (+ (* 2 main_~i~0) v_prenex_3)) (<= (+ main_~j~0 1) v_main_~j~0_12) (= v_main_~j~0_12 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_12)))) (<= v_main_~j~0_12 2) (= v_prenex_3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 8))) (= (+ |main_~#volArray~0.offset| 8) (* 4 v_prenex_3)))))} is VALID [2018-11-23 12:19:44,696 INFO L273 TraceCheckUtils]: 22: Hoare triple {2859#(and (<= 2 main_~i~0) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_3 Int) (v_main_~j~0_12 Int)) (and (<= main_~MINVAL~0 v_prenex_3) (<= (+ v_main_~j~0_12 3) (+ (* 2 main_~i~0) v_prenex_3)) (<= (+ main_~j~0 1) v_main_~j~0_12) (= v_main_~j~0_12 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_12)))) (<= v_main_~j~0_12 2) (= v_prenex_3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 8))) (= (+ |main_~#volArray~0.offset| 8) (* 4 v_prenex_3)))))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {2866#(and (exists ((v_prenex_3 Int)) (and (<= main_~MINVAL~0 v_prenex_3) (= v_prenex_3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 8))) (= (+ |main_~#volArray~0.offset| 8) (* 4 v_prenex_3)))) (exists ((main_~i~0 Int) (main_~j~0 Int) (v_main_~j~0_12 Int)) (and (<= 2 main_~i~0) (<= (+ main_~j~0 1) v_main_~j~0_12) (= v_main_~j~0_12 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_12)))) (<= v_main_~j~0_12 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)))))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:44,699 INFO L273 TraceCheckUtils]: 23: Hoare triple {2866#(and (exists ((v_prenex_3 Int)) (and (<= main_~MINVAL~0 v_prenex_3) (= v_prenex_3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 8))) (= (+ |main_~#volArray~0.offset| 8) (* 4 v_prenex_3)))) (exists ((main_~i~0 Int) (main_~j~0 Int) (v_main_~j~0_12 Int)) (and (<= 2 main_~i~0) (<= (+ main_~j~0 1) v_main_~j~0_12) (= v_main_~j~0_12 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_12)))) (<= v_main_~j~0_12 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)))))) (= |main_~#volArray~0.offset| 0))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {2866#(and (exists ((v_prenex_3 Int)) (and (<= main_~MINVAL~0 v_prenex_3) (= v_prenex_3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 8))) (= (+ |main_~#volArray~0.offset| 8) (* 4 v_prenex_3)))) (exists ((main_~i~0 Int) (main_~j~0 Int) (v_main_~j~0_12 Int)) (and (<= 2 main_~i~0) (<= (+ main_~j~0 1) v_main_~j~0_12) (= v_main_~j~0_12 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_12)))) (<= v_main_~j~0_12 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)))))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:44,700 INFO L273 TraceCheckUtils]: 24: Hoare triple {2866#(and (exists ((v_prenex_3 Int)) (and (<= main_~MINVAL~0 v_prenex_3) (= v_prenex_3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 8))) (= (+ |main_~#volArray~0.offset| 8) (* 4 v_prenex_3)))) (exists ((main_~i~0 Int) (main_~j~0 Int) (v_main_~j~0_12 Int)) (and (<= 2 main_~i~0) (<= (+ main_~j~0 1) v_main_~j~0_12) (= v_main_~j~0_12 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_12)))) (<= v_main_~j~0_12 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)))))) (= |main_~#volArray~0.offset| 0))} assume !(~j~0 >= 1); {2866#(and (exists ((v_prenex_3 Int)) (and (<= main_~MINVAL~0 v_prenex_3) (= v_prenex_3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 8))) (= (+ |main_~#volArray~0.offset| 8) (* 4 v_prenex_3)))) (exists ((main_~i~0 Int) (main_~j~0 Int) (v_main_~j~0_12 Int)) (and (<= 2 main_~i~0) (<= (+ main_~j~0 1) v_main_~j~0_12) (= v_main_~j~0_12 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_12)))) (<= v_main_~j~0_12 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)))))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:44,704 INFO L273 TraceCheckUtils]: 25: Hoare triple {2866#(and (exists ((v_prenex_3 Int)) (and (<= main_~MINVAL~0 v_prenex_3) (= v_prenex_3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 8))) (= (+ |main_~#volArray~0.offset| 8) (* 4 v_prenex_3)))) (exists ((main_~i~0 Int) (main_~j~0 Int) (v_main_~j~0_12 Int)) (and (<= 2 main_~i~0) (<= (+ main_~j~0 1) v_main_~j~0_12) (= v_main_~j~0_12 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_12)))) (<= v_main_~j~0_12 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)))))) (= |main_~#volArray~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2866#(and (exists ((v_prenex_3 Int)) (and (<= main_~MINVAL~0 v_prenex_3) (= v_prenex_3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 8))) (= (+ |main_~#volArray~0.offset| 8) (* 4 v_prenex_3)))) (exists ((main_~i~0 Int) (main_~j~0 Int) (v_main_~j~0_12 Int)) (and (<= 2 main_~i~0) (<= (+ main_~j~0 1) v_main_~j~0_12) (= v_main_~j~0_12 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_12)))) (<= v_main_~j~0_12 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)))))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:44,705 INFO L273 TraceCheckUtils]: 26: Hoare triple {2866#(and (exists ((v_prenex_3 Int)) (and (<= main_~MINVAL~0 v_prenex_3) (= v_prenex_3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 8))) (= (+ |main_~#volArray~0.offset| 8) (* 4 v_prenex_3)))) (exists ((main_~i~0 Int) (main_~j~0 Int) (v_main_~j~0_12 Int)) (and (<= 2 main_~i~0) (<= (+ main_~j~0 1) v_main_~j~0_12) (= v_main_~j~0_12 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_12)))) (<= v_main_~j~0_12 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)))))) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {2866#(and (exists ((v_prenex_3 Int)) (and (<= main_~MINVAL~0 v_prenex_3) (= v_prenex_3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 8))) (= (+ |main_~#volArray~0.offset| 8) (* 4 v_prenex_3)))) (exists ((main_~i~0 Int) (main_~j~0 Int) (v_main_~j~0_12 Int)) (and (<= 2 main_~i~0) (<= (+ main_~j~0 1) v_main_~j~0_12) (= v_main_~j~0_12 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_12)))) (<= v_main_~j~0_12 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)))))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:19:44,707 INFO L273 TraceCheckUtils]: 27: Hoare triple {2866#(and (exists ((v_prenex_3 Int)) (and (<= main_~MINVAL~0 v_prenex_3) (= v_prenex_3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 8))) (= (+ |main_~#volArray~0.offset| 8) (* 4 v_prenex_3)))) (exists ((main_~i~0 Int) (main_~j~0 Int) (v_main_~j~0_12 Int)) (and (<= 2 main_~i~0) (<= (+ main_~j~0 1) v_main_~j~0_12) (= v_main_~j~0_12 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_12)))) (<= v_main_~j~0_12 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)))))) (= |main_~#volArray~0.offset| 0))} ~i~0 := 0; {2882#(and (exists ((v_prenex_3 Int)) (and (<= main_~MINVAL~0 v_prenex_3) (= v_prenex_3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 8))) (= (+ |main_~#volArray~0.offset| 8) (* 4 v_prenex_3)))) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_4 Int) (main_~j~0 Int) (v_main_~j~0_12 Int)) (and (= v_main_~j~0_12 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_4) (* (- 4) v_main_~j~0_12)))) (<= (+ main_~j~0 1) v_main_~j~0_12) (<= v_main_~j~0_12 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_4) (* (- 4) main_~j~0)))) (<= 2 v_prenex_4))) (= main_~i~0 0))} is VALID [2018-11-23 12:19:44,709 INFO L273 TraceCheckUtils]: 28: Hoare triple {2882#(and (exists ((v_prenex_3 Int)) (and (<= main_~MINVAL~0 v_prenex_3) (= v_prenex_3 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* (- 4) v_prenex_3) 8))) (= (+ |main_~#volArray~0.offset| 8) (* 4 v_prenex_3)))) (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_4 Int) (main_~j~0 Int) (v_main_~j~0_12 Int)) (and (= v_main_~j~0_12 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_4) (* (- 4) v_main_~j~0_12)))) (<= (+ main_~j~0 1) v_main_~j~0_12) (<= v_main_~j~0_12 2) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_4) (* (- 4) main_~j~0)))) (<= 2 v_prenex_4))) (= 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; {2788#|main_#t~short7|} is VALID [2018-11-23 12:19:44,710 INFO L273 TraceCheckUtils]: 29: Hoare triple {2788#|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; {2773#false} is VALID [2018-11-23 12:19:44,710 INFO L256 TraceCheckUtils]: 30: Hoare triple {2773#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {2773#false} is VALID [2018-11-23 12:19:44,711 INFO L273 TraceCheckUtils]: 31: Hoare triple {2773#false} ~cond := #in~cond; {2773#false} is VALID [2018-11-23 12:19:44,711 INFO L273 TraceCheckUtils]: 32: Hoare triple {2773#false} assume 0 == ~cond; {2773#false} is VALID [2018-11-23 12:19:44,711 INFO L273 TraceCheckUtils]: 33: Hoare triple {2773#false} assume !false; {2773#false} is VALID [2018-11-23 12:19:44,723 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:19:44,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:19:44,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 27 [2018-11-23 12:19:44,765 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2018-11-23 12:19:44,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:19:44,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 12:19:44,885 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-23 12:19:44,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 12:19:44,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 12:19:44,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=562, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:19:44,887 INFO L87 Difference]: Start difference. First operand 71 states and 80 transitions. Second operand 27 states. [2018-11-23 12:21:06,691 WARN L180 SmtUtils]: Spent 2.07 s on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2018-11-23 12:21:09,080 WARN L180 SmtUtils]: Spent 2.04 s on a formula simplification. DAG size of input: 56 DAG size of output: 45 [2018-11-23 12:21:15,923 WARN L180 SmtUtils]: Spent 2.19 s on a formula simplification. DAG size of input: 56 DAG size of output: 46 [2018-11-23 12:21:20,042 WARN L180 SmtUtils]: Spent 3.94 s on a formula simplification. DAG size of input: 57 DAG size of output: 47 [2018-11-23 12:21:21,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:21,110 INFO L93 Difference]: Finished difference Result 138 states and 164 transitions. [2018-11-23 12:21:21,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 12:21:21,110 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 34 [2018-11-23 12:21:21,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:21,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:21:21,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 120 transitions. [2018-11-23 12:21:21,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:21:21,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 120 transitions. [2018-11-23 12:21:21,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 120 transitions. [2018-11-23 12:21:21,957 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:21:21,961 INFO L225 Difference]: With dead ends: 138 [2018-11-23 12:21:21,961 INFO L226 Difference]: Without dead ends: 122 [2018-11-23 12:21:21,962 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 24.7s TimeCoverageRelationStatistics Valid=323, Invalid=1394, Unknown=5, NotChecked=0, Total=1722 [2018-11-23 12:21:21,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-11-23 12:21:22,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 73. [2018-11-23 12:21:22,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:21:22,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand 73 states. [2018-11-23 12:21:22,390 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 73 states. [2018-11-23 12:21:22,391 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 73 states. [2018-11-23 12:21:22,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:22,396 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2018-11-23 12:21:22,396 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2018-11-23 12:21:22,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:22,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:22,397 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 122 states. [2018-11-23 12:21:22,397 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 122 states. [2018-11-23 12:21:22,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:22,402 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2018-11-23 12:21:22,402 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 145 transitions. [2018-11-23 12:21:22,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:22,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:22,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:21:22,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:21:22,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 12:21:22,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2018-11-23 12:21:22,406 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 34 [2018-11-23 12:21:22,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:22,407 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2018-11-23 12:21:22,407 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 12:21:22,407 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2018-11-23 12:21:22,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 12:21:22,408 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:22,408 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:21:22,408 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:22,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:22,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1720925926, now seen corresponding path program 2 times [2018-11-23 12:21:22,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:21:22,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:21:22,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:22,410 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:21:22,410 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:23,128 WARN L180 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 13 [2018-11-23 12:21:23,216 INFO L256 TraceCheckUtils]: 0: Hoare triple {3469#true} call ULTIMATE.init(); {3469#true} is VALID [2018-11-23 12:21:23,216 INFO L273 TraceCheckUtils]: 1: Hoare triple {3469#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {3469#true} is VALID [2018-11-23 12:21:23,216 INFO L273 TraceCheckUtils]: 2: Hoare triple {3469#true} assume true; {3469#true} is VALID [2018-11-23 12:21:23,216 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3469#true} {3469#true} #83#return; {3469#true} is VALID [2018-11-23 12:21:23,217 INFO L256 TraceCheckUtils]: 4: Hoare triple {3469#true} call #t~ret8 := main(); {3469#true} is VALID [2018-11-23 12:21:23,217 INFO L273 TraceCheckUtils]: 5: Hoare triple {3469#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {3469#true} is VALID [2018-11-23 12:21:23,218 INFO L273 TraceCheckUtils]: 6: Hoare triple {3469#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {3471#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-23 12:21:23,219 INFO L273 TraceCheckUtils]: 7: Hoare triple {3471#(<= 2 ~CELLCOUNT~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) then 1 else 0);~i~0 := 1; {3472#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:21:23,220 INFO L273 TraceCheckUtils]: 8: Hoare triple {3472#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2));~j~0 := 2; {3472#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:21:23,220 INFO L273 TraceCheckUtils]: 9: Hoare triple {3472#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume !!(~j~0 >= 1); {3472#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:21:23,221 INFO L273 TraceCheckUtils]: 10: Hoare triple {3472#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {3472#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:21:23,221 INFO L273 TraceCheckUtils]: 11: Hoare triple {3472#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {3472#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:21:23,222 INFO L273 TraceCheckUtils]: 12: Hoare triple {3472#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume !!(~j~0 >= 1); {3472#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:21:23,223 INFO L273 TraceCheckUtils]: 13: Hoare triple {3472#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {3472#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:21:23,224 INFO L273 TraceCheckUtils]: 14: Hoare triple {3472#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {3472#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:21:23,225 INFO L273 TraceCheckUtils]: 15: Hoare triple {3472#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~j~0 >= 1); {3472#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:21:23,226 INFO L273 TraceCheckUtils]: 16: Hoare triple {3472#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (= main_~i~0 1) (< 0 (+ ~CELLCOUNT~0 1)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3473#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= main_~i~0 2) (< 0 (+ ~CELLCOUNT~0 1)))} is VALID [2018-11-23 12:21:23,227 INFO L273 TraceCheckUtils]: 17: Hoare triple {3473#(and (= ~CELLCOUNT~0 (* 2 (div ~CELLCOUNT~0 2))) (<= main_~i~0 2) (< 0 (+ ~CELLCOUNT~0 1)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {3474#(<= ~CELLCOUNT~0 2)} is VALID [2018-11-23 12:21:23,228 INFO L273 TraceCheckUtils]: 18: Hoare triple {3474#(<= ~CELLCOUNT~0 2)} ~i~0 := 0; {3475#(and (<= ~CELLCOUNT~0 2) (= main_~i~0 0))} is VALID [2018-11-23 12:21:23,229 INFO L273 TraceCheckUtils]: 19: Hoare triple {3475#(and (<= ~CELLCOUNT~0 2) (= 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; {3475#(and (<= ~CELLCOUNT~0 2) (= main_~i~0 0))} is VALID [2018-11-23 12:21:23,229 INFO L273 TraceCheckUtils]: 20: Hoare triple {3475#(and (<= ~CELLCOUNT~0 2) (= main_~i~0 0))} assume #t~short7; {3475#(and (<= ~CELLCOUNT~0 2) (= main_~i~0 0))} is VALID [2018-11-23 12:21:23,230 INFO L256 TraceCheckUtils]: 21: Hoare triple {3475#(and (<= ~CELLCOUNT~0 2) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {3469#true} is VALID [2018-11-23 12:21:23,230 INFO L273 TraceCheckUtils]: 22: Hoare triple {3469#true} ~cond := #in~cond; {3469#true} is VALID [2018-11-23 12:21:23,230 INFO L273 TraceCheckUtils]: 23: Hoare triple {3469#true} assume !(0 == ~cond); {3469#true} is VALID [2018-11-23 12:21:23,231 INFO L273 TraceCheckUtils]: 24: Hoare triple {3469#true} assume true; {3469#true} is VALID [2018-11-23 12:21:23,232 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {3469#true} {3475#(and (<= ~CELLCOUNT~0 2) (= main_~i~0 0))} #87#return; {3475#(and (<= ~CELLCOUNT~0 2) (= main_~i~0 0))} is VALID [2018-11-23 12:21:23,232 INFO L273 TraceCheckUtils]: 26: Hoare triple {3475#(and (<= ~CELLCOUNT~0 2) (= main_~i~0 0))} havoc #t~short7;havoc #t~mem6;havoc #t~mem5; {3475#(and (<= ~CELLCOUNT~0 2) (= main_~i~0 0))} is VALID [2018-11-23 12:21:23,233 INFO L273 TraceCheckUtils]: 27: Hoare triple {3475#(and (<= ~CELLCOUNT~0 2) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3476#(<= ~CELLCOUNT~0 (+ main_~i~0 1))} is VALID [2018-11-23 12:21:23,234 INFO L273 TraceCheckUtils]: 28: Hoare triple {3476#(<= ~CELLCOUNT~0 (+ main_~i~0 1))} 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; {3476#(<= ~CELLCOUNT~0 (+ main_~i~0 1))} is VALID [2018-11-23 12:21:23,234 INFO L273 TraceCheckUtils]: 29: Hoare triple {3476#(<= ~CELLCOUNT~0 (+ main_~i~0 1))} assume #t~short7; {3476#(<= ~CELLCOUNT~0 (+ main_~i~0 1))} is VALID [2018-11-23 12:21:23,235 INFO L256 TraceCheckUtils]: 30: Hoare triple {3476#(<= ~CELLCOUNT~0 (+ main_~i~0 1))} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {3469#true} is VALID [2018-11-23 12:21:23,235 INFO L273 TraceCheckUtils]: 31: Hoare triple {3469#true} ~cond := #in~cond; {3469#true} is VALID [2018-11-23 12:21:23,235 INFO L273 TraceCheckUtils]: 32: Hoare triple {3469#true} assume !(0 == ~cond); {3469#true} is VALID [2018-11-23 12:21:23,235 INFO L273 TraceCheckUtils]: 33: Hoare triple {3469#true} assume true; {3469#true} is VALID [2018-11-23 12:21:23,236 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3469#true} {3476#(<= ~CELLCOUNT~0 (+ main_~i~0 1))} #87#return; {3476#(<= ~CELLCOUNT~0 (+ main_~i~0 1))} is VALID [2018-11-23 12:21:23,237 INFO L273 TraceCheckUtils]: 35: Hoare triple {3476#(<= ~CELLCOUNT~0 (+ main_~i~0 1))} havoc #t~short7;havoc #t~mem6;havoc #t~mem5; {3476#(<= ~CELLCOUNT~0 (+ main_~i~0 1))} is VALID [2018-11-23 12:21:23,237 INFO L273 TraceCheckUtils]: 36: Hoare triple {3476#(<= ~CELLCOUNT~0 (+ main_~i~0 1))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3477#(<= ~CELLCOUNT~0 main_~i~0)} is VALID [2018-11-23 12:21:23,238 INFO L273 TraceCheckUtils]: 37: Hoare triple {3477#(<= ~CELLCOUNT~0 main_~i~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; {3470#false} is VALID [2018-11-23 12:21:23,238 INFO L273 TraceCheckUtils]: 38: Hoare triple {3470#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {3470#false} is VALID [2018-11-23 12:21:23,238 INFO L256 TraceCheckUtils]: 39: Hoare triple {3470#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {3470#false} is VALID [2018-11-23 12:21:23,238 INFO L273 TraceCheckUtils]: 40: Hoare triple {3470#false} ~cond := #in~cond; {3470#false} is VALID [2018-11-23 12:21:23,239 INFO L273 TraceCheckUtils]: 41: Hoare triple {3470#false} assume 0 == ~cond; {3470#false} is VALID [2018-11-23 12:21:23,239 INFO L273 TraceCheckUtils]: 42: Hoare triple {3470#false} assume !false; {3470#false} is VALID [2018-11-23 12:21:23,243 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 9 proven. 7 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 12:21:23,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:21:23,243 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:21:23,255 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:21:23,274 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:21:23,275 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:21:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:23,289 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:21:23,675 INFO L256 TraceCheckUtils]: 0: Hoare triple {3469#true} call ULTIMATE.init(); {3469#true} is VALID [2018-11-23 12:21:23,675 INFO L273 TraceCheckUtils]: 1: Hoare triple {3469#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {3469#true} is VALID [2018-11-23 12:21:23,676 INFO L273 TraceCheckUtils]: 2: Hoare triple {3469#true} assume true; {3469#true} is VALID [2018-11-23 12:21:23,676 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3469#true} {3469#true} #83#return; {3469#true} is VALID [2018-11-23 12:21:23,677 INFO L256 TraceCheckUtils]: 4: Hoare triple {3469#true} call #t~ret8 := main(); {3469#true} is VALID [2018-11-23 12:21:23,677 INFO L273 TraceCheckUtils]: 5: Hoare triple {3469#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {3469#true} is VALID [2018-11-23 12:21:23,683 INFO L273 TraceCheckUtils]: 6: Hoare triple {3469#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {3471#(<= 2 ~CELLCOUNT~0)} is VALID [2018-11-23 12:21:23,684 INFO L273 TraceCheckUtils]: 7: Hoare triple {3471#(<= 2 ~CELLCOUNT~0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) then 1 else 0);~i~0 := 1; {3502#(and (<= 2 ~CELLCOUNT~0) (= (mod ~CELLCOUNT~0 2) 0) (<= main_~i~0 1))} is VALID [2018-11-23 12:21:23,684 INFO L273 TraceCheckUtils]: 8: Hoare triple {3502#(and (<= 2 ~CELLCOUNT~0) (= (mod ~CELLCOUNT~0 2) 0) (<= main_~i~0 1))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2));~j~0 := 2; {3502#(and (<= 2 ~CELLCOUNT~0) (= (mod ~CELLCOUNT~0 2) 0) (<= main_~i~0 1))} is VALID [2018-11-23 12:21:23,685 INFO L273 TraceCheckUtils]: 9: Hoare triple {3502#(and (<= 2 ~CELLCOUNT~0) (= (mod ~CELLCOUNT~0 2) 0) (<= main_~i~0 1))} assume !!(~j~0 >= 1); {3502#(and (<= 2 ~CELLCOUNT~0) (= (mod ~CELLCOUNT~0 2) 0) (<= main_~i~0 1))} is VALID [2018-11-23 12:21:23,686 INFO L273 TraceCheckUtils]: 10: Hoare triple {3502#(and (<= 2 ~CELLCOUNT~0) (= (mod ~CELLCOUNT~0 2) 0) (<= main_~i~0 1))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {3502#(and (<= 2 ~CELLCOUNT~0) (= (mod ~CELLCOUNT~0 2) 0) (<= main_~i~0 1))} is VALID [2018-11-23 12:21:23,686 INFO L273 TraceCheckUtils]: 11: Hoare triple {3502#(and (<= 2 ~CELLCOUNT~0) (= (mod ~CELLCOUNT~0 2) 0) (<= main_~i~0 1))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {3502#(and (<= 2 ~CELLCOUNT~0) (= (mod ~CELLCOUNT~0 2) 0) (<= main_~i~0 1))} is VALID [2018-11-23 12:21:23,686 INFO L273 TraceCheckUtils]: 12: Hoare triple {3502#(and (<= 2 ~CELLCOUNT~0) (= (mod ~CELLCOUNT~0 2) 0) (<= main_~i~0 1))} assume !!(~j~0 >= 1); {3502#(and (<= 2 ~CELLCOUNT~0) (= (mod ~CELLCOUNT~0 2) 0) (<= main_~i~0 1))} is VALID [2018-11-23 12:21:23,687 INFO L273 TraceCheckUtils]: 13: Hoare triple {3502#(and (<= 2 ~CELLCOUNT~0) (= (mod ~CELLCOUNT~0 2) 0) (<= main_~i~0 1))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {3502#(and (<= 2 ~CELLCOUNT~0) (= (mod ~CELLCOUNT~0 2) 0) (<= main_~i~0 1))} is VALID [2018-11-23 12:21:23,688 INFO L273 TraceCheckUtils]: 14: Hoare triple {3502#(and (<= 2 ~CELLCOUNT~0) (= (mod ~CELLCOUNT~0 2) 0) (<= main_~i~0 1))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {3502#(and (<= 2 ~CELLCOUNT~0) (= (mod ~CELLCOUNT~0 2) 0) (<= main_~i~0 1))} is VALID [2018-11-23 12:21:23,688 INFO L273 TraceCheckUtils]: 15: Hoare triple {3502#(and (<= 2 ~CELLCOUNT~0) (= (mod ~CELLCOUNT~0 2) 0) (<= main_~i~0 1))} assume !(~j~0 >= 1); {3502#(and (<= 2 ~CELLCOUNT~0) (= (mod ~CELLCOUNT~0 2) 0) (<= main_~i~0 1))} is VALID [2018-11-23 12:21:23,690 INFO L273 TraceCheckUtils]: 16: Hoare triple {3502#(and (<= 2 ~CELLCOUNT~0) (= (mod ~CELLCOUNT~0 2) 0) (<= main_~i~0 1))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3530#(and (<= 2 ~CELLCOUNT~0) (<= main_~i~0 2) (= (mod ~CELLCOUNT~0 2) 0))} is VALID [2018-11-23 12:21:23,691 INFO L273 TraceCheckUtils]: 17: Hoare triple {3530#(and (<= 2 ~CELLCOUNT~0) (<= main_~i~0 2) (= (mod ~CELLCOUNT~0 2) 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {3534#(and (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} is VALID [2018-11-23 12:21:23,697 INFO L273 TraceCheckUtils]: 18: Hoare triple {3534#(and (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} ~i~0 := 0; {3538#(and (<= 0 main_~i~0) (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} is VALID [2018-11-23 12:21:23,698 INFO L273 TraceCheckUtils]: 19: Hoare triple {3538#(and (<= 0 main_~i~0) (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 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; {3538#(and (<= 0 main_~i~0) (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} is VALID [2018-11-23 12:21:23,698 INFO L273 TraceCheckUtils]: 20: Hoare triple {3538#(and (<= 0 main_~i~0) (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} assume #t~short7; {3538#(and (<= 0 main_~i~0) (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} is VALID [2018-11-23 12:21:23,699 INFO L256 TraceCheckUtils]: 21: Hoare triple {3538#(and (<= 0 main_~i~0) (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {3534#(and (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} is VALID [2018-11-23 12:21:23,699 INFO L273 TraceCheckUtils]: 22: Hoare triple {3534#(and (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} ~cond := #in~cond; {3534#(and (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} is VALID [2018-11-23 12:21:23,707 INFO L273 TraceCheckUtils]: 23: Hoare triple {3534#(and (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} assume !(0 == ~cond); {3534#(and (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} is VALID [2018-11-23 12:21:23,707 INFO L273 TraceCheckUtils]: 24: Hoare triple {3534#(and (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} assume true; {3534#(and (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} is VALID [2018-11-23 12:21:23,708 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {3534#(and (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} {3538#(and (<= 0 main_~i~0) (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} #87#return; {3538#(and (<= 0 main_~i~0) (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} is VALID [2018-11-23 12:21:23,708 INFO L273 TraceCheckUtils]: 26: Hoare triple {3538#(and (<= 0 main_~i~0) (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} havoc #t~short7;havoc #t~mem6;havoc #t~mem5; {3538#(and (<= 0 main_~i~0) (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} is VALID [2018-11-23 12:21:23,709 INFO L273 TraceCheckUtils]: 27: Hoare triple {3538#(and (<= 0 main_~i~0) (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3566#(and (<= 1 main_~i~0) (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} is VALID [2018-11-23 12:21:23,710 INFO L273 TraceCheckUtils]: 28: Hoare triple {3566#(and (<= 1 main_~i~0) (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 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; {3566#(and (<= 1 main_~i~0) (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} is VALID [2018-11-23 12:21:23,710 INFO L273 TraceCheckUtils]: 29: Hoare triple {3566#(and (<= 1 main_~i~0) (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} assume #t~short7; {3566#(and (<= 1 main_~i~0) (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} is VALID [2018-11-23 12:21:23,711 INFO L256 TraceCheckUtils]: 30: Hoare triple {3566#(and (<= 1 main_~i~0) (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {3534#(and (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} is VALID [2018-11-23 12:21:23,711 INFO L273 TraceCheckUtils]: 31: Hoare triple {3534#(and (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} ~cond := #in~cond; {3534#(and (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} is VALID [2018-11-23 12:21:23,712 INFO L273 TraceCheckUtils]: 32: Hoare triple {3534#(and (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} assume !(0 == ~cond); {3534#(and (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} is VALID [2018-11-23 12:21:23,712 INFO L273 TraceCheckUtils]: 33: Hoare triple {3534#(and (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} assume true; {3534#(and (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} is VALID [2018-11-23 12:21:23,713 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3534#(and (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} {3566#(and (<= 1 main_~i~0) (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} #87#return; {3566#(and (<= 1 main_~i~0) (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} is VALID [2018-11-23 12:21:23,714 INFO L273 TraceCheckUtils]: 35: Hoare triple {3566#(and (<= 1 main_~i~0) (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} havoc #t~short7;havoc #t~mem6;havoc #t~mem5; {3566#(and (<= 1 main_~i~0) (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} is VALID [2018-11-23 12:21:23,715 INFO L273 TraceCheckUtils]: 36: Hoare triple {3566#(and (<= 1 main_~i~0) (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3594#(and (<= 2 main_~i~0) (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 0))} is VALID [2018-11-23 12:21:23,716 INFO L273 TraceCheckUtils]: 37: Hoare triple {3594#(and (<= 2 main_~i~0) (<= 2 ~CELLCOUNT~0) (<= (div ~CELLCOUNT~0 2) 1) (= (mod ~CELLCOUNT~0 2) 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; {3470#false} is VALID [2018-11-23 12:21:23,717 INFO L273 TraceCheckUtils]: 38: Hoare triple {3470#false} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {3470#false} is VALID [2018-11-23 12:21:23,717 INFO L256 TraceCheckUtils]: 39: Hoare triple {3470#false} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {3470#false} is VALID [2018-11-23 12:21:23,717 INFO L273 TraceCheckUtils]: 40: Hoare triple {3470#false} ~cond := #in~cond; {3470#false} is VALID [2018-11-23 12:21:23,717 INFO L273 TraceCheckUtils]: 41: Hoare triple {3470#false} assume 0 == ~cond; {3470#false} is VALID [2018-11-23 12:21:23,718 INFO L273 TraceCheckUtils]: 42: Hoare triple {3470#false} assume !false; {3470#false} is VALID [2018-11-23 12:21:23,722 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 12:21:23,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:21:23,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-11-23 12:21:23,742 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2018-11-23 12:21:23,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:21:23,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 12:21:23,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:21:23,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 12:21:23,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 12:21:23,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-11-23 12:21:23,822 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand 15 states. [2018-11-23 12:21:24,422 WARN L180 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-11-23 12:21:25,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:25,354 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2018-11-23 12:21:25,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:21:25,354 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 43 [2018-11-23 12:21:25,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:21:25,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:21:25,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2018-11-23 12:21:25,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 12:21:25,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 74 transitions. [2018-11-23 12:21:25,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 74 transitions. [2018-11-23 12:21:25,469 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:21:25,470 INFO L225 Difference]: With dead ends: 91 [2018-11-23 12:21:25,470 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 12:21:25,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=94, Invalid=248, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:21:25,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 12:21:25,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 46. [2018-11-23 12:21:25,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:21:25,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 46 states. [2018-11-23 12:21:25,793 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 46 states. [2018-11-23 12:21:25,793 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 46 states. [2018-11-23 12:21:25,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:25,795 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-23 12:21:25,795 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-11-23 12:21:25,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:25,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:25,795 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 54 states. [2018-11-23 12:21:25,796 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 54 states. [2018-11-23 12:21:25,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:21:25,798 INFO L93 Difference]: Finished difference Result 54 states and 59 transitions. [2018-11-23 12:21:25,798 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2018-11-23 12:21:25,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:21:25,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:21:25,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:21:25,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:21:25,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:21:25,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2018-11-23 12:21:25,800 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 43 [2018-11-23 12:21:25,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:21:25,801 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2018-11-23 12:21:25,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 12:21:25,801 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2018-11-23 12:21:25,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 12:21:25,802 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:21:25,802 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:21:25,802 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:21:25,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:21:25,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1321190548, now seen corresponding path program 3 times [2018-11-23 12:21:25,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:21:25,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:21:25,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:25,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:21:25,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:21:25,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:26,314 INFO L256 TraceCheckUtils]: 0: Hoare triple {3919#true} call ULTIMATE.init(); {3919#true} is VALID [2018-11-23 12:21:26,315 INFO L273 TraceCheckUtils]: 1: Hoare triple {3919#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {3919#true} is VALID [2018-11-23 12:21:26,315 INFO L273 TraceCheckUtils]: 2: Hoare triple {3919#true} assume true; {3919#true} is VALID [2018-11-23 12:21:26,315 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3919#true} {3919#true} #83#return; {3919#true} is VALID [2018-11-23 12:21:26,316 INFO L256 TraceCheckUtils]: 4: Hoare triple {3919#true} call #t~ret8 := main(); {3919#true} is VALID [2018-11-23 12:21:26,316 INFO L273 TraceCheckUtils]: 5: Hoare triple {3919#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {3919#true} is VALID [2018-11-23 12:21:26,316 INFO L273 TraceCheckUtils]: 6: Hoare triple {3919#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {3919#true} is VALID [2018-11-23 12:21:26,320 INFO L273 TraceCheckUtils]: 7: Hoare triple {3919#true} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) then 1 else 0);~i~0 := 1; {3921#(= main_~i~0 1)} is VALID [2018-11-23 12:21:26,321 INFO L273 TraceCheckUtils]: 8: Hoare triple {3921#(= main_~i~0 1)} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2));~j~0 := 2; {3921#(= main_~i~0 1)} is VALID [2018-11-23 12:21:26,321 INFO L273 TraceCheckUtils]: 9: Hoare triple {3921#(= main_~i~0 1)} assume !!(~j~0 >= 1); {3921#(= main_~i~0 1)} is VALID [2018-11-23 12:21:26,321 INFO L273 TraceCheckUtils]: 10: Hoare triple {3921#(= main_~i~0 1)} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {3921#(= main_~i~0 1)} is VALID [2018-11-23 12:21:26,322 INFO L273 TraceCheckUtils]: 11: Hoare triple {3921#(= main_~i~0 1)} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {3921#(= main_~i~0 1)} is VALID [2018-11-23 12:21:26,322 INFO L273 TraceCheckUtils]: 12: Hoare triple {3921#(= main_~i~0 1)} assume !!(~j~0 >= 1); {3922#(and (<= 1 main_~j~0) (= main_~i~0 1))} is VALID [2018-11-23 12:21:26,323 INFO L273 TraceCheckUtils]: 13: Hoare triple {3922#(and (<= 1 main_~j~0) (= main_~i~0 1))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {3923#(and (<= 1 main_~j~0) (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))))} is VALID [2018-11-23 12:21:26,324 INFO L273 TraceCheckUtils]: 14: Hoare triple {3923#(and (<= 1 main_~j~0) (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)))))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {3924#(and (<= 0 main_~j~0) (or (<= 1 main_~j~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 1)) (+ |main_~#volArray~0.offset| (* 8 main_~i~0)))))) (= main_~i~0 1))} is VALID [2018-11-23 12:21:26,325 INFO L273 TraceCheckUtils]: 15: Hoare triple {3924#(and (<= 0 main_~j~0) (or (<= 1 main_~j~0) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 1)) (+ |main_~#volArray~0.offset| (* 8 main_~i~0)))))) (= main_~i~0 1))} assume !(~j~0 >= 1); {3925#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 1)) (+ |main_~#volArray~0.offset| (* 8 main_~i~0))))))} is VALID [2018-11-23 12:21:26,326 INFO L273 TraceCheckUtils]: 16: Hoare triple {3925#(and (= main_~i~0 1) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 (- 1)) (+ |main_~#volArray~0.offset| (* 8 main_~i~0))))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3926#(and (<= (+ (div (+ (- |main_~#volArray~0.offset|) (+ (* 4 1) |main_~#volArray~0.offset|)) 4) 3) (* 2 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))))} is VALID [2018-11-23 12:21:26,327 INFO L273 TraceCheckUtils]: 17: Hoare triple {3926#(and (<= (+ (div (+ (- |main_~#volArray~0.offset|) (+ (* 4 1) |main_~#volArray~0.offset|)) 4) 3) (* 2 main_~i~0)) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2));~j~0 := 2; {3927#(= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-23 12:21:26,328 INFO L273 TraceCheckUtils]: 18: Hoare triple {3927#(= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) (+ (* 4 1) |main_~#volArray~0.offset|)))} assume !!(~j~0 >= 1); {3927#(= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-23 12:21:26,329 INFO L273 TraceCheckUtils]: 19: Hoare triple {3927#(= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) main_~j~0) (+ (* 4 1) |main_~#volArray~0.offset|)))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {3928#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-23 12:21:26,330 INFO L273 TraceCheckUtils]: 20: Hoare triple {3928#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {3929#(= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-23 12:21:26,330 INFO L273 TraceCheckUtils]: 21: Hoare triple {3929#(= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) (+ (* 4 1) |main_~#volArray~0.offset|)))} assume !!(~j~0 >= 1); {3929#(= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-23 12:21:26,332 INFO L273 TraceCheckUtils]: 22: Hoare triple {3929#(= 0 (select (store (select |#memory_int| |main_~#volArray~0.base|) (+ (* 8 main_~i~0) |main_~#volArray~0.offset| (* (- 4) main_~j~0)) 0) (+ (* 4 1) |main_~#volArray~0.offset|)))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {3928#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-23 12:21:26,332 INFO L273 TraceCheckUtils]: 23: Hoare triple {3928#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {3928#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-23 12:21:26,333 INFO L273 TraceCheckUtils]: 24: Hoare triple {3928#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} assume !(~j~0 >= 1); {3928#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-23 12:21:26,333 INFO L273 TraceCheckUtils]: 25: Hoare triple {3928#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3928#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-23 12:21:26,334 INFO L273 TraceCheckUtils]: 26: Hoare triple {3928#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {3928#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} is VALID [2018-11-23 12:21:26,335 INFO L273 TraceCheckUtils]: 27: Hoare triple {3928#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|)))} ~i~0 := 0; {3930#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-23 12:21:26,336 INFO L273 TraceCheckUtils]: 28: Hoare triple {3930#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= 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; {3930#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-23 12:21:26,336 INFO L273 TraceCheckUtils]: 29: Hoare triple {3930#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} assume #t~short7; {3930#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-23 12:21:26,337 INFO L256 TraceCheckUtils]: 30: Hoare triple {3930#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {3919#true} is VALID [2018-11-23 12:21:26,337 INFO L273 TraceCheckUtils]: 31: Hoare triple {3919#true} ~cond := #in~cond; {3919#true} is VALID [2018-11-23 12:21:26,337 INFO L273 TraceCheckUtils]: 32: Hoare triple {3919#true} assume !(0 == ~cond); {3919#true} is VALID [2018-11-23 12:21:26,337 INFO L273 TraceCheckUtils]: 33: Hoare triple {3919#true} assume true; {3919#true} is VALID [2018-11-23 12:21:26,338 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {3919#true} {3930#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} #87#return; {3930#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-23 12:21:26,339 INFO L273 TraceCheckUtils]: 35: Hoare triple {3930#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} havoc #t~short7;havoc #t~mem6;havoc #t~mem5; {3930#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} is VALID [2018-11-23 12:21:26,340 INFO L273 TraceCheckUtils]: 36: Hoare triple {3930#(and (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 1) |main_~#volArray~0.offset|))) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3931#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-23 12:21:26,341 INFO L273 TraceCheckUtils]: 37: Hoare triple {3931#(= 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; {3931#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} is VALID [2018-11-23 12:21:26,342 INFO L273 TraceCheckUtils]: 38: Hoare triple {3931#(= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ (* 4 main_~i~0) |main_~#volArray~0.offset|)))} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {3932#|main_#t~short7|} is VALID [2018-11-23 12:21:26,342 INFO L256 TraceCheckUtils]: 39: Hoare triple {3932#|main_#t~short7|} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {3933#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2018-11-23 12:21:26,343 INFO L273 TraceCheckUtils]: 40: Hoare triple {3933#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {3934#(not (= __VERIFIER_assert_~cond 0))} is VALID [2018-11-23 12:21:26,344 INFO L273 TraceCheckUtils]: 41: Hoare triple {3934#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {3920#false} is VALID [2018-11-23 12:21:26,344 INFO L273 TraceCheckUtils]: 42: Hoare triple {3920#false} assume !false; {3920#false} is VALID [2018-11-23 12:21:26,348 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 7 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 12:21:26,349 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:21:26,349 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 12:21:26,358 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:21:26,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 12:21:26,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:21:26,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:21:26,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:21:26,524 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-23 12:21:26,529 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 12 [2018-11-23 12:21:26,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:21:26,533 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:26,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:21:26,541 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2018-11-23 12:21:26,621 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 23 [2018-11-23 12:21:26,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 37 [2018-11-23 12:21:26,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 12:21:26,658 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:21:26,679 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:21:26,679 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:64 [2018-11-23 12:21:26,684 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:21:26,685 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_17|]. (let ((.cse0 (select |v_#memory_int_17| |main_~#volArray~0.base|))) (and (<= 2 main_~i~0) (= |#memory_int| (store |v_#memory_int_17| |main_~#volArray~0.base| (store .cse0 (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)) main_~j~0))) (= |main_~#volArray~0.offset| 0) (= 0 (select .cse0 (+ |main_~#volArray~0.offset| 4))))) [2018-11-23 12:21:26,685 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse5 (select |#memory_int| |main_~#volArray~0.base|)) (.cse3 (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)))) (let ((.cse0 (= main_~j~0 (select .cse5 .cse3))) (.cse1 (<= 2 main_~i~0)) (.cse2 (+ |main_~#volArray~0.offset| 4)) (.cse4 (= |main_~#volArray~0.offset| 0))) (or (and .cse0 .cse1 (= .cse2 .cse3) .cse4) (and .cse0 .cse1 (= (select .cse5 .cse2) 0) .cse4)))) [2018-11-23 12:21:26,899 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 46 [2018-11-23 12:21:26,909 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:26,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 69 [2018-11-23 12:21:26,936 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-23 12:21:26,971 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:21:27,036 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 40 [2018-11-23 12:21:27,043 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:21:27,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 49 [2018-11-23 12:21:27,058 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-23 12:21:27,084 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 12:21:27,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-11-23 12:21:27,170 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:99, output treesize:164 [2018-11-23 12:21:29,176 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:21:29,176 WARN L384 uantifierElimination]: Input elimination task: ∃ [main_~i~0, |v_#memory_int_18|, v_main_~j~0_14, v_prenex_5, v_prenex_6]. (let ((.cse2 (* (- 4) main_~j~0)) (.cse3 (= |main_~#volArray~0.offset| 0)) (.cse4 (+ |main_~#volArray~0.offset| 4))) (or (let ((.cse1 (* 8 main_~i~0)) (.cse0 (select |v_#memory_int_18| |main_~#volArray~0.base|))) (and (<= v_main_~j~0_14 (+ main_~j~0 1)) (<= 2 main_~i~0) (= |#memory_int| (store |v_#memory_int_18| |main_~#volArray~0.base| (store .cse0 (+ |main_~#volArray~0.offset| .cse1 .cse2) 0))) (= v_main_~j~0_14 (select .cse0 (+ |main_~#volArray~0.offset| .cse1 (* (- 4) v_main_~j~0_14)))) .cse3 (= (select .cse0 .cse4) 0))) (let ((.cse6 (select v_prenex_6 |main_~#volArray~0.base|)) (.cse5 (* 2 v_prenex_5))) (and (<= .cse5 (+ main_~j~0 2)) (<= 2 v_prenex_5) (= |#memory_int| (store v_prenex_6 |main_~#volArray~0.base| (store .cse6 (+ |main_~#volArray~0.offset| (* 8 v_prenex_5) .cse2) 0))) .cse3 (= (+ (select .cse6 .cse4) 1) .cse5))))) [2018-11-23 12:21:29,177 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_prenex_8, v_main_~j~0_14, main_~i~0, v_prenex_7, v_prenex_5]. (let ((.cse2 (select |#memory_int| |main_~#volArray~0.base|)) (.cse6 (+ |main_~#volArray~0.offset| 4))) (let ((.cse8 (select .cse2 .cse6))) (let ((.cse0 (= .cse8 0)) (.cse3 (* (- 4) main_~j~0)) (.cse4 (= |main_~#volArray~0.offset| 0))) (or (let ((.cse1 (* 8 main_~i~0))) (and (<= 2 main_~i~0) .cse0 (not (= (+ (* 4 main_~j~0) 4) .cse1)) (= 0 (select .cse2 (+ |main_~#volArray~0.offset| .cse1 .cse3))) .cse4)) (let ((.cse5 (+ |main_~#volArray~0.offset| (* 8 v_prenex_7) .cse3))) (and (= (select .cse2 .cse5) 0) (<= 2 v_prenex_7) .cse4 (= .cse5 .cse6))) (let ((.cse7 (* 2 v_prenex_5))) (and (= (select .cse2 (+ |main_~#volArray~0.offset| (* 8 v_prenex_5) .cse3)) 0) (<= .cse7 (+ main_~j~0 2)) (= .cse8 (+ .cse7 (- 1))) (<= 2 v_prenex_5) .cse4)) (let ((.cse9 (* 8 v_prenex_8))) (and (<= 2 v_prenex_8) (<= v_main_~j~0_14 (+ main_~j~0 1)) .cse0 (= 0 (select .cse2 (+ |main_~#volArray~0.offset| .cse9 .cse3))) .cse4 (= v_main_~j~0_14 (select .cse2 (+ |main_~#volArray~0.offset| .cse9 (* (- 4) v_main_~j~0_14)))))))))) [2018-11-23 12:21:55,410 WARN L180 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 51 [2018-11-23 12:22:02,000 WARN L180 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 51 DAG size of output: 32 [2018-11-23 12:22:02,086 INFO L256 TraceCheckUtils]: 0: Hoare triple {3919#true} call ULTIMATE.init(); {3919#true} is VALID [2018-11-23 12:22:02,086 INFO L273 TraceCheckUtils]: 1: Hoare triple {3919#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~CELLCOUNT~0 := 0; {3919#true} is VALID [2018-11-23 12:22:02,087 INFO L273 TraceCheckUtils]: 2: Hoare triple {3919#true} assume true; {3919#true} is VALID [2018-11-23 12:22:02,087 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3919#true} {3919#true} #83#return; {3919#true} is VALID [2018-11-23 12:22:02,087 INFO L256 TraceCheckUtils]: 4: Hoare triple {3919#true} call #t~ret8 := main(); {3919#true} is VALID [2018-11-23 12:22:02,087 INFO L273 TraceCheckUtils]: 5: Hoare triple {3919#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~CELLCOUNT~0 := #t~nondet1;havoc #t~nondet1; {3919#true} is VALID [2018-11-23 12:22:02,088 INFO L273 TraceCheckUtils]: 6: Hoare triple {3919#true} assume ~CELLCOUNT~0 > 1;~DEFAULTVALUE~0 := 1;~MINVAL~0 := 2;havoc ~i~0;havoc ~j~0;call ~#volArray~0.base, ~#volArray~0.offset := #Ultimate.alloc(4 * ~CELLCOUNT~0); {3956#(= |main_~#volArray~0.offset| 0)} is VALID [2018-11-23 12:22:02,088 INFO L273 TraceCheckUtils]: 7: Hoare triple {3956#(= |main_~#volArray~0.offset| 0)} assume !(0 != (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2));assume 0 != (if 0 == (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then ~CELLCOUNT~0 % 2 - 2 else ~CELLCOUNT~0 % 2) then 1 else 0);~i~0 := 1; {3960#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:22:02,089 INFO L273 TraceCheckUtils]: 8: Hoare triple {3960#(and (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2));~j~0 := 2; {3964#(and (= main_~j~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:22:02,090 INFO L273 TraceCheckUtils]: 9: Hoare triple {3964#(and (= main_~j~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~j~0 >= 1); {3964#(and (= main_~j~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:22:02,090 INFO L273 TraceCheckUtils]: 10: Hoare triple {3964#(and (= main_~j~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 * (2 * ~i~0 - ~j~0), 4); {3964#(and (= main_~j~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:22:02,091 INFO L273 TraceCheckUtils]: 11: Hoare triple {3964#(and (= main_~j~0 2) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {3974#(and (= 1 main_~j~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:22:02,091 INFO L273 TraceCheckUtils]: 12: Hoare triple {3974#(and (= 1 main_~j~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !!(~j~0 >= 1); {3974#(and (= 1 main_~j~0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:22:02,092 INFO L273 TraceCheckUtils]: 13: Hoare triple {3974#(and (= 1 main_~j~0) (= 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 * (2 * ~i~0 - ~j~0), 4); {3981#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 4))) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:22:02,093 INFO L273 TraceCheckUtils]: 14: Hoare triple {3981#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 4))) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {3981#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 4))) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:22:02,093 INFO L273 TraceCheckUtils]: 15: Hoare triple {3981#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 4))) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !(~j~0 >= 1); {3981#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 4))) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:22:02,094 INFO L273 TraceCheckUtils]: 16: Hoare triple {3981#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (- 4))) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3991#(and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:22:02,095 INFO L273 TraceCheckUtils]: 17: Hoare triple {3991#(and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= |main_~#volArray~0.offset| 0))} assume !!(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2));~j~0 := 2; {3991#(and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:22:02,096 INFO L273 TraceCheckUtils]: 18: Hoare triple {3991#(and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= |main_~#volArray~0.offset| 0))} assume !!(~j~0 >= 1); {3991#(and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:22:02,097 INFO L273 TraceCheckUtils]: 19: Hoare triple {3991#(and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= |main_~#volArray~0.offset| 0))} assume ~j~0 >= ~MINVAL~0;call write~int(~j~0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {4001#(or (and (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)))) (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= |main_~#volArray~0.offset| 0)) (and (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)))) (<= 2 main_~i~0) (= (+ (* 4 main_~j~0) 4) (* 8 main_~i~0)) (= |main_~#volArray~0.offset| 0)))} is VALID [2018-11-23 12:22:02,099 INFO L273 TraceCheckUtils]: 20: Hoare triple {4001#(or (and (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)))) (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= |main_~#volArray~0.offset| 0)) (and (= main_~j~0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)))) (<= 2 main_~i~0) (= (+ (* 4 main_~j~0) 4) (* 8 main_~i~0)) (= |main_~#volArray~0.offset| 0)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {4005#(or (and (= (+ (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 1) (* 2 main_~i~0)) (<= 2 main_~i~0) (<= (* 2 main_~i~0) (+ main_~j~0 2)) (= |main_~#volArray~0.offset| 0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_14 Int)) (and (<= v_main_~j~0_14 (+ main_~j~0 1)) (= v_main_~j~0_14 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_14))))))))} is VALID [2018-11-23 12:22:02,100 INFO L273 TraceCheckUtils]: 21: Hoare triple {4005#(or (and (= (+ (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 1) (* 2 main_~i~0)) (<= 2 main_~i~0) (<= (* 2 main_~i~0) (+ main_~j~0 2)) (= |main_~#volArray~0.offset| 0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_14 Int)) (and (<= v_main_~j~0_14 (+ main_~j~0 1)) (= v_main_~j~0_14 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_14))))))))} assume !!(~j~0 >= 1); {4005#(or (and (= (+ (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 1) (* 2 main_~i~0)) (<= 2 main_~i~0) (<= (* 2 main_~i~0) (+ main_~j~0 2)) (= |main_~#volArray~0.offset| 0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_14 Int)) (and (<= v_main_~j~0_14 (+ main_~j~0 1)) (= v_main_~j~0_14 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_14))))))))} is VALID [2018-11-23 12:22:02,107 INFO L273 TraceCheckUtils]: 22: Hoare triple {4005#(or (and (= (+ (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 1) (* 2 main_~i~0)) (<= 2 main_~i~0) (<= (* 2 main_~i~0) (+ main_~j~0 2)) (= |main_~#volArray~0.offset| 0)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= |main_~#volArray~0.offset| 0) (exists ((v_main_~j~0_14 Int)) (and (<= v_main_~j~0_14 (+ main_~j~0 1)) (= v_main_~j~0_14 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_14))))))))} assume !(~j~0 >= ~MINVAL~0);call write~int(0, ~#volArray~0.base, ~#volArray~0.offset + 4 * (2 * ~i~0 - ~j~0), 4); {4012#(or (and (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_5 Int)) (and (<= (* 2 v_prenex_5) (+ main_~j~0 2)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_5) (* (- 4) main_~j~0))) 0) (= (+ (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 1) (* 2 v_prenex_5)) (<= 2 v_prenex_5)))) (and (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_7 Int)) (and (<= 2 v_prenex_7) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_7) (* (- 4) main_~j~0))) 0) (= (* 8 v_prenex_7) (+ (* 4 main_~j~0) 4))))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (exists ((main_~i~0 Int)) (and (<= 2 main_~i~0) (not (= (+ (* 4 main_~j~0) 4) (* 8 main_~i~0))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)))))) (= |main_~#volArray~0.offset| 0)))} is VALID [2018-11-23 12:22:02,110 INFO L273 TraceCheckUtils]: 23: Hoare triple {4012#(or (and (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_5 Int)) (and (<= (* 2 v_prenex_5) (+ main_~j~0 2)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_5) (* (- 4) main_~j~0))) 0) (= (+ (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 1) (* 2 v_prenex_5)) (<= 2 v_prenex_5)))) (and (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_7 Int)) (and (<= 2 v_prenex_7) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_7) (* (- 4) main_~j~0))) 0) (= (* 8 v_prenex_7) (+ (* 4 main_~j~0) 4))))) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (exists ((main_~i~0 Int)) (and (<= 2 main_~i~0) (not (= (+ (* 4 main_~j~0) 4) (* 8 main_~i~0))) (= 0 (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) main_~j~0)))))) (= |main_~#volArray~0.offset| 0)))} #t~post3 := ~j~0;~j~0 := #t~post3 - 1;havoc #t~post3; {4016#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (exists ((v_prenex_7 Int)) (and (<= 2 v_prenex_7) (<= (* 2 v_prenex_7) (+ main_~j~0 2)))) (= |main_~#volArray~0.offset| 0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (exists ((main_~i~0 Int) (v_main_~j~0_15 Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_15))) 0) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 main_~i~0))) (<= v_main_~j~0_15 (+ main_~j~0 1)))) (= |main_~#volArray~0.offset| 0)) (and (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_5 Int) (v_prenex_9 Int)) (and (= (+ (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 1) (* 2 v_prenex_5)) (<= 2 v_prenex_5) (<= v_prenex_9 (+ main_~j~0 1)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_5) (* (- 4) v_prenex_9))) 0) (<= (* 2 v_prenex_5) (+ v_prenex_9 2))))))} is VALID [2018-11-23 12:22:02,112 INFO L273 TraceCheckUtils]: 24: Hoare triple {4016#(or (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (exists ((v_prenex_7 Int)) (and (<= 2 v_prenex_7) (<= (* 2 v_prenex_7) (+ main_~j~0 2)))) (= |main_~#volArray~0.offset| 0)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (exists ((main_~i~0 Int) (v_main_~j~0_15 Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_15))) 0) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 main_~i~0))) (<= v_main_~j~0_15 (+ main_~j~0 1)))) (= |main_~#volArray~0.offset| 0)) (and (= |main_~#volArray~0.offset| 0) (exists ((v_prenex_5 Int) (v_prenex_9 Int)) (and (= (+ (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 1) (* 2 v_prenex_5)) (<= 2 v_prenex_5) (<= v_prenex_9 (+ main_~j~0 1)) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_5) (* (- 4) v_prenex_9))) 0) (<= (* 2 v_prenex_5) (+ v_prenex_9 2))))))} assume !(~j~0 >= 1); {4020#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (exists ((main_~i~0 Int) (v_main_~j~0_15 Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_15))) 0) (<= v_main_~j~0_15 1) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 main_~i~0))))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:22:02,113 INFO L273 TraceCheckUtils]: 25: Hoare triple {4020#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (exists ((main_~i~0 Int) (v_main_~j~0_15 Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_15))) 0) (<= v_main_~j~0_15 1) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 main_~i~0))))) (= |main_~#volArray~0.offset| 0))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4020#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (exists ((main_~i~0 Int) (v_main_~j~0_15 Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_15))) 0) (<= v_main_~j~0_15 1) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 main_~i~0))))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:22:02,114 INFO L273 TraceCheckUtils]: 26: Hoare triple {4020#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (exists ((main_~i~0 Int) (v_main_~j~0_15 Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_15))) 0) (<= v_main_~j~0_15 1) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 main_~i~0))))) (= |main_~#volArray~0.offset| 0))} assume !(~i~0 <= (if ~CELLCOUNT~0 < 0 && 0 != ~CELLCOUNT~0 % 2 then 1 + ~CELLCOUNT~0 / 2 else ~CELLCOUNT~0 / 2)); {4020#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (exists ((main_~i~0 Int) (v_main_~j~0_15 Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_15))) 0) (<= v_main_~j~0_15 1) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 main_~i~0))))) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:22:02,117 INFO L273 TraceCheckUtils]: 27: Hoare triple {4020#(and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (exists ((main_~i~0 Int) (v_main_~j~0_15 Int)) (and (<= 2 main_~i~0) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 main_~i~0) (* (- 4) v_main_~j~0_15))) 0) (<= v_main_~j~0_15 1) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 main_~i~0))))) (= |main_~#volArray~0.offset| 0))} ~i~0 := 0; {4030#(and (exists ((v_main_~j~0_15 Int) (v_prenex_12 Int)) (and (<= 2 v_prenex_12) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 v_prenex_12))) (<= v_main_~j~0_15 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_12) (* (- 4) v_main_~j~0_15))) 0))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 12:22:02,118 INFO L273 TraceCheckUtils]: 28: Hoare triple {4030#(and (exists ((v_main_~j~0_15 Int) (v_prenex_12 Int)) (and (<= 2 v_prenex_12) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 v_prenex_12))) (<= v_main_~j~0_15 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_12) (* (- 4) v_main_~j~0_15))) 0))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= |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; {4030#(and (exists ((v_main_~j~0_15 Int) (v_prenex_12 Int)) (and (<= 2 v_prenex_12) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 v_prenex_12))) (<= v_main_~j~0_15 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_12) (* (- 4) v_main_~j~0_15))) 0))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 12:22:02,119 INFO L273 TraceCheckUtils]: 29: Hoare triple {4030#(and (exists ((v_main_~j~0_15 Int) (v_prenex_12 Int)) (and (<= 2 v_prenex_12) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 v_prenex_12))) (<= v_main_~j~0_15 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_12) (* (- 4) v_main_~j~0_15))) 0))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} assume #t~short7; {4030#(and (exists ((v_main_~j~0_15 Int) (v_prenex_12 Int)) (and (<= 2 v_prenex_12) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 v_prenex_12))) (<= v_main_~j~0_15 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_12) (* (- 4) v_main_~j~0_15))) 0))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 12:22:02,121 INFO L256 TraceCheckUtils]: 30: Hoare triple {4030#(and (exists ((v_main_~j~0_15 Int) (v_prenex_12 Int)) (and (<= 2 v_prenex_12) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 v_prenex_12))) (<= v_main_~j~0_15 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_12) (* (- 4) v_main_~j~0_15))) 0))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {4040#(exists ((v_main_~j~0_15 Int) (v_prenex_12 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (<= 2 v_prenex_12) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 v_prenex_12))) (<= v_main_~j~0_15 1) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) v_main_~j~0_15) (* 8 v_prenex_12))) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 4) 0)))} is VALID [2018-11-23 12:22:02,122 INFO L273 TraceCheckUtils]: 31: Hoare triple {4040#(exists ((v_main_~j~0_15 Int) (v_prenex_12 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (<= 2 v_prenex_12) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 v_prenex_12))) (<= v_main_~j~0_15 1) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) v_main_~j~0_15) (* 8 v_prenex_12))) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 4) 0)))} ~cond := #in~cond; {4040#(exists ((v_main_~j~0_15 Int) (v_prenex_12 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (<= 2 v_prenex_12) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 v_prenex_12))) (<= v_main_~j~0_15 1) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) v_main_~j~0_15) (* 8 v_prenex_12))) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 4) 0)))} is VALID [2018-11-23 12:22:02,122 INFO L273 TraceCheckUtils]: 32: Hoare triple {4040#(exists ((v_main_~j~0_15 Int) (v_prenex_12 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (<= 2 v_prenex_12) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 v_prenex_12))) (<= v_main_~j~0_15 1) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) v_main_~j~0_15) (* 8 v_prenex_12))) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 4) 0)))} assume !(0 == ~cond); {4040#(exists ((v_main_~j~0_15 Int) (v_prenex_12 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (<= 2 v_prenex_12) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 v_prenex_12))) (<= v_main_~j~0_15 1) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) v_main_~j~0_15) (* 8 v_prenex_12))) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 4) 0)))} is VALID [2018-11-23 12:22:02,123 INFO L273 TraceCheckUtils]: 33: Hoare triple {4040#(exists ((v_main_~j~0_15 Int) (v_prenex_12 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (<= 2 v_prenex_12) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 v_prenex_12))) (<= v_main_~j~0_15 1) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) v_main_~j~0_15) (* 8 v_prenex_12))) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 4) 0)))} assume true; {4040#(exists ((v_main_~j~0_15 Int) (v_prenex_12 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (<= 2 v_prenex_12) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 v_prenex_12))) (<= v_main_~j~0_15 1) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) v_main_~j~0_15) (* 8 v_prenex_12))) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 4) 0)))} is VALID [2018-11-23 12:22:04,126 INFO L268 TraceCheckUtils]: 34: Hoare quadruple {4040#(exists ((v_main_~j~0_15 Int) (v_prenex_12 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (<= 2 v_prenex_12) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 v_prenex_12))) (<= v_main_~j~0_15 1) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) v_main_~j~0_15) (* 8 v_prenex_12))) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 4) 0)))} {4030#(and (exists ((v_main_~j~0_15 Int) (v_prenex_12 Int)) (and (<= 2 v_prenex_12) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 v_prenex_12))) (<= v_main_~j~0_15 1) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_12) (* (- 4) v_main_~j~0_15))) 0))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} #87#return; {4053#(and (exists ((v_main_~j~0_15 Int) (v_prenex_12 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (<= 2 v_prenex_12) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 v_prenex_12))) (<= v_main_~j~0_15 1) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) v_main_~j~0_15) (* 8 v_prenex_12))) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 4) 0))) (exists ((v_prenex_14 Int) (v_prenex_13 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_14) (* (- 4) v_prenex_13))) 0) (<= v_prenex_13 1) (<= 2 v_prenex_14) (not (= (+ (* 4 v_prenex_13) 4) (* 8 v_prenex_14))))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is UNKNOWN [2018-11-23 12:22:04,128 INFO L273 TraceCheckUtils]: 35: Hoare triple {4053#(and (exists ((v_main_~j~0_15 Int) (v_prenex_12 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (<= 2 v_prenex_12) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 v_prenex_12))) (<= v_main_~j~0_15 1) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) v_main_~j~0_15) (* 8 v_prenex_12))) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 4) 0))) (exists ((v_prenex_14 Int) (v_prenex_13 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_14) (* (- 4) v_prenex_13))) 0) (<= v_prenex_13 1) (<= 2 v_prenex_14) (not (= (+ (* 4 v_prenex_13) 4) (* 8 v_prenex_14))))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} havoc #t~short7;havoc #t~mem6;havoc #t~mem5; {4053#(and (exists ((v_main_~j~0_15 Int) (v_prenex_12 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (<= 2 v_prenex_12) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 v_prenex_12))) (<= v_main_~j~0_15 1) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) v_main_~j~0_15) (* 8 v_prenex_12))) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 4) 0))) (exists ((v_prenex_14 Int) (v_prenex_13 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_14) (* (- 4) v_prenex_13))) 0) (<= v_prenex_13 1) (<= 2 v_prenex_14) (not (= (+ (* 4 v_prenex_13) 4) (* 8 v_prenex_14))))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} is VALID [2018-11-23 12:22:04,130 INFO L273 TraceCheckUtils]: 36: Hoare triple {4053#(and (exists ((v_main_~j~0_15 Int) (v_prenex_12 Int) (|v_main_~#volArray~0.base_BEFORE_CALL_2| Int)) (and (<= 2 v_prenex_12) (not (= (+ (* 4 v_main_~j~0_15) 4) (* 8 v_prenex_12))) (<= v_main_~j~0_15 1) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) (+ (* (- 4) v_main_~j~0_15) (* 8 v_prenex_12))) 0) (= (select (select |#memory_int| |v_main_~#volArray~0.base_BEFORE_CALL_2|) 4) 0))) (exists ((v_prenex_14 Int) (v_prenex_13 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_14) (* (- 4) v_prenex_13))) 0) (<= v_prenex_13 1) (<= 2 v_prenex_14) (not (= (+ (* 4 v_prenex_13) 4) (* 8 v_prenex_14))))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= |main_~#volArray~0.offset| 0) (= main_~i~0 0))} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4060#(and (exists ((v_prenex_14 Int) (v_prenex_13 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_14) (* (- 4) v_prenex_13))) 0) (<= v_prenex_13 1) (<= 2 v_prenex_14) (not (= (+ (* 4 v_prenex_13) 4) (* 8 v_prenex_14))))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:22:04,135 INFO L273 TraceCheckUtils]: 37: Hoare triple {4060#(and (exists ((v_prenex_14 Int) (v_prenex_13 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_14) (* (- 4) v_prenex_13))) 0) (<= v_prenex_13 1) (<= 2 v_prenex_14) (not (= (+ (* 4 v_prenex_13) 4) (* 8 v_prenex_14))))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 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; {4060#(and (exists ((v_prenex_14 Int) (v_prenex_13 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_14) (* (- 4) v_prenex_13))) 0) (<= v_prenex_13 1) (<= 2 v_prenex_14) (not (= (+ (* 4 v_prenex_13) 4) (* 8 v_prenex_14))))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} is VALID [2018-11-23 12:22:04,149 INFO L273 TraceCheckUtils]: 38: Hoare triple {4060#(and (exists ((v_prenex_14 Int) (v_prenex_13 Int)) (and (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| (* 8 v_prenex_14) (* (- 4) v_prenex_13))) 0) (<= v_prenex_13 1) (<= 2 v_prenex_14) (not (= (+ (* 4 v_prenex_13) 4) (* 8 v_prenex_14))))) (= (select (select |#memory_int| |main_~#volArray~0.base|) (+ |main_~#volArray~0.offset| 4)) 0) (= main_~i~0 1) (= |main_~#volArray~0.offset| 0))} assume !#t~short7;call #t~mem6 := read~int(~#volArray~0.base, ~#volArray~0.offset + 4 * ~i~0, 4);#t~short7 := 0 == #t~mem6; {3932#|main_#t~short7|} is VALID [2018-11-23 12:22:04,164 INFO L256 TraceCheckUtils]: 39: Hoare triple {3932#|main_#t~short7|} call __VERIFIER_assert((if #t~short7 then 1 else 0)); {4070#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:22:04,180 INFO L273 TraceCheckUtils]: 40: Hoare triple {4070#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {4074#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 12:22:04,196 INFO L273 TraceCheckUtils]: 41: Hoare triple {4074#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3920#false} is VALID [2018-11-23 12:22:04,196 INFO L273 TraceCheckUtils]: 42: Hoare triple {3920#false} assume !false; {3920#false} is VALID [2018-11-23 12:22:04,217 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:22:04,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:22:04,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20] total 33 [2018-11-23 12:22:04,250 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 43 [2018-11-23 12:22:04,250 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:22:04,251 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 12:22:12,394 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 75 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2018-11-23 12:22:12,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 12:22:12,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 12:22:12,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=908, Unknown=9, NotChecked=0, Total=1056 [2018-11-23 12:22:12,395 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand 33 states. [2018-11-23 12:22:23,597 WARN L180 SmtUtils]: Spent 2.67 s on a formula simplification. DAG size of input: 73 DAG size of output: 25