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_Bitvector.epf -i ../../../trunk/examples/svcomp/array-crafted/zero_sum_const2_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:40:12,160 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:40:12,162 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:40:12,174 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:40:12,175 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:40:12,180 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:40:12,181 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:40:12,186 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:40:12,189 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:40:12,190 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:40:12,191 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:40:12,197 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:40:12,198 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:40:12,199 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:40:12,203 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:40:12,204 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:40:12,205 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:40:12,207 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:40:12,209 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:40:12,211 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:40:12,212 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:40:12,213 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:40:12,216 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:40:12,216 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:40:12,216 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:40:12,217 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:40:12,218 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:40:12,219 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:40:12,220 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:40:12,221 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:40:12,221 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:40:12,222 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:40:12,222 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:40:12,223 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:40:12,224 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:40:12,224 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:40:12,225 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 10:40:12,241 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:40:12,241 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:40:12,243 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:40:12,243 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:40:12,244 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:40:12,244 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:40:12,245 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:40:12,245 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:40:12,245 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:40:12,245 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:40:12,245 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:40:12,246 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:40:12,246 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:40:12,246 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:40:12,246 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:40:12,246 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:40:12,247 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:40:12,248 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:40:12,248 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:40:12,248 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:40:12,249 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:40:12,249 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:40:12,249 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:40:12,249 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:40:12,249 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:40:12,250 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:40:12,250 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:40:12,250 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:40:12,250 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:40:12,250 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:40:12,251 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:40:12,251 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:40:12,251 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:40:12,307 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:40:12,325 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:40:12,329 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:40:12,331 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:40:12,332 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:40:12,332 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/zero_sum_const2_true-unreach-call.c [2018-11-23 10:40:12,404 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6530e488/d9580257c9df44bbaca24ac41b2e0afb/FLAGa8343abde [2018-11-23 10:40:12,893 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:40:12,894 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/zero_sum_const2_true-unreach-call.c [2018-11-23 10:40:12,900 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6530e488/d9580257c9df44bbaca24ac41b2e0afb/FLAGa8343abde [2018-11-23 10:40:13,268 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6530e488/d9580257c9df44bbaca24ac41b2e0afb [2018-11-23 10:40:13,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:40:13,281 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:40:13,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:40:13,286 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:40:13,290 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:40:13,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:40:13" (1/1) ... [2018-11-23 10:40:13,294 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c54ef45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:40:13, skipping insertion in model container [2018-11-23 10:40:13,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:40:13" (1/1) ... [2018-11-23 10:40:13,306 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:40:13,337 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:40:13,601 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:40:13,608 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:40:13,655 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:40:13,690 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:40:13,691 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:40:13 WrapperNode [2018-11-23 10:40:13,691 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:40:13,692 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:40:13,692 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:40:13,693 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:40:13,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:40:13" (1/1) ... [2018-11-23 10:40:13,716 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:40:13" (1/1) ... [2018-11-23 10:40:13,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:40:13,727 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:40:13,727 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:40:13,728 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:40:13,739 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:40:13" (1/1) ... [2018-11-23 10:40:13,740 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:40:13" (1/1) ... [2018-11-23 10:40:13,742 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:40:13" (1/1) ... [2018-11-23 10:40:13,744 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:40:13" (1/1) ... [2018-11-23 10:40:13,761 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:40:13" (1/1) ... [2018-11-23 10:40:13,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:40:13" (1/1) ... [2018-11-23 10:40:13,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:40:13" (1/1) ... [2018-11-23 10:40:13,779 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:40:13,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:40:13,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:40:13,780 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:40:13,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:40:13" (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 10:40:13,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:40:13,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:40:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:40:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:40:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:40:13,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:40:13,915 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:40:13,916 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:40:13,916 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:40:13,916 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:40:13,916 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:40:13,916 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:40:14,629 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:40:14,629 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 10:40:14,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:40:14 BoogieIcfgContainer [2018-11-23 10:40:14,630 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:40:14,631 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:40:14,631 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:40:14,635 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:40:14,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:40:13" (1/3) ... [2018-11-23 10:40:14,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4149d0c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:40:14, skipping insertion in model container [2018-11-23 10:40:14,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:40:13" (2/3) ... [2018-11-23 10:40:14,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4149d0c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:40:14, skipping insertion in model container [2018-11-23 10:40:14,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:40:14" (3/3) ... [2018-11-23 10:40:14,639 INFO L112 eAbstractionObserver]: Analyzing ICFG zero_sum_const2_true-unreach-call.c [2018-11-23 10:40:14,647 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:40:14,656 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:40:14,676 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:40:14,710 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:40:14,711 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:40:14,711 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:40:14,711 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:40:14,712 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:40:14,712 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:40:14,712 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:40:14,712 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:40:14,712 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:40:14,731 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-23 10:40:14,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 10:40:14,737 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:40:14,738 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] [2018-11-23 10:40:14,740 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:40:14,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:40:14,746 INFO L82 PathProgramCache]: Analyzing trace with hash -286857817, now seen corresponding path program 1 times [2018-11-23 10:40:14,750 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:40:14,751 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:40:14,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:40:14,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:40:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:40:14,853 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:40:15,262 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-23 10:40:15,265 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {37#true} is VALID [2018-11-23 10:40:15,266 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-23 10:40:15,266 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #97#return; {37#true} is VALID [2018-11-23 10:40:15,267 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret11 := main(); {37#true} is VALID [2018-11-23 10:40:15,267 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {37#true} is VALID [2018-11-23 10:40:15,267 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~sum~0 := 0bv32;~i~0 := 0bv32; {37#true} is VALID [2018-11-23 10:40:15,268 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-23 10:40:15,268 INFO L273 TraceCheckUtils]: 8: Hoare triple {38#false} ~i~0 := 0bv32; {38#false} is VALID [2018-11-23 10:40:15,269 INFO L273 TraceCheckUtils]: 9: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-23 10:40:15,269 INFO L273 TraceCheckUtils]: 10: Hoare triple {38#false} ~i~0 := 0bv32; {38#false} is VALID [2018-11-23 10:40:15,269 INFO L273 TraceCheckUtils]: 11: Hoare triple {38#false} assume !true; {38#false} is VALID [2018-11-23 10:40:15,270 INFO L273 TraceCheckUtils]: 12: Hoare triple {38#false} ~i~0 := 0bv32; {38#false} is VALID [2018-11-23 10:40:15,270 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#false} assume !~bvslt32(~i~0, ~SIZE~0); {38#false} is VALID [2018-11-23 10:40:15,270 INFO L273 TraceCheckUtils]: 14: Hoare triple {38#false} ~i~0 := 0bv32; {38#false} is VALID [2018-11-23 10:40:15,271 INFO L273 TraceCheckUtils]: 15: Hoare triple {38#false} assume !~bvslt32(~i~0, ~SIZE~0); {38#false} is VALID [2018-11-23 10:40:15,271 INFO L256 TraceCheckUtils]: 16: Hoare triple {38#false} call __VERIFIER_assert((if 0bv32 == ~sum~0 then 1bv32 else 0bv32)); {38#false} is VALID [2018-11-23 10:40:15,272 INFO L273 TraceCheckUtils]: 17: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2018-11-23 10:40:15,272 INFO L273 TraceCheckUtils]: 18: Hoare triple {38#false} assume 0bv32 == ~cond; {38#false} is VALID [2018-11-23 10:40:15,272 INFO L273 TraceCheckUtils]: 19: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-23 10:40:15,276 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 10:40:15,276 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:40:15,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:40:15,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:40:15,288 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-23 10:40:15,291 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:40:15,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:40:15,413 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:40:15,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:40:15,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:40:15,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:40:15,424 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-23 10:40:15,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:15,554 INFO L93 Difference]: Finished difference Result 59 states and 79 transitions. [2018-11-23 10:40:15,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:40:15,554 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-23 10:40:15,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:40:15,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:40:15,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2018-11-23 10:40:15,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:40:15,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2018-11-23 10:40:15,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 79 transitions. [2018-11-23 10:40:15,847 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:40:15,858 INFO L225 Difference]: With dead ends: 59 [2018-11-23 10:40:15,859 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 10:40:15,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:40:15,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 10:40:15,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 10:40:15,915 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:40:15,916 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 10:40:15,917 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 10:40:15,917 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 10:40:15,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:15,922 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 10:40:15,922 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 10:40:15,925 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:40:15,925 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:40:15,925 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 10:40:15,926 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 10:40:15,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:15,933 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2018-11-23 10:40:15,936 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 10:40:15,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:40:15,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:40:15,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:40:15,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:40:15,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 10:40:15,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2018-11-23 10:40:15,942 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 20 [2018-11-23 10:40:15,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:40:15,943 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2018-11-23 10:40:15,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:40:15,943 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2018-11-23 10:40:15,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 10:40:15,944 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:40:15,944 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] [2018-11-23 10:40:15,945 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:40:15,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:40:15,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1625158677, now seen corresponding path program 1 times [2018-11-23 10:40:15,946 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:40:15,946 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:40:15,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:40:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:40:16,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:40:16,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:40:16,420 INFO L256 TraceCheckUtils]: 0: Hoare triple {263#true} call ULTIMATE.init(); {263#true} is VALID [2018-11-23 10:40:16,421 INFO L273 TraceCheckUtils]: 1: Hoare triple {263#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {263#true} is VALID [2018-11-23 10:40:16,421 INFO L273 TraceCheckUtils]: 2: Hoare triple {263#true} assume true; {263#true} is VALID [2018-11-23 10:40:16,422 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {263#true} {263#true} #97#return; {263#true} is VALID [2018-11-23 10:40:16,422 INFO L256 TraceCheckUtils]: 4: Hoare triple {263#true} call #t~ret11 := main(); {263#true} is VALID [2018-11-23 10:40:16,422 INFO L273 TraceCheckUtils]: 5: Hoare triple {263#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {263#true} is VALID [2018-11-23 10:40:16,423 INFO L273 TraceCheckUtils]: 6: Hoare triple {263#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~sum~0 := 0bv32;~i~0 := 0bv32; {286#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:40:16,424 INFO L273 TraceCheckUtils]: 7: Hoare triple {286#(= main_~sum~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~SIZE~0); {286#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:40:16,424 INFO L273 TraceCheckUtils]: 8: Hoare triple {286#(= main_~sum~0 (_ bv0 32))} ~i~0 := 0bv32; {286#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:40:16,425 INFO L273 TraceCheckUtils]: 9: Hoare triple {286#(= main_~sum~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~SIZE~0); {286#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:40:16,426 INFO L273 TraceCheckUtils]: 10: Hoare triple {286#(= main_~sum~0 (_ bv0 32))} ~i~0 := 0bv32; {286#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:40:16,426 INFO L273 TraceCheckUtils]: 11: Hoare triple {286#(= main_~sum~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~SIZE~0); {286#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:40:16,427 INFO L273 TraceCheckUtils]: 12: Hoare triple {286#(= main_~sum~0 (_ bv0 32))} ~i~0 := 0bv32; {286#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:40:16,429 INFO L273 TraceCheckUtils]: 13: Hoare triple {286#(= main_~sum~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~SIZE~0); {286#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:40:16,431 INFO L273 TraceCheckUtils]: 14: Hoare triple {286#(= main_~sum~0 (_ bv0 32))} ~i~0 := 0bv32; {286#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:40:16,431 INFO L273 TraceCheckUtils]: 15: Hoare triple {286#(= main_~sum~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~SIZE~0); {286#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:40:16,432 INFO L256 TraceCheckUtils]: 16: Hoare triple {286#(= main_~sum~0 (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == ~sum~0 then 1bv32 else 0bv32)); {317#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:40:16,433 INFO L273 TraceCheckUtils]: 17: Hoare triple {317#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {321#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:40:16,434 INFO L273 TraceCheckUtils]: 18: Hoare triple {321#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {264#false} is VALID [2018-11-23 10:40:16,434 INFO L273 TraceCheckUtils]: 19: Hoare triple {264#false} assume !false; {264#false} is VALID [2018-11-23 10:40:16,439 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 10:40:16,439 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:40:16,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:40:16,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 10:40:16,445 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 10:40:16,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:40:16,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 10:40:16,508 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:40:16,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 10:40:16,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 10:40:16,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 10:40:16,510 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 5 states. [2018-11-23 10:40:17,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:17,197 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-11-23 10:40:17,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 10:40:17,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 10:40:17,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:40:17,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 10:40:17,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2018-11-23 10:40:17,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 10:40:17,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 45 transitions. [2018-11-23 10:40:17,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 45 transitions. [2018-11-23 10:40:17,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:40:17,322 INFO L225 Difference]: With dead ends: 38 [2018-11-23 10:40:17,323 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 10:40:17,324 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:40:17,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 10:40:17,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-23 10:40:17,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:40:17,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-23 10:40:17,349 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 10:40:17,349 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 10:40:17,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:17,353 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-11-23 10:40:17,353 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-23 10:40:17,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:40:17,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:40:17,354 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-23 10:40:17,355 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-23 10:40:17,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:17,358 INFO L93 Difference]: Finished difference Result 33 states and 40 transitions. [2018-11-23 10:40:17,358 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-23 10:40:17,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:40:17,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:40:17,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:40:17,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:40:17,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 10:40:17,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2018-11-23 10:40:17,365 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 20 [2018-11-23 10:40:17,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:40:17,365 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2018-11-23 10:40:17,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 10:40:17,366 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2018-11-23 10:40:17,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 10:40:17,367 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:40:17,367 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 10:40:17,367 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:40:17,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:40:17,368 INFO L82 PathProgramCache]: Analyzing trace with hash -573455021, now seen corresponding path program 1 times [2018-11-23 10:40:17,371 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:40:17,371 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:40:17,400 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:40:17,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:40:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:40:17,464 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:40:17,621 INFO L256 TraceCheckUtils]: 0: Hoare triple {498#true} call ULTIMATE.init(); {498#true} is VALID [2018-11-23 10:40:17,621 INFO L273 TraceCheckUtils]: 1: Hoare triple {498#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {498#true} is VALID [2018-11-23 10:40:17,622 INFO L273 TraceCheckUtils]: 2: Hoare triple {498#true} assume true; {498#true} is VALID [2018-11-23 10:40:17,622 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {498#true} {498#true} #97#return; {498#true} is VALID [2018-11-23 10:40:17,622 INFO L256 TraceCheckUtils]: 4: Hoare triple {498#true} call #t~ret11 := main(); {498#true} is VALID [2018-11-23 10:40:17,622 INFO L273 TraceCheckUtils]: 5: Hoare triple {498#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {498#true} is VALID [2018-11-23 10:40:17,627 INFO L273 TraceCheckUtils]: 6: Hoare triple {498#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~sum~0 := 0bv32;~i~0 := 0bv32; {521#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:40:17,633 INFO L273 TraceCheckUtils]: 7: Hoare triple {521#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {499#false} is VALID [2018-11-23 10:40:17,633 INFO L273 TraceCheckUtils]: 8: Hoare triple {499#false} ~i~0 := 0bv32; {499#false} is VALID [2018-11-23 10:40:17,633 INFO L273 TraceCheckUtils]: 9: Hoare triple {499#false} assume !~bvslt32(~i~0, ~SIZE~0); {499#false} is VALID [2018-11-23 10:40:17,634 INFO L273 TraceCheckUtils]: 10: Hoare triple {499#false} ~i~0 := 0bv32; {499#false} is VALID [2018-11-23 10:40:17,634 INFO L273 TraceCheckUtils]: 11: Hoare triple {499#false} assume !~bvslt32(~i~0, ~SIZE~0); {499#false} is VALID [2018-11-23 10:40:17,634 INFO L273 TraceCheckUtils]: 12: Hoare triple {499#false} ~i~0 := 0bv32; {499#false} is VALID [2018-11-23 10:40:17,635 INFO L273 TraceCheckUtils]: 13: Hoare triple {499#false} assume !~bvslt32(~i~0, ~SIZE~0); {499#false} is VALID [2018-11-23 10:40:17,635 INFO L273 TraceCheckUtils]: 14: Hoare triple {499#false} ~i~0 := 0bv32; {499#false} is VALID [2018-11-23 10:40:17,635 INFO L273 TraceCheckUtils]: 15: Hoare triple {499#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem10);havoc #t~mem10; {499#false} is VALID [2018-11-23 10:40:17,636 INFO L273 TraceCheckUtils]: 16: Hoare triple {499#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {499#false} is VALID [2018-11-23 10:40:17,636 INFO L273 TraceCheckUtils]: 17: Hoare triple {499#false} assume !~bvslt32(~i~0, ~SIZE~0); {499#false} is VALID [2018-11-23 10:40:17,636 INFO L256 TraceCheckUtils]: 18: Hoare triple {499#false} call __VERIFIER_assert((if 0bv32 == ~sum~0 then 1bv32 else 0bv32)); {499#false} is VALID [2018-11-23 10:40:17,637 INFO L273 TraceCheckUtils]: 19: Hoare triple {499#false} ~cond := #in~cond; {499#false} is VALID [2018-11-23 10:40:17,637 INFO L273 TraceCheckUtils]: 20: Hoare triple {499#false} assume 0bv32 == ~cond; {499#false} is VALID [2018-11-23 10:40:17,637 INFO L273 TraceCheckUtils]: 21: Hoare triple {499#false} assume !false; {499#false} is VALID [2018-11-23 10:40:17,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 10:40:17,639 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (4)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:40:17,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:40:17,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:40:17,646 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:40:17,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:40:17,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:40:17,739 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 10:40:17,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:40:17,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:40:17,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:40:17,740 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 3 states. [2018-11-23 10:40:18,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:18,005 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2018-11-23 10:40:18,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:40:18,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-23 10:40:18,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:40:18,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:40:18,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2018-11-23 10:40:18,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:40:18,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 53 transitions. [2018-11-23 10:40:18,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 53 transitions. [2018-11-23 10:40:18,123 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:40:18,126 INFO L225 Difference]: With dead ends: 59 [2018-11-23 10:40:18,126 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 10:40:18,127 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 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 10:40:18,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 10:40:18,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-11-23 10:40:18,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:40:18,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2018-11-23 10:40:18,158 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2018-11-23 10:40:18,158 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2018-11-23 10:40:18,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:18,162 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-23 10:40:18,162 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 10:40:18,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:40:18,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:40:18,163 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2018-11-23 10:40:18,163 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2018-11-23 10:40:18,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:18,166 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2018-11-23 10:40:18,166 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-11-23 10:40:18,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:40:18,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:40:18,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:40:18,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:40:18,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 10:40:18,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2018-11-23 10:40:18,170 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 22 [2018-11-23 10:40:18,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:40:18,170 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2018-11-23 10:40:18,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:40:18,170 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2018-11-23 10:40:18,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 10:40:18,171 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:40:18,172 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, 1, 1] [2018-11-23 10:40:18,172 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:40:18,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:40:18,172 INFO L82 PathProgramCache]: Analyzing trace with hash 2038931473, now seen corresponding path program 1 times [2018-11-23 10:40:18,173 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:40:18,173 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:40:18,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:40:18,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:40:18,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:40:18,239 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:40:18,352 INFO L256 TraceCheckUtils]: 0: Hoare triple {771#true} call ULTIMATE.init(); {771#true} is VALID [2018-11-23 10:40:18,352 INFO L273 TraceCheckUtils]: 1: Hoare triple {771#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {771#true} is VALID [2018-11-23 10:40:18,353 INFO L273 TraceCheckUtils]: 2: Hoare triple {771#true} assume true; {771#true} is VALID [2018-11-23 10:40:18,353 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {771#true} {771#true} #97#return; {771#true} is VALID [2018-11-23 10:40:18,354 INFO L256 TraceCheckUtils]: 4: Hoare triple {771#true} call #t~ret11 := main(); {771#true} is VALID [2018-11-23 10:40:18,354 INFO L273 TraceCheckUtils]: 5: Hoare triple {771#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {771#true} is VALID [2018-11-23 10:40:18,355 INFO L273 TraceCheckUtils]: 6: Hoare triple {771#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~sum~0 := 0bv32;~i~0 := 0bv32; {794#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:40:18,357 INFO L273 TraceCheckUtils]: 7: Hoare triple {794#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {794#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:40:18,357 INFO L273 TraceCheckUtils]: 8: Hoare triple {794#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {801#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:40:18,358 INFO L273 TraceCheckUtils]: 9: Hoare triple {801#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {772#false} is VALID [2018-11-23 10:40:18,359 INFO L273 TraceCheckUtils]: 10: Hoare triple {772#false} ~i~0 := 0bv32; {772#false} is VALID [2018-11-23 10:40:18,359 INFO L273 TraceCheckUtils]: 11: Hoare triple {772#false} assume !~bvslt32(~i~0, ~SIZE~0); {772#false} is VALID [2018-11-23 10:40:18,360 INFO L273 TraceCheckUtils]: 12: Hoare triple {772#false} ~i~0 := 0bv32; {772#false} is VALID [2018-11-23 10:40:18,360 INFO L273 TraceCheckUtils]: 13: Hoare triple {772#false} assume !~bvslt32(~i~0, ~SIZE~0); {772#false} is VALID [2018-11-23 10:40:18,360 INFO L273 TraceCheckUtils]: 14: Hoare triple {772#false} ~i~0 := 0bv32; {772#false} is VALID [2018-11-23 10:40:18,361 INFO L273 TraceCheckUtils]: 15: Hoare triple {772#false} assume !~bvslt32(~i~0, ~SIZE~0); {772#false} is VALID [2018-11-23 10:40:18,361 INFO L273 TraceCheckUtils]: 16: Hoare triple {772#false} ~i~0 := 0bv32; {772#false} is VALID [2018-11-23 10:40:18,361 INFO L273 TraceCheckUtils]: 17: Hoare triple {772#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem10);havoc #t~mem10; {772#false} is VALID [2018-11-23 10:40:18,362 INFO L273 TraceCheckUtils]: 18: Hoare triple {772#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {772#false} is VALID [2018-11-23 10:40:18,362 INFO L273 TraceCheckUtils]: 19: Hoare triple {772#false} assume !~bvslt32(~i~0, ~SIZE~0); {772#false} is VALID [2018-11-23 10:40:18,362 INFO L256 TraceCheckUtils]: 20: Hoare triple {772#false} call __VERIFIER_assert((if 0bv32 == ~sum~0 then 1bv32 else 0bv32)); {772#false} is VALID [2018-11-23 10:40:18,362 INFO L273 TraceCheckUtils]: 21: Hoare triple {772#false} ~cond := #in~cond; {772#false} is VALID [2018-11-23 10:40:18,363 INFO L273 TraceCheckUtils]: 22: Hoare triple {772#false} assume 0bv32 == ~cond; {772#false} is VALID [2018-11-23 10:40:18,363 INFO L273 TraceCheckUtils]: 23: Hoare triple {772#false} assume !false; {772#false} is VALID [2018-11-23 10:40:18,365 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 10:40:18,365 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:40:18,490 INFO L273 TraceCheckUtils]: 23: Hoare triple {772#false} assume !false; {772#false} is VALID [2018-11-23 10:40:18,490 INFO L273 TraceCheckUtils]: 22: Hoare triple {772#false} assume 0bv32 == ~cond; {772#false} is VALID [2018-11-23 10:40:18,491 INFO L273 TraceCheckUtils]: 21: Hoare triple {772#false} ~cond := #in~cond; {772#false} is VALID [2018-11-23 10:40:18,491 INFO L256 TraceCheckUtils]: 20: Hoare triple {772#false} call __VERIFIER_assert((if 0bv32 == ~sum~0 then 1bv32 else 0bv32)); {772#false} is VALID [2018-11-23 10:40:18,492 INFO L273 TraceCheckUtils]: 19: Hoare triple {772#false} assume !~bvslt32(~i~0, ~SIZE~0); {772#false} is VALID [2018-11-23 10:40:18,492 INFO L273 TraceCheckUtils]: 18: Hoare triple {772#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {772#false} is VALID [2018-11-23 10:40:18,493 INFO L273 TraceCheckUtils]: 17: Hoare triple {772#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem10);havoc #t~mem10; {772#false} is VALID [2018-11-23 10:40:18,493 INFO L273 TraceCheckUtils]: 16: Hoare triple {772#false} ~i~0 := 0bv32; {772#false} is VALID [2018-11-23 10:40:18,493 INFO L273 TraceCheckUtils]: 15: Hoare triple {772#false} assume !~bvslt32(~i~0, ~SIZE~0); {772#false} is VALID [2018-11-23 10:40:18,494 INFO L273 TraceCheckUtils]: 14: Hoare triple {772#false} ~i~0 := 0bv32; {772#false} is VALID [2018-11-23 10:40:18,494 INFO L273 TraceCheckUtils]: 13: Hoare triple {772#false} assume !~bvslt32(~i~0, ~SIZE~0); {772#false} is VALID [2018-11-23 10:40:18,494 INFO L273 TraceCheckUtils]: 12: Hoare triple {772#false} ~i~0 := 0bv32; {772#false} is VALID [2018-11-23 10:40:18,494 INFO L273 TraceCheckUtils]: 11: Hoare triple {772#false} assume !~bvslt32(~i~0, ~SIZE~0); {772#false} is VALID [2018-11-23 10:40:18,495 INFO L273 TraceCheckUtils]: 10: Hoare triple {772#false} ~i~0 := 0bv32; {772#false} is VALID [2018-11-23 10:40:18,495 INFO L273 TraceCheckUtils]: 9: Hoare triple {889#(bvslt main_~i~0 ~SIZE~0)} assume !~bvslt32(~i~0, ~SIZE~0); {772#false} is VALID [2018-11-23 10:40:18,501 INFO L273 TraceCheckUtils]: 8: Hoare triple {893#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {889#(bvslt main_~i~0 ~SIZE~0)} is VALID [2018-11-23 10:40:18,501 INFO L273 TraceCheckUtils]: 7: Hoare triple {893#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} assume !!~bvslt32(~i~0, ~SIZE~0);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {893#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} is VALID [2018-11-23 10:40:18,506 INFO L273 TraceCheckUtils]: 6: Hoare triple {771#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~sum~0 := 0bv32;~i~0 := 0bv32; {893#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} is VALID [2018-11-23 10:40:18,506 INFO L273 TraceCheckUtils]: 5: Hoare triple {771#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {771#true} is VALID [2018-11-23 10:40:18,506 INFO L256 TraceCheckUtils]: 4: Hoare triple {771#true} call #t~ret11 := main(); {771#true} is VALID [2018-11-23 10:40:18,507 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {771#true} {771#true} #97#return; {771#true} is VALID [2018-11-23 10:40:18,507 INFO L273 TraceCheckUtils]: 2: Hoare triple {771#true} assume true; {771#true} is VALID [2018-11-23 10:40:18,507 INFO L273 TraceCheckUtils]: 1: Hoare triple {771#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {771#true} is VALID [2018-11-23 10:40:18,507 INFO L256 TraceCheckUtils]: 0: Hoare triple {771#true} call ULTIMATE.init(); {771#true} is VALID [2018-11-23 10:40:18,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 10:40:18,513 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:40:18,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:40:18,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-23 10:40:18,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:40:18,514 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:40:18,575 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:40:18,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:40:18,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:40:18,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:40:18,576 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand 6 states. [2018-11-23 10:40:19,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:19,227 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2018-11-23 10:40:19,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 10:40:19,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-23 10:40:19,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:40:19,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:40:19,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2018-11-23 10:40:19,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:40:19,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2018-11-23 10:40:19,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2018-11-23 10:40:19,377 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 10:40:19,379 INFO L225 Difference]: With dead ends: 61 [2018-11-23 10:40:19,380 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 10:40:19,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:40:19,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 10:40:19,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-23 10:40:19,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:40:19,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 36 states. [2018-11-23 10:40:19,405 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 36 states. [2018-11-23 10:40:19,405 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 36 states. [2018-11-23 10:40:19,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:19,407 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-23 10:40:19,407 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 10:40:19,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:40:19,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:40:19,408 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 37 states. [2018-11-23 10:40:19,408 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 37 states. [2018-11-23 10:40:19,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:19,411 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-23 10:40:19,411 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-23 10:40:19,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:40:19,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:40:19,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:40:19,412 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:40:19,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 10:40:19,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-11-23 10:40:19,415 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 24 [2018-11-23 10:40:19,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:40:19,415 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-11-23 10:40:19,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:40:19,415 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-11-23 10:40:19,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 10:40:19,416 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:40:19,417 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, 1] [2018-11-23 10:40:19,417 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:40:19,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:40:19,417 INFO L82 PathProgramCache]: Analyzing trace with hash -13515953, now seen corresponding path program 2 times [2018-11-23 10:40:19,418 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:40:19,418 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:40:19,436 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:40:19,472 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 10:40:19,472 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:40:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:40:19,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:40:19,605 INFO L256 TraceCheckUtils]: 0: Hoare triple {1135#true} call ULTIMATE.init(); {1135#true} is VALID [2018-11-23 10:40:19,606 INFO L273 TraceCheckUtils]: 1: Hoare triple {1135#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1135#true} is VALID [2018-11-23 10:40:19,606 INFO L273 TraceCheckUtils]: 2: Hoare triple {1135#true} assume true; {1135#true} is VALID [2018-11-23 10:40:19,607 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1135#true} {1135#true} #97#return; {1135#true} is VALID [2018-11-23 10:40:19,607 INFO L256 TraceCheckUtils]: 4: Hoare triple {1135#true} call #t~ret11 := main(); {1135#true} is VALID [2018-11-23 10:40:19,607 INFO L273 TraceCheckUtils]: 5: Hoare triple {1135#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1135#true} is VALID [2018-11-23 10:40:19,608 INFO L273 TraceCheckUtils]: 6: Hoare triple {1135#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~sum~0 := 0bv32;~i~0 := 0bv32; {1158#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:40:19,608 INFO L273 TraceCheckUtils]: 7: Hoare triple {1158#(bvsgt ~SIZE~0 (_ bv1 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1158#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:40:19,609 INFO L273 TraceCheckUtils]: 8: Hoare triple {1158#(bvsgt ~SIZE~0 (_ bv1 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1158#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:40:19,609 INFO L273 TraceCheckUtils]: 9: Hoare triple {1158#(bvsgt ~SIZE~0 (_ bv1 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1158#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:40:19,610 INFO L273 TraceCheckUtils]: 10: Hoare triple {1158#(bvsgt ~SIZE~0 (_ bv1 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1158#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:40:19,624 INFO L273 TraceCheckUtils]: 11: Hoare triple {1158#(bvsgt ~SIZE~0 (_ bv1 32))} assume !~bvslt32(~i~0, ~SIZE~0); {1158#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:40:19,625 INFO L273 TraceCheckUtils]: 12: Hoare triple {1158#(bvsgt ~SIZE~0 (_ bv1 32))} ~i~0 := 0bv32; {1177#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:40:19,626 INFO L273 TraceCheckUtils]: 13: Hoare triple {1177#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {1136#false} is VALID [2018-11-23 10:40:19,626 INFO L273 TraceCheckUtils]: 14: Hoare triple {1136#false} ~i~0 := 0bv32; {1136#false} is VALID [2018-11-23 10:40:19,626 INFO L273 TraceCheckUtils]: 15: Hoare triple {1136#false} assume !~bvslt32(~i~0, ~SIZE~0); {1136#false} is VALID [2018-11-23 10:40:19,627 INFO L273 TraceCheckUtils]: 16: Hoare triple {1136#false} ~i~0 := 0bv32; {1136#false} is VALID [2018-11-23 10:40:19,627 INFO L273 TraceCheckUtils]: 17: Hoare triple {1136#false} assume !~bvslt32(~i~0, ~SIZE~0); {1136#false} is VALID [2018-11-23 10:40:19,627 INFO L273 TraceCheckUtils]: 18: Hoare triple {1136#false} ~i~0 := 0bv32; {1136#false} is VALID [2018-11-23 10:40:19,627 INFO L273 TraceCheckUtils]: 19: Hoare triple {1136#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem10);havoc #t~mem10; {1136#false} is VALID [2018-11-23 10:40:19,628 INFO L273 TraceCheckUtils]: 20: Hoare triple {1136#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {1136#false} is VALID [2018-11-23 10:40:19,628 INFO L273 TraceCheckUtils]: 21: Hoare triple {1136#false} assume !~bvslt32(~i~0, ~SIZE~0); {1136#false} is VALID [2018-11-23 10:40:19,628 INFO L256 TraceCheckUtils]: 22: Hoare triple {1136#false} call __VERIFIER_assert((if 0bv32 == ~sum~0 then 1bv32 else 0bv32)); {1136#false} is VALID [2018-11-23 10:40:19,629 INFO L273 TraceCheckUtils]: 23: Hoare triple {1136#false} ~cond := #in~cond; {1136#false} is VALID [2018-11-23 10:40:19,629 INFO L273 TraceCheckUtils]: 24: Hoare triple {1136#false} assume 0bv32 == ~cond; {1136#false} is VALID [2018-11-23 10:40:19,629 INFO L273 TraceCheckUtils]: 25: Hoare triple {1136#false} assume !false; {1136#false} is VALID [2018-11-23 10:40:19,631 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 10:40:19,631 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:40:19,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:40:19,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 10:40:19,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-23 10:40:19,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:40:19,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 10:40:19,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:40:19,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 10:40:19,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 10:40:19,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:40:19,663 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 4 states. [2018-11-23 10:40:19,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:19,899 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2018-11-23 10:40:19,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 10:40:19,900 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-23 10:40:19,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:40:19,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:40:19,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2018-11-23 10:40:19,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:40:19,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 60 transitions. [2018-11-23 10:40:19,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 60 transitions. [2018-11-23 10:40:20,065 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:40:20,067 INFO L225 Difference]: With dead ends: 56 [2018-11-23 10:40:20,067 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 10:40:20,068 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 10:40:20,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 10:40:20,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-11-23 10:40:20,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:40:20,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 33 states. [2018-11-23 10:40:20,091 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 33 states. [2018-11-23 10:40:20,091 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 33 states. [2018-11-23 10:40:20,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:20,094 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 10:40:20,094 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 10:40:20,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:40:20,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:40:20,096 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 37 states. [2018-11-23 10:40:20,096 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 37 states. [2018-11-23 10:40:20,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:20,098 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-23 10:40:20,098 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-23 10:40:20,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:40:20,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:40:20,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:40:20,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:40:20,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 10:40:20,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-23 10:40:20,101 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 26 [2018-11-23 10:40:20,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:40:20,101 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-23 10:40:20,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 10:40:20,102 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 10:40:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 10:40:20,103 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:40:20,103 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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:40:20,103 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:40:20,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:40:20,103 INFO L82 PathProgramCache]: Analyzing trace with hash -376037751, now seen corresponding path program 1 times [2018-11-23 10:40:20,104 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:40:20,104 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:40:20,125 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:40:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:40:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:40:20,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:40:20,389 INFO L256 TraceCheckUtils]: 0: Hoare triple {1421#true} call ULTIMATE.init(); {1421#true} is VALID [2018-11-23 10:40:20,390 INFO L273 TraceCheckUtils]: 1: Hoare triple {1421#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1421#true} is VALID [2018-11-23 10:40:20,390 INFO L273 TraceCheckUtils]: 2: Hoare triple {1421#true} assume true; {1421#true} is VALID [2018-11-23 10:40:20,391 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1421#true} {1421#true} #97#return; {1421#true} is VALID [2018-11-23 10:40:20,391 INFO L256 TraceCheckUtils]: 4: Hoare triple {1421#true} call #t~ret11 := main(); {1421#true} is VALID [2018-11-23 10:40:20,391 INFO L273 TraceCheckUtils]: 5: Hoare triple {1421#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1421#true} is VALID [2018-11-23 10:40:20,392 INFO L273 TraceCheckUtils]: 6: Hoare triple {1421#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~sum~0 := 0bv32;~i~0 := 0bv32; {1444#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:40:20,393 INFO L273 TraceCheckUtils]: 7: Hoare triple {1444#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1444#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:40:20,394 INFO L273 TraceCheckUtils]: 8: Hoare triple {1444#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1451#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:40:20,395 INFO L273 TraceCheckUtils]: 9: Hoare triple {1451#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1451#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:40:20,395 INFO L273 TraceCheckUtils]: 10: Hoare triple {1451#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1458#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 10:40:20,397 INFO L273 TraceCheckUtils]: 11: Hoare triple {1458#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume !~bvslt32(~i~0, ~SIZE~0); {1462#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:40:20,398 INFO L273 TraceCheckUtils]: 12: Hoare triple {1462#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)))} ~i~0 := 0bv32; {1466#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:40:20,399 INFO L273 TraceCheckUtils]: 13: Hoare triple {1466#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem4);havoc #t~mem4; {1466#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:40:20,400 INFO L273 TraceCheckUtils]: 14: Hoare triple {1466#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1473#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:40:20,401 INFO L273 TraceCheckUtils]: 15: Hoare triple {1473#(and (not (bvslt (_ bv2 32) ~SIZE~0)) (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {1422#false} is VALID [2018-11-23 10:40:20,402 INFO L273 TraceCheckUtils]: 16: Hoare triple {1422#false} ~i~0 := 0bv32; {1422#false} is VALID [2018-11-23 10:40:20,402 INFO L273 TraceCheckUtils]: 17: Hoare triple {1422#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem6);havoc #t~mem6; {1422#false} is VALID [2018-11-23 10:40:20,402 INFO L273 TraceCheckUtils]: 18: Hoare triple {1422#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1422#false} is VALID [2018-11-23 10:40:20,403 INFO L273 TraceCheckUtils]: 19: Hoare triple {1422#false} assume !~bvslt32(~i~0, ~SIZE~0); {1422#false} is VALID [2018-11-23 10:40:20,403 INFO L273 TraceCheckUtils]: 20: Hoare triple {1422#false} ~i~0 := 0bv32; {1422#false} is VALID [2018-11-23 10:40:20,403 INFO L273 TraceCheckUtils]: 21: Hoare triple {1422#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem8);havoc #t~mem8; {1422#false} is VALID [2018-11-23 10:40:20,404 INFO L273 TraceCheckUtils]: 22: Hoare triple {1422#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {1422#false} is VALID [2018-11-23 10:40:20,404 INFO L273 TraceCheckUtils]: 23: Hoare triple {1422#false} assume !~bvslt32(~i~0, ~SIZE~0); {1422#false} is VALID [2018-11-23 10:40:20,405 INFO L273 TraceCheckUtils]: 24: Hoare triple {1422#false} ~i~0 := 0bv32; {1422#false} is VALID [2018-11-23 10:40:20,405 INFO L273 TraceCheckUtils]: 25: Hoare triple {1422#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem10);havoc #t~mem10; {1422#false} is VALID [2018-11-23 10:40:20,405 INFO L273 TraceCheckUtils]: 26: Hoare triple {1422#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {1422#false} is VALID [2018-11-23 10:40:20,406 INFO L273 TraceCheckUtils]: 27: Hoare triple {1422#false} assume !~bvslt32(~i~0, ~SIZE~0); {1422#false} is VALID [2018-11-23 10:40:20,406 INFO L256 TraceCheckUtils]: 28: Hoare triple {1422#false} call __VERIFIER_assert((if 0bv32 == ~sum~0 then 1bv32 else 0bv32)); {1422#false} is VALID [2018-11-23 10:40:20,406 INFO L273 TraceCheckUtils]: 29: Hoare triple {1422#false} ~cond := #in~cond; {1422#false} is VALID [2018-11-23 10:40:20,407 INFO L273 TraceCheckUtils]: 30: Hoare triple {1422#false} assume 0bv32 == ~cond; {1422#false} is VALID [2018-11-23 10:40:20,407 INFO L273 TraceCheckUtils]: 31: Hoare triple {1422#false} assume !false; {1422#false} is VALID [2018-11-23 10:40:20,410 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 10:40:20,410 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:40:20,879 INFO L273 TraceCheckUtils]: 31: Hoare triple {1422#false} assume !false; {1422#false} is VALID [2018-11-23 10:40:20,880 INFO L273 TraceCheckUtils]: 30: Hoare triple {1422#false} assume 0bv32 == ~cond; {1422#false} is VALID [2018-11-23 10:40:20,880 INFO L273 TraceCheckUtils]: 29: Hoare triple {1422#false} ~cond := #in~cond; {1422#false} is VALID [2018-11-23 10:40:20,881 INFO L256 TraceCheckUtils]: 28: Hoare triple {1422#false} call __VERIFIER_assert((if 0bv32 == ~sum~0 then 1bv32 else 0bv32)); {1422#false} is VALID [2018-11-23 10:40:20,881 INFO L273 TraceCheckUtils]: 27: Hoare triple {1422#false} assume !~bvslt32(~i~0, ~SIZE~0); {1422#false} is VALID [2018-11-23 10:40:20,881 INFO L273 TraceCheckUtils]: 26: Hoare triple {1422#false} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {1422#false} is VALID [2018-11-23 10:40:20,882 INFO L273 TraceCheckUtils]: 25: Hoare triple {1422#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem10);havoc #t~mem10; {1422#false} is VALID [2018-11-23 10:40:20,882 INFO L273 TraceCheckUtils]: 24: Hoare triple {1422#false} ~i~0 := 0bv32; {1422#false} is VALID [2018-11-23 10:40:20,882 INFO L273 TraceCheckUtils]: 23: Hoare triple {1422#false} assume !~bvslt32(~i~0, ~SIZE~0); {1422#false} is VALID [2018-11-23 10:40:20,883 INFO L273 TraceCheckUtils]: 22: Hoare triple {1422#false} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {1422#false} is VALID [2018-11-23 10:40:20,883 INFO L273 TraceCheckUtils]: 21: Hoare triple {1422#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem8);havoc #t~mem8; {1422#false} is VALID [2018-11-23 10:40:20,883 INFO L273 TraceCheckUtils]: 20: Hoare triple {1422#false} ~i~0 := 0bv32; {1422#false} is VALID [2018-11-23 10:40:20,883 INFO L273 TraceCheckUtils]: 19: Hoare triple {1422#false} assume !~bvslt32(~i~0, ~SIZE~0); {1422#false} is VALID [2018-11-23 10:40:20,884 INFO L273 TraceCheckUtils]: 18: Hoare triple {1422#false} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {1422#false} is VALID [2018-11-23 10:40:20,884 INFO L273 TraceCheckUtils]: 17: Hoare triple {1422#false} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem6);havoc #t~mem6; {1422#false} is VALID [2018-11-23 10:40:20,884 INFO L273 TraceCheckUtils]: 16: Hoare triple {1422#false} ~i~0 := 0bv32; {1422#false} is VALID [2018-11-23 10:40:20,884 INFO L273 TraceCheckUtils]: 15: Hoare triple {1573#(bvslt main_~i~0 ~SIZE~0)} assume !~bvslt32(~i~0, ~SIZE~0); {1422#false} is VALID [2018-11-23 10:40:20,886 INFO L273 TraceCheckUtils]: 14: Hoare triple {1577#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {1573#(bvslt main_~i~0 ~SIZE~0)} is VALID [2018-11-23 10:40:20,886 INFO L273 TraceCheckUtils]: 13: Hoare triple {1577#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem4);havoc #t~mem4; {1577#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} is VALID [2018-11-23 10:40:20,887 INFO L273 TraceCheckUtils]: 12: Hoare triple {1584#(bvslt (_ bv1 32) ~SIZE~0)} ~i~0 := 0bv32; {1577#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} is VALID [2018-11-23 10:40:20,887 INFO L273 TraceCheckUtils]: 11: Hoare triple {1588#(or (bvslt (_ bv1 32) ~SIZE~0) (bvslt main_~i~0 ~SIZE~0))} assume !~bvslt32(~i~0, ~SIZE~0); {1584#(bvslt (_ bv1 32) ~SIZE~0)} is VALID [2018-11-23 10:40:20,889 INFO L273 TraceCheckUtils]: 10: Hoare triple {1592#(or (bvslt (_ bv1 32) ~SIZE~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1588#(or (bvslt (_ bv1 32) ~SIZE~0) (bvslt main_~i~0 ~SIZE~0))} is VALID [2018-11-23 10:40:20,890 INFO L273 TraceCheckUtils]: 9: Hoare triple {1592#(or (bvslt (_ bv1 32) ~SIZE~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1592#(or (bvslt (_ bv1 32) ~SIZE~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-23 10:40:20,910 INFO L273 TraceCheckUtils]: 8: Hoare triple {1599#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (bvslt (_ bv1 32) ~SIZE~0))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1592#(or (bvslt (_ bv1 32) ~SIZE~0) (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0))} is VALID [2018-11-23 10:40:20,910 INFO L273 TraceCheckUtils]: 7: Hoare triple {1599#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (bvslt (_ bv1 32) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1599#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (bvslt (_ bv1 32) ~SIZE~0))} is VALID [2018-11-23 10:40:20,911 INFO L273 TraceCheckUtils]: 6: Hoare triple {1421#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~sum~0 := 0bv32;~i~0 := 0bv32; {1599#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0) (bvslt (_ bv1 32) ~SIZE~0))} is VALID [2018-11-23 10:40:20,911 INFO L273 TraceCheckUtils]: 5: Hoare triple {1421#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {1421#true} is VALID [2018-11-23 10:40:20,911 INFO L256 TraceCheckUtils]: 4: Hoare triple {1421#true} call #t~ret11 := main(); {1421#true} is VALID [2018-11-23 10:40:20,912 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1421#true} {1421#true} #97#return; {1421#true} is VALID [2018-11-23 10:40:20,912 INFO L273 TraceCheckUtils]: 2: Hoare triple {1421#true} assume true; {1421#true} is VALID [2018-11-23 10:40:20,912 INFO L273 TraceCheckUtils]: 1: Hoare triple {1421#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {1421#true} is VALID [2018-11-23 10:40:20,912 INFO L256 TraceCheckUtils]: 0: Hoare triple {1421#true} call ULTIMATE.init(); {1421#true} is VALID [2018-11-23 10:40:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 10:40:20,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:40:20,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 10:40:20,918 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-11-23 10:40:20,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:40:20,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 10:40:21,034 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:40:21,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 10:40:21,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 10:40:21,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-11-23 10:40:21,035 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 14 states. [2018-11-23 10:40:22,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:22,868 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2018-11-23 10:40:22,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:40:22,868 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-11-23 10:40:22,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:40:22,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 10:40:22,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 124 transitions. [2018-11-23 10:40:22,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 10:40:22,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 124 transitions. [2018-11-23 10:40:22,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 124 transitions. [2018-11-23 10:40:23,215 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:40:23,218 INFO L225 Difference]: With dead ends: 104 [2018-11-23 10:40:23,218 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 10:40:23,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-11-23 10:40:23,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 10:40:23,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 73. [2018-11-23 10:40:23,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:40:23,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 73 states. [2018-11-23 10:40:23,324 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 73 states. [2018-11-23 10:40:23,324 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 73 states. [2018-11-23 10:40:23,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:23,330 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-11-23 10:40:23,330 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2018-11-23 10:40:23,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:40:23,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:40:23,331 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 85 states. [2018-11-23 10:40:23,335 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 85 states. [2018-11-23 10:40:23,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:40:23,339 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2018-11-23 10:40:23,339 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2018-11-23 10:40:23,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:40:23,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:40:23,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:40:23,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:40:23,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-23 10:40:23,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2018-11-23 10:40:23,343 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 32 [2018-11-23 10:40:23,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:40:23,343 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2018-11-23 10:40:23,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 10:40:23,344 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2018-11-23 10:40:23,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 10:40:23,345 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:40:23,345 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:40:23,345 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:40:23,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:40:23,346 INFO L82 PathProgramCache]: Analyzing trace with hash -740334591, now seen corresponding path program 2 times [2018-11-23 10:40:23,346 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:40:23,346 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:40:23,372 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:40:23,497 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:40:23,497 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:40:25,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:40:25,520 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:40:25,885 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-11-23 10:40:26,349 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2018-11-23 10:40:26,359 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2018-11-23 10:40:26,404 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:40:26,415 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:40:26,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 10:40:26,420 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:25, output treesize:9 [2018-11-23 10:40:26,583 INFO L256 TraceCheckUtils]: 0: Hoare triple {2065#true} call ULTIMATE.init(); {2065#true} is VALID [2018-11-23 10:40:26,584 INFO L273 TraceCheckUtils]: 1: Hoare triple {2065#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {2065#true} is VALID [2018-11-23 10:40:26,584 INFO L273 TraceCheckUtils]: 2: Hoare triple {2065#true} assume true; {2065#true} is VALID [2018-11-23 10:40:26,584 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2065#true} {2065#true} #97#return; {2065#true} is VALID [2018-11-23 10:40:26,584 INFO L256 TraceCheckUtils]: 4: Hoare triple {2065#true} call #t~ret11 := main(); {2065#true} is VALID [2018-11-23 10:40:26,585 INFO L273 TraceCheckUtils]: 5: Hoare triple {2065#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2065#true} is VALID [2018-11-23 10:40:26,591 INFO L273 TraceCheckUtils]: 6: Hoare triple {2065#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~sum~0 := 0bv32;~i~0 := 0bv32; {2088#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} is VALID [2018-11-23 10:40:26,592 INFO L273 TraceCheckUtils]: 7: Hoare triple {2088#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2088#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} is VALID [2018-11-23 10:40:26,592 INFO L273 TraceCheckUtils]: 8: Hoare triple {2088#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2088#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} is VALID [2018-11-23 10:40:26,596 INFO L273 TraceCheckUtils]: 9: Hoare triple {2088#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2088#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} is VALID [2018-11-23 10:40:26,600 INFO L273 TraceCheckUtils]: 10: Hoare triple {2088#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2088#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} is VALID [2018-11-23 10:40:26,600 INFO L273 TraceCheckUtils]: 11: Hoare triple {2088#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {2088#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} is VALID [2018-11-23 10:40:26,601 INFO L273 TraceCheckUtils]: 12: Hoare triple {2088#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} ~i~0 := 0bv32; {2107#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} is VALID [2018-11-23 10:40:26,602 INFO L273 TraceCheckUtils]: 13: Hoare triple {2107#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem4);havoc #t~mem4; {2111#(and (= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:40:26,603 INFO L273 TraceCheckUtils]: 14: Hoare triple {2111#(and (= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2115#(and (= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:40:26,627 INFO L273 TraceCheckUtils]: 15: Hoare triple {2115#(and (= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem4);havoc #t~mem4; {2119#(and (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:40:26,628 INFO L273 TraceCheckUtils]: 16: Hoare triple {2119#(and (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= |main_~#a~0.offset| (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2119#(and (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:40:26,628 INFO L273 TraceCheckUtils]: 17: Hoare triple {2119#(and (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= |main_~#a~0.offset| (_ bv0 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {2119#(and (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:40:26,629 INFO L273 TraceCheckUtils]: 18: Hoare triple {2119#(and (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= |main_~#a~0.offset| (_ bv0 32)))} ~i~0 := 0bv32; {2129#(and (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:40:26,716 INFO L273 TraceCheckUtils]: 19: Hoare triple {2129#(and (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem6);havoc #t~mem6; {2133#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:40:26,718 INFO L273 TraceCheckUtils]: 20: Hoare triple {2133#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2137#(and (= main_~sum~0 (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:40:26,733 INFO L273 TraceCheckUtils]: 21: Hoare triple {2137#(and (= main_~sum~0 (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem6);havoc #t~mem6; {2088#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} is VALID [2018-11-23 10:40:26,734 INFO L273 TraceCheckUtils]: 22: Hoare triple {2088#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2088#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} is VALID [2018-11-23 10:40:26,734 INFO L273 TraceCheckUtils]: 23: Hoare triple {2088#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {2088#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} is VALID [2018-11-23 10:40:26,735 INFO L273 TraceCheckUtils]: 24: Hoare triple {2088#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} ~i~0 := 0bv32; {2107#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} is VALID [2018-11-23 10:40:26,735 INFO L273 TraceCheckUtils]: 25: Hoare triple {2107#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem8);havoc #t~mem8; {2111#(and (= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:40:26,736 INFO L273 TraceCheckUtils]: 26: Hoare triple {2111#(and (= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {2115#(and (= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:40:26,760 INFO L273 TraceCheckUtils]: 27: Hoare triple {2115#(and (= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem8);havoc #t~mem8; {2119#(and (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:40:26,761 INFO L273 TraceCheckUtils]: 28: Hoare triple {2119#(and (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= |main_~#a~0.offset| (_ bv0 32)))} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {2119#(and (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:40:26,762 INFO L273 TraceCheckUtils]: 29: Hoare triple {2119#(and (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= |main_~#a~0.offset| (_ bv0 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {2119#(and (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:40:26,762 INFO L273 TraceCheckUtils]: 30: Hoare triple {2119#(and (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= |main_~#a~0.offset| (_ bv0 32)))} ~i~0 := 0bv32; {2129#(and (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:40:26,846 INFO L273 TraceCheckUtils]: 31: Hoare triple {2129#(and (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem10);havoc #t~mem10; {2133#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:40:26,857 INFO L273 TraceCheckUtils]: 32: Hoare triple {2133#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {2137#(and (= main_~sum~0 (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:40:26,870 INFO L273 TraceCheckUtils]: 33: Hoare triple {2137#(and (= main_~sum~0 (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem10);havoc #t~mem10; {2177#(exists ((v_arrayElimCell_2 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32))) (= (bvadd (bvneg v_arrayElimCell_2) (bvneg v_arrayElimCell_3) v_arrayElimCell_2 v_arrayElimCell_3) main_~sum~0))} is VALID [2018-11-23 10:40:26,871 INFO L273 TraceCheckUtils]: 34: Hoare triple {2177#(exists ((v_arrayElimCell_2 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32))) (= (bvadd (bvneg v_arrayElimCell_2) (bvneg v_arrayElimCell_3) v_arrayElimCell_2 v_arrayElimCell_3) main_~sum~0))} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {2177#(exists ((v_arrayElimCell_2 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32))) (= (bvadd (bvneg v_arrayElimCell_2) (bvneg v_arrayElimCell_3) v_arrayElimCell_2 v_arrayElimCell_3) main_~sum~0))} is VALID [2018-11-23 10:40:26,871 INFO L273 TraceCheckUtils]: 35: Hoare triple {2177#(exists ((v_arrayElimCell_2 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32))) (= (bvadd (bvneg v_arrayElimCell_2) (bvneg v_arrayElimCell_3) v_arrayElimCell_2 v_arrayElimCell_3) main_~sum~0))} assume !~bvslt32(~i~0, ~SIZE~0); {2177#(exists ((v_arrayElimCell_2 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32))) (= (bvadd (bvneg v_arrayElimCell_2) (bvneg v_arrayElimCell_3) v_arrayElimCell_2 v_arrayElimCell_3) main_~sum~0))} is VALID [2018-11-23 10:40:26,872 INFO L256 TraceCheckUtils]: 36: Hoare triple {2177#(exists ((v_arrayElimCell_2 (_ BitVec 32)) (v_arrayElimCell_3 (_ BitVec 32))) (= (bvadd (bvneg v_arrayElimCell_2) (bvneg v_arrayElimCell_3) v_arrayElimCell_2 v_arrayElimCell_3) main_~sum~0))} call __VERIFIER_assert((if 0bv32 == ~sum~0 then 1bv32 else 0bv32)); {2187#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:40:26,872 INFO L273 TraceCheckUtils]: 37: Hoare triple {2187#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {2191#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:40:26,873 INFO L273 TraceCheckUtils]: 38: Hoare triple {2191#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {2066#false} is VALID [2018-11-23 10:40:26,873 INFO L273 TraceCheckUtils]: 39: Hoare triple {2066#false} assume !false; {2066#false} is VALID [2018-11-23 10:40:26,880 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 10:40:26,881 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:40:30,374 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 29 [2018-11-23 10:40:34,390 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:40:34,428 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:40:34,501 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 82 [2018-11-23 10:40:37,469 INFO L267 ElimStorePlain]: Start of recursive call 3: 13 dim-0 vars, End of recursive call: 13 dim-0 vars, and 16 xjuncts. [2018-11-23 10:40:37,558 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 10:40:37,572 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-23 10:40:37,572 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:21 [2018-11-23 10:40:37,636 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:40:37,636 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#a~0.base|]. (= (let ((.cse1 (bvmul (_ bv4 32) main_~i~0)) (.cse0 (select |#memory_int| |main_~#a~0.base|))) (bvadd (bvneg (select .cse0 |main_~#a~0.offset|)) (select .cse0 (bvadd |main_~#a~0.offset| .cse1 (_ bv4 32))) (select .cse0 (bvadd |main_~#a~0.offset| .cse1)) main_~sum~0 (bvneg (select .cse0 (bvadd |main_~#a~0.offset| (_ bv4 32)))))) (_ bv0 32)) [2018-11-23 10:40:37,637 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_prenex_9, v_prenex_10]. (and (= (_ bv0 32) (bvadd main_~sum~0 v_prenex_9 (bvneg v_prenex_9) v_prenex_10 (bvneg v_prenex_10))) (= (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)) (bvadd |main_~#a~0.offset| (_ bv4 32)))) [2018-11-23 10:40:37,852 INFO L273 TraceCheckUtils]: 39: Hoare triple {2066#false} assume !false; {2066#false} is VALID [2018-11-23 10:40:37,853 INFO L273 TraceCheckUtils]: 38: Hoare triple {2201#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {2066#false} is VALID [2018-11-23 10:40:37,853 INFO L273 TraceCheckUtils]: 37: Hoare triple {2205#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {2201#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:40:37,854 INFO L256 TraceCheckUtils]: 36: Hoare triple {2209#(= main_~sum~0 (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == ~sum~0 then 1bv32 else 0bv32)); {2205#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:40:37,855 INFO L273 TraceCheckUtils]: 35: Hoare triple {2209#(= main_~sum~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~SIZE~0); {2209#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:40:37,855 INFO L273 TraceCheckUtils]: 34: Hoare triple {2209#(= main_~sum~0 (_ bv0 32))} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {2209#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:40:37,856 INFO L273 TraceCheckUtils]: 33: Hoare triple {2219#(= (_ bv0 32) (bvadd main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem10);havoc #t~mem10; {2209#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:40:38,043 INFO L273 TraceCheckUtils]: 32: Hoare triple {2223#(= (bvadd main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))))) (_ bv0 32))} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {2219#(= (_ bv0 32) (bvadd main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))))} is VALID [2018-11-23 10:40:38,184 INFO L273 TraceCheckUtils]: 31: Hoare triple {2227#(= (bvadd main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem10);havoc #t~mem10; {2223#(= (bvadd main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))))) (_ bv0 32))} is VALID [2018-11-23 10:40:38,243 INFO L273 TraceCheckUtils]: 30: Hoare triple {2231#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))))} ~i~0 := 0bv32; {2227#(= (bvadd main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))) (_ bv0 32))} is VALID [2018-11-23 10:40:38,244 INFO L273 TraceCheckUtils]: 29: Hoare triple {2231#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))))} assume !~bvslt32(~i~0, ~SIZE~0); {2231#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))))} is VALID [2018-11-23 10:40:38,244 INFO L273 TraceCheckUtils]: 28: Hoare triple {2231#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))))} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {2231#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))))} is VALID [2018-11-23 10:40:39,525 INFO L273 TraceCheckUtils]: 27: Hoare triple {2241#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem8);havoc #t~mem8; {2231#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))))} is VALID [2018-11-23 10:40:41,554 INFO L273 TraceCheckUtils]: 26: Hoare triple {2245#(= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (_ bv0 32))} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {2241#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))))} is UNKNOWN [2018-11-23 10:40:43,562 INFO L273 TraceCheckUtils]: 25: Hoare triple {2249#(= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem8);havoc #t~mem8; {2245#(= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (_ bv0 32))} is UNKNOWN [2018-11-23 10:40:43,566 INFO L273 TraceCheckUtils]: 24: Hoare triple {2209#(= main_~sum~0 (_ bv0 32))} ~i~0 := 0bv32; {2249#(= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (_ bv0 32))} is VALID [2018-11-23 10:40:43,576 INFO L273 TraceCheckUtils]: 23: Hoare triple {2209#(= main_~sum~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~SIZE~0); {2209#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:40:43,579 INFO L273 TraceCheckUtils]: 22: Hoare triple {2209#(= main_~sum~0 (_ bv0 32))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2209#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:40:43,580 INFO L273 TraceCheckUtils]: 21: Hoare triple {2219#(= (_ bv0 32) (bvadd main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem6);havoc #t~mem6; {2209#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:40:43,788 INFO L273 TraceCheckUtils]: 20: Hoare triple {2223#(= (bvadd main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))))) (_ bv0 32))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2219#(= (_ bv0 32) (bvadd main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))))} is VALID [2018-11-23 10:40:43,974 INFO L273 TraceCheckUtils]: 19: Hoare triple {2227#(= (bvadd main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem6);havoc #t~mem6; {2223#(= (bvadd main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))))) (_ bv0 32))} is VALID [2018-11-23 10:40:44,023 INFO L273 TraceCheckUtils]: 18: Hoare triple {2231#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))))} ~i~0 := 0bv32; {2227#(= (bvadd main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))) (_ bv0 32))} is VALID [2018-11-23 10:40:44,024 INFO L273 TraceCheckUtils]: 17: Hoare triple {2231#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))))} assume !~bvslt32(~i~0, ~SIZE~0); {2231#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))))} is VALID [2018-11-23 10:40:44,024 INFO L273 TraceCheckUtils]: 16: Hoare triple {2231#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2231#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))))} is VALID [2018-11-23 10:40:45,517 INFO L273 TraceCheckUtils]: 15: Hoare triple {2241#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem4);havoc #t~mem4; {2231#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))))} is VALID [2018-11-23 10:40:47,524 INFO L273 TraceCheckUtils]: 14: Hoare triple {2245#(= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (_ bv0 32))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2241#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))))} is UNKNOWN [2018-11-23 10:40:47,526 INFO L273 TraceCheckUtils]: 13: Hoare triple {2286#(and (= (bvmul (_ bv4 32) main_~i~0) (_ bv0 32)) (forall ((v_prenex_10 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32))) (= (_ bv0 32) (bvadd v_prenex_10 main_~sum~0 v_prenex_9 (bvneg v_prenex_10) (bvneg v_prenex_9)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem4);havoc #t~mem4; {2245#(= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))))) (_ bv0 32))} is VALID [2018-11-23 10:40:47,527 INFO L273 TraceCheckUtils]: 12: Hoare triple {2209#(= main_~sum~0 (_ bv0 32))} ~i~0 := 0bv32; {2286#(and (= (bvmul (_ bv4 32) main_~i~0) (_ bv0 32)) (forall ((v_prenex_10 (_ BitVec 32)) (v_prenex_9 (_ BitVec 32))) (= (_ bv0 32) (bvadd v_prenex_10 main_~sum~0 v_prenex_9 (bvneg v_prenex_10) (bvneg v_prenex_9)))))} is VALID [2018-11-23 10:40:47,528 INFO L273 TraceCheckUtils]: 11: Hoare triple {2209#(= main_~sum~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~SIZE~0); {2209#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:40:47,528 INFO L273 TraceCheckUtils]: 10: Hoare triple {2209#(= main_~sum~0 (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2209#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:40:47,528 INFO L273 TraceCheckUtils]: 9: Hoare triple {2209#(= main_~sum~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2209#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:40:47,529 INFO L273 TraceCheckUtils]: 8: Hoare triple {2209#(= main_~sum~0 (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2209#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:40:47,529 INFO L273 TraceCheckUtils]: 7: Hoare triple {2209#(= main_~sum~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2209#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:40:47,530 INFO L273 TraceCheckUtils]: 6: Hoare triple {2065#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~sum~0 := 0bv32;~i~0 := 0bv32; {2209#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:40:47,530 INFO L273 TraceCheckUtils]: 5: Hoare triple {2065#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2065#true} is VALID [2018-11-23 10:40:47,530 INFO L256 TraceCheckUtils]: 4: Hoare triple {2065#true} call #t~ret11 := main(); {2065#true} is VALID [2018-11-23 10:40:47,531 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2065#true} {2065#true} #97#return; {2065#true} is VALID [2018-11-23 10:40:47,531 INFO L273 TraceCheckUtils]: 2: Hoare triple {2065#true} assume true; {2065#true} is VALID [2018-11-23 10:40:47,531 INFO L273 TraceCheckUtils]: 1: Hoare triple {2065#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {2065#true} is VALID [2018-11-23 10:40:47,532 INFO L256 TraceCheckUtils]: 0: Hoare triple {2065#true} call ULTIMATE.init(); {2065#true} is VALID [2018-11-23 10:40:47,537 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 10:40:47,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:40:47,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:40:47,539 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 40 [2018-11-23 10:40:47,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:40:47,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:40:57,228 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 66 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2018-11-23 10:40:57,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:40:57,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:40:57,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=483, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:40:57,230 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 24 states. [2018-11-23 10:41:00,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:41:00,906 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2018-11-23 10:41:00,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:41:00,906 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 40 [2018-11-23 10:41:00,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:41:00,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:41:00,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2018-11-23 10:41:00,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:41:00,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2018-11-23 10:41:00,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 60 transitions. [2018-11-23 10:41:01,267 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:41:01,269 INFO L225 Difference]: With dead ends: 90 [2018-11-23 10:41:01,269 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 10:41:01,270 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 53 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2018-11-23 10:41:01,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 10:41:01,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-11-23 10:41:01,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:41:01,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 61 states. [2018-11-23 10:41:01,332 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-23 10:41:01,332 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-23 10:41:01,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:41:01,334 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-11-23 10:41:01,335 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-11-23 10:41:01,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:41:01,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:41:01,335 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 61 states. [2018-11-23 10:41:01,335 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 61 states. [2018-11-23 10:41:01,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:41:01,337 INFO L93 Difference]: Finished difference Result 61 states and 67 transitions. [2018-11-23 10:41:01,338 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-11-23 10:41:01,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:41:01,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:41:01,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:41:01,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:41:01,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 10:41:01,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 67 transitions. [2018-11-23 10:41:01,341 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 67 transitions. Word has length 40 [2018-11-23 10:41:01,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:41:01,341 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 67 transitions. [2018-11-23 10:41:01,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:41:01,341 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 67 transitions. [2018-11-23 10:41:01,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 10:41:01,342 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:41:01,342 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:41:01,342 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:41:01,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:41:01,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1478751555, now seen corresponding path program 3 times [2018-11-23 10:41:01,343 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:41:01,343 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:41:01,367 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:41:01,598 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 10:41:01,598 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:41:01,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:41:01,652 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:41:01,857 INFO L256 TraceCheckUtils]: 0: Hoare triple {2679#true} call ULTIMATE.init(); {2679#true} is VALID [2018-11-23 10:41:01,857 INFO L273 TraceCheckUtils]: 1: Hoare triple {2679#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {2679#true} is VALID [2018-11-23 10:41:01,857 INFO L273 TraceCheckUtils]: 2: Hoare triple {2679#true} assume true; {2679#true} is VALID [2018-11-23 10:41:01,857 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2679#true} {2679#true} #97#return; {2679#true} is VALID [2018-11-23 10:41:01,857 INFO L256 TraceCheckUtils]: 4: Hoare triple {2679#true} call #t~ret11 := main(); {2679#true} is VALID [2018-11-23 10:41:01,858 INFO L273 TraceCheckUtils]: 5: Hoare triple {2679#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2679#true} is VALID [2018-11-23 10:41:01,858 INFO L273 TraceCheckUtils]: 6: Hoare triple {2679#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~sum~0 := 0bv32;~i~0 := 0bv32; {2702#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:41:01,858 INFO L273 TraceCheckUtils]: 7: Hoare triple {2702#(bvsgt ~SIZE~0 (_ bv1 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2702#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:41:01,859 INFO L273 TraceCheckUtils]: 8: Hoare triple {2702#(bvsgt ~SIZE~0 (_ bv1 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2702#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:41:01,859 INFO L273 TraceCheckUtils]: 9: Hoare triple {2702#(bvsgt ~SIZE~0 (_ bv1 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2702#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:41:01,859 INFO L273 TraceCheckUtils]: 10: Hoare triple {2702#(bvsgt ~SIZE~0 (_ bv1 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2702#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:41:01,860 INFO L273 TraceCheckUtils]: 11: Hoare triple {2702#(bvsgt ~SIZE~0 (_ bv1 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2702#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:41:01,860 INFO L273 TraceCheckUtils]: 12: Hoare triple {2702#(bvsgt ~SIZE~0 (_ bv1 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2702#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:41:01,860 INFO L273 TraceCheckUtils]: 13: Hoare triple {2702#(bvsgt ~SIZE~0 (_ bv1 32))} assume !~bvslt32(~i~0, ~SIZE~0); {2702#(bvsgt ~SIZE~0 (_ bv1 32))} is VALID [2018-11-23 10:41:01,861 INFO L273 TraceCheckUtils]: 14: Hoare triple {2702#(bvsgt ~SIZE~0 (_ bv1 32))} ~i~0 := 0bv32; {2727#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:41:01,861 INFO L273 TraceCheckUtils]: 15: Hoare triple {2727#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem4);havoc #t~mem4; {2727#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} is VALID [2018-11-23 10:41:01,862 INFO L273 TraceCheckUtils]: 16: Hoare triple {2727#(and (= main_~i~0 (_ bv0 32)) (bvsgt ~SIZE~0 (_ bv1 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2734#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:41:01,863 INFO L273 TraceCheckUtils]: 17: Hoare triple {2734#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem4);havoc #t~mem4; {2734#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:41:01,864 INFO L273 TraceCheckUtils]: 18: Hoare triple {2734#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2741#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 10:41:01,866 INFO L273 TraceCheckUtils]: 19: Hoare triple {2741#(and (bvsgt ~SIZE~0 (_ bv1 32)) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem4);havoc #t~mem4; {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:01,867 INFO L273 TraceCheckUtils]: 20: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:01,867 INFO L273 TraceCheckUtils]: 21: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} assume !~bvslt32(~i~0, ~SIZE~0); {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:01,868 INFO L273 TraceCheckUtils]: 22: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} ~i~0 := 0bv32; {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:01,868 INFO L273 TraceCheckUtils]: 23: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem6);havoc #t~mem6; {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:01,868 INFO L273 TraceCheckUtils]: 24: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:01,869 INFO L273 TraceCheckUtils]: 25: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem6);havoc #t~mem6; {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:01,869 INFO L273 TraceCheckUtils]: 26: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:01,869 INFO L273 TraceCheckUtils]: 27: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} assume !~bvslt32(~i~0, ~SIZE~0); {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:01,870 INFO L273 TraceCheckUtils]: 28: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} ~i~0 := 0bv32; {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:01,872 INFO L273 TraceCheckUtils]: 29: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem8);havoc #t~mem8; {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:01,872 INFO L273 TraceCheckUtils]: 30: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:01,873 INFO L273 TraceCheckUtils]: 31: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem8);havoc #t~mem8; {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:01,873 INFO L273 TraceCheckUtils]: 32: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:01,874 INFO L273 TraceCheckUtils]: 33: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} assume !~bvslt32(~i~0, ~SIZE~0); {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:01,875 INFO L273 TraceCheckUtils]: 34: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} ~i~0 := 0bv32; {2791#(and (= main_~i~0 (_ bv0 32)) (bvslt (_ bv2 32) ~SIZE~0))} is VALID [2018-11-23 10:41:01,875 INFO L273 TraceCheckUtils]: 35: Hoare triple {2791#(and (= main_~i~0 (_ bv0 32)) (bvslt (_ bv2 32) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem10);havoc #t~mem10; {2791#(and (= main_~i~0 (_ bv0 32)) (bvslt (_ bv2 32) ~SIZE~0))} is VALID [2018-11-23 10:41:01,876 INFO L273 TraceCheckUtils]: 36: Hoare triple {2791#(and (= main_~i~0 (_ bv0 32)) (bvslt (_ bv2 32) ~SIZE~0))} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {2798#(and (bvslt (_ bv2 32) ~SIZE~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:41:01,876 INFO L273 TraceCheckUtils]: 37: Hoare triple {2798#(and (bvslt (_ bv2 32) ~SIZE~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem10);havoc #t~mem10; {2798#(and (bvslt (_ bv2 32) ~SIZE~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:41:01,877 INFO L273 TraceCheckUtils]: 38: Hoare triple {2798#(and (bvslt (_ bv2 32) ~SIZE~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {2805#(and (= (_ bv2 32) main_~i~0) (bvslt (_ bv2 32) ~SIZE~0))} is VALID [2018-11-23 10:41:01,878 INFO L273 TraceCheckUtils]: 39: Hoare triple {2805#(and (= (_ bv2 32) main_~i~0) (bvslt (_ bv2 32) ~SIZE~0))} assume !~bvslt32(~i~0, ~SIZE~0); {2680#false} is VALID [2018-11-23 10:41:01,878 INFO L256 TraceCheckUtils]: 40: Hoare triple {2680#false} call __VERIFIER_assert((if 0bv32 == ~sum~0 then 1bv32 else 0bv32)); {2680#false} is VALID [2018-11-23 10:41:01,879 INFO L273 TraceCheckUtils]: 41: Hoare triple {2680#false} ~cond := #in~cond; {2680#false} is VALID [2018-11-23 10:41:01,879 INFO L273 TraceCheckUtils]: 42: Hoare triple {2680#false} assume 0bv32 == ~cond; {2680#false} is VALID [2018-11-23 10:41:01,879 INFO L273 TraceCheckUtils]: 43: Hoare triple {2680#false} assume !false; {2680#false} is VALID [2018-11-23 10:41:01,882 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 10:41:01,882 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:41:02,182 INFO L273 TraceCheckUtils]: 43: Hoare triple {2680#false} assume !false; {2680#false} is VALID [2018-11-23 10:41:02,182 INFO L273 TraceCheckUtils]: 42: Hoare triple {2680#false} assume 0bv32 == ~cond; {2680#false} is VALID [2018-11-23 10:41:02,182 INFO L273 TraceCheckUtils]: 41: Hoare triple {2680#false} ~cond := #in~cond; {2680#false} is VALID [2018-11-23 10:41:02,183 INFO L256 TraceCheckUtils]: 40: Hoare triple {2680#false} call __VERIFIER_assert((if 0bv32 == ~sum~0 then 1bv32 else 0bv32)); {2680#false} is VALID [2018-11-23 10:41:02,188 INFO L273 TraceCheckUtils]: 39: Hoare triple {2833#(bvslt main_~i~0 ~SIZE~0)} assume !~bvslt32(~i~0, ~SIZE~0); {2680#false} is VALID [2018-11-23 10:41:02,189 INFO L273 TraceCheckUtils]: 38: Hoare triple {2837#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {2833#(bvslt main_~i~0 ~SIZE~0)} is VALID [2018-11-23 10:41:02,189 INFO L273 TraceCheckUtils]: 37: Hoare triple {2837#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem10);havoc #t~mem10; {2837#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} is VALID [2018-11-23 10:41:02,213 INFO L273 TraceCheckUtils]: 36: Hoare triple {2844#(bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0)} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {2837#(bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)} is VALID [2018-11-23 10:41:02,213 INFO L273 TraceCheckUtils]: 35: Hoare triple {2844#(bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0)} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem10);havoc #t~mem10; {2844#(bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0)} is VALID [2018-11-23 10:41:02,214 INFO L273 TraceCheckUtils]: 34: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} ~i~0 := 0bv32; {2844#(bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0)} is VALID [2018-11-23 10:41:02,214 INFO L273 TraceCheckUtils]: 33: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} assume !~bvslt32(~i~0, ~SIZE~0); {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:02,214 INFO L273 TraceCheckUtils]: 32: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:02,215 INFO L273 TraceCheckUtils]: 31: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem8);havoc #t~mem8; {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:02,215 INFO L273 TraceCheckUtils]: 30: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:02,215 INFO L273 TraceCheckUtils]: 29: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem8);havoc #t~mem8; {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:02,216 INFO L273 TraceCheckUtils]: 28: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} ~i~0 := 0bv32; {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:02,217 INFO L273 TraceCheckUtils]: 27: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} assume !~bvslt32(~i~0, ~SIZE~0); {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:02,217 INFO L273 TraceCheckUtils]: 26: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:02,218 INFO L273 TraceCheckUtils]: 25: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem6);havoc #t~mem6; {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:02,218 INFO L273 TraceCheckUtils]: 24: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:02,219 INFO L273 TraceCheckUtils]: 23: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem6);havoc #t~mem6; {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:02,219 INFO L273 TraceCheckUtils]: 22: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} ~i~0 := 0bv32; {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:02,220 INFO L273 TraceCheckUtils]: 21: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} assume !~bvslt32(~i~0, ~SIZE~0); {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:02,220 INFO L273 TraceCheckUtils]: 20: Hoare triple {2745#(bvslt (_ bv2 32) ~SIZE~0)} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:02,221 INFO L273 TraceCheckUtils]: 19: Hoare triple {2896#(or (not (bvslt main_~i~0 ~SIZE~0)) (bvslt (_ bv2 32) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem4);havoc #t~mem4; {2745#(bvslt (_ bv2 32) ~SIZE~0)} is VALID [2018-11-23 10:41:02,222 INFO L273 TraceCheckUtils]: 18: Hoare triple {2900#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)) (bvslt (_ bv2 32) ~SIZE~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2896#(or (not (bvslt main_~i~0 ~SIZE~0)) (bvslt (_ bv2 32) ~SIZE~0))} is VALID [2018-11-23 10:41:02,223 INFO L273 TraceCheckUtils]: 17: Hoare triple {2900#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)) (bvslt (_ bv2 32) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem4);havoc #t~mem4; {2900#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)) (bvslt (_ bv2 32) ~SIZE~0))} is VALID [2018-11-23 10:41:02,259 INFO L273 TraceCheckUtils]: 16: Hoare triple {2907#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0)) (bvslt (_ bv2 32) ~SIZE~0))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {2900#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) ~SIZE~0)) (bvslt (_ bv2 32) ~SIZE~0))} is VALID [2018-11-23 10:41:02,260 INFO L273 TraceCheckUtils]: 15: Hoare triple {2907#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0)) (bvslt (_ bv2 32) ~SIZE~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem4);havoc #t~mem4; {2907#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0)) (bvslt (_ bv2 32) ~SIZE~0))} is VALID [2018-11-23 10:41:02,260 INFO L273 TraceCheckUtils]: 14: Hoare triple {2679#true} ~i~0 := 0bv32; {2907#(or (not (bvslt (bvadd main_~i~0 (_ bv2 32)) ~SIZE~0)) (bvslt (_ bv2 32) ~SIZE~0))} is VALID [2018-11-23 10:41:02,261 INFO L273 TraceCheckUtils]: 13: Hoare triple {2679#true} assume !~bvslt32(~i~0, ~SIZE~0); {2679#true} is VALID [2018-11-23 10:41:02,261 INFO L273 TraceCheckUtils]: 12: Hoare triple {2679#true} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2679#true} is VALID [2018-11-23 10:41:02,261 INFO L273 TraceCheckUtils]: 11: Hoare triple {2679#true} assume !!~bvslt32(~i~0, ~SIZE~0);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2679#true} is VALID [2018-11-23 10:41:02,261 INFO L273 TraceCheckUtils]: 10: Hoare triple {2679#true} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2679#true} is VALID [2018-11-23 10:41:02,261 INFO L273 TraceCheckUtils]: 9: Hoare triple {2679#true} assume !!~bvslt32(~i~0, ~SIZE~0);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2679#true} is VALID [2018-11-23 10:41:02,261 INFO L273 TraceCheckUtils]: 8: Hoare triple {2679#true} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2679#true} is VALID [2018-11-23 10:41:02,261 INFO L273 TraceCheckUtils]: 7: Hoare triple {2679#true} assume !!~bvslt32(~i~0, ~SIZE~0);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2679#true} is VALID [2018-11-23 10:41:02,262 INFO L273 TraceCheckUtils]: 6: Hoare triple {2679#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~sum~0 := 0bv32;~i~0 := 0bv32; {2679#true} is VALID [2018-11-23 10:41:02,262 INFO L273 TraceCheckUtils]: 5: Hoare triple {2679#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {2679#true} is VALID [2018-11-23 10:41:02,262 INFO L256 TraceCheckUtils]: 4: Hoare triple {2679#true} call #t~ret11 := main(); {2679#true} is VALID [2018-11-23 10:41:02,262 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2679#true} {2679#true} #97#return; {2679#true} is VALID [2018-11-23 10:41:02,262 INFO L273 TraceCheckUtils]: 2: Hoare triple {2679#true} assume true; {2679#true} is VALID [2018-11-23 10:41:02,262 INFO L273 TraceCheckUtils]: 1: Hoare triple {2679#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {2679#true} is VALID [2018-11-23 10:41:02,262 INFO L256 TraceCheckUtils]: 0: Hoare triple {2679#true} call ULTIMATE.init(); {2679#true} is VALID [2018-11-23 10:41:02,264 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 8 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-23 10:41:02,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:41:02,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2018-11-23 10:41:02,267 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-11-23 10:41:02,267 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:41:02,267 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 10:41:02,420 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:41:02,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 10:41:02,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 10:41:02,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:41:02,420 INFO L87 Difference]: Start difference. First operand 61 states and 67 transitions. Second operand 16 states. [2018-11-23 10:41:03,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:41:03,989 INFO L93 Difference]: Finished difference Result 73 states and 79 transitions. [2018-11-23 10:41:03,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 10:41:03,990 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 44 [2018-11-23 10:41:03,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:41:03,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 10:41:03,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2018-11-23 10:41:03,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 10:41:03,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 75 transitions. [2018-11-23 10:41:03,994 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 75 transitions. [2018-11-23 10:41:04,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:41:04,116 INFO L225 Difference]: With dead ends: 73 [2018-11-23 10:41:04,116 INFO L226 Difference]: Without dead ends: 56 [2018-11-23 10:41:04,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-11-23 10:41:04,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-11-23 10:41:04,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2018-11-23 10:41:04,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:41:04,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand 51 states. [2018-11-23 10:41:04,315 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 51 states. [2018-11-23 10:41:04,315 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 51 states. [2018-11-23 10:41:04,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:41:04,319 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-11-23 10:41:04,319 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-23 10:41:04,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:41:04,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:41:04,319 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 56 states. [2018-11-23 10:41:04,320 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 56 states. [2018-11-23 10:41:04,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:41:04,321 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2018-11-23 10:41:04,321 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-23 10:41:04,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:41:04,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:41:04,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:41:04,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:41:04,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 10:41:04,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2018-11-23 10:41:04,324 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 44 [2018-11-23 10:41:04,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:41:04,324 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2018-11-23 10:41:04,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 10:41:04,324 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2018-11-23 10:41:04,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 10:41:04,325 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:41:04,325 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:41:04,325 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:41:04,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:41:04,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1811621193, now seen corresponding path program 4 times [2018-11-23 10:41:04,326 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:41:04,326 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:41:04,345 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:41:04,464 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:41:04,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:41:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-11-23 10:41:06,518 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:41:07,760 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2018-11-23 10:41:07,773 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2018-11-23 10:41:07,785 INFO L267 ElimStorePlain]: Start of recursive call 3: 3 dim-0 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 10:41:07,795 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 10:41:07,804 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-11-23 10:41:07,805 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:36, output treesize:12 [2018-11-23 10:41:08,408 INFO L256 TraceCheckUtils]: 0: Hoare triple {3257#true} call ULTIMATE.init(); {3257#true} is VALID [2018-11-23 10:41:08,409 INFO L273 TraceCheckUtils]: 1: Hoare triple {3257#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {3257#true} is VALID [2018-11-23 10:41:08,409 INFO L273 TraceCheckUtils]: 2: Hoare triple {3257#true} assume true; {3257#true} is VALID [2018-11-23 10:41:08,409 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3257#true} {3257#true} #97#return; {3257#true} is VALID [2018-11-23 10:41:08,409 INFO L256 TraceCheckUtils]: 4: Hoare triple {3257#true} call #t~ret11 := main(); {3257#true} is VALID [2018-11-23 10:41:08,410 INFO L273 TraceCheckUtils]: 5: Hoare triple {3257#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {3257#true} is VALID [2018-11-23 10:41:08,411 INFO L273 TraceCheckUtils]: 6: Hoare triple {3257#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~sum~0 := 0bv32;~i~0 := 0bv32; {3280#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} is VALID [2018-11-23 10:41:08,412 INFO L273 TraceCheckUtils]: 7: Hoare triple {3280#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3280#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} is VALID [2018-11-23 10:41:08,420 INFO L273 TraceCheckUtils]: 8: Hoare triple {3280#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3280#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} is VALID [2018-11-23 10:41:08,433 INFO L273 TraceCheckUtils]: 9: Hoare triple {3280#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3280#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} is VALID [2018-11-23 10:41:08,446 INFO L273 TraceCheckUtils]: 10: Hoare triple {3280#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3280#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} is VALID [2018-11-23 10:41:08,459 INFO L273 TraceCheckUtils]: 11: Hoare triple {3280#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3280#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} is VALID [2018-11-23 10:41:08,471 INFO L273 TraceCheckUtils]: 12: Hoare triple {3280#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3280#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} is VALID [2018-11-23 10:41:08,474 INFO L273 TraceCheckUtils]: 13: Hoare triple {3280#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {3280#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} is VALID [2018-11-23 10:41:08,480 INFO L273 TraceCheckUtils]: 14: Hoare triple {3280#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} ~i~0 := 0bv32; {3305#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} is VALID [2018-11-23 10:41:08,481 INFO L273 TraceCheckUtils]: 15: Hoare triple {3305#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem4);havoc #t~mem4; {3309#(and (= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:41:08,484 INFO L273 TraceCheckUtils]: 16: Hoare triple {3309#(and (= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3313#(and (= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:41:08,513 INFO L273 TraceCheckUtils]: 17: Hoare triple {3313#(and (= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem4);havoc #t~mem4; {3317#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32))))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:41:08,515 INFO L273 TraceCheckUtils]: 18: Hoare triple {3317#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32))))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3321#(and (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967288 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 10:41:08,790 INFO L273 TraceCheckUtils]: 19: Hoare triple {3321#(and (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967288 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem4);havoc #t~mem4; {3325#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:41:08,791 INFO L273 TraceCheckUtils]: 20: Hoare triple {3325#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3325#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:41:08,791 INFO L273 TraceCheckUtils]: 21: Hoare triple {3325#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {3325#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:41:08,792 INFO L273 TraceCheckUtils]: 22: Hoare triple {3325#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)))} ~i~0 := 0bv32; {3335#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:41:10,798 INFO L273 TraceCheckUtils]: 23: Hoare triple {3335#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem6);havoc #t~mem6; {3339#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))))} is UNKNOWN [2018-11-23 10:41:10,799 INFO L273 TraceCheckUtils]: 24: Hoare triple {3339#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3343#(and (= main_~sum~0 (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:41:10,865 INFO L273 TraceCheckUtils]: 25: Hoare triple {3343#(and (= main_~sum~0 (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem6);havoc #t~mem6; {3347#(and (= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:41:10,866 INFO L273 TraceCheckUtils]: 26: Hoare triple {3347#(and (= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3351#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) main_~sum~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 10:41:10,880 INFO L273 TraceCheckUtils]: 27: Hoare triple {3351#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) main_~sum~0) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem6);havoc #t~mem6; {3280#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} is VALID [2018-11-23 10:41:10,881 INFO L273 TraceCheckUtils]: 28: Hoare triple {3280#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3280#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} is VALID [2018-11-23 10:41:10,881 INFO L273 TraceCheckUtils]: 29: Hoare triple {3280#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {3280#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} is VALID [2018-11-23 10:41:10,882 INFO L273 TraceCheckUtils]: 30: Hoare triple {3280#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} ~i~0 := 0bv32; {3305#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} is VALID [2018-11-23 10:41:10,882 INFO L273 TraceCheckUtils]: 31: Hoare triple {3305#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~sum~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem8);havoc #t~mem8; {3309#(and (= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:41:10,883 INFO L273 TraceCheckUtils]: 32: Hoare triple {3309#(and (= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3313#(and (= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:41:10,913 INFO L273 TraceCheckUtils]: 33: Hoare triple {3313#(and (= main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem8);havoc #t~mem8; {3317#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32))))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:41:10,914 INFO L273 TraceCheckUtils]: 34: Hoare triple {3317#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32))))) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3321#(and (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967288 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 10:41:11,183 INFO L273 TraceCheckUtils]: 35: Hoare triple {3321#(and (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967288 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem8);havoc #t~mem8; {3325#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:41:11,184 INFO L273 TraceCheckUtils]: 36: Hoare triple {3325#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)))} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3325#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:41:11,184 INFO L273 TraceCheckUtils]: 37: Hoare triple {3325#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)))} assume !~bvslt32(~i~0, ~SIZE~0); {3325#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)))} is VALID [2018-11-23 10:41:11,185 INFO L273 TraceCheckUtils]: 38: Hoare triple {3325#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)))} ~i~0 := 0bv32; {3335#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:41:13,190 INFO L273 TraceCheckUtils]: 39: Hoare triple {3335#(and (= (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem10);havoc #t~mem10; {3339#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))))} is UNKNOWN [2018-11-23 10:41:13,192 INFO L273 TraceCheckUtils]: 40: Hoare triple {3339#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~sum~0 (bvadd (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0)))))))} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3343#(and (= main_~sum~0 (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:41:13,262 INFO L273 TraceCheckUtils]: 41: Hoare triple {3343#(and (= main_~sum~0 (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem10);havoc #t~mem10; {3347#(and (= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:41:13,263 INFO L273 TraceCheckUtils]: 42: Hoare triple {3347#(and (= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))) main_~sum~0) (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3351#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) main_~sum~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 10:41:13,276 INFO L273 TraceCheckUtils]: 43: Hoare triple {3351#(and (= |main_~#a~0.offset| (_ bv0 32)) (= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4294967292 32)))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) main_~sum~0) (= (_ bv2 32) main_~i~0))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem10);havoc #t~mem10; {3403#(exists ((v_arrayElimCell_10 (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32))) (= main_~sum~0 (bvadd (bvneg v_arrayElimCell_11) (bvneg v_arrayElimCell_12) v_arrayElimCell_10 v_arrayElimCell_11 v_arrayElimCell_12 (bvneg v_arrayElimCell_10))))} is VALID [2018-11-23 10:41:13,277 INFO L273 TraceCheckUtils]: 44: Hoare triple {3403#(exists ((v_arrayElimCell_10 (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32))) (= main_~sum~0 (bvadd (bvneg v_arrayElimCell_11) (bvneg v_arrayElimCell_12) v_arrayElimCell_10 v_arrayElimCell_11 v_arrayElimCell_12 (bvneg v_arrayElimCell_10))))} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3403#(exists ((v_arrayElimCell_10 (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32))) (= main_~sum~0 (bvadd (bvneg v_arrayElimCell_11) (bvneg v_arrayElimCell_12) v_arrayElimCell_10 v_arrayElimCell_11 v_arrayElimCell_12 (bvneg v_arrayElimCell_10))))} is VALID [2018-11-23 10:41:13,277 INFO L273 TraceCheckUtils]: 45: Hoare triple {3403#(exists ((v_arrayElimCell_10 (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32))) (= main_~sum~0 (bvadd (bvneg v_arrayElimCell_11) (bvneg v_arrayElimCell_12) v_arrayElimCell_10 v_arrayElimCell_11 v_arrayElimCell_12 (bvneg v_arrayElimCell_10))))} assume !~bvslt32(~i~0, ~SIZE~0); {3403#(exists ((v_arrayElimCell_10 (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32))) (= main_~sum~0 (bvadd (bvneg v_arrayElimCell_11) (bvneg v_arrayElimCell_12) v_arrayElimCell_10 v_arrayElimCell_11 v_arrayElimCell_12 (bvneg v_arrayElimCell_10))))} is VALID [2018-11-23 10:41:13,278 INFO L256 TraceCheckUtils]: 46: Hoare triple {3403#(exists ((v_arrayElimCell_10 (_ BitVec 32)) (v_arrayElimCell_11 (_ BitVec 32)) (v_arrayElimCell_12 (_ BitVec 32))) (= main_~sum~0 (bvadd (bvneg v_arrayElimCell_11) (bvneg v_arrayElimCell_12) v_arrayElimCell_10 v_arrayElimCell_11 v_arrayElimCell_12 (bvneg v_arrayElimCell_10))))} call __VERIFIER_assert((if 0bv32 == ~sum~0 then 1bv32 else 0bv32)); {3413#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:41:13,279 INFO L273 TraceCheckUtils]: 47: Hoare triple {3413#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {3417#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:41:13,279 INFO L273 TraceCheckUtils]: 48: Hoare triple {3417#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {3258#false} is VALID [2018-11-23 10:41:13,279 INFO L273 TraceCheckUtils]: 49: Hoare triple {3258#false} assume !false; {3258#false} is VALID [2018-11-23 10:41:13,290 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 10:41:13,290 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:41:23,602 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 43 [2018-11-23 10:41:27,626 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:41:27,626 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:41:27,671 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:41:27,702 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:41:27,703 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:41:27,704 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 10:41:27,781 INFO L303 Elim1Store]: Index analysis took 166 ms [2018-11-23 10:41:27,918 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 9 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 43 treesize of output 194 [2018-11-23 10:41:27,918 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-11-23 10:43:00,679 INFO L267 ElimStorePlain]: Start of recursive call 3: 508 dim-0 vars, End of recursive call: 508 dim-0 vars, and 512 xjuncts. [2018-11-23 10:43:08,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 10:43:08,455 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 10:43:08,455 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:55, output treesize:22 [2018-11-23 10:43:08,490 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 10:43:08,490 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#a~0.base|]. (= (let ((.cse0 (select |#memory_int| |main_~#a~0.base|)) (.cse1 (bvmul (_ bv4 32) main_~i~0))) (bvadd (bvneg (select .cse0 |main_~#a~0.offset|)) (select .cse0 (bvadd |main_~#a~0.offset| .cse1 (_ bv4 32))) (select .cse0 (bvadd |main_~#a~0.offset| .cse1)) main_~sum~0 (bvneg (select .cse0 (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select .cse0 (bvadd |main_~#a~0.offset| (_ bv8 32)))) (select .cse0 (bvadd |main_~#a~0.offset| .cse1 (_ bv8 32))))) (_ bv0 32)) [2018-11-23 10:43:08,490 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ [v_prenex_391]. (and (= (_ bv0 32) (bvadd (bvmul (_ bv3 32) (bvneg v_prenex_391)) main_~sum~0 (bvmul (_ bv3 32) v_prenex_391))) (= (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)) (bvadd |main_~#a~0.offset| (_ bv8 32)))) [2018-11-23 10:43:08,681 INFO L273 TraceCheckUtils]: 49: Hoare triple {3258#false} assume !false; {3258#false} is VALID [2018-11-23 10:43:08,681 INFO L273 TraceCheckUtils]: 48: Hoare triple {3427#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {3258#false} is VALID [2018-11-23 10:43:08,682 INFO L273 TraceCheckUtils]: 47: Hoare triple {3431#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {3427#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 10:43:08,683 INFO L256 TraceCheckUtils]: 46: Hoare triple {3435#(= main_~sum~0 (_ bv0 32))} call __VERIFIER_assert((if 0bv32 == ~sum~0 then 1bv32 else 0bv32)); {3431#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 10:43:08,684 INFO L273 TraceCheckUtils]: 45: Hoare triple {3435#(= main_~sum~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~SIZE~0); {3435#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:43:08,684 INFO L273 TraceCheckUtils]: 44: Hoare triple {3435#(= main_~sum~0 (_ bv0 32))} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3435#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:43:08,685 INFO L273 TraceCheckUtils]: 43: Hoare triple {3445#(= (_ bv0 32) (bvadd main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem10);havoc #t~mem10; {3435#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:43:08,859 INFO L273 TraceCheckUtils]: 42: Hoare triple {3449#(= (bvadd main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))))) (_ bv0 32))} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3445#(= (_ bv0 32) (bvadd main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))))} is VALID [2018-11-23 10:43:09,044 INFO L273 TraceCheckUtils]: 41: Hoare triple {3453#(= (bvadd main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem10);havoc #t~mem10; {3449#(= (bvadd main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))))) (_ bv0 32))} is VALID [2018-11-23 10:43:11,053 INFO L273 TraceCheckUtils]: 40: Hoare triple {3457#(= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))))) (_ bv0 32))} #t~post9 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post9);havoc #t~post9; {3453#(= (bvadd main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))) (_ bv0 32))} is UNKNOWN [2018-11-23 10:43:13,058 INFO L273 TraceCheckUtils]: 39: Hoare triple {3461#(= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem10);havoc #t~mem10; {3457#(= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))))) (_ bv0 32))} is UNKNOWN [2018-11-23 10:43:13,060 INFO L273 TraceCheckUtils]: 38: Hoare triple {3465#(= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (_ bv0 32))} ~i~0 := 0bv32; {3461#(= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))) (_ bv0 32))} is VALID [2018-11-23 10:43:13,060 INFO L273 TraceCheckUtils]: 37: Hoare triple {3465#(= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (_ bv0 32))} assume !~bvslt32(~i~0, ~SIZE~0); {3465#(= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (_ bv0 32))} is VALID [2018-11-23 10:43:13,060 INFO L273 TraceCheckUtils]: 36: Hoare triple {3465#(= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (_ bv0 32))} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3465#(= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (_ bv0 32))} is VALID [2018-11-23 10:43:15,065 INFO L273 TraceCheckUtils]: 35: Hoare triple {3475#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem8);havoc #t~mem8; {3465#(= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (_ bv0 32))} is UNKNOWN [2018-11-23 10:43:17,079 INFO L273 TraceCheckUtils]: 34: Hoare triple {3479#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))))} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3475#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))))} is UNKNOWN [2018-11-23 10:43:19,084 INFO L273 TraceCheckUtils]: 33: Hoare triple {3483#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem8);havoc #t~mem8; {3479#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))))} is UNKNOWN [2018-11-23 10:43:21,091 INFO L273 TraceCheckUtils]: 32: Hoare triple {3487#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} #t~post7 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post7);havoc #t~post7; {3483#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))))} is UNKNOWN [2018-11-23 10:43:23,098 INFO L273 TraceCheckUtils]: 31: Hoare triple {3491#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem8 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem8);havoc #t~mem8; {3487#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} is UNKNOWN [2018-11-23 10:43:23,099 INFO L273 TraceCheckUtils]: 30: Hoare triple {3435#(= main_~sum~0 (_ bv0 32))} ~i~0 := 0bv32; {3491#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} is VALID [2018-11-23 10:43:23,099 INFO L273 TraceCheckUtils]: 29: Hoare triple {3435#(= main_~sum~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~SIZE~0); {3435#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:43:23,100 INFO L273 TraceCheckUtils]: 28: Hoare triple {3435#(= main_~sum~0 (_ bv0 32))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3435#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:43:23,100 INFO L273 TraceCheckUtils]: 27: Hoare triple {3445#(= (_ bv0 32) (bvadd main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem6);havoc #t~mem6; {3435#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:43:23,290 INFO L273 TraceCheckUtils]: 26: Hoare triple {3449#(= (bvadd main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))))) (_ bv0 32))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3445#(= (_ bv0 32) (bvadd main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))))} is VALID [2018-11-23 10:43:23,514 INFO L273 TraceCheckUtils]: 25: Hoare triple {3453#(= (bvadd main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem6);havoc #t~mem6; {3449#(= (bvadd main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))))) (_ bv0 32))} is VALID [2018-11-23 10:43:25,533 INFO L273 TraceCheckUtils]: 24: Hoare triple {3457#(= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))))) (_ bv0 32))} #t~post5 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post5);havoc #t~post5; {3453#(= (bvadd main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))) (_ bv0 32))} is UNKNOWN [2018-11-23 10:43:27,537 INFO L273 TraceCheckUtils]: 23: Hoare triple {3461#(= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))) (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvsub32(~sum~0, #t~mem6);havoc #t~mem6; {3457#(= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))))) (_ bv0 32))} is UNKNOWN [2018-11-23 10:43:27,538 INFO L273 TraceCheckUtils]: 22: Hoare triple {3465#(= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (_ bv0 32))} ~i~0 := 0bv32; {3461#(= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))))) (_ bv0 32))} is VALID [2018-11-23 10:43:27,538 INFO L273 TraceCheckUtils]: 21: Hoare triple {3465#(= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (_ bv0 32))} assume !~bvslt32(~i~0, ~SIZE~0); {3465#(= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (_ bv0 32))} is VALID [2018-11-23 10:43:27,539 INFO L273 TraceCheckUtils]: 20: Hoare triple {3465#(= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (_ bv0 32))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3465#(= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (_ bv0 32))} is VALID [2018-11-23 10:43:29,548 INFO L273 TraceCheckUtils]: 19: Hoare triple {3475#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem4);havoc #t~mem4; {3465#(= (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))) (_ bv0 32))} is UNKNOWN [2018-11-23 10:43:31,572 INFO L273 TraceCheckUtils]: 18: Hoare triple {3479#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3475#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))))} is UNKNOWN [2018-11-23 10:43:33,579 INFO L273 TraceCheckUtils]: 17: Hoare triple {3483#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem4);havoc #t~mem4; {3479#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))))} is UNKNOWN [2018-11-23 10:43:35,585 INFO L273 TraceCheckUtils]: 16: Hoare triple {3487#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} #t~post3 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post3);havoc #t~post3; {3483#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~sum~0 (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32))))))} is UNKNOWN [2018-11-23 10:43:35,586 INFO L273 TraceCheckUtils]: 15: Hoare triple {3540#(and (= (bvmul (_ bv4 32) main_~i~0) (_ bv0 32)) (forall ((v_prenex_391 (_ BitVec 32))) (= (_ bv0 32) (bvadd (bvmul (_ bv3 32) (bvneg v_prenex_391)) (bvmul (_ bv3 32) v_prenex_391) main_~sum~0))))} assume !!~bvslt32(~i~0, ~SIZE~0);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~sum~0 := ~bvadd32(~sum~0, #t~mem4);havoc #t~mem4; {3487#(= (_ bv0 32) (bvadd (bvneg (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|)) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) main_~sum~0 (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (bvneg (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv8 32)))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv8 32)))))} is VALID [2018-11-23 10:43:35,586 INFO L273 TraceCheckUtils]: 14: Hoare triple {3435#(= main_~sum~0 (_ bv0 32))} ~i~0 := 0bv32; {3540#(and (= (bvmul (_ bv4 32) main_~i~0) (_ bv0 32)) (forall ((v_prenex_391 (_ BitVec 32))) (= (_ bv0 32) (bvadd (bvmul (_ bv3 32) (bvneg v_prenex_391)) (bvmul (_ bv3 32) v_prenex_391) main_~sum~0))))} is VALID [2018-11-23 10:43:35,587 INFO L273 TraceCheckUtils]: 13: Hoare triple {3435#(= main_~sum~0 (_ bv0 32))} assume !~bvslt32(~i~0, ~SIZE~0); {3435#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:43:35,587 INFO L273 TraceCheckUtils]: 12: Hoare triple {3435#(= main_~sum~0 (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3435#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:43:35,587 INFO L273 TraceCheckUtils]: 11: Hoare triple {3435#(= main_~sum~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3435#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:43:35,588 INFO L273 TraceCheckUtils]: 10: Hoare triple {3435#(= main_~sum~0 (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3435#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:43:35,588 INFO L273 TraceCheckUtils]: 9: Hoare triple {3435#(= main_~sum~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3435#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:43:35,588 INFO L273 TraceCheckUtils]: 8: Hoare triple {3435#(= main_~sum~0 (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3435#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:43:35,589 INFO L273 TraceCheckUtils]: 7: Hoare triple {3435#(= main_~sum~0 (_ bv0 32))} assume !!~bvslt32(~i~0, ~SIZE~0);call write~intINTTYPE4(1bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3435#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:43:35,589 INFO L273 TraceCheckUtils]: 6: Hoare triple {3257#true} assume ~bvsgt32(~SIZE~0, 1bv32);havoc ~i~0;call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(~bvmul32(4bv32, ~SIZE~0));~sum~0 := 0bv32;~i~0 := 0bv32; {3435#(= main_~sum~0 (_ bv0 32))} is VALID [2018-11-23 10:43:35,589 INFO L273 TraceCheckUtils]: 5: Hoare triple {3257#true} ~SIZE~0 := #t~nondet1;havoc #t~nondet1; {3257#true} is VALID [2018-11-23 10:43:35,589 INFO L256 TraceCheckUtils]: 4: Hoare triple {3257#true} call #t~ret11 := main(); {3257#true} is VALID [2018-11-23 10:43:35,590 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3257#true} {3257#true} #97#return; {3257#true} is VALID [2018-11-23 10:43:35,590 INFO L273 TraceCheckUtils]: 2: Hoare triple {3257#true} assume true; {3257#true} is VALID [2018-11-23 10:43:35,590 INFO L273 TraceCheckUtils]: 1: Hoare triple {3257#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1];~SIZE~0 := 0bv32; {3257#true} is VALID [2018-11-23 10:43:35,590 INFO L256 TraceCheckUtils]: 0: Hoare triple {3257#true} call ULTIMATE.init(); {3257#true} is VALID [2018-11-23 10:43:35,599 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-23 10:43:35,601 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:43:35,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2018-11-23 10:43:35,602 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 50 [2018-11-23 10:43:35,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:43:35,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states.