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-Const.epf -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call1_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:29:32,215 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:29:32,217 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:29:32,229 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:29:32,229 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:29:32,230 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:29:32,231 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:29:32,233 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:29:32,235 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:29:32,236 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:29:32,237 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:29:32,237 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:29:32,238 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:29:32,239 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:29:32,240 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:29:32,241 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:29:32,242 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:29:32,244 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:29:32,246 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:29:32,248 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:29:32,249 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:29:32,251 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:29:32,253 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:29:32,253 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:29:32,257 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:29:32,258 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:29:32,259 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:29:32,260 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:29:32,261 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:29:32,265 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:29:32,265 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:29:32,266 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:29:32,266 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:29:32,266 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:29:32,267 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:29:32,268 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:29:32,269 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 18:29:32,287 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:29:32,287 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:29:32,289 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:29:32,289 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:29:32,289 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:29:32,290 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:29:32,290 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:29:32,290 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:29:32,290 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:29:32,290 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:29:32,291 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:29:32,292 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:29:32,292 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:29:32,292 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:29:32,292 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 18:29:32,292 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 18:29:32,293 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:29:32,293 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:29:32,293 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:29:32,293 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:29:32,293 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:29:32,294 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:29:32,295 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:29:32,295 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:29:32,295 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:29:32,295 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:29:32,296 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:29:32,296 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:29:32,296 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 18:29:32,296 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:29:32,296 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 18:29:32,297 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 18:29:32,297 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:29:32,364 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:29:32,381 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:29:32,385 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:29:32,387 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:29:32,387 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:29:32,388 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call1_true-termination.i [2018-11-14 18:29:32,445 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/152a2005b/7b8118de278840de8b144ce669a78824/FLAGf25dee448 [2018-11-14 18:29:32,858 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:29:32,859 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_true-unreach-call1_true-termination.i [2018-11-14 18:29:32,864 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/152a2005b/7b8118de278840de8b144ce669a78824/FLAGf25dee448 [2018-11-14 18:29:32,880 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/152a2005b/7b8118de278840de8b144ce669a78824 [2018-11-14 18:29:32,893 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:29:32,897 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:29:32,898 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:29:32,899 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:29:32,907 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:29:32,908 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:29:32" (1/1) ... [2018-11-14 18:29:32,911 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1792571 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:32, skipping insertion in model container [2018-11-14 18:29:32,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:29:32" (1/1) ... [2018-11-14 18:29:32,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:29:32,944 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:29:33,202 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:29:33,209 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:29:33,241 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:29:33,273 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:29:33,274 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:33 WrapperNode [2018-11-14 18:29:33,274 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:29:33,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:29:33,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:29:33,275 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:29:33,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:33" (1/1) ... [2018-11-14 18:29:33,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:33" (1/1) ... [2018-11-14 18:29:33,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:33" (1/1) ... [2018-11-14 18:29:33,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:33" (1/1) ... [2018-11-14 18:29:33,320 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:33" (1/1) ... [2018-11-14 18:29:33,332 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:33" (1/1) ... [2018-11-14 18:29:33,333 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:33" (1/1) ... [2018-11-14 18:29:33,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:29:33,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:29:33,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:29:33,342 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:29:33,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:33" (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 18:29:33,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:29:33,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:29:33,471 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:29:33,471 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:29:33,471 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:29:33,472 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:29:33,472 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:29:33,472 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:29:33,472 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 18:29:33,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 18:29:33,472 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:29:33,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:29:33,473 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:29:33,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 18:29:34,044 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:29:34,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:29:34 BoogieIcfgContainer [2018-11-14 18:29:34,045 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:29:34,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:29:34,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:29:34,049 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:29:34,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:29:32" (1/3) ... [2018-11-14 18:29:34,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148d2f12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:29:34, skipping insertion in model container [2018-11-14 18:29:34,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:29:33" (2/3) ... [2018-11-14 18:29:34,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@148d2f12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:29:34, skipping insertion in model container [2018-11-14 18:29:34,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:29:34" (3/3) ... [2018-11-14 18:29:34,054 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call1_true-termination.i [2018-11-14 18:29:34,063 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:29:34,070 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:29:34,087 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:29:34,127 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:29:34,128 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:29:34,128 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:29:34,128 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:29:34,129 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:29:34,129 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:29:34,129 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:29:34,129 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:29:34,129 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:29:34,145 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-14 18:29:34,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 18:29:34,152 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:29:34,153 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:29:34,155 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:29:34,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:29:34,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1504457121, now seen corresponding path program 1 times [2018-11-14 18:29:34,165 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:29:34,166 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 18:29:34,189 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:29:34,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:34,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:34,249 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:29:34,370 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-14 18:29:34,374 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {32#true} is VALID [2018-11-14 18:29:34,374 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-14 18:29:34,375 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #58#return; {32#true} is VALID [2018-11-14 18:29:34,375 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret4 := main(); {32#true} is VALID [2018-11-14 18:29:34,375 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4000bv32);havoc ~index~0;~index~0 := 0bv32; {32#true} is VALID [2018-11-14 18:29:34,389 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-14 18:29:34,390 INFO L273 TraceCheckUtils]: 7: Hoare triple {33#false} ~index~0 := 0bv32; {33#false} is VALID [2018-11-14 18:29:34,390 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#false} assume true; {33#false} is VALID [2018-11-14 18:29:34,390 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} assume !!~bvult32(~index~0, 1000bv32); {33#false} is VALID [2018-11-14 18:29:34,391 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} assume ~bvurem32(~index~0, 2bv32) == 0bv32;call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {33#false} is VALID [2018-11-14 18:29:34,391 INFO L256 TraceCheckUtils]: 11: Hoare triple {33#false} call __VERIFIER_assert((if #t~mem2 == 0bv32 then 1bv32 else 0bv32)); {33#false} is VALID [2018-11-14 18:29:34,392 INFO L273 TraceCheckUtils]: 12: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-14 18:29:34,392 INFO L273 TraceCheckUtils]: 13: Hoare triple {33#false} assume ~cond == 0bv32; {33#false} is VALID [2018-11-14 18:29:34,392 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-14 18:29:34,395 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 18:29:34,396 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:29:34,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:29:34,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:29:34,407 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-14 18:29:34,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:29:34,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:29:34,524 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 18:29:34,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:29:34,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:29:34,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:29:34,539 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-14 18:29:34,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:34,828 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2018-11-14 18:29:34,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:29:34,829 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-14 18:29:34,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:29:34,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:29:34,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2018-11-14 18:29:34,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:29:34,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 61 transitions. [2018-11-14 18:29:34,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 61 transitions. [2018-11-14 18:29:35,133 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 18:29:35,144 INFO L225 Difference]: With dead ends: 49 [2018-11-14 18:29:35,144 INFO L226 Difference]: Without dead ends: 24 [2018-11-14 18:29:35,148 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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 18:29:35,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-14 18:29:35,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-14 18:29:35,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:29:35,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-14 18:29:35,218 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 18:29:35,219 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 18:29:35,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:35,225 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-14 18:29:35,225 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-14 18:29:35,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:35,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:29:35,226 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-14 18:29:35,226 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-14 18:29:35,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:35,231 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-14 18:29:35,232 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-14 18:29:35,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:35,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:29:35,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:29:35,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:29:35,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 18:29:35,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-14 18:29:35,239 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 15 [2018-11-14 18:29:35,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:29:35,239 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-14 18:29:35,240 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:29:35,240 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-14 18:29:35,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 18:29:35,241 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:29:35,241 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:29:35,242 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:29:35,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:29:35,242 INFO L82 PathProgramCache]: Analyzing trace with hash -194164888, now seen corresponding path program 1 times [2018-11-14 18:29:35,243 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:29:35,243 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 18:29:35,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:29:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:35,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:29:35,384 INFO L256 TraceCheckUtils]: 0: Hoare triple {221#true} call ULTIMATE.init(); {221#true} is VALID [2018-11-14 18:29:35,385 INFO L273 TraceCheckUtils]: 1: Hoare triple {221#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {221#true} is VALID [2018-11-14 18:29:35,385 INFO L273 TraceCheckUtils]: 2: Hoare triple {221#true} assume true; {221#true} is VALID [2018-11-14 18:29:35,385 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {221#true} {221#true} #58#return; {221#true} is VALID [2018-11-14 18:29:35,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {221#true} call #t~ret4 := main(); {221#true} is VALID [2018-11-14 18:29:35,402 INFO L273 TraceCheckUtils]: 5: Hoare triple {221#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4000bv32);havoc ~index~0;~index~0 := 0bv32; {241#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-14 18:29:35,419 INFO L273 TraceCheckUtils]: 6: Hoare triple {241#(= (_ bv0 32) main_~index~0)} assume true; {241#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-14 18:29:35,434 INFO L273 TraceCheckUtils]: 7: Hoare triple {241#(= (_ bv0 32) main_~index~0)} assume !~bvult32(~index~0, 1000bv32); {222#false} is VALID [2018-11-14 18:29:35,434 INFO L273 TraceCheckUtils]: 8: Hoare triple {222#false} ~index~0 := 0bv32; {222#false} is VALID [2018-11-14 18:29:35,435 INFO L273 TraceCheckUtils]: 9: Hoare triple {222#false} assume true; {222#false} is VALID [2018-11-14 18:29:35,435 INFO L273 TraceCheckUtils]: 10: Hoare triple {222#false} assume !!~bvult32(~index~0, 1000bv32); {222#false} is VALID [2018-11-14 18:29:35,435 INFO L273 TraceCheckUtils]: 11: Hoare triple {222#false} assume ~bvurem32(~index~0, 2bv32) == 0bv32;call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {222#false} is VALID [2018-11-14 18:29:35,436 INFO L256 TraceCheckUtils]: 12: Hoare triple {222#false} call __VERIFIER_assert((if #t~mem2 == 0bv32 then 1bv32 else 0bv32)); {222#false} is VALID [2018-11-14 18:29:35,436 INFO L273 TraceCheckUtils]: 13: Hoare triple {222#false} ~cond := #in~cond; {222#false} is VALID [2018-11-14 18:29:35,436 INFO L273 TraceCheckUtils]: 14: Hoare triple {222#false} assume ~cond == 0bv32; {222#false} is VALID [2018-11-14 18:29:35,437 INFO L273 TraceCheckUtils]: 15: Hoare triple {222#false} assume !false; {222#false} is VALID [2018-11-14 18:29:35,438 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 18:29:35,438 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 18:29:35,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:29:35,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:29:35,445 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-14 18:29:35,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:29:35,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:29:35,486 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:29:35,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:29:35,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:29:35,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:29:35,488 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 3 states. [2018-11-14 18:29:35,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:35,979 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-11-14 18:29:35,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:29:35,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-14 18:29:35,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:29:35,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:29:35,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2018-11-14 18:29:35,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:29:35,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2018-11-14 18:29:35,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2018-11-14 18:29:36,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:29:36,135 INFO L225 Difference]: With dead ends: 48 [2018-11-14 18:29:36,136 INFO L226 Difference]: Without dead ends: 33 [2018-11-14 18:29:36,137 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 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 18:29:36,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-14 18:29:36,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2018-11-14 18:29:36,162 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:29:36,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 29 states. [2018-11-14 18:29:36,163 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 29 states. [2018-11-14 18:29:36,163 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 29 states. [2018-11-14 18:29:36,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:36,167 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-14 18:29:36,167 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-14 18:29:36,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:36,168 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:29:36,169 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 33 states. [2018-11-14 18:29:36,169 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 33 states. [2018-11-14 18:29:36,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:36,173 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-14 18:29:36,173 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-14 18:29:36,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:36,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:29:36,174 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:29:36,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:29:36,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 18:29:36,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-11-14 18:29:36,178 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 16 [2018-11-14 18:29:36,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:29:36,178 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-11-14 18:29:36,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:29:36,178 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-14 18:29:36,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 18:29:36,179 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:29:36,179 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:29:36,180 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:29:36,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:29:36,180 INFO L82 PathProgramCache]: Analyzing trace with hash 706658557, now seen corresponding path program 1 times [2018-11-14 18:29:36,181 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:29:36,181 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 18:29:36,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:29:36,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:36,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:36,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:29:36,323 INFO L256 TraceCheckUtils]: 0: Hoare triple {441#true} call ULTIMATE.init(); {441#true} is VALID [2018-11-14 18:29:36,323 INFO L273 TraceCheckUtils]: 1: Hoare triple {441#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {441#true} is VALID [2018-11-14 18:29:36,324 INFO L273 TraceCheckUtils]: 2: Hoare triple {441#true} assume true; {441#true} is VALID [2018-11-14 18:29:36,324 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {441#true} {441#true} #58#return; {441#true} is VALID [2018-11-14 18:29:36,324 INFO L256 TraceCheckUtils]: 4: Hoare triple {441#true} call #t~ret4 := main(); {441#true} is VALID [2018-11-14 18:29:36,325 INFO L273 TraceCheckUtils]: 5: Hoare triple {441#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4000bv32);havoc ~index~0;~index~0 := 0bv32; {461#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-14 18:29:36,325 INFO L273 TraceCheckUtils]: 6: Hoare triple {461#(= (_ bv0 32) main_~index~0)} assume true; {461#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-14 18:29:36,327 INFO L273 TraceCheckUtils]: 7: Hoare triple {461#(= (_ bv0 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {461#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-14 18:29:36,327 INFO L273 TraceCheckUtils]: 8: Hoare triple {461#(= (_ bv0 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {471#(= (_ bv1 32) main_~index~0)} is VALID [2018-11-14 18:29:36,328 INFO L273 TraceCheckUtils]: 9: Hoare triple {471#(= (_ bv1 32) main_~index~0)} assume true; {471#(= (_ bv1 32) main_~index~0)} is VALID [2018-11-14 18:29:36,329 INFO L273 TraceCheckUtils]: 10: Hoare triple {471#(= (_ bv1 32) main_~index~0)} assume !~bvult32(~index~0, 1000bv32); {442#false} is VALID [2018-11-14 18:29:36,330 INFO L273 TraceCheckUtils]: 11: Hoare triple {442#false} ~index~0 := 0bv32; {442#false} is VALID [2018-11-14 18:29:36,330 INFO L273 TraceCheckUtils]: 12: Hoare triple {442#false} assume true; {442#false} is VALID [2018-11-14 18:29:36,331 INFO L273 TraceCheckUtils]: 13: Hoare triple {442#false} assume !!~bvult32(~index~0, 1000bv32); {442#false} is VALID [2018-11-14 18:29:36,331 INFO L273 TraceCheckUtils]: 14: Hoare triple {442#false} assume ~bvurem32(~index~0, 2bv32) == 0bv32;call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {442#false} is VALID [2018-11-14 18:29:36,332 INFO L256 TraceCheckUtils]: 15: Hoare triple {442#false} call __VERIFIER_assert((if #t~mem2 == 0bv32 then 1bv32 else 0bv32)); {442#false} is VALID [2018-11-14 18:29:36,332 INFO L273 TraceCheckUtils]: 16: Hoare triple {442#false} ~cond := #in~cond; {442#false} is VALID [2018-11-14 18:29:36,333 INFO L273 TraceCheckUtils]: 17: Hoare triple {442#false} assume ~cond == 0bv32; {442#false} is VALID [2018-11-14 18:29:36,333 INFO L273 TraceCheckUtils]: 18: Hoare triple {442#false} assume !false; {442#false} is VALID [2018-11-14 18:29:36,335 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 18:29:36,336 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:29:36,442 INFO L273 TraceCheckUtils]: 18: Hoare triple {442#false} assume !false; {442#false} is VALID [2018-11-14 18:29:36,442 INFO L273 TraceCheckUtils]: 17: Hoare triple {442#false} assume ~cond == 0bv32; {442#false} is VALID [2018-11-14 18:29:36,443 INFO L273 TraceCheckUtils]: 16: Hoare triple {442#false} ~cond := #in~cond; {442#false} is VALID [2018-11-14 18:29:36,443 INFO L256 TraceCheckUtils]: 15: Hoare triple {442#false} call __VERIFIER_assert((if #t~mem2 == 0bv32 then 1bv32 else 0bv32)); {442#false} is VALID [2018-11-14 18:29:36,443 INFO L273 TraceCheckUtils]: 14: Hoare triple {442#false} assume ~bvurem32(~index~0, 2bv32) == 0bv32;call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {442#false} is VALID [2018-11-14 18:29:36,444 INFO L273 TraceCheckUtils]: 13: Hoare triple {442#false} assume !!~bvult32(~index~0, 1000bv32); {442#false} is VALID [2018-11-14 18:29:36,444 INFO L273 TraceCheckUtils]: 12: Hoare triple {442#false} assume true; {442#false} is VALID [2018-11-14 18:29:36,444 INFO L273 TraceCheckUtils]: 11: Hoare triple {442#false} ~index~0 := 0bv32; {442#false} is VALID [2018-11-14 18:29:36,447 INFO L273 TraceCheckUtils]: 10: Hoare triple {526#(bvult main_~index~0 (_ bv1000 32))} assume !~bvult32(~index~0, 1000bv32); {442#false} is VALID [2018-11-14 18:29:36,448 INFO L273 TraceCheckUtils]: 9: Hoare triple {526#(bvult main_~index~0 (_ bv1000 32))} assume true; {526#(bvult main_~index~0 (_ bv1000 32))} is VALID [2018-11-14 18:29:36,452 INFO L273 TraceCheckUtils]: 8: Hoare triple {533#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {526#(bvult main_~index~0 (_ bv1000 32))} is VALID [2018-11-14 18:29:36,453 INFO L273 TraceCheckUtils]: 7: Hoare triple {533#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {533#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-14 18:29:36,456 INFO L273 TraceCheckUtils]: 6: Hoare triple {533#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} assume true; {533#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-14 18:29:36,458 INFO L273 TraceCheckUtils]: 5: Hoare triple {441#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4000bv32);havoc ~index~0;~index~0 := 0bv32; {533#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-14 18:29:36,458 INFO L256 TraceCheckUtils]: 4: Hoare triple {441#true} call #t~ret4 := main(); {441#true} is VALID [2018-11-14 18:29:36,458 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {441#true} {441#true} #58#return; {441#true} is VALID [2018-11-14 18:29:36,459 INFO L273 TraceCheckUtils]: 2: Hoare triple {441#true} assume true; {441#true} is VALID [2018-11-14 18:29:36,459 INFO L273 TraceCheckUtils]: 1: Hoare triple {441#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {441#true} is VALID [2018-11-14 18:29:36,460 INFO L256 TraceCheckUtils]: 0: Hoare triple {441#true} call ULTIMATE.init(); {441#true} is VALID [2018-11-14 18:29:36,461 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 18:29:36,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:29:36,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 18:29:36,463 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 18:29:36,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:29:36,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:29:36,613 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:29:36,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:29:36,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:29:36,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:29:36,614 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 6 states. [2018-11-14 18:29:37,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:37,198 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2018-11-14 18:29:37,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:29:37,198 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 18:29:37,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:29:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:29:37,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2018-11-14 18:29:37,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:29:37,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 83 transitions. [2018-11-14 18:29:37,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 83 transitions. [2018-11-14 18:29:37,407 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:29:37,409 INFO L225 Difference]: With dead ends: 73 [2018-11-14 18:29:37,409 INFO L226 Difference]: Without dead ends: 55 [2018-11-14 18:29:37,410 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 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 18:29:37,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-14 18:29:37,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 44. [2018-11-14 18:29:37,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:29:37,433 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 44 states. [2018-11-14 18:29:37,433 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 44 states. [2018-11-14 18:29:37,433 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 44 states. [2018-11-14 18:29:37,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:37,438 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-14 18:29:37,439 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-11-14 18:29:37,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:37,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:29:37,440 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 55 states. [2018-11-14 18:29:37,440 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 55 states. [2018-11-14 18:29:37,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:37,445 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-14 18:29:37,446 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2018-11-14 18:29:37,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:37,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:29:37,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:29:37,447 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:29:37,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 18:29:37,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-14 18:29:37,450 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 19 [2018-11-14 18:29:37,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:29:37,451 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-14 18:29:37,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:29:37,451 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-14 18:29:37,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 18:29:37,452 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:29:37,453 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:29:37,453 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:29:37,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:29:37,453 INFO L82 PathProgramCache]: Analyzing trace with hash 296425256, now seen corresponding path program 2 times [2018-11-14 18:29:37,454 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:29:37,454 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 18:29:37,478 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 18:29:37,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:29:37,528 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:29:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:37,549 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:29:37,698 INFO L256 TraceCheckUtils]: 0: Hoare triple {830#true} call ULTIMATE.init(); {830#true} is VALID [2018-11-14 18:29:37,699 INFO L273 TraceCheckUtils]: 1: Hoare triple {830#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {830#true} is VALID [2018-11-14 18:29:37,699 INFO L273 TraceCheckUtils]: 2: Hoare triple {830#true} assume true; {830#true} is VALID [2018-11-14 18:29:37,699 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {830#true} {830#true} #58#return; {830#true} is VALID [2018-11-14 18:29:37,699 INFO L256 TraceCheckUtils]: 4: Hoare triple {830#true} call #t~ret4 := main(); {830#true} is VALID [2018-11-14 18:29:37,700 INFO L273 TraceCheckUtils]: 5: Hoare triple {830#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4000bv32);havoc ~index~0;~index~0 := 0bv32; {850#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-14 18:29:37,701 INFO L273 TraceCheckUtils]: 6: Hoare triple {850#(= (_ bv0 32) main_~index~0)} assume true; {850#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-14 18:29:37,702 INFO L273 TraceCheckUtils]: 7: Hoare triple {850#(= (_ bv0 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {850#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-14 18:29:37,703 INFO L273 TraceCheckUtils]: 8: Hoare triple {850#(= (_ bv0 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {860#(= (_ bv1 32) main_~index~0)} is VALID [2018-11-14 18:29:37,704 INFO L273 TraceCheckUtils]: 9: Hoare triple {860#(= (_ bv1 32) main_~index~0)} assume true; {860#(= (_ bv1 32) main_~index~0)} is VALID [2018-11-14 18:29:37,704 INFO L273 TraceCheckUtils]: 10: Hoare triple {860#(= (_ bv1 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {860#(= (_ bv1 32) main_~index~0)} is VALID [2018-11-14 18:29:37,705 INFO L273 TraceCheckUtils]: 11: Hoare triple {860#(= (_ bv1 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {870#(= (_ bv2 32) main_~index~0)} is VALID [2018-11-14 18:29:37,706 INFO L273 TraceCheckUtils]: 12: Hoare triple {870#(= (_ bv2 32) main_~index~0)} assume true; {870#(= (_ bv2 32) main_~index~0)} is VALID [2018-11-14 18:29:37,707 INFO L273 TraceCheckUtils]: 13: Hoare triple {870#(= (_ bv2 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {870#(= (_ bv2 32) main_~index~0)} is VALID [2018-11-14 18:29:37,708 INFO L273 TraceCheckUtils]: 14: Hoare triple {870#(= (_ bv2 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {880#(= (_ bv3 32) main_~index~0)} is VALID [2018-11-14 18:29:37,709 INFO L273 TraceCheckUtils]: 15: Hoare triple {880#(= (_ bv3 32) main_~index~0)} assume true; {880#(= (_ bv3 32) main_~index~0)} is VALID [2018-11-14 18:29:37,710 INFO L273 TraceCheckUtils]: 16: Hoare triple {880#(= (_ bv3 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {880#(= (_ bv3 32) main_~index~0)} is VALID [2018-11-14 18:29:37,711 INFO L273 TraceCheckUtils]: 17: Hoare triple {880#(= (_ bv3 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {890#(= (_ bv4 32) main_~index~0)} is VALID [2018-11-14 18:29:37,712 INFO L273 TraceCheckUtils]: 18: Hoare triple {890#(= (_ bv4 32) main_~index~0)} assume true; {890#(= (_ bv4 32) main_~index~0)} is VALID [2018-11-14 18:29:37,713 INFO L273 TraceCheckUtils]: 19: Hoare triple {890#(= (_ bv4 32) main_~index~0)} assume !~bvult32(~index~0, 1000bv32); {831#false} is VALID [2018-11-14 18:29:37,713 INFO L273 TraceCheckUtils]: 20: Hoare triple {831#false} ~index~0 := 0bv32; {831#false} is VALID [2018-11-14 18:29:37,714 INFO L273 TraceCheckUtils]: 21: Hoare triple {831#false} assume true; {831#false} is VALID [2018-11-14 18:29:37,714 INFO L273 TraceCheckUtils]: 22: Hoare triple {831#false} assume !!~bvult32(~index~0, 1000bv32); {831#false} is VALID [2018-11-14 18:29:37,715 INFO L273 TraceCheckUtils]: 23: Hoare triple {831#false} assume ~bvurem32(~index~0, 2bv32) == 0bv32;call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {831#false} is VALID [2018-11-14 18:29:37,715 INFO L256 TraceCheckUtils]: 24: Hoare triple {831#false} call __VERIFIER_assert((if #t~mem2 == 0bv32 then 1bv32 else 0bv32)); {831#false} is VALID [2018-11-14 18:29:37,715 INFO L273 TraceCheckUtils]: 25: Hoare triple {831#false} ~cond := #in~cond; {831#false} is VALID [2018-11-14 18:29:37,716 INFO L273 TraceCheckUtils]: 26: Hoare triple {831#false} assume ~cond == 0bv32; {831#false} is VALID [2018-11-14 18:29:37,716 INFO L273 TraceCheckUtils]: 27: Hoare triple {831#false} assume !false; {831#false} is VALID [2018-11-14 18:29:37,718 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:29:37,719 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:29:38,162 INFO L273 TraceCheckUtils]: 27: Hoare triple {831#false} assume !false; {831#false} is VALID [2018-11-14 18:29:38,162 INFO L273 TraceCheckUtils]: 26: Hoare triple {831#false} assume ~cond == 0bv32; {831#false} is VALID [2018-11-14 18:29:38,163 INFO L273 TraceCheckUtils]: 25: Hoare triple {831#false} ~cond := #in~cond; {831#false} is VALID [2018-11-14 18:29:38,163 INFO L256 TraceCheckUtils]: 24: Hoare triple {831#false} call __VERIFIER_assert((if #t~mem2 == 0bv32 then 1bv32 else 0bv32)); {831#false} is VALID [2018-11-14 18:29:38,164 INFO L273 TraceCheckUtils]: 23: Hoare triple {831#false} assume ~bvurem32(~index~0, 2bv32) == 0bv32;call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {831#false} is VALID [2018-11-14 18:29:38,164 INFO L273 TraceCheckUtils]: 22: Hoare triple {831#false} assume !!~bvult32(~index~0, 1000bv32); {831#false} is VALID [2018-11-14 18:29:38,164 INFO L273 TraceCheckUtils]: 21: Hoare triple {831#false} assume true; {831#false} is VALID [2018-11-14 18:29:38,164 INFO L273 TraceCheckUtils]: 20: Hoare triple {831#false} ~index~0 := 0bv32; {831#false} is VALID [2018-11-14 18:29:38,165 INFO L273 TraceCheckUtils]: 19: Hoare triple {945#(bvult main_~index~0 (_ bv1000 32))} assume !~bvult32(~index~0, 1000bv32); {831#false} is VALID [2018-11-14 18:29:38,170 INFO L273 TraceCheckUtils]: 18: Hoare triple {945#(bvult main_~index~0 (_ bv1000 32))} assume true; {945#(bvult main_~index~0 (_ bv1000 32))} is VALID [2018-11-14 18:29:38,175 INFO L273 TraceCheckUtils]: 17: Hoare triple {952#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {945#(bvult main_~index~0 (_ bv1000 32))} is VALID [2018-11-14 18:29:38,176 INFO L273 TraceCheckUtils]: 16: Hoare triple {956#(or (not (bvult main_~index~0 (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32)))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {952#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-14 18:29:38,177 INFO L273 TraceCheckUtils]: 15: Hoare triple {956#(or (not (bvult main_~index~0 (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32)))} assume true; {956#(or (not (bvult main_~index~0 (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:38,180 INFO L273 TraceCheckUtils]: 14: Hoare triple {963#(or (not (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32)))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {956#(or (not (bvult main_~index~0 (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:38,181 INFO L273 TraceCheckUtils]: 13: Hoare triple {963#(or (not (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32)))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {963#(or (not (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:38,182 INFO L273 TraceCheckUtils]: 12: Hoare triple {963#(or (not (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32)))} assume true; {963#(or (not (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:38,186 INFO L273 TraceCheckUtils]: 11: Hoare triple {973#(or (not (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32)))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {963#(or (not (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:38,187 INFO L273 TraceCheckUtils]: 10: Hoare triple {973#(or (not (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32)))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {973#(or (not (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:38,188 INFO L273 TraceCheckUtils]: 9: Hoare triple {973#(or (not (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32)))} assume true; {973#(or (not (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:38,193 INFO L273 TraceCheckUtils]: 8: Hoare triple {983#(or (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32)) (not (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {973#(or (not (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:38,194 INFO L273 TraceCheckUtils]: 7: Hoare triple {983#(or (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32)) (not (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {983#(or (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32)) (not (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))))} is VALID [2018-11-14 18:29:38,195 INFO L273 TraceCheckUtils]: 6: Hoare triple {983#(or (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32)) (not (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))))} assume true; {983#(or (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32)) (not (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))))} is VALID [2018-11-14 18:29:38,195 INFO L273 TraceCheckUtils]: 5: Hoare triple {830#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4000bv32);havoc ~index~0;~index~0 := 0bv32; {983#(or (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32)) (not (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))))} is VALID [2018-11-14 18:29:38,196 INFO L256 TraceCheckUtils]: 4: Hoare triple {830#true} call #t~ret4 := main(); {830#true} is VALID [2018-11-14 18:29:38,196 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {830#true} {830#true} #58#return; {830#true} is VALID [2018-11-14 18:29:38,196 INFO L273 TraceCheckUtils]: 2: Hoare triple {830#true} assume true; {830#true} is VALID [2018-11-14 18:29:38,196 INFO L273 TraceCheckUtils]: 1: Hoare triple {830#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {830#true} is VALID [2018-11-14 18:29:38,197 INFO L256 TraceCheckUtils]: 0: Hoare triple {830#true} call ULTIMATE.init(); {830#true} is VALID [2018-11-14 18:29:38,200 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:29:38,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:29:38,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 13 [2018-11-14 18:29:38,207 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-11-14 18:29:38,208 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:29:38,208 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 18:29:38,303 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:29:38,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 18:29:38,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 18:29:38,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:29:38,305 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 13 states. [2018-11-14 18:29:41,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:41,645 INFO L93 Difference]: Finished difference Result 133 states and 161 transitions. [2018-11-14 18:29:41,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-14 18:29:41,645 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 28 [2018-11-14 18:29:41,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:29:41,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:29:41,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 151 transitions. [2018-11-14 18:29:41,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 18:29:41,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 151 transitions. [2018-11-14 18:29:41,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 151 transitions. [2018-11-14 18:29:42,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:29:42,027 INFO L225 Difference]: With dead ends: 133 [2018-11-14 18:29:42,027 INFO L226 Difference]: Without dead ends: 109 [2018-11-14 18:29:42,028 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=186, Invalid=320, Unknown=0, NotChecked=0, Total=506 [2018-11-14 18:29:42,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-14 18:29:42,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 80. [2018-11-14 18:29:42,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:29:42,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 80 states. [2018-11-14 18:29:42,102 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 80 states. [2018-11-14 18:29:42,102 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 80 states. [2018-11-14 18:29:42,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:42,109 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2018-11-14 18:29:42,109 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2018-11-14 18:29:42,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:42,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:29:42,111 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 109 states. [2018-11-14 18:29:42,112 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 109 states. [2018-11-14 18:29:42,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:42,119 INFO L93 Difference]: Finished difference Result 109 states and 125 transitions. [2018-11-14 18:29:42,119 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 125 transitions. [2018-11-14 18:29:42,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:29:42,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:29:42,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:29:42,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:29:42,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 18:29:42,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-11-14 18:29:42,126 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 28 [2018-11-14 18:29:42,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:29:42,126 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-11-14 18:29:42,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 18:29:42,127 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-11-14 18:29:42,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-14 18:29:42,128 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:29:42,128 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:29:42,129 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:29:42,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:29:42,129 INFO L82 PathProgramCache]: Analyzing trace with hash 16171720, now seen corresponding path program 3 times [2018-11-14 18:29:42,130 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:29:42,130 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 18:29:42,163 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 18:29:42,655 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-14 18:29:42,655 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:29:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:29:42,688 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:29:42,990 INFO L256 TraceCheckUtils]: 0: Hoare triple {1534#true} call ULTIMATE.init(); {1534#true} is VALID [2018-11-14 18:29:42,990 INFO L273 TraceCheckUtils]: 1: Hoare triple {1534#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1534#true} is VALID [2018-11-14 18:29:42,991 INFO L273 TraceCheckUtils]: 2: Hoare triple {1534#true} assume true; {1534#true} is VALID [2018-11-14 18:29:42,991 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1534#true} {1534#true} #58#return; {1534#true} is VALID [2018-11-14 18:29:42,991 INFO L256 TraceCheckUtils]: 4: Hoare triple {1534#true} call #t~ret4 := main(); {1534#true} is VALID [2018-11-14 18:29:42,996 INFO L273 TraceCheckUtils]: 5: Hoare triple {1534#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4000bv32);havoc ~index~0;~index~0 := 0bv32; {1554#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-14 18:29:42,996 INFO L273 TraceCheckUtils]: 6: Hoare triple {1554#(= (_ bv0 32) main_~index~0)} assume true; {1554#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-14 18:29:42,998 INFO L273 TraceCheckUtils]: 7: Hoare triple {1554#(= (_ bv0 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1554#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-14 18:29:42,998 INFO L273 TraceCheckUtils]: 8: Hoare triple {1554#(= (_ bv0 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1564#(= (_ bv1 32) main_~index~0)} is VALID [2018-11-14 18:29:43,000 INFO L273 TraceCheckUtils]: 9: Hoare triple {1564#(= (_ bv1 32) main_~index~0)} assume true; {1564#(= (_ bv1 32) main_~index~0)} is VALID [2018-11-14 18:29:43,001 INFO L273 TraceCheckUtils]: 10: Hoare triple {1564#(= (_ bv1 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1564#(= (_ bv1 32) main_~index~0)} is VALID [2018-11-14 18:29:43,002 INFO L273 TraceCheckUtils]: 11: Hoare triple {1564#(= (_ bv1 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1574#(= (_ bv2 32) main_~index~0)} is VALID [2018-11-14 18:29:43,002 INFO L273 TraceCheckUtils]: 12: Hoare triple {1574#(= (_ bv2 32) main_~index~0)} assume true; {1574#(= (_ bv2 32) main_~index~0)} is VALID [2018-11-14 18:29:43,004 INFO L273 TraceCheckUtils]: 13: Hoare triple {1574#(= (_ bv2 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1574#(= (_ bv2 32) main_~index~0)} is VALID [2018-11-14 18:29:43,004 INFO L273 TraceCheckUtils]: 14: Hoare triple {1574#(= (_ bv2 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1584#(= (_ bv3 32) main_~index~0)} is VALID [2018-11-14 18:29:43,006 INFO L273 TraceCheckUtils]: 15: Hoare triple {1584#(= (_ bv3 32) main_~index~0)} assume true; {1584#(= (_ bv3 32) main_~index~0)} is VALID [2018-11-14 18:29:43,006 INFO L273 TraceCheckUtils]: 16: Hoare triple {1584#(= (_ bv3 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1584#(= (_ bv3 32) main_~index~0)} is VALID [2018-11-14 18:29:43,008 INFO L273 TraceCheckUtils]: 17: Hoare triple {1584#(= (_ bv3 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1594#(= (_ bv4 32) main_~index~0)} is VALID [2018-11-14 18:29:43,008 INFO L273 TraceCheckUtils]: 18: Hoare triple {1594#(= (_ bv4 32) main_~index~0)} assume true; {1594#(= (_ bv4 32) main_~index~0)} is VALID [2018-11-14 18:29:43,009 INFO L273 TraceCheckUtils]: 19: Hoare triple {1594#(= (_ bv4 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1594#(= (_ bv4 32) main_~index~0)} is VALID [2018-11-14 18:29:43,010 INFO L273 TraceCheckUtils]: 20: Hoare triple {1594#(= (_ bv4 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1604#(= (_ bv5 32) main_~index~0)} is VALID [2018-11-14 18:29:43,011 INFO L273 TraceCheckUtils]: 21: Hoare triple {1604#(= (_ bv5 32) main_~index~0)} assume true; {1604#(= (_ bv5 32) main_~index~0)} is VALID [2018-11-14 18:29:43,012 INFO L273 TraceCheckUtils]: 22: Hoare triple {1604#(= (_ bv5 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1604#(= (_ bv5 32) main_~index~0)} is VALID [2018-11-14 18:29:43,013 INFO L273 TraceCheckUtils]: 23: Hoare triple {1604#(= (_ bv5 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1614#(= (_ bv6 32) main_~index~0)} is VALID [2018-11-14 18:29:43,014 INFO L273 TraceCheckUtils]: 24: Hoare triple {1614#(= (_ bv6 32) main_~index~0)} assume true; {1614#(= (_ bv6 32) main_~index~0)} is VALID [2018-11-14 18:29:43,014 INFO L273 TraceCheckUtils]: 25: Hoare triple {1614#(= (_ bv6 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1614#(= (_ bv6 32) main_~index~0)} is VALID [2018-11-14 18:29:43,016 INFO L273 TraceCheckUtils]: 26: Hoare triple {1614#(= (_ bv6 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1624#(= (_ bv7 32) main_~index~0)} is VALID [2018-11-14 18:29:43,016 INFO L273 TraceCheckUtils]: 27: Hoare triple {1624#(= (_ bv7 32) main_~index~0)} assume true; {1624#(= (_ bv7 32) main_~index~0)} is VALID [2018-11-14 18:29:43,018 INFO L273 TraceCheckUtils]: 28: Hoare triple {1624#(= (_ bv7 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1624#(= (_ bv7 32) main_~index~0)} is VALID [2018-11-14 18:29:43,019 INFO L273 TraceCheckUtils]: 29: Hoare triple {1624#(= (_ bv7 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1634#(= (_ bv8 32) main_~index~0)} is VALID [2018-11-14 18:29:43,020 INFO L273 TraceCheckUtils]: 30: Hoare triple {1634#(= (_ bv8 32) main_~index~0)} assume true; {1634#(= (_ bv8 32) main_~index~0)} is VALID [2018-11-14 18:29:43,020 INFO L273 TraceCheckUtils]: 31: Hoare triple {1634#(= (_ bv8 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1634#(= (_ bv8 32) main_~index~0)} is VALID [2018-11-14 18:29:43,022 INFO L273 TraceCheckUtils]: 32: Hoare triple {1634#(= (_ bv8 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1644#(= (_ bv9 32) main_~index~0)} is VALID [2018-11-14 18:29:43,022 INFO L273 TraceCheckUtils]: 33: Hoare triple {1644#(= (_ bv9 32) main_~index~0)} assume true; {1644#(= (_ bv9 32) main_~index~0)} is VALID [2018-11-14 18:29:43,024 INFO L273 TraceCheckUtils]: 34: Hoare triple {1644#(= (_ bv9 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1644#(= (_ bv9 32) main_~index~0)} is VALID [2018-11-14 18:29:43,025 INFO L273 TraceCheckUtils]: 35: Hoare triple {1644#(= (_ bv9 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1654#(= (_ bv10 32) main_~index~0)} is VALID [2018-11-14 18:29:43,026 INFO L273 TraceCheckUtils]: 36: Hoare triple {1654#(= (_ bv10 32) main_~index~0)} assume true; {1654#(= (_ bv10 32) main_~index~0)} is VALID [2018-11-14 18:29:43,026 INFO L273 TraceCheckUtils]: 37: Hoare triple {1654#(= (_ bv10 32) main_~index~0)} assume !~bvult32(~index~0, 1000bv32); {1535#false} is VALID [2018-11-14 18:29:43,026 INFO L273 TraceCheckUtils]: 38: Hoare triple {1535#false} ~index~0 := 0bv32; {1535#false} is VALID [2018-11-14 18:29:43,027 INFO L273 TraceCheckUtils]: 39: Hoare triple {1535#false} assume true; {1535#false} is VALID [2018-11-14 18:29:43,027 INFO L273 TraceCheckUtils]: 40: Hoare triple {1535#false} assume !!~bvult32(~index~0, 1000bv32); {1535#false} is VALID [2018-11-14 18:29:43,027 INFO L273 TraceCheckUtils]: 41: Hoare triple {1535#false} assume ~bvurem32(~index~0, 2bv32) == 0bv32;call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1535#false} is VALID [2018-11-14 18:29:43,027 INFO L256 TraceCheckUtils]: 42: Hoare triple {1535#false} call __VERIFIER_assert((if #t~mem2 == 0bv32 then 1bv32 else 0bv32)); {1535#false} is VALID [2018-11-14 18:29:43,028 INFO L273 TraceCheckUtils]: 43: Hoare triple {1535#false} ~cond := #in~cond; {1535#false} is VALID [2018-11-14 18:29:43,028 INFO L273 TraceCheckUtils]: 44: Hoare triple {1535#false} assume ~cond == 0bv32; {1535#false} is VALID [2018-11-14 18:29:43,028 INFO L273 TraceCheckUtils]: 45: Hoare triple {1535#false} assume !false; {1535#false} is VALID [2018-11-14 18:29:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:29:43,034 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:29:43,926 INFO L273 TraceCheckUtils]: 45: Hoare triple {1535#false} assume !false; {1535#false} is VALID [2018-11-14 18:29:43,927 INFO L273 TraceCheckUtils]: 44: Hoare triple {1535#false} assume ~cond == 0bv32; {1535#false} is VALID [2018-11-14 18:29:43,927 INFO L273 TraceCheckUtils]: 43: Hoare triple {1535#false} ~cond := #in~cond; {1535#false} is VALID [2018-11-14 18:29:43,927 INFO L256 TraceCheckUtils]: 42: Hoare triple {1535#false} call __VERIFIER_assert((if #t~mem2 == 0bv32 then 1bv32 else 0bv32)); {1535#false} is VALID [2018-11-14 18:29:43,928 INFO L273 TraceCheckUtils]: 41: Hoare triple {1535#false} assume ~bvurem32(~index~0, 2bv32) == 0bv32;call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1535#false} is VALID [2018-11-14 18:29:43,928 INFO L273 TraceCheckUtils]: 40: Hoare triple {1535#false} assume !!~bvult32(~index~0, 1000bv32); {1535#false} is VALID [2018-11-14 18:29:43,928 INFO L273 TraceCheckUtils]: 39: Hoare triple {1535#false} assume true; {1535#false} is VALID [2018-11-14 18:29:43,928 INFO L273 TraceCheckUtils]: 38: Hoare triple {1535#false} ~index~0 := 0bv32; {1535#false} is VALID [2018-11-14 18:29:43,929 INFO L273 TraceCheckUtils]: 37: Hoare triple {1709#(bvult main_~index~0 (_ bv1000 32))} assume !~bvult32(~index~0, 1000bv32); {1535#false} is VALID [2018-11-14 18:29:43,929 INFO L273 TraceCheckUtils]: 36: Hoare triple {1709#(bvult main_~index~0 (_ bv1000 32))} assume true; {1709#(bvult main_~index~0 (_ bv1000 32))} is VALID [2018-11-14 18:29:43,933 INFO L273 TraceCheckUtils]: 35: Hoare triple {1716#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1709#(bvult main_~index~0 (_ bv1000 32))} is VALID [2018-11-14 18:29:43,934 INFO L273 TraceCheckUtils]: 34: Hoare triple {1720#(or (not (bvult main_~index~0 (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32)))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1716#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-14 18:29:43,935 INFO L273 TraceCheckUtils]: 33: Hoare triple {1720#(or (not (bvult main_~index~0 (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32)))} assume true; {1720#(or (not (bvult main_~index~0 (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:43,938 INFO L273 TraceCheckUtils]: 32: Hoare triple {1727#(or (not (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32)))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1720#(or (not (bvult main_~index~0 (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:43,938 INFO L273 TraceCheckUtils]: 31: Hoare triple {1727#(or (not (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32)))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1727#(or (not (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:43,939 INFO L273 TraceCheckUtils]: 30: Hoare triple {1727#(or (not (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32)))} assume true; {1727#(or (not (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:43,943 INFO L273 TraceCheckUtils]: 29: Hoare triple {1737#(or (not (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32)))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1727#(or (not (bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:43,944 INFO L273 TraceCheckUtils]: 28: Hoare triple {1737#(or (not (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32)))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1737#(or (not (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:43,944 INFO L273 TraceCheckUtils]: 27: Hoare triple {1737#(or (not (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32)))} assume true; {1737#(or (not (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:43,949 INFO L273 TraceCheckUtils]: 26: Hoare triple {1747#(or (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32)) (not (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1737#(or (not (bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:43,949 INFO L273 TraceCheckUtils]: 25: Hoare triple {1747#(or (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32)) (not (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1747#(or (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32)) (not (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))))} is VALID [2018-11-14 18:29:43,950 INFO L273 TraceCheckUtils]: 24: Hoare triple {1747#(or (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32)) (not (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))))} assume true; {1747#(or (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32)) (not (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))))} is VALID [2018-11-14 18:29:43,954 INFO L273 TraceCheckUtils]: 23: Hoare triple {1757#(or (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32)) (not (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32))))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1747#(or (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32)) (not (bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))))} is VALID [2018-11-14 18:29:43,954 INFO L273 TraceCheckUtils]: 22: Hoare triple {1757#(or (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32)) (not (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32))))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1757#(or (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32)) (not (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32))))} is VALID [2018-11-14 18:29:43,955 INFO L273 TraceCheckUtils]: 21: Hoare triple {1757#(or (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32)) (not (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32))))} assume true; {1757#(or (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32)) (not (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32))))} is VALID [2018-11-14 18:29:43,959 INFO L273 TraceCheckUtils]: 20: Hoare triple {1767#(or (not (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32)))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1757#(or (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32)) (not (bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32))))} is VALID [2018-11-14 18:29:43,959 INFO L273 TraceCheckUtils]: 19: Hoare triple {1767#(or (not (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32)))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1767#(or (not (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:43,960 INFO L273 TraceCheckUtils]: 18: Hoare triple {1767#(or (not (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32)))} assume true; {1767#(or (not (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:43,964 INFO L273 TraceCheckUtils]: 17: Hoare triple {1777#(or (not (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32)))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1767#(or (not (bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:43,964 INFO L273 TraceCheckUtils]: 16: Hoare triple {1777#(or (not (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32)))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1777#(or (not (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:43,965 INFO L273 TraceCheckUtils]: 15: Hoare triple {1777#(or (not (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32)))} assume true; {1777#(or (not (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:43,969 INFO L273 TraceCheckUtils]: 14: Hoare triple {1787#(or (not (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32)))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1777#(or (not (bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:43,969 INFO L273 TraceCheckUtils]: 13: Hoare triple {1787#(or (not (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32)))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1787#(or (not (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:43,976 INFO L273 TraceCheckUtils]: 12: Hoare triple {1787#(or (not (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32)))} assume true; {1787#(or (not (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:43,980 INFO L273 TraceCheckUtils]: 11: Hoare triple {1797#(or (not (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32)))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1787#(or (not (bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:43,980 INFO L273 TraceCheckUtils]: 10: Hoare triple {1797#(or (not (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32)))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1797#(or (not (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:43,981 INFO L273 TraceCheckUtils]: 9: Hoare triple {1797#(or (not (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32)))} assume true; {1797#(or (not (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:43,986 INFO L273 TraceCheckUtils]: 8: Hoare triple {1807#(or (not (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv1000 32)))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1797#(or (not (bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:43,986 INFO L273 TraceCheckUtils]: 7: Hoare triple {1807#(or (not (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv1000 32)))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {1807#(or (not (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:43,987 INFO L273 TraceCheckUtils]: 6: Hoare triple {1807#(or (not (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv1000 32)))} assume true; {1807#(or (not (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:43,987 INFO L273 TraceCheckUtils]: 5: Hoare triple {1534#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4000bv32);havoc ~index~0;~index~0 := 0bv32; {1807#(or (not (bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32))) (bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv1000 32)))} is VALID [2018-11-14 18:29:43,988 INFO L256 TraceCheckUtils]: 4: Hoare triple {1534#true} call #t~ret4 := main(); {1534#true} is VALID [2018-11-14 18:29:43,988 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1534#true} {1534#true} #58#return; {1534#true} is VALID [2018-11-14 18:29:43,988 INFO L273 TraceCheckUtils]: 2: Hoare triple {1534#true} assume true; {1534#true} is VALID [2018-11-14 18:29:43,988 INFO L273 TraceCheckUtils]: 1: Hoare triple {1534#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1534#true} is VALID [2018-11-14 18:29:43,989 INFO L256 TraceCheckUtils]: 0: Hoare triple {1534#true} call ULTIMATE.init(); {1534#true} is VALID [2018-11-14 18:29:43,996 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:29:44,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:29:44,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 25 [2018-11-14 18:29:44,005 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-11-14 18:29:44,006 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:29:44,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-14 18:29:44,172 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:29:44,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-14 18:29:44,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-14 18:29:44,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2018-11-14 18:29:44,173 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 25 states. [2018-11-14 18:29:45,916 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-14 18:29:46,188 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 7 [2018-11-14 18:29:46,451 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 7 [2018-11-14 18:29:46,699 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 7 [2018-11-14 18:29:48,146 WARN L179 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2018-11-14 18:29:52,621 WARN L179 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 15 [2018-11-14 18:29:53,119 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 15 [2018-11-14 18:29:53,731 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 15 [2018-11-14 18:29:54,172 WARN L179 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 23 [2018-11-14 18:29:54,762 WARN L179 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 23 [2018-11-14 18:29:55,385 WARN L179 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 23 [2018-11-14 18:29:55,994 WARN L179 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 31 [2018-11-14 18:29:56,615 WARN L179 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2018-11-14 18:29:57,308 WARN L179 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2018-11-14 18:29:57,836 WARN L179 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 39 [2018-11-14 18:29:59,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:29:59,982 INFO L93 Difference]: Finished difference Result 259 states and 317 transitions. [2018-11-14 18:29:59,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-14 18:29:59,983 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 46 [2018-11-14 18:29:59,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:29:59,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 18:29:59,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 286 transitions. [2018-11-14 18:29:59,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-14 18:30:00,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 286 transitions. [2018-11-14 18:30:00,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 286 transitions. [2018-11-14 18:30:00,808 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 286 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:00,816 INFO L225 Difference]: With dead ends: 259 [2018-11-14 18:30:00,816 INFO L226 Difference]: Without dead ends: 217 [2018-11-14 18:30:00,818 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=864, Invalid=1586, Unknown=0, NotChecked=0, Total=2450 [2018-11-14 18:30:00,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-14 18:30:01,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 152. [2018-11-14 18:30:01,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:30:01,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand 152 states. [2018-11-14 18:30:01,036 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand 152 states. [2018-11-14 18:30:01,036 INFO L87 Difference]: Start difference. First operand 217 states. Second operand 152 states. [2018-11-14 18:30:01,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:01,047 INFO L93 Difference]: Finished difference Result 217 states and 251 transitions. [2018-11-14 18:30:01,047 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 251 transitions. [2018-11-14 18:30:01,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:01,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:01,049 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand 217 states. [2018-11-14 18:30:01,049 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 217 states. [2018-11-14 18:30:01,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:01,060 INFO L93 Difference]: Finished difference Result 217 states and 251 transitions. [2018-11-14 18:30:01,060 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 251 transitions. [2018-11-14 18:30:01,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:01,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:01,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:30:01,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:30:01,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-11-14 18:30:01,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2018-11-14 18:30:01,068 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 46 [2018-11-14 18:30:01,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:30:01,068 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2018-11-14 18:30:01,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-14 18:30:01,068 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2018-11-14 18:30:01,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-14 18:30:01,070 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:30:01,071 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:30:01,071 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:30:01,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:30:01,071 INFO L82 PathProgramCache]: Analyzing trace with hash -163503608, now seen corresponding path program 4 times [2018-11-14 18:30:01,072 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:30:01,072 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 18:30:01,101 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:30:01,206 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:30:01,206 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:30:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:30:01,254 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:30:01,829 INFO L256 TraceCheckUtils]: 0: Hoare triple {2868#true} call ULTIMATE.init(); {2868#true} is VALID [2018-11-14 18:30:01,830 INFO L273 TraceCheckUtils]: 1: Hoare triple {2868#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2868#true} is VALID [2018-11-14 18:30:01,830 INFO L273 TraceCheckUtils]: 2: Hoare triple {2868#true} assume true; {2868#true} is VALID [2018-11-14 18:30:01,830 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2868#true} {2868#true} #58#return; {2868#true} is VALID [2018-11-14 18:30:01,831 INFO L256 TraceCheckUtils]: 4: Hoare triple {2868#true} call #t~ret4 := main(); {2868#true} is VALID [2018-11-14 18:30:01,832 INFO L273 TraceCheckUtils]: 5: Hoare triple {2868#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4000bv32);havoc ~index~0;~index~0 := 0bv32; {2888#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-14 18:30:01,832 INFO L273 TraceCheckUtils]: 6: Hoare triple {2888#(= (_ bv0 32) main_~index~0)} assume true; {2888#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-14 18:30:01,832 INFO L273 TraceCheckUtils]: 7: Hoare triple {2888#(= (_ bv0 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2888#(= (_ bv0 32) main_~index~0)} is VALID [2018-11-14 18:30:01,833 INFO L273 TraceCheckUtils]: 8: Hoare triple {2888#(= (_ bv0 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2898#(= (_ bv1 32) main_~index~0)} is VALID [2018-11-14 18:30:01,833 INFO L273 TraceCheckUtils]: 9: Hoare triple {2898#(= (_ bv1 32) main_~index~0)} assume true; {2898#(= (_ bv1 32) main_~index~0)} is VALID [2018-11-14 18:30:01,833 INFO L273 TraceCheckUtils]: 10: Hoare triple {2898#(= (_ bv1 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2898#(= (_ bv1 32) main_~index~0)} is VALID [2018-11-14 18:30:01,834 INFO L273 TraceCheckUtils]: 11: Hoare triple {2898#(= (_ bv1 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2908#(= (_ bv2 32) main_~index~0)} is VALID [2018-11-14 18:30:01,835 INFO L273 TraceCheckUtils]: 12: Hoare triple {2908#(= (_ bv2 32) main_~index~0)} assume true; {2908#(= (_ bv2 32) main_~index~0)} is VALID [2018-11-14 18:30:01,835 INFO L273 TraceCheckUtils]: 13: Hoare triple {2908#(= (_ bv2 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2908#(= (_ bv2 32) main_~index~0)} is VALID [2018-11-14 18:30:01,836 INFO L273 TraceCheckUtils]: 14: Hoare triple {2908#(= (_ bv2 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2918#(= (_ bv3 32) main_~index~0)} is VALID [2018-11-14 18:30:01,837 INFO L273 TraceCheckUtils]: 15: Hoare triple {2918#(= (_ bv3 32) main_~index~0)} assume true; {2918#(= (_ bv3 32) main_~index~0)} is VALID [2018-11-14 18:30:01,838 INFO L273 TraceCheckUtils]: 16: Hoare triple {2918#(= (_ bv3 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2918#(= (_ bv3 32) main_~index~0)} is VALID [2018-11-14 18:30:01,838 INFO L273 TraceCheckUtils]: 17: Hoare triple {2918#(= (_ bv3 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2928#(= (_ bv4 32) main_~index~0)} is VALID [2018-11-14 18:30:01,838 INFO L273 TraceCheckUtils]: 18: Hoare triple {2928#(= (_ bv4 32) main_~index~0)} assume true; {2928#(= (_ bv4 32) main_~index~0)} is VALID [2018-11-14 18:30:01,839 INFO L273 TraceCheckUtils]: 19: Hoare triple {2928#(= (_ bv4 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2928#(= (_ bv4 32) main_~index~0)} is VALID [2018-11-14 18:30:01,839 INFO L273 TraceCheckUtils]: 20: Hoare triple {2928#(= (_ bv4 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2938#(= (_ bv5 32) main_~index~0)} is VALID [2018-11-14 18:30:01,840 INFO L273 TraceCheckUtils]: 21: Hoare triple {2938#(= (_ bv5 32) main_~index~0)} assume true; {2938#(= (_ bv5 32) main_~index~0)} is VALID [2018-11-14 18:30:01,840 INFO L273 TraceCheckUtils]: 22: Hoare triple {2938#(= (_ bv5 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2938#(= (_ bv5 32) main_~index~0)} is VALID [2018-11-14 18:30:01,840 INFO L273 TraceCheckUtils]: 23: Hoare triple {2938#(= (_ bv5 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2948#(= (_ bv6 32) main_~index~0)} is VALID [2018-11-14 18:30:01,841 INFO L273 TraceCheckUtils]: 24: Hoare triple {2948#(= (_ bv6 32) main_~index~0)} assume true; {2948#(= (_ bv6 32) main_~index~0)} is VALID [2018-11-14 18:30:01,841 INFO L273 TraceCheckUtils]: 25: Hoare triple {2948#(= (_ bv6 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2948#(= (_ bv6 32) main_~index~0)} is VALID [2018-11-14 18:30:01,842 INFO L273 TraceCheckUtils]: 26: Hoare triple {2948#(= (_ bv6 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2958#(= (_ bv7 32) main_~index~0)} is VALID [2018-11-14 18:30:01,843 INFO L273 TraceCheckUtils]: 27: Hoare triple {2958#(= (_ bv7 32) main_~index~0)} assume true; {2958#(= (_ bv7 32) main_~index~0)} is VALID [2018-11-14 18:30:01,843 INFO L273 TraceCheckUtils]: 28: Hoare triple {2958#(= (_ bv7 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2958#(= (_ bv7 32) main_~index~0)} is VALID [2018-11-14 18:30:01,844 INFO L273 TraceCheckUtils]: 29: Hoare triple {2958#(= (_ bv7 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2968#(= (_ bv8 32) main_~index~0)} is VALID [2018-11-14 18:30:01,845 INFO L273 TraceCheckUtils]: 30: Hoare triple {2968#(= (_ bv8 32) main_~index~0)} assume true; {2968#(= (_ bv8 32) main_~index~0)} is VALID [2018-11-14 18:30:01,845 INFO L273 TraceCheckUtils]: 31: Hoare triple {2968#(= (_ bv8 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2968#(= (_ bv8 32) main_~index~0)} is VALID [2018-11-14 18:30:01,846 INFO L273 TraceCheckUtils]: 32: Hoare triple {2968#(= (_ bv8 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2978#(= (_ bv9 32) main_~index~0)} is VALID [2018-11-14 18:30:01,847 INFO L273 TraceCheckUtils]: 33: Hoare triple {2978#(= (_ bv9 32) main_~index~0)} assume true; {2978#(= (_ bv9 32) main_~index~0)} is VALID [2018-11-14 18:30:01,847 INFO L273 TraceCheckUtils]: 34: Hoare triple {2978#(= (_ bv9 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2978#(= (_ bv9 32) main_~index~0)} is VALID [2018-11-14 18:30:01,848 INFO L273 TraceCheckUtils]: 35: Hoare triple {2978#(= (_ bv9 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2988#(= (_ bv10 32) main_~index~0)} is VALID [2018-11-14 18:30:01,851 INFO L273 TraceCheckUtils]: 36: Hoare triple {2988#(= (_ bv10 32) main_~index~0)} assume true; {2988#(= (_ bv10 32) main_~index~0)} is VALID [2018-11-14 18:30:01,853 INFO L273 TraceCheckUtils]: 37: Hoare triple {2988#(= (_ bv10 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2988#(= (_ bv10 32) main_~index~0)} is VALID [2018-11-14 18:30:01,857 INFO L273 TraceCheckUtils]: 38: Hoare triple {2988#(= (_ bv10 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2998#(= (_ bv11 32) main_~index~0)} is VALID [2018-11-14 18:30:01,858 INFO L273 TraceCheckUtils]: 39: Hoare triple {2998#(= (_ bv11 32) main_~index~0)} assume true; {2998#(= (_ bv11 32) main_~index~0)} is VALID [2018-11-14 18:30:01,859 INFO L273 TraceCheckUtils]: 40: Hoare triple {2998#(= (_ bv11 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2998#(= (_ bv11 32) main_~index~0)} is VALID [2018-11-14 18:30:01,859 INFO L273 TraceCheckUtils]: 41: Hoare triple {2998#(= (_ bv11 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3008#(= (_ bv12 32) main_~index~0)} is VALID [2018-11-14 18:30:01,860 INFO L273 TraceCheckUtils]: 42: Hoare triple {3008#(= (_ bv12 32) main_~index~0)} assume true; {3008#(= (_ bv12 32) main_~index~0)} is VALID [2018-11-14 18:30:01,860 INFO L273 TraceCheckUtils]: 43: Hoare triple {3008#(= (_ bv12 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3008#(= (_ bv12 32) main_~index~0)} is VALID [2018-11-14 18:30:01,860 INFO L273 TraceCheckUtils]: 44: Hoare triple {3008#(= (_ bv12 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3018#(= (_ bv13 32) main_~index~0)} is VALID [2018-11-14 18:30:01,861 INFO L273 TraceCheckUtils]: 45: Hoare triple {3018#(= (_ bv13 32) main_~index~0)} assume true; {3018#(= (_ bv13 32) main_~index~0)} is VALID [2018-11-14 18:30:01,861 INFO L273 TraceCheckUtils]: 46: Hoare triple {3018#(= (_ bv13 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3018#(= (_ bv13 32) main_~index~0)} is VALID [2018-11-14 18:30:01,862 INFO L273 TraceCheckUtils]: 47: Hoare triple {3018#(= (_ bv13 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3028#(= (_ bv14 32) main_~index~0)} is VALID [2018-11-14 18:30:01,862 INFO L273 TraceCheckUtils]: 48: Hoare triple {3028#(= (_ bv14 32) main_~index~0)} assume true; {3028#(= (_ bv14 32) main_~index~0)} is VALID [2018-11-14 18:30:01,863 INFO L273 TraceCheckUtils]: 49: Hoare triple {3028#(= (_ bv14 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3028#(= (_ bv14 32) main_~index~0)} is VALID [2018-11-14 18:30:01,863 INFO L273 TraceCheckUtils]: 50: Hoare triple {3028#(= (_ bv14 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3038#(= (_ bv15 32) main_~index~0)} is VALID [2018-11-14 18:30:01,869 INFO L273 TraceCheckUtils]: 51: Hoare triple {3038#(= (_ bv15 32) main_~index~0)} assume true; {3038#(= (_ bv15 32) main_~index~0)} is VALID [2018-11-14 18:30:01,870 INFO L273 TraceCheckUtils]: 52: Hoare triple {3038#(= (_ bv15 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3038#(= (_ bv15 32) main_~index~0)} is VALID [2018-11-14 18:30:01,870 INFO L273 TraceCheckUtils]: 53: Hoare triple {3038#(= (_ bv15 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3048#(= (_ bv16 32) main_~index~0)} is VALID [2018-11-14 18:30:01,871 INFO L273 TraceCheckUtils]: 54: Hoare triple {3048#(= (_ bv16 32) main_~index~0)} assume true; {3048#(= (_ bv16 32) main_~index~0)} is VALID [2018-11-14 18:30:01,871 INFO L273 TraceCheckUtils]: 55: Hoare triple {3048#(= (_ bv16 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3048#(= (_ bv16 32) main_~index~0)} is VALID [2018-11-14 18:30:01,871 INFO L273 TraceCheckUtils]: 56: Hoare triple {3048#(= (_ bv16 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3058#(= (_ bv17 32) main_~index~0)} is VALID [2018-11-14 18:30:01,872 INFO L273 TraceCheckUtils]: 57: Hoare triple {3058#(= (_ bv17 32) main_~index~0)} assume true; {3058#(= (_ bv17 32) main_~index~0)} is VALID [2018-11-14 18:30:01,872 INFO L273 TraceCheckUtils]: 58: Hoare triple {3058#(= (_ bv17 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3058#(= (_ bv17 32) main_~index~0)} is VALID [2018-11-14 18:30:01,873 INFO L273 TraceCheckUtils]: 59: Hoare triple {3058#(= (_ bv17 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3068#(= (_ bv18 32) main_~index~0)} is VALID [2018-11-14 18:30:01,873 INFO L273 TraceCheckUtils]: 60: Hoare triple {3068#(= (_ bv18 32) main_~index~0)} assume true; {3068#(= (_ bv18 32) main_~index~0)} is VALID [2018-11-14 18:30:01,873 INFO L273 TraceCheckUtils]: 61: Hoare triple {3068#(= (_ bv18 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3068#(= (_ bv18 32) main_~index~0)} is VALID [2018-11-14 18:30:01,874 INFO L273 TraceCheckUtils]: 62: Hoare triple {3068#(= (_ bv18 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3078#(= (_ bv19 32) main_~index~0)} is VALID [2018-11-14 18:30:01,874 INFO L273 TraceCheckUtils]: 63: Hoare triple {3078#(= (_ bv19 32) main_~index~0)} assume true; {3078#(= (_ bv19 32) main_~index~0)} is VALID [2018-11-14 18:30:01,875 INFO L273 TraceCheckUtils]: 64: Hoare triple {3078#(= (_ bv19 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3078#(= (_ bv19 32) main_~index~0)} is VALID [2018-11-14 18:30:01,876 INFO L273 TraceCheckUtils]: 65: Hoare triple {3078#(= (_ bv19 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3088#(= (_ bv20 32) main_~index~0)} is VALID [2018-11-14 18:30:01,876 INFO L273 TraceCheckUtils]: 66: Hoare triple {3088#(= (_ bv20 32) main_~index~0)} assume true; {3088#(= (_ bv20 32) main_~index~0)} is VALID [2018-11-14 18:30:01,877 INFO L273 TraceCheckUtils]: 67: Hoare triple {3088#(= (_ bv20 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3088#(= (_ bv20 32) main_~index~0)} is VALID [2018-11-14 18:30:01,877 INFO L273 TraceCheckUtils]: 68: Hoare triple {3088#(= (_ bv20 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3098#(= (_ bv21 32) main_~index~0)} is VALID [2018-11-14 18:30:01,878 INFO L273 TraceCheckUtils]: 69: Hoare triple {3098#(= (_ bv21 32) main_~index~0)} assume true; {3098#(= (_ bv21 32) main_~index~0)} is VALID [2018-11-14 18:30:01,879 INFO L273 TraceCheckUtils]: 70: Hoare triple {3098#(= (_ bv21 32) main_~index~0)} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3098#(= (_ bv21 32) main_~index~0)} is VALID [2018-11-14 18:30:01,879 INFO L273 TraceCheckUtils]: 71: Hoare triple {3098#(= (_ bv21 32) main_~index~0)} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3108#(= (_ bv22 32) main_~index~0)} is VALID [2018-11-14 18:30:01,880 INFO L273 TraceCheckUtils]: 72: Hoare triple {3108#(= (_ bv22 32) main_~index~0)} assume true; {3108#(= (_ bv22 32) main_~index~0)} is VALID [2018-11-14 18:30:01,880 INFO L273 TraceCheckUtils]: 73: Hoare triple {3108#(= (_ bv22 32) main_~index~0)} assume !~bvult32(~index~0, 1000bv32); {2869#false} is VALID [2018-11-14 18:30:01,881 INFO L273 TraceCheckUtils]: 74: Hoare triple {2869#false} ~index~0 := 0bv32; {2869#false} is VALID [2018-11-14 18:30:01,881 INFO L273 TraceCheckUtils]: 75: Hoare triple {2869#false} assume true; {2869#false} is VALID [2018-11-14 18:30:01,881 INFO L273 TraceCheckUtils]: 76: Hoare triple {2869#false} assume !!~bvult32(~index~0, 1000bv32); {2869#false} is VALID [2018-11-14 18:30:01,882 INFO L273 TraceCheckUtils]: 77: Hoare triple {2869#false} assume ~bvurem32(~index~0, 2bv32) == 0bv32;call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2869#false} is VALID [2018-11-14 18:30:01,882 INFO L256 TraceCheckUtils]: 78: Hoare triple {2869#false} call __VERIFIER_assert((if #t~mem2 == 0bv32 then 1bv32 else 0bv32)); {2869#false} is VALID [2018-11-14 18:30:01,882 INFO L273 TraceCheckUtils]: 79: Hoare triple {2869#false} ~cond := #in~cond; {2869#false} is VALID [2018-11-14 18:30:01,883 INFO L273 TraceCheckUtils]: 80: Hoare triple {2869#false} assume ~cond == 0bv32; {2869#false} is VALID [2018-11-14 18:30:01,883 INFO L273 TraceCheckUtils]: 81: Hoare triple {2869#false} assume !false; {2869#false} is VALID [2018-11-14 18:30:01,891 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:30:01,891 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 18:30:03,585 INFO L273 TraceCheckUtils]: 81: Hoare triple {2869#false} assume !false; {2869#false} is VALID [2018-11-14 18:30:03,585 INFO L273 TraceCheckUtils]: 80: Hoare triple {2869#false} assume ~cond == 0bv32; {2869#false} is VALID [2018-11-14 18:30:03,585 INFO L273 TraceCheckUtils]: 79: Hoare triple {2869#false} ~cond := #in~cond; {2869#false} is VALID [2018-11-14 18:30:03,586 INFO L256 TraceCheckUtils]: 78: Hoare triple {2869#false} call __VERIFIER_assert((if #t~mem2 == 0bv32 then 1bv32 else 0bv32)); {2869#false} is VALID [2018-11-14 18:30:03,586 INFO L273 TraceCheckUtils]: 77: Hoare triple {2869#false} assume ~bvurem32(~index~0, 2bv32) == 0bv32;call #t~mem2 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {2869#false} is VALID [2018-11-14 18:30:03,586 INFO L273 TraceCheckUtils]: 76: Hoare triple {2869#false} assume !!~bvult32(~index~0, 1000bv32); {2869#false} is VALID [2018-11-14 18:30:03,586 INFO L273 TraceCheckUtils]: 75: Hoare triple {2869#false} assume true; {2869#false} is VALID [2018-11-14 18:30:03,586 INFO L273 TraceCheckUtils]: 74: Hoare triple {2869#false} ~index~0 := 0bv32; {2869#false} is VALID [2018-11-14 18:30:03,586 INFO L273 TraceCheckUtils]: 73: Hoare triple {3163#(bvult main_~index~0 (_ bv1000 32))} assume !~bvult32(~index~0, 1000bv32); {2869#false} is VALID [2018-11-14 18:30:03,587 INFO L273 TraceCheckUtils]: 72: Hoare triple {3163#(bvult main_~index~0 (_ bv1000 32))} assume true; {3163#(bvult main_~index~0 (_ bv1000 32))} is VALID [2018-11-14 18:30:03,591 INFO L273 TraceCheckUtils]: 71: Hoare triple {3170#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3163#(bvult main_~index~0 (_ bv1000 32))} is VALID [2018-11-14 18:30:03,592 INFO L273 TraceCheckUtils]: 70: Hoare triple {3170#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3170#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,592 INFO L273 TraceCheckUtils]: 69: Hoare triple {3170#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} assume true; {3170#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,597 INFO L273 TraceCheckUtils]: 68: Hoare triple {3180#(bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3170#(bvult (bvadd main_~index~0 (_ bv1 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,598 INFO L273 TraceCheckUtils]: 67: Hoare triple {3180#(bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3180#(bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,598 INFO L273 TraceCheckUtils]: 66: Hoare triple {3180#(bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))} assume true; {3180#(bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,605 INFO L273 TraceCheckUtils]: 65: Hoare triple {3190#(bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3180#(bvult (bvadd main_~index~0 (_ bv2 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,605 INFO L273 TraceCheckUtils]: 64: Hoare triple {3190#(bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3190#(bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,605 INFO L273 TraceCheckUtils]: 63: Hoare triple {3190#(bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))} assume true; {3190#(bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,610 INFO L273 TraceCheckUtils]: 62: Hoare triple {3200#(bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3190#(bvult (bvadd main_~index~0 (_ bv3 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,611 INFO L273 TraceCheckUtils]: 61: Hoare triple {3200#(bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3200#(bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,611 INFO L273 TraceCheckUtils]: 60: Hoare triple {3200#(bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32))} assume true; {3200#(bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,618 INFO L273 TraceCheckUtils]: 59: Hoare triple {3210#(bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3200#(bvult (bvadd main_~index~0 (_ bv4 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,618 INFO L273 TraceCheckUtils]: 58: Hoare triple {3210#(bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3210#(bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,621 INFO L273 TraceCheckUtils]: 57: Hoare triple {3210#(bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32))} assume true; {3210#(bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,629 INFO L273 TraceCheckUtils]: 56: Hoare triple {3220#(bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3210#(bvult (bvadd main_~index~0 (_ bv5 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,630 INFO L273 TraceCheckUtils]: 55: Hoare triple {3220#(bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3220#(bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,630 INFO L273 TraceCheckUtils]: 54: Hoare triple {3220#(bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32))} assume true; {3220#(bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,635 INFO L273 TraceCheckUtils]: 53: Hoare triple {3230#(bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3220#(bvult (bvadd main_~index~0 (_ bv6 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,635 INFO L273 TraceCheckUtils]: 52: Hoare triple {3230#(bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3230#(bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,636 INFO L273 TraceCheckUtils]: 51: Hoare triple {3230#(bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32))} assume true; {3230#(bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,641 INFO L273 TraceCheckUtils]: 50: Hoare triple {3240#(bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3230#(bvult (bvadd main_~index~0 (_ bv7 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,641 INFO L273 TraceCheckUtils]: 49: Hoare triple {3240#(bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3240#(bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,642 INFO L273 TraceCheckUtils]: 48: Hoare triple {3240#(bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32))} assume true; {3240#(bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,646 INFO L273 TraceCheckUtils]: 47: Hoare triple {3250#(bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3240#(bvult (bvadd main_~index~0 (_ bv8 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,646 INFO L273 TraceCheckUtils]: 46: Hoare triple {3250#(bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3250#(bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,647 INFO L273 TraceCheckUtils]: 45: Hoare triple {3250#(bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32))} assume true; {3250#(bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,652 INFO L273 TraceCheckUtils]: 44: Hoare triple {3260#(bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3250#(bvult (bvadd main_~index~0 (_ bv9 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,652 INFO L273 TraceCheckUtils]: 43: Hoare triple {3260#(bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3260#(bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,653 INFO L273 TraceCheckUtils]: 42: Hoare triple {3260#(bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv1000 32))} assume true; {3260#(bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,658 INFO L273 TraceCheckUtils]: 41: Hoare triple {3270#(bvult (bvadd main_~index~0 (_ bv11 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3260#(bvult (bvadd main_~index~0 (_ bv10 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,659 INFO L273 TraceCheckUtils]: 40: Hoare triple {3270#(bvult (bvadd main_~index~0 (_ bv11 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3270#(bvult (bvadd main_~index~0 (_ bv11 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,659 INFO L273 TraceCheckUtils]: 39: Hoare triple {3270#(bvult (bvadd main_~index~0 (_ bv11 32)) (_ bv1000 32))} assume true; {3270#(bvult (bvadd main_~index~0 (_ bv11 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,664 INFO L273 TraceCheckUtils]: 38: Hoare triple {3280#(bvult (bvadd main_~index~0 (_ bv12 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3270#(bvult (bvadd main_~index~0 (_ bv11 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,665 INFO L273 TraceCheckUtils]: 37: Hoare triple {3280#(bvult (bvadd main_~index~0 (_ bv12 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3280#(bvult (bvadd main_~index~0 (_ bv12 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,665 INFO L273 TraceCheckUtils]: 36: Hoare triple {3280#(bvult (bvadd main_~index~0 (_ bv12 32)) (_ bv1000 32))} assume true; {3280#(bvult (bvadd main_~index~0 (_ bv12 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,672 INFO L273 TraceCheckUtils]: 35: Hoare triple {3290#(bvult (bvadd main_~index~0 (_ bv13 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3280#(bvult (bvadd main_~index~0 (_ bv12 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,673 INFO L273 TraceCheckUtils]: 34: Hoare triple {3290#(bvult (bvadd main_~index~0 (_ bv13 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3290#(bvult (bvadd main_~index~0 (_ bv13 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,673 INFO L273 TraceCheckUtils]: 33: Hoare triple {3290#(bvult (bvadd main_~index~0 (_ bv13 32)) (_ bv1000 32))} assume true; {3290#(bvult (bvadd main_~index~0 (_ bv13 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,682 INFO L273 TraceCheckUtils]: 32: Hoare triple {3300#(bvult (bvadd main_~index~0 (_ bv14 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3290#(bvult (bvadd main_~index~0 (_ bv13 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,683 INFO L273 TraceCheckUtils]: 31: Hoare triple {3300#(bvult (bvadd main_~index~0 (_ bv14 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3300#(bvult (bvadd main_~index~0 (_ bv14 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,683 INFO L273 TraceCheckUtils]: 30: Hoare triple {3300#(bvult (bvadd main_~index~0 (_ bv14 32)) (_ bv1000 32))} assume true; {3300#(bvult (bvadd main_~index~0 (_ bv14 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,688 INFO L273 TraceCheckUtils]: 29: Hoare triple {3310#(bvult (bvadd main_~index~0 (_ bv15 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3300#(bvult (bvadd main_~index~0 (_ bv14 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,688 INFO L273 TraceCheckUtils]: 28: Hoare triple {3310#(bvult (bvadd main_~index~0 (_ bv15 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3310#(bvult (bvadd main_~index~0 (_ bv15 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,689 INFO L273 TraceCheckUtils]: 27: Hoare triple {3310#(bvult (bvadd main_~index~0 (_ bv15 32)) (_ bv1000 32))} assume true; {3310#(bvult (bvadd main_~index~0 (_ bv15 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,693 INFO L273 TraceCheckUtils]: 26: Hoare triple {3320#(bvult (bvadd main_~index~0 (_ bv16 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3310#(bvult (bvadd main_~index~0 (_ bv15 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,693 INFO L273 TraceCheckUtils]: 25: Hoare triple {3320#(bvult (bvadd main_~index~0 (_ bv16 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3320#(bvult (bvadd main_~index~0 (_ bv16 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,694 INFO L273 TraceCheckUtils]: 24: Hoare triple {3320#(bvult (bvadd main_~index~0 (_ bv16 32)) (_ bv1000 32))} assume true; {3320#(bvult (bvadd main_~index~0 (_ bv16 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,699 INFO L273 TraceCheckUtils]: 23: Hoare triple {3330#(bvult (bvadd main_~index~0 (_ bv17 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3320#(bvult (bvadd main_~index~0 (_ bv16 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,699 INFO L273 TraceCheckUtils]: 22: Hoare triple {3330#(bvult (bvadd main_~index~0 (_ bv17 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3330#(bvult (bvadd main_~index~0 (_ bv17 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,699 INFO L273 TraceCheckUtils]: 21: Hoare triple {3330#(bvult (bvadd main_~index~0 (_ bv17 32)) (_ bv1000 32))} assume true; {3330#(bvult (bvadd main_~index~0 (_ bv17 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,706 INFO L273 TraceCheckUtils]: 20: Hoare triple {3340#(bvult (bvadd main_~index~0 (_ bv18 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3330#(bvult (bvadd main_~index~0 (_ bv17 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,706 INFO L273 TraceCheckUtils]: 19: Hoare triple {3340#(bvult (bvadd main_~index~0 (_ bv18 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3340#(bvult (bvadd main_~index~0 (_ bv18 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,707 INFO L273 TraceCheckUtils]: 18: Hoare triple {3340#(bvult (bvadd main_~index~0 (_ bv18 32)) (_ bv1000 32))} assume true; {3340#(bvult (bvadd main_~index~0 (_ bv18 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,713 INFO L273 TraceCheckUtils]: 17: Hoare triple {3350#(bvult (bvadd main_~index~0 (_ bv19 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3340#(bvult (bvadd main_~index~0 (_ bv18 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,713 INFO L273 TraceCheckUtils]: 16: Hoare triple {3350#(bvult (bvadd main_~index~0 (_ bv19 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3350#(bvult (bvadd main_~index~0 (_ bv19 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,714 INFO L273 TraceCheckUtils]: 15: Hoare triple {3350#(bvult (bvadd main_~index~0 (_ bv19 32)) (_ bv1000 32))} assume true; {3350#(bvult (bvadd main_~index~0 (_ bv19 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,719 INFO L273 TraceCheckUtils]: 14: Hoare triple {3360#(bvult (bvadd main_~index~0 (_ bv20 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3350#(bvult (bvadd main_~index~0 (_ bv19 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,719 INFO L273 TraceCheckUtils]: 13: Hoare triple {3360#(bvult (bvadd main_~index~0 (_ bv20 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3360#(bvult (bvadd main_~index~0 (_ bv20 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,719 INFO L273 TraceCheckUtils]: 12: Hoare triple {3360#(bvult (bvadd main_~index~0 (_ bv20 32)) (_ bv1000 32))} assume true; {3360#(bvult (bvadd main_~index~0 (_ bv20 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,727 INFO L273 TraceCheckUtils]: 11: Hoare triple {3370#(bvult (bvadd main_~index~0 (_ bv21 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3360#(bvult (bvadd main_~index~0 (_ bv20 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,728 INFO L273 TraceCheckUtils]: 10: Hoare triple {3370#(bvult (bvadd main_~index~0 (_ bv21 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3370#(bvult (bvadd main_~index~0 (_ bv21 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,728 INFO L273 TraceCheckUtils]: 9: Hoare triple {3370#(bvult (bvadd main_~index~0 (_ bv21 32)) (_ bv1000 32))} assume true; {3370#(bvult (bvadd main_~index~0 (_ bv21 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,735 INFO L273 TraceCheckUtils]: 8: Hoare triple {3380#(bvult (bvadd main_~index~0 (_ bv22 32)) (_ bv1000 32))} #t~post0 := ~index~0;~index~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3370#(bvult (bvadd main_~index~0 (_ bv21 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,735 INFO L273 TraceCheckUtils]: 7: Hoare triple {3380#(bvult (bvadd main_~index~0 (_ bv22 32)) (_ bv1000 32))} assume !!~bvult32(~index~0, 1000bv32);call write~intINTTYPE4(~bvurem32(~index~0, 2bv32), ~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~index~0)), 4bv32); {3380#(bvult (bvadd main_~index~0 (_ bv22 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,736 INFO L273 TraceCheckUtils]: 6: Hoare triple {3380#(bvult (bvadd main_~index~0 (_ bv22 32)) (_ bv1000 32))} assume true; {3380#(bvult (bvadd main_~index~0 (_ bv22 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,736 INFO L273 TraceCheckUtils]: 5: Hoare triple {2868#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(4000bv32);havoc ~index~0;~index~0 := 0bv32; {3380#(bvult (bvadd main_~index~0 (_ bv22 32)) (_ bv1000 32))} is VALID [2018-11-14 18:30:03,737 INFO L256 TraceCheckUtils]: 4: Hoare triple {2868#true} call #t~ret4 := main(); {2868#true} is VALID [2018-11-14 18:30:03,737 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2868#true} {2868#true} #58#return; {2868#true} is VALID [2018-11-14 18:30:03,737 INFO L273 TraceCheckUtils]: 2: Hoare triple {2868#true} assume true; {2868#true} is VALID [2018-11-14 18:30:03,737 INFO L273 TraceCheckUtils]: 1: Hoare triple {2868#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2868#true} is VALID [2018-11-14 18:30:03,737 INFO L256 TraceCheckUtils]: 0: Hoare triple {2868#true} call ULTIMATE.init(); {2868#true} is VALID [2018-11-14 18:30:03,746 INFO L134 CoverageAnalysis]: Checked inductivity of 737 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:30:03,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 18:30:03,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-14 18:30:03,751 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 82 [2018-11-14 18:30:03,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:30:03,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-14 18:30:04,070 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:04,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-14 18:30:04,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-14 18:30:04,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-14 18:30:04,072 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand 48 states. [2018-11-14 18:30:09,766 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-14 18:30:10,338 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-14 18:30:10,880 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-14 18:30:11,426 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-14 18:30:11,966 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-14 18:30:12,500 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-14 18:30:41,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:41,446 INFO L93 Difference]: Finished difference Result 511 states and 629 transitions. [2018-11-14 18:30:41,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-14 18:30:41,447 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 82 [2018-11-14 18:30:41,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:30:41,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 18:30:41,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 556 transitions. [2018-11-14 18:30:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 18:30:41,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 556 transitions. [2018-11-14 18:30:41,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 556 transitions. [2018-11-14 18:30:42,626 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 556 edges. 556 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:30:42,645 INFO L225 Difference]: With dead ends: 511 [2018-11-14 18:30:42,645 INFO L226 Difference]: Without dead ends: 433 [2018-11-14 18:30:42,648 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-14 18:30:42,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2018-11-14 18:30:42,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 296. [2018-11-14 18:30:42,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:30:42,957 INFO L82 GeneralOperation]: Start isEquivalent. First operand 433 states. Second operand 296 states. [2018-11-14 18:30:42,957 INFO L74 IsIncluded]: Start isIncluded. First operand 433 states. Second operand 296 states. [2018-11-14 18:30:42,957 INFO L87 Difference]: Start difference. First operand 433 states. Second operand 296 states. [2018-11-14 18:30:42,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:42,982 INFO L93 Difference]: Finished difference Result 433 states and 503 transitions. [2018-11-14 18:30:42,983 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 503 transitions. [2018-11-14 18:30:42,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:42,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:42,985 INFO L74 IsIncluded]: Start isIncluded. First operand 296 states. Second operand 433 states. [2018-11-14 18:30:42,985 INFO L87 Difference]: Start difference. First operand 296 states. Second operand 433 states. [2018-11-14 18:30:43,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:30:43,012 INFO L93 Difference]: Finished difference Result 433 states and 503 transitions. [2018-11-14 18:30:43,012 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 503 transitions. [2018-11-14 18:30:43,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:30:43,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:30:43,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:30:43,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:30:43,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-11-14 18:30:43,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 321 transitions. [2018-11-14 18:30:43,033 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 321 transitions. Word has length 82 [2018-11-14 18:30:43,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:30:43,034 INFO L480 AbstractCegarLoop]: Abstraction has 296 states and 321 transitions. [2018-11-14 18:30:43,034 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-14 18:30:43,034 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 321 transitions. [2018-11-14 18:30:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-11-14 18:30:43,036 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:30:43,036 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:30:43,037 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:30:43,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:30:43,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1460010872, now seen corresponding path program 5 times [2018-11-14 18:30:43,038 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 18:30:43,038 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 18:30:43,067 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1