java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_false-unreach-call3_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:38:58,168 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:38:58,173 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:38:58,186 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:38:58,186 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:38:58,187 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:38:58,188 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:38:58,190 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:38:58,192 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:38:58,193 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:38:58,193 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:38:58,194 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:38:58,195 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:38:58,196 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:38:58,197 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:38:58,198 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:38:58,199 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:38:58,201 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:38:58,203 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:38:58,204 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:38:58,205 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:38:58,207 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:38:58,209 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:38:58,210 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:38:58,210 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:38:58,211 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:38:58,212 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:38:58,213 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:38:58,213 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:38:58,215 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:38:58,215 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:38:58,216 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:38:58,216 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:38:58,216 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:38:58,217 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:38:58,218 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:38:58,218 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-14 16:38:58,234 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:38:58,235 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:38:58,235 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:38:58,236 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:38:58,236 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:38:58,236 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:38:58,236 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:38:58,237 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:38:58,237 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:38:58,237 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:38:58,237 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:38:58,237 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:38:58,238 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:38:58,238 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:38:58,238 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:38:58,238 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:38:58,238 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:38:58,239 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:38:58,239 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:38:58,239 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:38:58,239 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:38:58,239 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:38:58,240 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:38:58,240 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:38:58,240 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:38:58,240 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:38:58,240 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:38:58,241 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:38:58,241 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:38:58,241 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:38:58,241 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:38:58,241 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:38:58,289 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:38:58,304 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:38:58,308 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:38:58,310 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:38:58,311 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:38:58,311 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_false-unreach-call3_true-termination.i [2018-11-14 16:38:58,380 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2749a02c/518039f6cae342f88e0273210c592d69/FLAG3e405bbca [2018-11-14 16:38:58,837 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:38:58,838 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_false-unreach-call3_true-termination.i [2018-11-14 16:38:58,845 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2749a02c/518039f6cae342f88e0273210c592d69/FLAG3e405bbca [2018-11-14 16:38:58,861 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a2749a02c/518039f6cae342f88e0273210c592d69 [2018-11-14 16:38:58,873 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:38:58,875 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:38:58,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:38:58,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:38:58,880 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:38:58,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:38:58" (1/1) ... [2018-11-14 16:38:58,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f7c9eb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:38:58, skipping insertion in model container [2018-11-14 16:38:58,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:38:58" (1/1) ... [2018-11-14 16:38:58,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:38:58,919 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:38:59,117 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:38:59,122 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:38:59,146 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:38:59,169 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:38:59,170 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:38:59 WrapperNode [2018-11-14 16:38:59,170 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:38:59,171 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:38:59,171 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:38:59,171 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:38:59,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:38:59" (1/1) ... [2018-11-14 16:38:59,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:38:59" (1/1) ... [2018-11-14 16:38:59,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:38:59" (1/1) ... [2018-11-14 16:38:59,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:38:59" (1/1) ... [2018-11-14 16:38:59,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:38:59" (1/1) ... [2018-11-14 16:38:59,210 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:38:59" (1/1) ... [2018-11-14 16:38:59,212 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:38:59" (1/1) ... [2018-11-14 16:38:59,214 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:38:59,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:38:59,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:38:59,215 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:38:59,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:38:59" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:38:59,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:38:59,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:38:59,342 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:38:59,342 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:38:59,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:38:59,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:38:59,343 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:38:59,343 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:38:59,343 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 16:38:59,343 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 16:38:59,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 16:38:59,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 16:38:59,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:38:59,344 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:38:59,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 16:38:59,876 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:38:59,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:38:59 BoogieIcfgContainer [2018-11-14 16:38:59,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:38:59,879 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:38:59,879 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:38:59,883 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:38:59,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:38:58" (1/3) ... [2018-11-14 16:38:59,884 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144c7e2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:38:59, skipping insertion in model container [2018-11-14 16:38:59,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:38:59" (2/3) ... [2018-11-14 16:38:59,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@144c7e2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:38:59, skipping insertion in model container [2018-11-14 16:38:59,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:38:59" (3/3) ... [2018-11-14 16:38:59,887 INFO L112 eAbstractionObserver]: Analyzing ICFG array_false-unreach-call3_true-termination.i [2018-11-14 16:38:59,897 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:38:59,907 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:38:59,926 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:38:59,959 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:38:59,960 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:38:59,961 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:38:59,961 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:38:59,961 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:38:59,961 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:38:59,961 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:38:59,961 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:38:59,962 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:38:59,980 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-14 16:38:59,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 16:38:59,985 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:38:59,986 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:38:59,989 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:38:59,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:38:59,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1097964223, now seen corresponding path program 1 times [2018-11-14 16:39:00,000 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:00,000 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-14 16:39:00,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:39:00,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:00,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:00,085 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:00,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-14 16:39:00,140 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {28#true} is VALID [2018-11-14 16:39:00,140 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-14 16:39:00,141 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #50#return; {28#true} is VALID [2018-11-14 16:39:00,141 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret4 := main(); {28#true} is VALID [2018-11-14 16:39:00,141 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4096bv32);havoc ~i~0;~i~0 := 0bv32; {28#true} is VALID [2018-11-14 16:39:00,155 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-14 16:39:00,156 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#false} ~i~0 := 0bv32; {29#false} is VALID [2018-11-14 16:39:00,156 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume !true; {29#false} is VALID [2018-11-14 16:39:00,156 INFO L256 TraceCheckUtils]: 9: Hoare triple {29#false} call __VERIFIER_assert((if ~bvsle32(~i~0, 512bv32) then 1bv32 else 0bv32)); {29#false} is VALID [2018-11-14 16:39:00,157 INFO L273 TraceCheckUtils]: 10: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2018-11-14 16:39:00,157 INFO L273 TraceCheckUtils]: 11: Hoare triple {29#false} assume ~cond == 0bv32; {29#false} is VALID [2018-11-14 16:39:00,157 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-14 16:39:00,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:00,160 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:39:00,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:39:00,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:39:00,169 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-14 16:39:00,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:00,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:39:00,290 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:00,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:39:00,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:39:00,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:39:00,301 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-14 16:39:00,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:00,560 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2018-11-14 16:39:00,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:39:00,561 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-14 16:39:00,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:00,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:39:00,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2018-11-14 16:39:00,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:39:00,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 48 transitions. [2018-11-14 16:39:00,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 48 transitions. [2018-11-14 16:39:00,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:00,797 INFO L225 Difference]: With dead ends: 41 [2018-11-14 16:39:00,797 INFO L226 Difference]: Without dead ends: 18 [2018-11-14 16:39:00,801 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:39:00,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-14 16:39:00,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-14 16:39:00,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:00,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-14 16:39:00,858 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 16:39:00,858 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 16:39:00,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:00,862 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-14 16:39:00,862 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-14 16:39:00,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:00,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:00,863 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-14 16:39:00,863 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-14 16:39:00,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:00,867 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-14 16:39:00,867 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-14 16:39:00,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:00,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:00,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:00,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:00,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-14 16:39:00,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-14 16:39:00,872 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-14 16:39:00,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:00,873 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-14 16:39:00,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:39:00,873 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-14 16:39:00,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 16:39:00,874 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:00,874 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:00,875 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:00,875 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:00,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1413574900, now seen corresponding path program 1 times [2018-11-14 16:39:00,875 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:00,876 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-14 16:39:00,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:39:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:00,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:00,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:01,104 INFO L256 TraceCheckUtils]: 0: Hoare triple {182#true} call ULTIMATE.init(); {182#true} is VALID [2018-11-14 16:39:01,104 INFO L273 TraceCheckUtils]: 1: Hoare triple {182#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {182#true} is VALID [2018-11-14 16:39:01,105 INFO L273 TraceCheckUtils]: 2: Hoare triple {182#true} assume true; {182#true} is VALID [2018-11-14 16:39:01,105 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {182#true} {182#true} #50#return; {182#true} is VALID [2018-11-14 16:39:01,105 INFO L256 TraceCheckUtils]: 4: Hoare triple {182#true} call #t~ret4 := main(); {182#true} is VALID [2018-11-14 16:39:01,106 INFO L273 TraceCheckUtils]: 5: Hoare triple {182#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4096bv32);havoc ~i~0;~i~0 := 0bv32; {202#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:01,110 INFO L273 TraceCheckUtils]: 6: Hoare triple {202#(= main_~i~0 (_ bv0 32))} assume true; {202#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:01,111 INFO L273 TraceCheckUtils]: 7: Hoare triple {202#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 1024bv32); {183#false} is VALID [2018-11-14 16:39:01,111 INFO L273 TraceCheckUtils]: 8: Hoare triple {183#false} ~i~0 := 0bv32; {183#false} is VALID [2018-11-14 16:39:01,111 INFO L273 TraceCheckUtils]: 9: Hoare triple {183#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {183#false} is VALID [2018-11-14 16:39:01,112 INFO L273 TraceCheckUtils]: 10: Hoare triple {183#false} assume !(#t~mem3 != 0bv32 && ~bvslt32(~i~0, 1024bv32));havoc #t~mem3; {183#false} is VALID [2018-11-14 16:39:01,112 INFO L256 TraceCheckUtils]: 11: Hoare triple {183#false} call __VERIFIER_assert((if ~bvsle32(~i~0, 512bv32) then 1bv32 else 0bv32)); {183#false} is VALID [2018-11-14 16:39:01,112 INFO L273 TraceCheckUtils]: 12: Hoare triple {183#false} ~cond := #in~cond; {183#false} is VALID [2018-11-14 16:39:01,112 INFO L273 TraceCheckUtils]: 13: Hoare triple {183#false} assume ~cond == 0bv32; {183#false} is VALID [2018-11-14 16:39:01,113 INFO L273 TraceCheckUtils]: 14: Hoare triple {183#false} assume !false; {183#false} is VALID [2018-11-14 16:39:01,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:01,114 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:39:01,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:39:01,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:39:01,118 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 16:39:01,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:01,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:39:01,145 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:01,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:39:01,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:39:01,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:39:01,146 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 3 states. [2018-11-14 16:39:01,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:01,268 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2018-11-14 16:39:01,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:39:01,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 16:39:01,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:01,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:39:01,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2018-11-14 16:39:01,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:39:01,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2018-11-14 16:39:01,274 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2018-11-14 16:39:01,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:01,652 INFO L225 Difference]: With dead ends: 34 [2018-11-14 16:39:01,652 INFO L226 Difference]: Without dead ends: 25 [2018-11-14 16:39:01,653 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:39:01,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-14 16:39:01,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2018-11-14 16:39:01,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:01,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 20 states. [2018-11-14 16:39:01,711 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 20 states. [2018-11-14 16:39:01,712 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 20 states. [2018-11-14 16:39:01,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:01,714 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-14 16:39:01,715 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-14 16:39:01,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:01,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:01,716 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 25 states. [2018-11-14 16:39:01,716 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 25 states. [2018-11-14 16:39:01,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:01,719 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-14 16:39:01,719 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-14 16:39:01,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:01,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:01,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:01,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:01,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 16:39:01,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-14 16:39:01,722 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 15 [2018-11-14 16:39:01,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:01,723 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-14 16:39:01,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:39:01,723 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-14 16:39:01,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 16:39:01,724 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:01,724 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:01,724 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:01,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:01,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1818930225, now seen corresponding path program 1 times [2018-11-14 16:39:01,725 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:01,725 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-14 16:39:01,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:39:01,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:01,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:01,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:01,857 INFO L256 TraceCheckUtils]: 0: Hoare triple {356#true} call ULTIMATE.init(); {356#true} is VALID [2018-11-14 16:39:01,857 INFO L273 TraceCheckUtils]: 1: Hoare triple {356#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {356#true} is VALID [2018-11-14 16:39:01,858 INFO L273 TraceCheckUtils]: 2: Hoare triple {356#true} assume true; {356#true} is VALID [2018-11-14 16:39:01,858 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {356#true} {356#true} #50#return; {356#true} is VALID [2018-11-14 16:39:01,858 INFO L256 TraceCheckUtils]: 4: Hoare triple {356#true} call #t~ret4 := main(); {356#true} is VALID [2018-11-14 16:39:01,863 INFO L273 TraceCheckUtils]: 5: Hoare triple {356#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4096bv32);havoc ~i~0;~i~0 := 0bv32; {376#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:01,864 INFO L273 TraceCheckUtils]: 6: Hoare triple {376#(= main_~i~0 (_ bv0 32))} assume true; {376#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:01,865 INFO L273 TraceCheckUtils]: 7: Hoare triple {376#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {376#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:01,866 INFO L273 TraceCheckUtils]: 8: Hoare triple {376#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {386#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:01,867 INFO L273 TraceCheckUtils]: 9: Hoare triple {386#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {386#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:01,869 INFO L273 TraceCheckUtils]: 10: Hoare triple {386#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 1024bv32); {357#false} is VALID [2018-11-14 16:39:01,869 INFO L273 TraceCheckUtils]: 11: Hoare triple {357#false} ~i~0 := 0bv32; {357#false} is VALID [2018-11-14 16:39:01,870 INFO L273 TraceCheckUtils]: 12: Hoare triple {357#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {357#false} is VALID [2018-11-14 16:39:01,870 INFO L273 TraceCheckUtils]: 13: Hoare triple {357#false} assume !(#t~mem3 != 0bv32 && ~bvslt32(~i~0, 1024bv32));havoc #t~mem3; {357#false} is VALID [2018-11-14 16:39:01,870 INFO L256 TraceCheckUtils]: 14: Hoare triple {357#false} call __VERIFIER_assert((if ~bvsle32(~i~0, 512bv32) then 1bv32 else 0bv32)); {357#false} is VALID [2018-11-14 16:39:01,871 INFO L273 TraceCheckUtils]: 15: Hoare triple {357#false} ~cond := #in~cond; {357#false} is VALID [2018-11-14 16:39:01,871 INFO L273 TraceCheckUtils]: 16: Hoare triple {357#false} assume ~cond == 0bv32; {357#false} is VALID [2018-11-14 16:39:01,872 INFO L273 TraceCheckUtils]: 17: Hoare triple {357#false} assume !false; {357#false} is VALID [2018-11-14 16:39:01,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:01,874 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:39:02,128 INFO L273 TraceCheckUtils]: 17: Hoare triple {357#false} assume !false; {357#false} is VALID [2018-11-14 16:39:02,128 INFO L273 TraceCheckUtils]: 16: Hoare triple {357#false} assume ~cond == 0bv32; {357#false} is VALID [2018-11-14 16:39:02,128 INFO L273 TraceCheckUtils]: 15: Hoare triple {357#false} ~cond := #in~cond; {357#false} is VALID [2018-11-14 16:39:02,129 INFO L256 TraceCheckUtils]: 14: Hoare triple {357#false} call __VERIFIER_assert((if ~bvsle32(~i~0, 512bv32) then 1bv32 else 0bv32)); {357#false} is VALID [2018-11-14 16:39:02,129 INFO L273 TraceCheckUtils]: 13: Hoare triple {357#false} assume !(#t~mem3 != 0bv32 && ~bvslt32(~i~0, 1024bv32));havoc #t~mem3; {357#false} is VALID [2018-11-14 16:39:02,129 INFO L273 TraceCheckUtils]: 12: Hoare triple {357#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {357#false} is VALID [2018-11-14 16:39:02,130 INFO L273 TraceCheckUtils]: 11: Hoare triple {357#false} ~i~0 := 0bv32; {357#false} is VALID [2018-11-14 16:39:02,141 INFO L273 TraceCheckUtils]: 10: Hoare triple {435#(bvslt main_~i~0 (_ bv1024 32))} assume !~bvslt32(~i~0, 1024bv32); {357#false} is VALID [2018-11-14 16:39:02,142 INFO L273 TraceCheckUtils]: 9: Hoare triple {435#(bvslt main_~i~0 (_ bv1024 32))} assume true; {435#(bvslt main_~i~0 (_ bv1024 32))} is VALID [2018-11-14 16:39:02,143 INFO L273 TraceCheckUtils]: 8: Hoare triple {442#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {435#(bvslt main_~i~0 (_ bv1024 32))} is VALID [2018-11-14 16:39:02,145 INFO L273 TraceCheckUtils]: 7: Hoare triple {442#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {442#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:02,146 INFO L273 TraceCheckUtils]: 6: Hoare triple {442#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume true; {442#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:02,147 INFO L273 TraceCheckUtils]: 5: Hoare triple {356#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4096bv32);havoc ~i~0;~i~0 := 0bv32; {442#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:02,147 INFO L256 TraceCheckUtils]: 4: Hoare triple {356#true} call #t~ret4 := main(); {356#true} is VALID [2018-11-14 16:39:02,148 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {356#true} {356#true} #50#return; {356#true} is VALID [2018-11-14 16:39:02,148 INFO L273 TraceCheckUtils]: 2: Hoare triple {356#true} assume true; {356#true} is VALID [2018-11-14 16:39:02,149 INFO L273 TraceCheckUtils]: 1: Hoare triple {356#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {356#true} is VALID [2018-11-14 16:39:02,149 INFO L256 TraceCheckUtils]: 0: Hoare triple {356#true} call ULTIMATE.init(); {356#true} is VALID [2018-11-14 16:39:02,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:39:02,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:39:02,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 16:39:02,153 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-14 16:39:02,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:02,155 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:39:02,234 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:02,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:39:02,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:39:02,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:39:02,235 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 6 states. [2018-11-14 16:39:02,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:02,730 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2018-11-14 16:39:02,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:39:02,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-14 16:39:02,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:02,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:39:02,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2018-11-14 16:39:02,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:39:02,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2018-11-14 16:39:02,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 61 transitions. [2018-11-14 16:39:02,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:02,962 INFO L225 Difference]: With dead ends: 53 [2018-11-14 16:39:02,963 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 16:39:02,963 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:39:02,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 16:39:02,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 29. [2018-11-14 16:39:02,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:02,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 29 states. [2018-11-14 16:39:02,992 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 29 states. [2018-11-14 16:39:02,992 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 29 states. [2018-11-14 16:39:02,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:02,996 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-14 16:39:02,996 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-14 16:39:02,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:02,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:02,997 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 44 states. [2018-11-14 16:39:02,997 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 44 states. [2018-11-14 16:39:03,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:03,001 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2018-11-14 16:39:03,001 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2018-11-14 16:39:03,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:03,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:03,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:03,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:03,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 16:39:03,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-11-14 16:39:03,005 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 18 [2018-11-14 16:39:03,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:03,005 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-11-14 16:39:03,005 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:39:03,006 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-11-14 16:39:03,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 16:39:03,006 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:03,007 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:03,007 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:03,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:03,007 INFO L82 PathProgramCache]: Analyzing trace with hash -342428364, now seen corresponding path program 2 times [2018-11-14 16:39:03,008 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:03,008 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-14 16:39:03,026 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:39:03,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 16:39:03,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:39:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:03,070 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:03,176 INFO L256 TraceCheckUtils]: 0: Hoare triple {676#true} call ULTIMATE.init(); {676#true} is VALID [2018-11-14 16:39:03,176 INFO L273 TraceCheckUtils]: 1: Hoare triple {676#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {676#true} is VALID [2018-11-14 16:39:03,177 INFO L273 TraceCheckUtils]: 2: Hoare triple {676#true} assume true; {676#true} is VALID [2018-11-14 16:39:03,177 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {676#true} {676#true} #50#return; {676#true} is VALID [2018-11-14 16:39:03,177 INFO L256 TraceCheckUtils]: 4: Hoare triple {676#true} call #t~ret4 := main(); {676#true} is VALID [2018-11-14 16:39:03,178 INFO L273 TraceCheckUtils]: 5: Hoare triple {676#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4096bv32);havoc ~i~0;~i~0 := 0bv32; {676#true} is VALID [2018-11-14 16:39:03,178 INFO L273 TraceCheckUtils]: 6: Hoare triple {676#true} assume true; {676#true} is VALID [2018-11-14 16:39:03,178 INFO L273 TraceCheckUtils]: 7: Hoare triple {676#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {676#true} is VALID [2018-11-14 16:39:03,178 INFO L273 TraceCheckUtils]: 8: Hoare triple {676#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {676#true} is VALID [2018-11-14 16:39:03,179 INFO L273 TraceCheckUtils]: 9: Hoare triple {676#true} assume true; {676#true} is VALID [2018-11-14 16:39:03,179 INFO L273 TraceCheckUtils]: 10: Hoare triple {676#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {676#true} is VALID [2018-11-14 16:39:03,179 INFO L273 TraceCheckUtils]: 11: Hoare triple {676#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {676#true} is VALID [2018-11-14 16:39:03,179 INFO L273 TraceCheckUtils]: 12: Hoare triple {676#true} assume true; {676#true} is VALID [2018-11-14 16:39:03,180 INFO L273 TraceCheckUtils]: 13: Hoare triple {676#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {676#true} is VALID [2018-11-14 16:39:03,180 INFO L273 TraceCheckUtils]: 14: Hoare triple {676#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {676#true} is VALID [2018-11-14 16:39:03,180 INFO L273 TraceCheckUtils]: 15: Hoare triple {676#true} assume true; {676#true} is VALID [2018-11-14 16:39:03,180 INFO L273 TraceCheckUtils]: 16: Hoare triple {676#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {676#true} is VALID [2018-11-14 16:39:03,181 INFO L273 TraceCheckUtils]: 17: Hoare triple {676#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {676#true} is VALID [2018-11-14 16:39:03,181 INFO L273 TraceCheckUtils]: 18: Hoare triple {676#true} assume true; {676#true} is VALID [2018-11-14 16:39:03,181 INFO L273 TraceCheckUtils]: 19: Hoare triple {676#true} assume !~bvslt32(~i~0, 1024bv32); {676#true} is VALID [2018-11-14 16:39:03,182 INFO L273 TraceCheckUtils]: 20: Hoare triple {676#true} ~i~0 := 0bv32; {741#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:03,183 INFO L273 TraceCheckUtils]: 21: Hoare triple {741#(= main_~i~0 (_ bv0 32))} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {741#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:03,183 INFO L273 TraceCheckUtils]: 22: Hoare triple {741#(= main_~i~0 (_ bv0 32))} assume !(#t~mem3 != 0bv32 && ~bvslt32(~i~0, 1024bv32));havoc #t~mem3; {741#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:03,186 INFO L256 TraceCheckUtils]: 23: Hoare triple {741#(= main_~i~0 (_ bv0 32))} call __VERIFIER_assert((if ~bvsle32(~i~0, 512bv32) then 1bv32 else 0bv32)); {751#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:03,186 INFO L273 TraceCheckUtils]: 24: Hoare triple {751#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {755#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:03,188 INFO L273 TraceCheckUtils]: 25: Hoare triple {755#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {677#false} is VALID [2018-11-14 16:39:03,188 INFO L273 TraceCheckUtils]: 26: Hoare triple {677#false} assume !false; {677#false} is VALID [2018-11-14 16:39:03,190 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-14 16:39:03,190 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:39:03,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:39:03,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 16:39:03,192 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 16:39:03,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:03,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 16:39:03,235 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:03,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 16:39:03,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 16:39:03,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 16:39:03,236 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 5 states. [2018-11-14 16:39:03,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:03,429 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-11-14 16:39:03,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 16:39:03,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 16:39:03,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:03,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:39:03,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2018-11-14 16:39:03,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 16:39:03,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2018-11-14 16:39:03,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2018-11-14 16:39:03,481 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:03,484 INFO L225 Difference]: With dead ends: 37 [2018-11-14 16:39:03,484 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 16:39:03,485 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:39:03,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 16:39:03,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-14 16:39:03,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:03,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 31 states. [2018-11-14 16:39:03,504 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 31 states. [2018-11-14 16:39:03,504 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 31 states. [2018-11-14 16:39:03,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:03,507 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-14 16:39:03,507 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-14 16:39:03,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:03,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:03,508 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 32 states. [2018-11-14 16:39:03,508 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 32 states. [2018-11-14 16:39:03,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:03,511 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2018-11-14 16:39:03,511 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2018-11-14 16:39:03,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:03,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:03,512 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:03,512 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:03,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 16:39:03,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-11-14 16:39:03,514 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 27 [2018-11-14 16:39:03,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:03,514 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-11-14 16:39:03,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 16:39:03,515 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-14 16:39:03,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 16:39:03,516 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:03,516 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:03,516 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:03,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:03,517 INFO L82 PathProgramCache]: Analyzing trace with hash -9056718, now seen corresponding path program 1 times [2018-11-14 16:39:03,517 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:03,517 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-14 16:39:03,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 16:39:03,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:03,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:03,768 INFO L256 TraceCheckUtils]: 0: Hoare triple {923#true} call ULTIMATE.init(); {923#true} is VALID [2018-11-14 16:39:03,769 INFO L273 TraceCheckUtils]: 1: Hoare triple {923#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {923#true} is VALID [2018-11-14 16:39:03,769 INFO L273 TraceCheckUtils]: 2: Hoare triple {923#true} assume true; {923#true} is VALID [2018-11-14 16:39:03,770 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {923#true} {923#true} #50#return; {923#true} is VALID [2018-11-14 16:39:03,770 INFO L256 TraceCheckUtils]: 4: Hoare triple {923#true} call #t~ret4 := main(); {923#true} is VALID [2018-11-14 16:39:03,771 INFO L273 TraceCheckUtils]: 5: Hoare triple {923#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4096bv32);havoc ~i~0;~i~0 := 0bv32; {943#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:03,771 INFO L273 TraceCheckUtils]: 6: Hoare triple {943#(= main_~i~0 (_ bv0 32))} assume true; {943#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:03,772 INFO L273 TraceCheckUtils]: 7: Hoare triple {943#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {943#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:03,773 INFO L273 TraceCheckUtils]: 8: Hoare triple {943#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {953#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:03,773 INFO L273 TraceCheckUtils]: 9: Hoare triple {953#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {953#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:03,774 INFO L273 TraceCheckUtils]: 10: Hoare triple {953#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {953#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:03,775 INFO L273 TraceCheckUtils]: 11: Hoare triple {953#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {963#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:39:03,776 INFO L273 TraceCheckUtils]: 12: Hoare triple {963#(= (_ bv2 32) main_~i~0)} assume true; {963#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:39:03,777 INFO L273 TraceCheckUtils]: 13: Hoare triple {963#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {963#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:39:03,796 INFO L273 TraceCheckUtils]: 14: Hoare triple {963#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {973#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:03,811 INFO L273 TraceCheckUtils]: 15: Hoare triple {973#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {973#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:03,818 INFO L273 TraceCheckUtils]: 16: Hoare triple {973#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {973#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:03,819 INFO L273 TraceCheckUtils]: 17: Hoare triple {973#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {983#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 16:39:03,821 INFO L273 TraceCheckUtils]: 18: Hoare triple {983#(= (_ bv4 32) main_~i~0)} assume true; {983#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 16:39:03,821 INFO L273 TraceCheckUtils]: 19: Hoare triple {983#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 1024bv32); {924#false} is VALID [2018-11-14 16:39:03,821 INFO L273 TraceCheckUtils]: 20: Hoare triple {924#false} ~i~0 := 0bv32; {924#false} is VALID [2018-11-14 16:39:03,822 INFO L273 TraceCheckUtils]: 21: Hoare triple {924#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {924#false} is VALID [2018-11-14 16:39:03,822 INFO L273 TraceCheckUtils]: 22: Hoare triple {924#false} assume !!(#t~mem3 != 0bv32 && ~bvslt32(~i~0, 1024bv32));havoc #t~mem3; {924#false} is VALID [2018-11-14 16:39:03,822 INFO L273 TraceCheckUtils]: 23: Hoare triple {924#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {924#false} is VALID [2018-11-14 16:39:03,822 INFO L273 TraceCheckUtils]: 24: Hoare triple {924#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {924#false} is VALID [2018-11-14 16:39:03,823 INFO L273 TraceCheckUtils]: 25: Hoare triple {924#false} assume !(#t~mem3 != 0bv32 && ~bvslt32(~i~0, 1024bv32));havoc #t~mem3; {924#false} is VALID [2018-11-14 16:39:03,823 INFO L256 TraceCheckUtils]: 26: Hoare triple {924#false} call __VERIFIER_assert((if ~bvsle32(~i~0, 512bv32) then 1bv32 else 0bv32)); {924#false} is VALID [2018-11-14 16:39:03,823 INFO L273 TraceCheckUtils]: 27: Hoare triple {924#false} ~cond := #in~cond; {924#false} is VALID [2018-11-14 16:39:03,823 INFO L273 TraceCheckUtils]: 28: Hoare triple {924#false} assume ~cond == 0bv32; {924#false} is VALID [2018-11-14 16:39:03,823 INFO L273 TraceCheckUtils]: 29: Hoare triple {924#false} assume !false; {924#false} is VALID [2018-11-14 16:39:03,826 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 16:39:03,826 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:39:04,018 INFO L273 TraceCheckUtils]: 29: Hoare triple {924#false} assume !false; {924#false} is VALID [2018-11-14 16:39:04,019 INFO L273 TraceCheckUtils]: 28: Hoare triple {924#false} assume ~cond == 0bv32; {924#false} is VALID [2018-11-14 16:39:04,020 INFO L273 TraceCheckUtils]: 27: Hoare triple {924#false} ~cond := #in~cond; {924#false} is VALID [2018-11-14 16:39:04,020 INFO L256 TraceCheckUtils]: 26: Hoare triple {924#false} call __VERIFIER_assert((if ~bvsle32(~i~0, 512bv32) then 1bv32 else 0bv32)); {924#false} is VALID [2018-11-14 16:39:04,021 INFO L273 TraceCheckUtils]: 25: Hoare triple {924#false} assume !(#t~mem3 != 0bv32 && ~bvslt32(~i~0, 1024bv32));havoc #t~mem3; {924#false} is VALID [2018-11-14 16:39:04,021 INFO L273 TraceCheckUtils]: 24: Hoare triple {924#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {924#false} is VALID [2018-11-14 16:39:04,021 INFO L273 TraceCheckUtils]: 23: Hoare triple {924#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {924#false} is VALID [2018-11-14 16:39:04,022 INFO L273 TraceCheckUtils]: 22: Hoare triple {924#false} assume !!(#t~mem3 != 0bv32 && ~bvslt32(~i~0, 1024bv32));havoc #t~mem3; {924#false} is VALID [2018-11-14 16:39:04,022 INFO L273 TraceCheckUtils]: 21: Hoare triple {924#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {924#false} is VALID [2018-11-14 16:39:04,022 INFO L273 TraceCheckUtils]: 20: Hoare triple {924#false} ~i~0 := 0bv32; {924#false} is VALID [2018-11-14 16:39:04,028 INFO L273 TraceCheckUtils]: 19: Hoare triple {1050#(bvslt main_~i~0 (_ bv1024 32))} assume !~bvslt32(~i~0, 1024bv32); {924#false} is VALID [2018-11-14 16:39:04,029 INFO L273 TraceCheckUtils]: 18: Hoare triple {1050#(bvslt main_~i~0 (_ bv1024 32))} assume true; {1050#(bvslt main_~i~0 (_ bv1024 32))} is VALID [2018-11-14 16:39:04,030 INFO L273 TraceCheckUtils]: 17: Hoare triple {1057#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1050#(bvslt main_~i~0 (_ bv1024 32))} is VALID [2018-11-14 16:39:04,031 INFO L273 TraceCheckUtils]: 16: Hoare triple {1057#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1057#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:04,031 INFO L273 TraceCheckUtils]: 15: Hoare triple {1057#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume true; {1057#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:04,034 INFO L273 TraceCheckUtils]: 14: Hoare triple {1067#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1057#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:04,035 INFO L273 TraceCheckUtils]: 13: Hoare triple {1067#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1067#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:04,035 INFO L273 TraceCheckUtils]: 12: Hoare triple {1067#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} assume true; {1067#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:04,039 INFO L273 TraceCheckUtils]: 11: Hoare triple {1077#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1067#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:04,039 INFO L273 TraceCheckUtils]: 10: Hoare triple {1077#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1077#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:04,040 INFO L273 TraceCheckUtils]: 9: Hoare triple {1077#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} assume true; {1077#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:04,043 INFO L273 TraceCheckUtils]: 8: Hoare triple {1087#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1077#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:04,044 INFO L273 TraceCheckUtils]: 7: Hoare triple {1087#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1087#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:04,044 INFO L273 TraceCheckUtils]: 6: Hoare triple {1087#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} assume true; {1087#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:04,045 INFO L273 TraceCheckUtils]: 5: Hoare triple {923#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4096bv32);havoc ~i~0;~i~0 := 0bv32; {1087#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:04,046 INFO L256 TraceCheckUtils]: 4: Hoare triple {923#true} call #t~ret4 := main(); {923#true} is VALID [2018-11-14 16:39:04,046 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {923#true} {923#true} #50#return; {923#true} is VALID [2018-11-14 16:39:04,046 INFO L273 TraceCheckUtils]: 2: Hoare triple {923#true} assume true; {923#true} is VALID [2018-11-14 16:39:04,046 INFO L273 TraceCheckUtils]: 1: Hoare triple {923#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {923#true} is VALID [2018-11-14 16:39:04,046 INFO L256 TraceCheckUtils]: 0: Hoare triple {923#true} call ULTIMATE.init(); {923#true} is VALID [2018-11-14 16:39:04,049 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 16:39:04,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:39:04,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 16:39:04,056 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-11-14 16:39:04,057 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:04,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:39:04,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:04,143 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:39:04,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:39:04,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:39:04,144 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 12 states. [2018-11-14 16:39:05,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:05,843 INFO L93 Difference]: Finished difference Result 96 states and 112 transitions. [2018-11-14 16:39:05,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 16:39:05,843 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 30 [2018-11-14 16:39:05,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:05,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:39:05,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 110 transitions. [2018-11-14 16:39:05,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:39:05,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 110 transitions. [2018-11-14 16:39:05,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 110 transitions. [2018-11-14 16:39:06,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:06,108 INFO L225 Difference]: With dead ends: 96 [2018-11-14 16:39:06,108 INFO L226 Difference]: Without dead ends: 85 [2018-11-14 16:39:06,109 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-14 16:39:06,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-14 16:39:06,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 49. [2018-11-14 16:39:06,140 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:06,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 49 states. [2018-11-14 16:39:06,140 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 49 states. [2018-11-14 16:39:06,140 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 49 states. [2018-11-14 16:39:06,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:06,145 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-11-14 16:39:06,145 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-11-14 16:39:06,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:06,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:06,147 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 85 states. [2018-11-14 16:39:06,147 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 85 states. [2018-11-14 16:39:06,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:06,152 INFO L93 Difference]: Finished difference Result 85 states and 95 transitions. [2018-11-14 16:39:06,152 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 95 transitions. [2018-11-14 16:39:06,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:06,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:06,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:06,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:06,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-14 16:39:06,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-11-14 16:39:06,156 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 30 [2018-11-14 16:39:06,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:06,157 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-11-14 16:39:06,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:39:06,157 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-11-14 16:39:06,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-14 16:39:06,158 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:06,158 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:06,159 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:06,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:06,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1853824978, now seen corresponding path program 2 times [2018-11-14 16:39:06,160 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:06,160 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-14 16:39:06,176 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:39:06,246 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:39:06,246 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:39:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:06,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:06,489 INFO L256 TraceCheckUtils]: 0: Hoare triple {1497#true} call ULTIMATE.init(); {1497#true} is VALID [2018-11-14 16:39:06,489 INFO L273 TraceCheckUtils]: 1: Hoare triple {1497#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1497#true} is VALID [2018-11-14 16:39:06,489 INFO L273 TraceCheckUtils]: 2: Hoare triple {1497#true} assume true; {1497#true} is VALID [2018-11-14 16:39:06,489 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1497#true} {1497#true} #50#return; {1497#true} is VALID [2018-11-14 16:39:06,489 INFO L256 TraceCheckUtils]: 4: Hoare triple {1497#true} call #t~ret4 := main(); {1497#true} is VALID [2018-11-14 16:39:06,490 INFO L273 TraceCheckUtils]: 5: Hoare triple {1497#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4096bv32);havoc ~i~0;~i~0 := 0bv32; {1517#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:06,490 INFO L273 TraceCheckUtils]: 6: Hoare triple {1517#(= main_~i~0 (_ bv0 32))} assume true; {1517#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:06,491 INFO L273 TraceCheckUtils]: 7: Hoare triple {1517#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1517#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:06,491 INFO L273 TraceCheckUtils]: 8: Hoare triple {1517#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1527#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:06,491 INFO L273 TraceCheckUtils]: 9: Hoare triple {1527#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1527#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:06,492 INFO L273 TraceCheckUtils]: 10: Hoare triple {1527#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1527#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:06,492 INFO L273 TraceCheckUtils]: 11: Hoare triple {1527#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1537#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:39:06,493 INFO L273 TraceCheckUtils]: 12: Hoare triple {1537#(= (_ bv2 32) main_~i~0)} assume true; {1537#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:39:06,493 INFO L273 TraceCheckUtils]: 13: Hoare triple {1537#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1537#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:39:06,494 INFO L273 TraceCheckUtils]: 14: Hoare triple {1537#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1547#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:06,495 INFO L273 TraceCheckUtils]: 15: Hoare triple {1547#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1547#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:06,495 INFO L273 TraceCheckUtils]: 16: Hoare triple {1547#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1547#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:06,496 INFO L273 TraceCheckUtils]: 17: Hoare triple {1547#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1557#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 16:39:06,497 INFO L273 TraceCheckUtils]: 18: Hoare triple {1557#(= (_ bv4 32) main_~i~0)} assume true; {1557#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 16:39:06,497 INFO L273 TraceCheckUtils]: 19: Hoare triple {1557#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1557#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 16:39:06,498 INFO L273 TraceCheckUtils]: 20: Hoare triple {1557#(= (_ bv4 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1567#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:06,499 INFO L273 TraceCheckUtils]: 21: Hoare triple {1567#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {1567#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:06,499 INFO L273 TraceCheckUtils]: 22: Hoare triple {1567#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1567#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:06,500 INFO L273 TraceCheckUtils]: 23: Hoare triple {1567#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1577#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 16:39:06,503 INFO L273 TraceCheckUtils]: 24: Hoare triple {1577#(= (_ bv6 32) main_~i~0)} assume true; {1577#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 16:39:06,503 INFO L273 TraceCheckUtils]: 25: Hoare triple {1577#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1577#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 16:39:06,504 INFO L273 TraceCheckUtils]: 26: Hoare triple {1577#(= (_ bv6 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1587#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:06,504 INFO L273 TraceCheckUtils]: 27: Hoare triple {1587#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {1587#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:06,504 INFO L273 TraceCheckUtils]: 28: Hoare triple {1587#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1587#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:06,505 INFO L273 TraceCheckUtils]: 29: Hoare triple {1587#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1597#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-14 16:39:06,505 INFO L273 TraceCheckUtils]: 30: Hoare triple {1597#(= (_ bv8 32) main_~i~0)} assume true; {1597#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-14 16:39:06,506 INFO L273 TraceCheckUtils]: 31: Hoare triple {1597#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1597#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-14 16:39:06,506 INFO L273 TraceCheckUtils]: 32: Hoare triple {1597#(= (_ bv8 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1607#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:06,507 INFO L273 TraceCheckUtils]: 33: Hoare triple {1607#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume true; {1607#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:06,508 INFO L273 TraceCheckUtils]: 34: Hoare triple {1607#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1607#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:06,508 INFO L273 TraceCheckUtils]: 35: Hoare triple {1607#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1617#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-14 16:39:06,509 INFO L273 TraceCheckUtils]: 36: Hoare triple {1617#(= (_ bv10 32) main_~i~0)} assume true; {1617#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-14 16:39:06,510 INFO L273 TraceCheckUtils]: 37: Hoare triple {1617#(= (_ bv10 32) main_~i~0)} assume !~bvslt32(~i~0, 1024bv32); {1498#false} is VALID [2018-11-14 16:39:06,510 INFO L273 TraceCheckUtils]: 38: Hoare triple {1498#false} ~i~0 := 0bv32; {1498#false} is VALID [2018-11-14 16:39:06,510 INFO L273 TraceCheckUtils]: 39: Hoare triple {1498#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1498#false} is VALID [2018-11-14 16:39:06,511 INFO L273 TraceCheckUtils]: 40: Hoare triple {1498#false} assume !!(#t~mem3 != 0bv32 && ~bvslt32(~i~0, 1024bv32));havoc #t~mem3; {1498#false} is VALID [2018-11-14 16:39:06,511 INFO L273 TraceCheckUtils]: 41: Hoare triple {1498#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1498#false} is VALID [2018-11-14 16:39:06,511 INFO L273 TraceCheckUtils]: 42: Hoare triple {1498#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1498#false} is VALID [2018-11-14 16:39:06,512 INFO L273 TraceCheckUtils]: 43: Hoare triple {1498#false} assume !(#t~mem3 != 0bv32 && ~bvslt32(~i~0, 1024bv32));havoc #t~mem3; {1498#false} is VALID [2018-11-14 16:39:06,512 INFO L256 TraceCheckUtils]: 44: Hoare triple {1498#false} call __VERIFIER_assert((if ~bvsle32(~i~0, 512bv32) then 1bv32 else 0bv32)); {1498#false} is VALID [2018-11-14 16:39:06,512 INFO L273 TraceCheckUtils]: 45: Hoare triple {1498#false} ~cond := #in~cond; {1498#false} is VALID [2018-11-14 16:39:06,513 INFO L273 TraceCheckUtils]: 46: Hoare triple {1498#false} assume ~cond == 0bv32; {1498#false} is VALID [2018-11-14 16:39:06,513 INFO L273 TraceCheckUtils]: 47: Hoare triple {1498#false} assume !false; {1498#false} is VALID [2018-11-14 16:39:06,517 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 16:39:06,517 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:39:07,233 INFO L273 TraceCheckUtils]: 47: Hoare triple {1498#false} assume !false; {1498#false} is VALID [2018-11-14 16:39:07,233 INFO L273 TraceCheckUtils]: 46: Hoare triple {1498#false} assume ~cond == 0bv32; {1498#false} is VALID [2018-11-14 16:39:07,234 INFO L273 TraceCheckUtils]: 45: Hoare triple {1498#false} ~cond := #in~cond; {1498#false} is VALID [2018-11-14 16:39:07,234 INFO L256 TraceCheckUtils]: 44: Hoare triple {1498#false} call __VERIFIER_assert((if ~bvsle32(~i~0, 512bv32) then 1bv32 else 0bv32)); {1498#false} is VALID [2018-11-14 16:39:07,234 INFO L273 TraceCheckUtils]: 43: Hoare triple {1498#false} assume !(#t~mem3 != 0bv32 && ~bvslt32(~i~0, 1024bv32));havoc #t~mem3; {1498#false} is VALID [2018-11-14 16:39:07,235 INFO L273 TraceCheckUtils]: 42: Hoare triple {1498#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1498#false} is VALID [2018-11-14 16:39:07,235 INFO L273 TraceCheckUtils]: 41: Hoare triple {1498#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1498#false} is VALID [2018-11-14 16:39:07,235 INFO L273 TraceCheckUtils]: 40: Hoare triple {1498#false} assume !!(#t~mem3 != 0bv32 && ~bvslt32(~i~0, 1024bv32));havoc #t~mem3; {1498#false} is VALID [2018-11-14 16:39:07,235 INFO L273 TraceCheckUtils]: 39: Hoare triple {1498#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1498#false} is VALID [2018-11-14 16:39:07,236 INFO L273 TraceCheckUtils]: 38: Hoare triple {1498#false} ~i~0 := 0bv32; {1498#false} is VALID [2018-11-14 16:39:07,242 INFO L273 TraceCheckUtils]: 37: Hoare triple {1684#(bvslt main_~i~0 (_ bv1024 32))} assume !~bvslt32(~i~0, 1024bv32); {1498#false} is VALID [2018-11-14 16:39:07,261 INFO L273 TraceCheckUtils]: 36: Hoare triple {1684#(bvslt main_~i~0 (_ bv1024 32))} assume true; {1684#(bvslt main_~i~0 (_ bv1024 32))} is VALID [2018-11-14 16:39:07,275 INFO L273 TraceCheckUtils]: 35: Hoare triple {1691#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1684#(bvslt main_~i~0 (_ bv1024 32))} is VALID [2018-11-14 16:39:07,282 INFO L273 TraceCheckUtils]: 34: Hoare triple {1691#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1691#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,283 INFO L273 TraceCheckUtils]: 33: Hoare triple {1691#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume true; {1691#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,286 INFO L273 TraceCheckUtils]: 32: Hoare triple {1701#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1691#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,287 INFO L273 TraceCheckUtils]: 31: Hoare triple {1701#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1701#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,287 INFO L273 TraceCheckUtils]: 30: Hoare triple {1701#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} assume true; {1701#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,290 INFO L273 TraceCheckUtils]: 29: Hoare triple {1711#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1701#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,292 INFO L273 TraceCheckUtils]: 28: Hoare triple {1711#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1711#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,292 INFO L273 TraceCheckUtils]: 27: Hoare triple {1711#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} assume true; {1711#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,296 INFO L273 TraceCheckUtils]: 26: Hoare triple {1721#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1711#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,297 INFO L273 TraceCheckUtils]: 25: Hoare triple {1721#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1721#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,298 INFO L273 TraceCheckUtils]: 24: Hoare triple {1721#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} assume true; {1721#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,301 INFO L273 TraceCheckUtils]: 23: Hoare triple {1731#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1721#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,302 INFO L273 TraceCheckUtils]: 22: Hoare triple {1731#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1731#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,305 INFO L273 TraceCheckUtils]: 21: Hoare triple {1731#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv1024 32))} assume true; {1731#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,309 INFO L273 TraceCheckUtils]: 20: Hoare triple {1741#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1731#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,309 INFO L273 TraceCheckUtils]: 19: Hoare triple {1741#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1741#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,310 INFO L273 TraceCheckUtils]: 18: Hoare triple {1741#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv1024 32))} assume true; {1741#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,313 INFO L273 TraceCheckUtils]: 17: Hoare triple {1751#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1741#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,314 INFO L273 TraceCheckUtils]: 16: Hoare triple {1751#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1751#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,315 INFO L273 TraceCheckUtils]: 15: Hoare triple {1751#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv1024 32))} assume true; {1751#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,318 INFO L273 TraceCheckUtils]: 14: Hoare triple {1761#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1751#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,319 INFO L273 TraceCheckUtils]: 13: Hoare triple {1761#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1761#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,319 INFO L273 TraceCheckUtils]: 12: Hoare triple {1761#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv1024 32))} assume true; {1761#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,323 INFO L273 TraceCheckUtils]: 11: Hoare triple {1771#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1761#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,324 INFO L273 TraceCheckUtils]: 10: Hoare triple {1771#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1771#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,324 INFO L273 TraceCheckUtils]: 9: Hoare triple {1771#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv1024 32))} assume true; {1771#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,328 INFO L273 TraceCheckUtils]: 8: Hoare triple {1781#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1771#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,329 INFO L273 TraceCheckUtils]: 7: Hoare triple {1781#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {1781#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,329 INFO L273 TraceCheckUtils]: 6: Hoare triple {1781#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv1024 32))} assume true; {1781#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {1497#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4096bv32);havoc ~i~0;~i~0 := 0bv32; {1781#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:07,330 INFO L256 TraceCheckUtils]: 4: Hoare triple {1497#true} call #t~ret4 := main(); {1497#true} is VALID [2018-11-14 16:39:07,331 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1497#true} {1497#true} #50#return; {1497#true} is VALID [2018-11-14 16:39:07,331 INFO L273 TraceCheckUtils]: 2: Hoare triple {1497#true} assume true; {1497#true} is VALID [2018-11-14 16:39:07,331 INFO L273 TraceCheckUtils]: 1: Hoare triple {1497#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1497#true} is VALID [2018-11-14 16:39:07,331 INFO L256 TraceCheckUtils]: 0: Hoare triple {1497#true} call ULTIMATE.init(); {1497#true} is VALID [2018-11-14 16:39:07,337 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-14 16:39:07,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:39:07,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-14 16:39:07,342 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 48 [2018-11-14 16:39:07,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:07,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 16:39:07,548 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:07,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 16:39:07,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 16:39:07,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-14 16:39:07,549 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 24 states. [2018-11-14 16:39:09,187 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 7 [2018-11-14 16:39:13,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:13,582 INFO L93 Difference]: Finished difference Result 180 states and 214 transitions. [2018-11-14 16:39:13,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 16:39:13,582 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 48 [2018-11-14 16:39:13,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:13,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 16:39:13,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 212 transitions. [2018-11-14 16:39:13,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 16:39:13,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 212 transitions. [2018-11-14 16:39:13,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 212 transitions. [2018-11-14 16:39:13,990 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:13,997 INFO L225 Difference]: With dead ends: 180 [2018-11-14 16:39:13,997 INFO L226 Difference]: Without dead ends: 169 [2018-11-14 16:39:13,998 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 16:39:13,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-14 16:39:14,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 85. [2018-11-14 16:39:14,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:14,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand 85 states. [2018-11-14 16:39:14,080 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 85 states. [2018-11-14 16:39:14,081 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 85 states. [2018-11-14 16:39:14,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:14,088 INFO L93 Difference]: Finished difference Result 169 states and 191 transitions. [2018-11-14 16:39:14,088 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 191 transitions. [2018-11-14 16:39:14,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:14,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:14,090 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 169 states. [2018-11-14 16:39:14,090 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 169 states. [2018-11-14 16:39:14,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:14,097 INFO L93 Difference]: Finished difference Result 169 states and 191 transitions. [2018-11-14 16:39:14,097 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 191 transitions. [2018-11-14 16:39:14,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:14,098 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:14,098 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:14,098 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:14,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-14 16:39:14,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 86 transitions. [2018-11-14 16:39:14,101 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 86 transitions. Word has length 48 [2018-11-14 16:39:14,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:14,102 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 86 transitions. [2018-11-14 16:39:14,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 16:39:14,102 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2018-11-14 16:39:14,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-14 16:39:14,104 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:14,104 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:14,104 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:14,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:14,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1039381742, now seen corresponding path program 3 times [2018-11-14 16:39:14,105 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:14,105 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-14 16:39:14,130 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 16:39:14,177 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 16:39:14,177 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:39:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:14,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:14,314 INFO L256 TraceCheckUtils]: 0: Hoare triple {2539#true} call ULTIMATE.init(); {2539#true} is VALID [2018-11-14 16:39:14,314 INFO L273 TraceCheckUtils]: 1: Hoare triple {2539#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2539#true} is VALID [2018-11-14 16:39:14,314 INFO L273 TraceCheckUtils]: 2: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,315 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2539#true} {2539#true} #50#return; {2539#true} is VALID [2018-11-14 16:39:14,315 INFO L256 TraceCheckUtils]: 4: Hoare triple {2539#true} call #t~ret4 := main(); {2539#true} is VALID [2018-11-14 16:39:14,315 INFO L273 TraceCheckUtils]: 5: Hoare triple {2539#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4096bv32);havoc ~i~0;~i~0 := 0bv32; {2539#true} is VALID [2018-11-14 16:39:14,316 INFO L273 TraceCheckUtils]: 6: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,316 INFO L273 TraceCheckUtils]: 7: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,317 INFO L273 TraceCheckUtils]: 8: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,317 INFO L273 TraceCheckUtils]: 9: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,317 INFO L273 TraceCheckUtils]: 10: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,317 INFO L273 TraceCheckUtils]: 11: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,318 INFO L273 TraceCheckUtils]: 12: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,318 INFO L273 TraceCheckUtils]: 13: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,318 INFO L273 TraceCheckUtils]: 14: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,318 INFO L273 TraceCheckUtils]: 15: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,318 INFO L273 TraceCheckUtils]: 16: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,318 INFO L273 TraceCheckUtils]: 17: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,319 INFO L273 TraceCheckUtils]: 18: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,319 INFO L273 TraceCheckUtils]: 19: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,319 INFO L273 TraceCheckUtils]: 20: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,319 INFO L273 TraceCheckUtils]: 21: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,319 INFO L273 TraceCheckUtils]: 22: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,319 INFO L273 TraceCheckUtils]: 23: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,320 INFO L273 TraceCheckUtils]: 24: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,320 INFO L273 TraceCheckUtils]: 25: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,320 INFO L273 TraceCheckUtils]: 26: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,320 INFO L273 TraceCheckUtils]: 27: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,320 INFO L273 TraceCheckUtils]: 28: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,320 INFO L273 TraceCheckUtils]: 29: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,321 INFO L273 TraceCheckUtils]: 30: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,321 INFO L273 TraceCheckUtils]: 31: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,321 INFO L273 TraceCheckUtils]: 32: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,321 INFO L273 TraceCheckUtils]: 33: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,321 INFO L273 TraceCheckUtils]: 34: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,321 INFO L273 TraceCheckUtils]: 35: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,322 INFO L273 TraceCheckUtils]: 36: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,322 INFO L273 TraceCheckUtils]: 37: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,322 INFO L273 TraceCheckUtils]: 38: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,322 INFO L273 TraceCheckUtils]: 39: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,322 INFO L273 TraceCheckUtils]: 40: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,322 INFO L273 TraceCheckUtils]: 41: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,322 INFO L273 TraceCheckUtils]: 42: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,323 INFO L273 TraceCheckUtils]: 43: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,323 INFO L273 TraceCheckUtils]: 44: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,323 INFO L273 TraceCheckUtils]: 45: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,323 INFO L273 TraceCheckUtils]: 46: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,323 INFO L273 TraceCheckUtils]: 47: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,324 INFO L273 TraceCheckUtils]: 48: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,324 INFO L273 TraceCheckUtils]: 49: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,324 INFO L273 TraceCheckUtils]: 50: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,324 INFO L273 TraceCheckUtils]: 51: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,324 INFO L273 TraceCheckUtils]: 52: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,325 INFO L273 TraceCheckUtils]: 53: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,325 INFO L273 TraceCheckUtils]: 54: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,325 INFO L273 TraceCheckUtils]: 55: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,325 INFO L273 TraceCheckUtils]: 56: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,325 INFO L273 TraceCheckUtils]: 57: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,326 INFO L273 TraceCheckUtils]: 58: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,326 INFO L273 TraceCheckUtils]: 59: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,326 INFO L273 TraceCheckUtils]: 60: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,326 INFO L273 TraceCheckUtils]: 61: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,326 INFO L273 TraceCheckUtils]: 62: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,327 INFO L273 TraceCheckUtils]: 63: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,327 INFO L273 TraceCheckUtils]: 64: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,327 INFO L273 TraceCheckUtils]: 65: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,327 INFO L273 TraceCheckUtils]: 66: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,328 INFO L273 TraceCheckUtils]: 67: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,328 INFO L273 TraceCheckUtils]: 68: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,328 INFO L273 TraceCheckUtils]: 69: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,328 INFO L273 TraceCheckUtils]: 70: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,328 INFO L273 TraceCheckUtils]: 71: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,328 INFO L273 TraceCheckUtils]: 72: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,329 INFO L273 TraceCheckUtils]: 73: Hoare triple {2539#true} assume !~bvslt32(~i~0, 1024bv32); {2539#true} is VALID [2018-11-14 16:39:14,329 INFO L273 TraceCheckUtils]: 74: Hoare triple {2539#true} ~i~0 := 0bv32; {2766#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:14,330 INFO L273 TraceCheckUtils]: 75: Hoare triple {2766#(= main_~i~0 (_ bv0 32))} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2766#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:14,331 INFO L273 TraceCheckUtils]: 76: Hoare triple {2766#(= main_~i~0 (_ bv0 32))} assume !!(#t~mem3 != 0bv32 && ~bvslt32(~i~0, 1024bv32));havoc #t~mem3; {2766#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:14,331 INFO L273 TraceCheckUtils]: 77: Hoare triple {2766#(= main_~i~0 (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2776#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:14,333 INFO L273 TraceCheckUtils]: 78: Hoare triple {2776#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2776#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:14,333 INFO L273 TraceCheckUtils]: 79: Hoare triple {2776#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(#t~mem3 != 0bv32 && ~bvslt32(~i~0, 1024bv32));havoc #t~mem3; {2776#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:14,335 INFO L256 TraceCheckUtils]: 80: Hoare triple {2776#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call __VERIFIER_assert((if ~bvsle32(~i~0, 512bv32) then 1bv32 else 0bv32)); {2786#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:14,335 INFO L273 TraceCheckUtils]: 81: Hoare triple {2786#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {2790#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:14,337 INFO L273 TraceCheckUtils]: 82: Hoare triple {2790#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {2540#false} is VALID [2018-11-14 16:39:14,337 INFO L273 TraceCheckUtils]: 83: Hoare triple {2540#false} assume !false; {2540#false} is VALID [2018-11-14 16:39:14,346 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-11-14 16:39:14,346 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:39:14,528 INFO L273 TraceCheckUtils]: 83: Hoare triple {2540#false} assume !false; {2540#false} is VALID [2018-11-14 16:39:14,529 INFO L273 TraceCheckUtils]: 82: Hoare triple {2800#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {2540#false} is VALID [2018-11-14 16:39:14,529 INFO L273 TraceCheckUtils]: 81: Hoare triple {2804#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {2800#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 16:39:14,530 INFO L256 TraceCheckUtils]: 80: Hoare triple {2808#(bvsle main_~i~0 (_ bv512 32))} call __VERIFIER_assert((if ~bvsle32(~i~0, 512bv32) then 1bv32 else 0bv32)); {2804#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 16:39:14,530 INFO L273 TraceCheckUtils]: 79: Hoare triple {2808#(bvsle main_~i~0 (_ bv512 32))} assume !(#t~mem3 != 0bv32 && ~bvslt32(~i~0, 1024bv32));havoc #t~mem3; {2808#(bvsle main_~i~0 (_ bv512 32))} is VALID [2018-11-14 16:39:14,531 INFO L273 TraceCheckUtils]: 78: Hoare triple {2808#(bvsle main_~i~0 (_ bv512 32))} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2808#(bvsle main_~i~0 (_ bv512 32))} is VALID [2018-11-14 16:39:14,532 INFO L273 TraceCheckUtils]: 77: Hoare triple {2818#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv512 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2808#(bvsle main_~i~0 (_ bv512 32))} is VALID [2018-11-14 16:39:14,533 INFO L273 TraceCheckUtils]: 76: Hoare triple {2818#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv512 32))} assume !!(#t~mem3 != 0bv32 && ~bvslt32(~i~0, 1024bv32));havoc #t~mem3; {2818#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv512 32))} is VALID [2018-11-14 16:39:14,533 INFO L273 TraceCheckUtils]: 75: Hoare triple {2818#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv512 32))} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2818#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv512 32))} is VALID [2018-11-14 16:39:14,534 INFO L273 TraceCheckUtils]: 74: Hoare triple {2539#true} ~i~0 := 0bv32; {2818#(bvsle (bvadd main_~i~0 (_ bv1 32)) (_ bv512 32))} is VALID [2018-11-14 16:39:14,534 INFO L273 TraceCheckUtils]: 73: Hoare triple {2539#true} assume !~bvslt32(~i~0, 1024bv32); {2539#true} is VALID [2018-11-14 16:39:14,535 INFO L273 TraceCheckUtils]: 72: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,535 INFO L273 TraceCheckUtils]: 71: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,535 INFO L273 TraceCheckUtils]: 70: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,535 INFO L273 TraceCheckUtils]: 69: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,536 INFO L273 TraceCheckUtils]: 68: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,536 INFO L273 TraceCheckUtils]: 67: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,536 INFO L273 TraceCheckUtils]: 66: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,537 INFO L273 TraceCheckUtils]: 65: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,537 INFO L273 TraceCheckUtils]: 64: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,537 INFO L273 TraceCheckUtils]: 63: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,538 INFO L273 TraceCheckUtils]: 62: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,538 INFO L273 TraceCheckUtils]: 61: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,538 INFO L273 TraceCheckUtils]: 60: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,538 INFO L273 TraceCheckUtils]: 59: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,539 INFO L273 TraceCheckUtils]: 58: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,539 INFO L273 TraceCheckUtils]: 57: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,539 INFO L273 TraceCheckUtils]: 56: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,539 INFO L273 TraceCheckUtils]: 55: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,540 INFO L273 TraceCheckUtils]: 54: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,540 INFO L273 TraceCheckUtils]: 53: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,540 INFO L273 TraceCheckUtils]: 52: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,540 INFO L273 TraceCheckUtils]: 51: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,540 INFO L273 TraceCheckUtils]: 50: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,541 INFO L273 TraceCheckUtils]: 49: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,541 INFO L273 TraceCheckUtils]: 48: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,541 INFO L273 TraceCheckUtils]: 47: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,541 INFO L273 TraceCheckUtils]: 46: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,541 INFO L273 TraceCheckUtils]: 45: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,542 INFO L273 TraceCheckUtils]: 44: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,542 INFO L273 TraceCheckUtils]: 43: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,542 INFO L273 TraceCheckUtils]: 42: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,542 INFO L273 TraceCheckUtils]: 41: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,542 INFO L273 TraceCheckUtils]: 40: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,543 INFO L273 TraceCheckUtils]: 39: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,543 INFO L273 TraceCheckUtils]: 38: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,543 INFO L273 TraceCheckUtils]: 37: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,543 INFO L273 TraceCheckUtils]: 36: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,543 INFO L273 TraceCheckUtils]: 35: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,544 INFO L273 TraceCheckUtils]: 34: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,544 INFO L273 TraceCheckUtils]: 33: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,544 INFO L273 TraceCheckUtils]: 32: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,544 INFO L273 TraceCheckUtils]: 31: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,544 INFO L273 TraceCheckUtils]: 30: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,545 INFO L273 TraceCheckUtils]: 29: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,545 INFO L273 TraceCheckUtils]: 28: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,545 INFO L273 TraceCheckUtils]: 27: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,545 INFO L273 TraceCheckUtils]: 26: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,545 INFO L273 TraceCheckUtils]: 25: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,546 INFO L273 TraceCheckUtils]: 24: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,546 INFO L273 TraceCheckUtils]: 23: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,546 INFO L273 TraceCheckUtils]: 22: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,546 INFO L273 TraceCheckUtils]: 21: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,546 INFO L273 TraceCheckUtils]: 20: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,547 INFO L273 TraceCheckUtils]: 19: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,547 INFO L273 TraceCheckUtils]: 18: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,547 INFO L273 TraceCheckUtils]: 17: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,547 INFO L273 TraceCheckUtils]: 16: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,548 INFO L273 TraceCheckUtils]: 15: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,548 INFO L273 TraceCheckUtils]: 14: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,548 INFO L273 TraceCheckUtils]: 13: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,548 INFO L273 TraceCheckUtils]: 12: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,548 INFO L273 TraceCheckUtils]: 11: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,548 INFO L273 TraceCheckUtils]: 10: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,549 INFO L273 TraceCheckUtils]: 9: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,549 INFO L273 TraceCheckUtils]: 8: Hoare triple {2539#true} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2539#true} is VALID [2018-11-14 16:39:14,549 INFO L273 TraceCheckUtils]: 7: Hoare triple {2539#true} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {2539#true} is VALID [2018-11-14 16:39:14,549 INFO L273 TraceCheckUtils]: 6: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,549 INFO L273 TraceCheckUtils]: 5: Hoare triple {2539#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4096bv32);havoc ~i~0;~i~0 := 0bv32; {2539#true} is VALID [2018-11-14 16:39:14,550 INFO L256 TraceCheckUtils]: 4: Hoare triple {2539#true} call #t~ret4 := main(); {2539#true} is VALID [2018-11-14 16:39:14,550 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2539#true} {2539#true} #50#return; {2539#true} is VALID [2018-11-14 16:39:14,550 INFO L273 TraceCheckUtils]: 2: Hoare triple {2539#true} assume true; {2539#true} is VALID [2018-11-14 16:39:14,550 INFO L273 TraceCheckUtils]: 1: Hoare triple {2539#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2539#true} is VALID [2018-11-14 16:39:14,550 INFO L256 TraceCheckUtils]: 0: Hoare triple {2539#true} call ULTIMATE.init(); {2539#true} is VALID [2018-11-14 16:39:14,554 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 737 trivial. 0 not checked. [2018-11-14 16:39:14,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:39:14,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-14 16:39:14,557 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2018-11-14 16:39:14,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:14,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 16:39:14,597 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:14,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 16:39:14,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 16:39:14,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-14 16:39:14,598 INFO L87 Difference]: Start difference. First operand 85 states and 86 transitions. Second operand 10 states. [2018-11-14 16:39:15,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:15,332 INFO L93 Difference]: Finished difference Result 102 states and 105 transitions. [2018-11-14 16:39:15,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 16:39:15,332 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2018-11-14 16:39:15,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:15,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:39:15,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2018-11-14 16:39:15,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 16:39:15,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2018-11-14 16:39:15,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2018-11-14 16:39:15,433 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-14 16:39:15,436 INFO L225 Difference]: With dead ends: 102 [2018-11-14 16:39:15,436 INFO L226 Difference]: Without dead ends: 95 [2018-11-14 16:39:15,436 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:39:15,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-14 16:39:15,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-11-14 16:39:15,477 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:15,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand 94 states. [2018-11-14 16:39:15,478 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 94 states. [2018-11-14 16:39:15,478 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 94 states. [2018-11-14 16:39:15,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:15,481 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2018-11-14 16:39:15,481 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-11-14 16:39:15,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:15,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:15,482 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 95 states. [2018-11-14 16:39:15,482 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 95 states. [2018-11-14 16:39:15,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:15,485 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2018-11-14 16:39:15,485 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-11-14 16:39:15,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:15,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:15,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:15,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-14 16:39:15,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 95 transitions. [2018-11-14 16:39:15,489 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 95 transitions. Word has length 84 [2018-11-14 16:39:15,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:15,489 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 95 transitions. [2018-11-14 16:39:15,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 16:39:15,489 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 95 transitions. [2018-11-14 16:39:15,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-14 16:39:15,490 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:15,491 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:15,491 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:15,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:15,491 INFO L82 PathProgramCache]: Analyzing trace with hash 615609044, now seen corresponding path program 4 times [2018-11-14 16:39:15,492 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:15,492 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-14 16:39:15,515 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 16:39:15,610 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 16:39:15,611 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:39:15,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:39:15,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:39:16,279 INFO L256 TraceCheckUtils]: 0: Hoare triple {3515#true} call ULTIMATE.init(); {3515#true} is VALID [2018-11-14 16:39:16,279 INFO L273 TraceCheckUtils]: 1: Hoare triple {3515#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3515#true} is VALID [2018-11-14 16:39:16,280 INFO L273 TraceCheckUtils]: 2: Hoare triple {3515#true} assume true; {3515#true} is VALID [2018-11-14 16:39:16,280 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3515#true} {3515#true} #50#return; {3515#true} is VALID [2018-11-14 16:39:16,280 INFO L256 TraceCheckUtils]: 4: Hoare triple {3515#true} call #t~ret4 := main(); {3515#true} is VALID [2018-11-14 16:39:16,281 INFO L273 TraceCheckUtils]: 5: Hoare triple {3515#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4096bv32);havoc ~i~0;~i~0 := 0bv32; {3535#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:16,281 INFO L273 TraceCheckUtils]: 6: Hoare triple {3535#(= main_~i~0 (_ bv0 32))} assume true; {3535#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:16,282 INFO L273 TraceCheckUtils]: 7: Hoare triple {3535#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3535#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 16:39:16,282 INFO L273 TraceCheckUtils]: 8: Hoare triple {3535#(= main_~i~0 (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3545#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,283 INFO L273 TraceCheckUtils]: 9: Hoare triple {3545#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3545#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,283 INFO L273 TraceCheckUtils]: 10: Hoare triple {3545#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3545#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,283 INFO L273 TraceCheckUtils]: 11: Hoare triple {3545#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3555#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:39:16,284 INFO L273 TraceCheckUtils]: 12: Hoare triple {3555#(= (_ bv2 32) main_~i~0)} assume true; {3555#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:39:16,284 INFO L273 TraceCheckUtils]: 13: Hoare triple {3555#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3555#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 16:39:16,285 INFO L273 TraceCheckUtils]: 14: Hoare triple {3555#(= (_ bv2 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3565#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,285 INFO L273 TraceCheckUtils]: 15: Hoare triple {3565#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {3565#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,286 INFO L273 TraceCheckUtils]: 16: Hoare triple {3565#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3565#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,286 INFO L273 TraceCheckUtils]: 17: Hoare triple {3565#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3575#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 16:39:16,287 INFO L273 TraceCheckUtils]: 18: Hoare triple {3575#(= (_ bv4 32) main_~i~0)} assume true; {3575#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 16:39:16,288 INFO L273 TraceCheckUtils]: 19: Hoare triple {3575#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3575#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 16:39:16,289 INFO L273 TraceCheckUtils]: 20: Hoare triple {3575#(= (_ bv4 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3585#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,289 INFO L273 TraceCheckUtils]: 21: Hoare triple {3585#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3585#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,290 INFO L273 TraceCheckUtils]: 22: Hoare triple {3585#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3585#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,291 INFO L273 TraceCheckUtils]: 23: Hoare triple {3585#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3595#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 16:39:16,292 INFO L273 TraceCheckUtils]: 24: Hoare triple {3595#(= (_ bv6 32) main_~i~0)} assume true; {3595#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 16:39:16,293 INFO L273 TraceCheckUtils]: 25: Hoare triple {3595#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3595#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 16:39:16,294 INFO L273 TraceCheckUtils]: 26: Hoare triple {3595#(= (_ bv6 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3605#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,294 INFO L273 TraceCheckUtils]: 27: Hoare triple {3605#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {3605#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,295 INFO L273 TraceCheckUtils]: 28: Hoare triple {3605#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3605#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,296 INFO L273 TraceCheckUtils]: 29: Hoare triple {3605#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3615#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-14 16:39:16,297 INFO L273 TraceCheckUtils]: 30: Hoare triple {3615#(= (_ bv8 32) main_~i~0)} assume true; {3615#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-14 16:39:16,297 INFO L273 TraceCheckUtils]: 31: Hoare triple {3615#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3615#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-14 16:39:16,298 INFO L273 TraceCheckUtils]: 32: Hoare triple {3615#(= (_ bv8 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3625#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,299 INFO L273 TraceCheckUtils]: 33: Hoare triple {3625#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume true; {3625#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,299 INFO L273 TraceCheckUtils]: 34: Hoare triple {3625#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3625#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,300 INFO L273 TraceCheckUtils]: 35: Hoare triple {3625#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3635#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-14 16:39:16,301 INFO L273 TraceCheckUtils]: 36: Hoare triple {3635#(= (_ bv10 32) main_~i~0)} assume true; {3635#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-14 16:39:16,302 INFO L273 TraceCheckUtils]: 37: Hoare triple {3635#(= (_ bv10 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3635#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-14 16:39:16,302 INFO L273 TraceCheckUtils]: 38: Hoare triple {3635#(= (_ bv10 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3645#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,303 INFO L273 TraceCheckUtils]: 39: Hoare triple {3645#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume true; {3645#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,304 INFO L273 TraceCheckUtils]: 40: Hoare triple {3645#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3645#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,304 INFO L273 TraceCheckUtils]: 41: Hoare triple {3645#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3655#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-14 16:39:16,305 INFO L273 TraceCheckUtils]: 42: Hoare triple {3655#(= (_ bv12 32) main_~i~0)} assume true; {3655#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-14 16:39:16,306 INFO L273 TraceCheckUtils]: 43: Hoare triple {3655#(= (_ bv12 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3655#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-14 16:39:16,307 INFO L273 TraceCheckUtils]: 44: Hoare triple {3655#(= (_ bv12 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3665#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,307 INFO L273 TraceCheckUtils]: 45: Hoare triple {3665#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume true; {3665#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,308 INFO L273 TraceCheckUtils]: 46: Hoare triple {3665#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3665#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,309 INFO L273 TraceCheckUtils]: 47: Hoare triple {3665#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3675#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-14 16:39:16,309 INFO L273 TraceCheckUtils]: 48: Hoare triple {3675#(= (_ bv14 32) main_~i~0)} assume true; {3675#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-14 16:39:16,310 INFO L273 TraceCheckUtils]: 49: Hoare triple {3675#(= (_ bv14 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3675#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-14 16:39:16,311 INFO L273 TraceCheckUtils]: 50: Hoare triple {3675#(= (_ bv14 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3685#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,312 INFO L273 TraceCheckUtils]: 51: Hoare triple {3685#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume true; {3685#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,312 INFO L273 TraceCheckUtils]: 52: Hoare triple {3685#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3685#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,313 INFO L273 TraceCheckUtils]: 53: Hoare triple {3685#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3695#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-14 16:39:16,314 INFO L273 TraceCheckUtils]: 54: Hoare triple {3695#(= (_ bv16 32) main_~i~0)} assume true; {3695#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-14 16:39:16,314 INFO L273 TraceCheckUtils]: 55: Hoare triple {3695#(= (_ bv16 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3695#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-14 16:39:16,315 INFO L273 TraceCheckUtils]: 56: Hoare triple {3695#(= (_ bv16 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3705#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,316 INFO L273 TraceCheckUtils]: 57: Hoare triple {3705#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume true; {3705#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,317 INFO L273 TraceCheckUtils]: 58: Hoare triple {3705#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3705#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,318 INFO L273 TraceCheckUtils]: 59: Hoare triple {3705#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3715#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-14 16:39:16,318 INFO L273 TraceCheckUtils]: 60: Hoare triple {3715#(= (_ bv18 32) main_~i~0)} assume true; {3715#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-14 16:39:16,319 INFO L273 TraceCheckUtils]: 61: Hoare triple {3715#(= (_ bv18 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3715#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-14 16:39:16,320 INFO L273 TraceCheckUtils]: 62: Hoare triple {3715#(= (_ bv18 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3725#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,321 INFO L273 TraceCheckUtils]: 63: Hoare triple {3725#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume true; {3725#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,321 INFO L273 TraceCheckUtils]: 64: Hoare triple {3725#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3725#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,322 INFO L273 TraceCheckUtils]: 65: Hoare triple {3725#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3735#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-14 16:39:16,323 INFO L273 TraceCheckUtils]: 66: Hoare triple {3735#(= (_ bv20 32) main_~i~0)} assume true; {3735#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-14 16:39:16,324 INFO L273 TraceCheckUtils]: 67: Hoare triple {3735#(= (_ bv20 32) main_~i~0)} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3735#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-14 16:39:16,324 INFO L273 TraceCheckUtils]: 68: Hoare triple {3735#(= (_ bv20 32) main_~i~0)} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3745#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,325 INFO L273 TraceCheckUtils]: 69: Hoare triple {3745#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume true; {3745#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,326 INFO L273 TraceCheckUtils]: 70: Hoare triple {3745#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3745#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,327 INFO L273 TraceCheckUtils]: 71: Hoare triple {3745#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3755#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,327 INFO L273 TraceCheckUtils]: 72: Hoare triple {3755#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume true; {3755#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 16:39:16,328 INFO L273 TraceCheckUtils]: 73: Hoare triple {3755#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 1024bv32); {3516#false} is VALID [2018-11-14 16:39:16,328 INFO L273 TraceCheckUtils]: 74: Hoare triple {3516#false} ~i~0 := 0bv32; {3516#false} is VALID [2018-11-14 16:39:16,329 INFO L273 TraceCheckUtils]: 75: Hoare triple {3516#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3516#false} is VALID [2018-11-14 16:39:16,329 INFO L273 TraceCheckUtils]: 76: Hoare triple {3516#false} assume !!(#t~mem3 != 0bv32 && ~bvslt32(~i~0, 1024bv32));havoc #t~mem3; {3516#false} is VALID [2018-11-14 16:39:16,329 INFO L273 TraceCheckUtils]: 77: Hoare triple {3516#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3516#false} is VALID [2018-11-14 16:39:16,330 INFO L273 TraceCheckUtils]: 78: Hoare triple {3516#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3516#false} is VALID [2018-11-14 16:39:16,330 INFO L273 TraceCheckUtils]: 79: Hoare triple {3516#false} assume !!(#t~mem3 != 0bv32 && ~bvslt32(~i~0, 1024bv32));havoc #t~mem3; {3516#false} is VALID [2018-11-14 16:39:16,330 INFO L273 TraceCheckUtils]: 80: Hoare triple {3516#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3516#false} is VALID [2018-11-14 16:39:16,330 INFO L273 TraceCheckUtils]: 81: Hoare triple {3516#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3516#false} is VALID [2018-11-14 16:39:16,331 INFO L273 TraceCheckUtils]: 82: Hoare triple {3516#false} assume !!(#t~mem3 != 0bv32 && ~bvslt32(~i~0, 1024bv32));havoc #t~mem3; {3516#false} is VALID [2018-11-14 16:39:16,331 INFO L273 TraceCheckUtils]: 83: Hoare triple {3516#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3516#false} is VALID [2018-11-14 16:39:16,332 INFO L273 TraceCheckUtils]: 84: Hoare triple {3516#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3516#false} is VALID [2018-11-14 16:39:16,332 INFO L273 TraceCheckUtils]: 85: Hoare triple {3516#false} assume !!(#t~mem3 != 0bv32 && ~bvslt32(~i~0, 1024bv32));havoc #t~mem3; {3516#false} is VALID [2018-11-14 16:39:16,332 INFO L273 TraceCheckUtils]: 86: Hoare triple {3516#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3516#false} is VALID [2018-11-14 16:39:16,332 INFO L273 TraceCheckUtils]: 87: Hoare triple {3516#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3516#false} is VALID [2018-11-14 16:39:16,332 INFO L273 TraceCheckUtils]: 88: Hoare triple {3516#false} assume !(#t~mem3 != 0bv32 && ~bvslt32(~i~0, 1024bv32));havoc #t~mem3; {3516#false} is VALID [2018-11-14 16:39:16,333 INFO L256 TraceCheckUtils]: 89: Hoare triple {3516#false} call __VERIFIER_assert((if ~bvsle32(~i~0, 512bv32) then 1bv32 else 0bv32)); {3516#false} is VALID [2018-11-14 16:39:16,333 INFO L273 TraceCheckUtils]: 90: Hoare triple {3516#false} ~cond := #in~cond; {3516#false} is VALID [2018-11-14 16:39:16,333 INFO L273 TraceCheckUtils]: 91: Hoare triple {3516#false} assume ~cond == 0bv32; {3516#false} is VALID [2018-11-14 16:39:16,333 INFO L273 TraceCheckUtils]: 92: Hoare triple {3516#false} assume !false; {3516#false} is VALID [2018-11-14 16:39:16,348 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-14 16:39:16,349 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:39:18,357 INFO L273 TraceCheckUtils]: 92: Hoare triple {3516#false} assume !false; {3516#false} is VALID [2018-11-14 16:39:18,357 INFO L273 TraceCheckUtils]: 91: Hoare triple {3516#false} assume ~cond == 0bv32; {3516#false} is VALID [2018-11-14 16:39:18,357 INFO L273 TraceCheckUtils]: 90: Hoare triple {3516#false} ~cond := #in~cond; {3516#false} is VALID [2018-11-14 16:39:18,357 INFO L256 TraceCheckUtils]: 89: Hoare triple {3516#false} call __VERIFIER_assert((if ~bvsle32(~i~0, 512bv32) then 1bv32 else 0bv32)); {3516#false} is VALID [2018-11-14 16:39:18,358 INFO L273 TraceCheckUtils]: 88: Hoare triple {3516#false} assume !(#t~mem3 != 0bv32 && ~bvslt32(~i~0, 1024bv32));havoc #t~mem3; {3516#false} is VALID [2018-11-14 16:39:18,358 INFO L273 TraceCheckUtils]: 87: Hoare triple {3516#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3516#false} is VALID [2018-11-14 16:39:18,358 INFO L273 TraceCheckUtils]: 86: Hoare triple {3516#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3516#false} is VALID [2018-11-14 16:39:18,359 INFO L273 TraceCheckUtils]: 85: Hoare triple {3516#false} assume !!(#t~mem3 != 0bv32 && ~bvslt32(~i~0, 1024bv32));havoc #t~mem3; {3516#false} is VALID [2018-11-14 16:39:18,359 INFO L273 TraceCheckUtils]: 84: Hoare triple {3516#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3516#false} is VALID [2018-11-14 16:39:18,359 INFO L273 TraceCheckUtils]: 83: Hoare triple {3516#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3516#false} is VALID [2018-11-14 16:39:18,359 INFO L273 TraceCheckUtils]: 82: Hoare triple {3516#false} assume !!(#t~mem3 != 0bv32 && ~bvslt32(~i~0, 1024bv32));havoc #t~mem3; {3516#false} is VALID [2018-11-14 16:39:18,360 INFO L273 TraceCheckUtils]: 81: Hoare triple {3516#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3516#false} is VALID [2018-11-14 16:39:18,360 INFO L273 TraceCheckUtils]: 80: Hoare triple {3516#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3516#false} is VALID [2018-11-14 16:39:18,360 INFO L273 TraceCheckUtils]: 79: Hoare triple {3516#false} assume !!(#t~mem3 != 0bv32 && ~bvslt32(~i~0, 1024bv32));havoc #t~mem3; {3516#false} is VALID [2018-11-14 16:39:18,361 INFO L273 TraceCheckUtils]: 78: Hoare triple {3516#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3516#false} is VALID [2018-11-14 16:39:18,361 INFO L273 TraceCheckUtils]: 77: Hoare triple {3516#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3516#false} is VALID [2018-11-14 16:39:18,361 INFO L273 TraceCheckUtils]: 76: Hoare triple {3516#false} assume !!(#t~mem3 != 0bv32 && ~bvslt32(~i~0, 1024bv32));havoc #t~mem3; {3516#false} is VALID [2018-11-14 16:39:18,361 INFO L273 TraceCheckUtils]: 75: Hoare triple {3516#false} assume true;call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3516#false} is VALID [2018-11-14 16:39:18,361 INFO L273 TraceCheckUtils]: 74: Hoare triple {3516#false} ~i~0 := 0bv32; {3516#false} is VALID [2018-11-14 16:39:18,366 INFO L273 TraceCheckUtils]: 73: Hoare triple {3876#(bvslt main_~i~0 (_ bv1024 32))} assume !~bvslt32(~i~0, 1024bv32); {3516#false} is VALID [2018-11-14 16:39:18,367 INFO L273 TraceCheckUtils]: 72: Hoare triple {3876#(bvslt main_~i~0 (_ bv1024 32))} assume true; {3876#(bvslt main_~i~0 (_ bv1024 32))} is VALID [2018-11-14 16:39:18,368 INFO L273 TraceCheckUtils]: 71: Hoare triple {3883#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3876#(bvslt main_~i~0 (_ bv1024 32))} is VALID [2018-11-14 16:39:18,368 INFO L273 TraceCheckUtils]: 70: Hoare triple {3883#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3883#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,368 INFO L273 TraceCheckUtils]: 69: Hoare triple {3883#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} assume true; {3883#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,371 INFO L273 TraceCheckUtils]: 68: Hoare triple {3893#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3883#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,372 INFO L273 TraceCheckUtils]: 67: Hoare triple {3893#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3893#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,372 INFO L273 TraceCheckUtils]: 66: Hoare triple {3893#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} assume true; {3893#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,375 INFO L273 TraceCheckUtils]: 65: Hoare triple {3903#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3893#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,376 INFO L273 TraceCheckUtils]: 64: Hoare triple {3903#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3903#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,376 INFO L273 TraceCheckUtils]: 63: Hoare triple {3903#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} assume true; {3903#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,380 INFO L273 TraceCheckUtils]: 62: Hoare triple {3913#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3903#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,381 INFO L273 TraceCheckUtils]: 61: Hoare triple {3913#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3913#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,381 INFO L273 TraceCheckUtils]: 60: Hoare triple {3913#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} assume true; {3913#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,384 INFO L273 TraceCheckUtils]: 59: Hoare triple {3923#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3913#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,385 INFO L273 TraceCheckUtils]: 58: Hoare triple {3923#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3923#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,385 INFO L273 TraceCheckUtils]: 57: Hoare triple {3923#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv1024 32))} assume true; {3923#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,389 INFO L273 TraceCheckUtils]: 56: Hoare triple {3933#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3923#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,390 INFO L273 TraceCheckUtils]: 55: Hoare triple {3933#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3933#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,390 INFO L273 TraceCheckUtils]: 54: Hoare triple {3933#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv1024 32))} assume true; {3933#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,394 INFO L273 TraceCheckUtils]: 53: Hoare triple {3943#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3933#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,394 INFO L273 TraceCheckUtils]: 52: Hoare triple {3943#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3943#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,395 INFO L273 TraceCheckUtils]: 51: Hoare triple {3943#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv1024 32))} assume true; {3943#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,398 INFO L273 TraceCheckUtils]: 50: Hoare triple {3953#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3943#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,399 INFO L273 TraceCheckUtils]: 49: Hoare triple {3953#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3953#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,399 INFO L273 TraceCheckUtils]: 48: Hoare triple {3953#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv1024 32))} assume true; {3953#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,402 INFO L273 TraceCheckUtils]: 47: Hoare triple {3963#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3953#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,403 INFO L273 TraceCheckUtils]: 46: Hoare triple {3963#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3963#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,403 INFO L273 TraceCheckUtils]: 45: Hoare triple {3963#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv1024 32))} assume true; {3963#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,407 INFO L273 TraceCheckUtils]: 44: Hoare triple {3973#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3963#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,407 INFO L273 TraceCheckUtils]: 43: Hoare triple {3973#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3973#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,407 INFO L273 TraceCheckUtils]: 42: Hoare triple {3973#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv1024 32))} assume true; {3973#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,411 INFO L273 TraceCheckUtils]: 41: Hoare triple {3983#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3973#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,412 INFO L273 TraceCheckUtils]: 40: Hoare triple {3983#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3983#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,412 INFO L273 TraceCheckUtils]: 39: Hoare triple {3983#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv1024 32))} assume true; {3983#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,417 INFO L273 TraceCheckUtils]: 38: Hoare triple {3993#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3983#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,424 INFO L273 TraceCheckUtils]: 37: Hoare triple {3993#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {3993#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,424 INFO L273 TraceCheckUtils]: 36: Hoare triple {3993#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv1024 32))} assume true; {3993#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,428 INFO L273 TraceCheckUtils]: 35: Hoare triple {4003#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3993#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,429 INFO L273 TraceCheckUtils]: 34: Hoare triple {4003#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {4003#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,429 INFO L273 TraceCheckUtils]: 33: Hoare triple {4003#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv1024 32))} assume true; {4003#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,432 INFO L273 TraceCheckUtils]: 32: Hoare triple {4013#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4003#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,432 INFO L273 TraceCheckUtils]: 31: Hoare triple {4013#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {4013#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,433 INFO L273 TraceCheckUtils]: 30: Hoare triple {4013#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv1024 32))} assume true; {4013#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,438 INFO L273 TraceCheckUtils]: 29: Hoare triple {4023#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4013#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,439 INFO L273 TraceCheckUtils]: 28: Hoare triple {4023#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {4023#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,439 INFO L273 TraceCheckUtils]: 27: Hoare triple {4023#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv1024 32))} assume true; {4023#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,444 INFO L273 TraceCheckUtils]: 26: Hoare triple {4033#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4023#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,444 INFO L273 TraceCheckUtils]: 25: Hoare triple {4033#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {4033#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,445 INFO L273 TraceCheckUtils]: 24: Hoare triple {4033#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv1024 32))} assume true; {4033#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,448 INFO L273 TraceCheckUtils]: 23: Hoare triple {4043#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4033#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,449 INFO L273 TraceCheckUtils]: 22: Hoare triple {4043#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {4043#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,449 INFO L273 TraceCheckUtils]: 21: Hoare triple {4043#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv1024 32))} assume true; {4043#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,453 INFO L273 TraceCheckUtils]: 20: Hoare triple {4053#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4043#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,453 INFO L273 TraceCheckUtils]: 19: Hoare triple {4053#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {4053#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,453 INFO L273 TraceCheckUtils]: 18: Hoare triple {4053#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv1024 32))} assume true; {4053#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,457 INFO L273 TraceCheckUtils]: 17: Hoare triple {4063#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4053#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,457 INFO L273 TraceCheckUtils]: 16: Hoare triple {4063#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {4063#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,457 INFO L273 TraceCheckUtils]: 15: Hoare triple {4063#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv1024 32))} assume true; {4063#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,462 INFO L273 TraceCheckUtils]: 14: Hoare triple {4073#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4063#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,463 INFO L273 TraceCheckUtils]: 13: Hoare triple {4073#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {4073#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,463 INFO L273 TraceCheckUtils]: 12: Hoare triple {4073#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv1024 32))} assume true; {4073#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,467 INFO L273 TraceCheckUtils]: 11: Hoare triple {4083#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4073#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,467 INFO L273 TraceCheckUtils]: 10: Hoare triple {4083#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {4083#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,468 INFO L273 TraceCheckUtils]: 9: Hoare triple {4083#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv1024 32))} assume true; {4083#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,471 INFO L273 TraceCheckUtils]: 8: Hoare triple {4093#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv1024 32))} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4083#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,471 INFO L273 TraceCheckUtils]: 7: Hoare triple {4093#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv1024 32))} assume !!~bvslt32(~i~0, 1024bv32);call write~intINTTYPE4(#t~nondet1, ~#A~0.base, ~bvadd32(~#A~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~nondet1; {4093#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,472 INFO L273 TraceCheckUtils]: 6: Hoare triple {4093#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv1024 32))} assume true; {4093#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,473 INFO L273 TraceCheckUtils]: 5: Hoare triple {3515#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4096bv32);havoc ~i~0;~i~0 := 0bv32; {4093#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv1024 32))} is VALID [2018-11-14 16:39:18,473 INFO L256 TraceCheckUtils]: 4: Hoare triple {3515#true} call #t~ret4 := main(); {3515#true} is VALID [2018-11-14 16:39:18,473 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3515#true} {3515#true} #50#return; {3515#true} is VALID [2018-11-14 16:39:18,473 INFO L273 TraceCheckUtils]: 2: Hoare triple {3515#true} assume true; {3515#true} is VALID [2018-11-14 16:39:18,474 INFO L273 TraceCheckUtils]: 1: Hoare triple {3515#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3515#true} is VALID [2018-11-14 16:39:18,474 INFO L256 TraceCheckUtils]: 0: Hoare triple {3515#true} call ULTIMATE.init(); {3515#true} is VALID [2018-11-14 16:39:18,482 INFO L134 CoverageAnalysis]: Checked inductivity of 763 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-14 16:39:18,484 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:39:18,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-14 16:39:18,486 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 93 [2018-11-14 16:39:18,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:39:18,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-14 16:39:18,759 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:18,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-14 16:39:18,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-14 16:39:18,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-14 16:39:18,761 INFO L87 Difference]: Start difference. First operand 94 states and 95 transitions. Second operand 48 states. [2018-11-14 16:39:24,534 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-14 16:39:24,974 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-14 16:39:25,480 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-14 16:39:26,908 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-14 16:39:45,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:45,132 INFO L93 Difference]: Finished difference Result 354 states and 421 transitions. [2018-11-14 16:39:45,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-14 16:39:45,132 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 93 [2018-11-14 16:39:45,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:39:45,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 16:39:45,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 410 transitions. [2018-11-14 16:39:45,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 16:39:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 410 transitions. [2018-11-14 16:39:45,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 410 transitions. [2018-11-14 16:39:46,760 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 410 edges. 410 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:39:46,772 INFO L225 Difference]: With dead ends: 354 [2018-11-14 16:39:46,772 INFO L226 Difference]: Without dead ends: 334 [2018-11-14 16:39:46,774 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-14 16:39:46,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-11-14 16:39:46,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 166. [2018-11-14 16:39:46,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:39:46,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 334 states. Second operand 166 states. [2018-11-14 16:39:46,883 INFO L74 IsIncluded]: Start isIncluded. First operand 334 states. Second operand 166 states. [2018-11-14 16:39:46,883 INFO L87 Difference]: Start difference. First operand 334 states. Second operand 166 states. [2018-11-14 16:39:46,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:46,897 INFO L93 Difference]: Finished difference Result 334 states and 377 transitions. [2018-11-14 16:39:46,897 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 377 transitions. [2018-11-14 16:39:46,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:46,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:46,899 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 334 states. [2018-11-14 16:39:46,899 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 334 states. [2018-11-14 16:39:46,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:39:46,911 INFO L93 Difference]: Finished difference Result 334 states and 377 transitions. [2018-11-14 16:39:46,912 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 377 transitions. [2018-11-14 16:39:46,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:39:46,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:39:46,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:39:46,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:39:46,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-14 16:39:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 167 transitions. [2018-11-14 16:39:46,919 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 167 transitions. Word has length 93 [2018-11-14 16:39:46,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:39:46,919 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 167 transitions. [2018-11-14 16:39:46,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-14 16:39:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 167 transitions. [2018-11-14 16:39:46,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-14 16:39:46,921 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:39:46,922 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:39:46,922 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:39:46,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:39:46,922 INFO L82 PathProgramCache]: Analyzing trace with hash 506612820, now seen corresponding path program 5 times [2018-11-14 16:39:46,923 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:39:46,923 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-14 16:39:46,951 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1