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/array-examples/standard_partition_original_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:47:29,290 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:47:29,292 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:47:29,304 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:47:29,304 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:47:29,305 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:47:29,307 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:47:29,309 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:47:29,311 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:47:29,311 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:47:29,312 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:47:29,313 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:47:29,314 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:47:29,315 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:47:29,316 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:47:29,317 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:47:29,318 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:47:29,320 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:47:29,322 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:47:29,323 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:47:29,325 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:47:29,326 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:47:29,329 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:47:29,329 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:47:29,329 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:47:29,330 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:47:29,331 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:47:29,332 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:47:29,333 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:47:29,334 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:47:29,335 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:47:29,336 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:47:29,336 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:47:29,336 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:47:29,337 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:47:29,338 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:47:29,338 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 17:47:29,357 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:47:29,357 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:47:29,361 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:47:29,361 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:47:29,362 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:47:29,362 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:47:29,362 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:47:29,363 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:47:29,363 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:47:29,363 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:47:29,363 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:47:29,363 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:47:29,363 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:47:29,364 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:47:29,365 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 17:47:29,365 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 17:47:29,365 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:47:29,365 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:47:29,365 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 17:47:29,365 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:47:29,367 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:47:29,367 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:47:29,367 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:47:29,367 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:47:29,368 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:47:29,368 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:47:29,368 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:47:29,368 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:47:29,368 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 17:47:29,368 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:47:29,369 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 17:47:29,369 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 17:47:29,369 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:47:29,419 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:47:29,431 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:47:29,436 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:47:29,437 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:47:29,438 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:47:29,439 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_partition_original_true-unreach-call_ground.i [2018-11-14 17:47:29,500 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/988bc2e59/d083d40a63874af59e073c6be50bbf40/FLAG24ac5c861 [2018-11-14 17:47:29,922 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:47:29,923 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_partition_original_true-unreach-call_ground.i [2018-11-14 17:47:29,929 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/988bc2e59/d083d40a63874af59e073c6be50bbf40/FLAG24ac5c861 [2018-11-14 17:47:29,943 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/988bc2e59/d083d40a63874af59e073c6be50bbf40 [2018-11-14 17:47:29,955 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:47:29,957 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:47:29,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:47:29,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:47:29,962 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:47:29,964 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:47:29" (1/1) ... [2018-11-14 17:47:29,967 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77cac830 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:29, skipping insertion in model container [2018-11-14 17:47:29,967 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:47:29" (1/1) ... [2018-11-14 17:47:29,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:47:30,004 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:47:30,270 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:47:30,277 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:47:30,318 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:47:30,345 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:47:30,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:30 WrapperNode [2018-11-14 17:47:30,346 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:47:30,347 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:47:30,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:47:30,348 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:47:30,364 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:30" (1/1) ... [2018-11-14 17:47:30,364 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:30" (1/1) ... [2018-11-14 17:47:30,375 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:30" (1/1) ... [2018-11-14 17:47:30,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:30" (1/1) ... [2018-11-14 17:47:30,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:30" (1/1) ... [2018-11-14 17:47:30,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:30" (1/1) ... [2018-11-14 17:47:30,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:30" (1/1) ... [2018-11-14 17:47:30,405 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:47:30,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:47:30,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:47:30,408 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:47:30,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:30" (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 17:47:30,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:47:30,569 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:47:30,569 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:47:30,569 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:47:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:47:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:47:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:47:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:47:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 17:47:30,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 17:47:30,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:47:30,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:47:30,571 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:47:30,571 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 17:47:31,297 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:47:31,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:47:31 BoogieIcfgContainer [2018-11-14 17:47:31,298 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:47:31,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:47:31,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:47:31,303 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:47:31,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:47:29" (1/3) ... [2018-11-14 17:47:31,304 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b155ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:47:31, skipping insertion in model container [2018-11-14 17:47:31,304 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:47:30" (2/3) ... [2018-11-14 17:47:31,305 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b155ae3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:47:31, skipping insertion in model container [2018-11-14 17:47:31,305 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:47:31" (3/3) ... [2018-11-14 17:47:31,307 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_partition_original_true-unreach-call_ground.i [2018-11-14 17:47:31,318 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:47:31,328 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:47:31,343 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:47:31,377 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:47:31,378 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:47:31,378 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:47:31,378 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:47:31,378 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:47:31,378 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:47:31,378 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:47:31,379 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:47:31,379 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:47:31,398 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2018-11-14 17:47:31,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 17:47:31,405 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:47:31,406 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:47:31,408 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:47:31,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:47:31,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1669182187, now seen corresponding path program 1 times [2018-11-14 17:47:31,420 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:47:31,420 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 17:47:31,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:47:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:47:31,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:47:31,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:47:31,608 INFO L256 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {36#true} is VALID [2018-11-14 17:47:31,612 INFO L273 TraceCheckUtils]: 1: Hoare triple {36#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {36#true} is VALID [2018-11-14 17:47:31,612 INFO L273 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2018-11-14 17:47:31,613 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #74#return; {36#true} is VALID [2018-11-14 17:47:31,613 INFO L256 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret7 := main(); {36#true} is VALID [2018-11-14 17:47:31,613 INFO L273 TraceCheckUtils]: 5: Hoare triple {36#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000bv32);~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000bv32);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000bv32); {36#true} is VALID [2018-11-14 17:47:31,615 INFO L273 TraceCheckUtils]: 6: Hoare triple {36#true} assume !true; {37#false} is VALID [2018-11-14 17:47:31,615 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#false} havoc ~x~0;~x~0 := 0bv32; {37#false} is VALID [2018-11-14 17:47:31,615 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#false} assume true; {37#false} is VALID [2018-11-14 17:47:31,616 INFO L273 TraceCheckUtils]: 9: Hoare triple {37#false} assume !!~bvslt32(~x~0, ~b~0);call #t~mem4 := read~intINTTYPE4(~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {37#false} is VALID [2018-11-14 17:47:31,616 INFO L256 TraceCheckUtils]: 10: Hoare triple {37#false} call __VERIFIER_assert((if ~bvsge32(#t~mem4, 0bv32) then 1bv32 else 0bv32)); {37#false} is VALID [2018-11-14 17:47:31,616 INFO L273 TraceCheckUtils]: 11: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2018-11-14 17:47:31,617 INFO L273 TraceCheckUtils]: 12: Hoare triple {37#false} assume ~cond == 0bv32; {37#false} is VALID [2018-11-14 17:47:31,617 INFO L273 TraceCheckUtils]: 13: Hoare triple {37#false} assume !false; {37#false} is VALID [2018-11-14 17:47:31,620 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 17:47:31,620 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:47:31,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:47:31,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:47:31,629 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 17:47:31,633 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:47:31,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:47:31,751 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:47:31,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:47:31,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:47:31,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:47:31,764 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 2 states. [2018-11-14 17:47:32,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:47:32,118 INFO L93 Difference]: Finished difference Result 56 states and 71 transitions. [2018-11-14 17:47:32,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:47:32,118 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 17:47:32,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:47:32,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:47:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-14 17:47:32,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:47:32,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-14 17:47:32,138 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-14 17:47:32,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:47:32,424 INFO L225 Difference]: With dead ends: 56 [2018-11-14 17:47:32,424 INFO L226 Difference]: Without dead ends: 28 [2018-11-14 17:47:32,430 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 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 17:47:32,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-14 17:47:32,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2018-11-14 17:47:32,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:47:32,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2018-11-14 17:47:32,501 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 17:47:32,501 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 17:47:32,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:47:32,507 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-14 17:47:32,507 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-14 17:47:32,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:47:32,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:47:32,508 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2018-11-14 17:47:32,508 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2018-11-14 17:47:32,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:47:32,513 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2018-11-14 17:47:32,513 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-14 17:47:32,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:47:32,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:47:32,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:47:32,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:47:32,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-14 17:47:32,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2018-11-14 17:47:32,520 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 14 [2018-11-14 17:47:32,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:47:32,521 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2018-11-14 17:47:32,521 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:47:32,521 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2018-11-14 17:47:32,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 17:47:32,522 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:47:32,522 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:47:32,523 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:47:32,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:47:32,523 INFO L82 PathProgramCache]: Analyzing trace with hash 518737971, now seen corresponding path program 1 times [2018-11-14 17:47:32,524 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:47:32,524 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 17:47:32,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:47:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:47:32,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:47:32,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:47:32,651 INFO L256 TraceCheckUtils]: 0: Hoare triple {244#true} call ULTIMATE.init(); {244#true} is VALID [2018-11-14 17:47:32,652 INFO L273 TraceCheckUtils]: 1: Hoare triple {244#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {244#true} is VALID [2018-11-14 17:47:32,652 INFO L273 TraceCheckUtils]: 2: Hoare triple {244#true} assume true; {244#true} is VALID [2018-11-14 17:47:32,653 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {244#true} {244#true} #74#return; {244#true} is VALID [2018-11-14 17:47:32,653 INFO L256 TraceCheckUtils]: 4: Hoare triple {244#true} call #t~ret7 := main(); {244#true} is VALID [2018-11-14 17:47:32,664 INFO L273 TraceCheckUtils]: 5: Hoare triple {244#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000bv32);~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000bv32);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000bv32); {264#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 17:47:32,666 INFO L273 TraceCheckUtils]: 6: Hoare triple {264#(= main_~a~0 (_ bv0 32))} assume true; {264#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 17:47:32,667 INFO L273 TraceCheckUtils]: 7: Hoare triple {264#(= main_~a~0 (_ bv0 32))} assume !~bvslt32(~a~0, 100000bv32); {245#false} is VALID [2018-11-14 17:47:32,667 INFO L273 TraceCheckUtils]: 8: Hoare triple {245#false} havoc ~x~0;~x~0 := 0bv32; {245#false} is VALID [2018-11-14 17:47:32,667 INFO L273 TraceCheckUtils]: 9: Hoare triple {245#false} assume true; {245#false} is VALID [2018-11-14 17:47:32,668 INFO L273 TraceCheckUtils]: 10: Hoare triple {245#false} assume !!~bvslt32(~x~0, ~b~0);call #t~mem4 := read~intINTTYPE4(~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {245#false} is VALID [2018-11-14 17:47:32,668 INFO L256 TraceCheckUtils]: 11: Hoare triple {245#false} call __VERIFIER_assert((if ~bvsge32(#t~mem4, 0bv32) then 1bv32 else 0bv32)); {245#false} is VALID [2018-11-14 17:47:32,669 INFO L273 TraceCheckUtils]: 12: Hoare triple {245#false} ~cond := #in~cond; {245#false} is VALID [2018-11-14 17:47:32,669 INFO L273 TraceCheckUtils]: 13: Hoare triple {245#false} assume ~cond == 0bv32; {245#false} is VALID [2018-11-14 17:47:32,670 INFO L273 TraceCheckUtils]: 14: Hoare triple {245#false} assume !false; {245#false} is VALID [2018-11-14 17:47:32,671 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 17:47:32,671 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:47:32,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:47:32,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:47:32,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 17:47:32,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:47:32,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:47:32,709 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 17:47:32,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:47:32,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:47:32,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:47:32,711 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states. [2018-11-14 17:47:33,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:47:33,225 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2018-11-14 17:47:33,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:47:33,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-14 17:47:33,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:47:33,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:47:33,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-14 17:47:33,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:47:33,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2018-11-14 17:47:33,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2018-11-14 17:47:33,383 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:47:33,385 INFO L225 Difference]: With dead ends: 50 [2018-11-14 17:47:33,385 INFO L226 Difference]: Without dead ends: 32 [2018-11-14 17:47:33,386 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:47:33,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-14 17:47:33,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2018-11-14 17:47:33,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:47:33,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand 30 states. [2018-11-14 17:47:33,451 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 30 states. [2018-11-14 17:47:33,451 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 30 states. [2018-11-14 17:47:33,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:47:33,455 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-14 17:47:33,455 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-14 17:47:33,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:47:33,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:47:33,456 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 32 states. [2018-11-14 17:47:33,456 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 32 states. [2018-11-14 17:47:33,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:47:33,460 INFO L93 Difference]: Finished difference Result 32 states and 37 transitions. [2018-11-14 17:47:33,460 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-11-14 17:47:33,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:47:33,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:47:33,462 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:47:33,462 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:47:33,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-14 17:47:33,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2018-11-14 17:47:33,465 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 15 [2018-11-14 17:47:33,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:47:33,465 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2018-11-14 17:47:33,466 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:47:33,466 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-14 17:47:33,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 17:47:33,467 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:47:33,467 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 17:47:33,467 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:47:33,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:47:33,468 INFO L82 PathProgramCache]: Analyzing trace with hash 747420425, now seen corresponding path program 1 times [2018-11-14 17:47:33,468 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:47:33,468 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 17:47:33,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:47:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:47:33,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:47:33,538 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:47:33,600 INFO L256 TraceCheckUtils]: 0: Hoare triple {462#true} call ULTIMATE.init(); {462#true} is VALID [2018-11-14 17:47:33,600 INFO L273 TraceCheckUtils]: 1: Hoare triple {462#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {462#true} is VALID [2018-11-14 17:47:33,601 INFO L273 TraceCheckUtils]: 2: Hoare triple {462#true} assume true; {462#true} is VALID [2018-11-14 17:47:33,601 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {462#true} {462#true} #74#return; {462#true} is VALID [2018-11-14 17:47:33,601 INFO L256 TraceCheckUtils]: 4: Hoare triple {462#true} call #t~ret7 := main(); {462#true} is VALID [2018-11-14 17:47:33,606 INFO L273 TraceCheckUtils]: 5: Hoare triple {462#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000bv32);~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000bv32);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000bv32); {482#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 17:47:33,608 INFO L273 TraceCheckUtils]: 6: Hoare triple {482#(= main_~a~0 (_ bv0 32))} assume true; {482#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 17:47:33,608 INFO L273 TraceCheckUtils]: 7: Hoare triple {482#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {482#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 17:47:33,610 INFO L273 TraceCheckUtils]: 8: Hoare triple {482#(= main_~a~0 (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {482#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 17:47:33,612 INFO L273 TraceCheckUtils]: 9: Hoare triple {482#(= main_~a~0 (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {495#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:33,613 INFO L273 TraceCheckUtils]: 10: Hoare triple {495#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {495#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:33,614 INFO L273 TraceCheckUtils]: 11: Hoare triple {495#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~a~0, 100000bv32); {463#false} is VALID [2018-11-14 17:47:33,614 INFO L273 TraceCheckUtils]: 12: Hoare triple {463#false} havoc ~x~0;~x~0 := 0bv32; {463#false} is VALID [2018-11-14 17:47:33,615 INFO L273 TraceCheckUtils]: 13: Hoare triple {463#false} assume true; {463#false} is VALID [2018-11-14 17:47:33,615 INFO L273 TraceCheckUtils]: 14: Hoare triple {463#false} assume !!~bvslt32(~x~0, ~b~0);call #t~mem4 := read~intINTTYPE4(~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {463#false} is VALID [2018-11-14 17:47:33,616 INFO L256 TraceCheckUtils]: 15: Hoare triple {463#false} call __VERIFIER_assert((if ~bvsge32(#t~mem4, 0bv32) then 1bv32 else 0bv32)); {463#false} is VALID [2018-11-14 17:47:33,616 INFO L273 TraceCheckUtils]: 16: Hoare triple {463#false} ~cond := #in~cond; {463#false} is VALID [2018-11-14 17:47:33,617 INFO L273 TraceCheckUtils]: 17: Hoare triple {463#false} assume ~cond == 0bv32; {463#false} is VALID [2018-11-14 17:47:33,617 INFO L273 TraceCheckUtils]: 18: Hoare triple {463#false} assume !false; {463#false} is VALID [2018-11-14 17:47:33,619 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 17:47:33,619 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:47:33,696 INFO L273 TraceCheckUtils]: 18: Hoare triple {463#false} assume !false; {463#false} is VALID [2018-11-14 17:47:33,697 INFO L273 TraceCheckUtils]: 17: Hoare triple {463#false} assume ~cond == 0bv32; {463#false} is VALID [2018-11-14 17:47:33,697 INFO L273 TraceCheckUtils]: 16: Hoare triple {463#false} ~cond := #in~cond; {463#false} is VALID [2018-11-14 17:47:33,697 INFO L256 TraceCheckUtils]: 15: Hoare triple {463#false} call __VERIFIER_assert((if ~bvsge32(#t~mem4, 0bv32) then 1bv32 else 0bv32)); {463#false} is VALID [2018-11-14 17:47:33,698 INFO L273 TraceCheckUtils]: 14: Hoare triple {463#false} assume !!~bvslt32(~x~0, ~b~0);call #t~mem4 := read~intINTTYPE4(~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {463#false} is VALID [2018-11-14 17:47:33,698 INFO L273 TraceCheckUtils]: 13: Hoare triple {463#false} assume true; {463#false} is VALID [2018-11-14 17:47:33,699 INFO L273 TraceCheckUtils]: 12: Hoare triple {463#false} havoc ~x~0;~x~0 := 0bv32; {463#false} is VALID [2018-11-14 17:47:33,702 INFO L273 TraceCheckUtils]: 11: Hoare triple {544#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {463#false} is VALID [2018-11-14 17:47:33,702 INFO L273 TraceCheckUtils]: 10: Hoare triple {544#(bvslt main_~a~0 (_ bv100000 32))} assume true; {544#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-14 17:47:33,704 INFO L273 TraceCheckUtils]: 9: Hoare triple {551#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {544#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-14 17:47:33,704 INFO L273 TraceCheckUtils]: 8: Hoare triple {551#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {551#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:33,706 INFO L273 TraceCheckUtils]: 7: Hoare triple {551#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {551#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:33,707 INFO L273 TraceCheckUtils]: 6: Hoare triple {551#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume true; {551#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:33,712 INFO L273 TraceCheckUtils]: 5: Hoare triple {462#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000bv32);~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000bv32);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000bv32); {551#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:33,712 INFO L256 TraceCheckUtils]: 4: Hoare triple {462#true} call #t~ret7 := main(); {462#true} is VALID [2018-11-14 17:47:33,713 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {462#true} {462#true} #74#return; {462#true} is VALID [2018-11-14 17:47:33,713 INFO L273 TraceCheckUtils]: 2: Hoare triple {462#true} assume true; {462#true} is VALID [2018-11-14 17:47:33,713 INFO L273 TraceCheckUtils]: 1: Hoare triple {462#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {462#true} is VALID [2018-11-14 17:47:33,714 INFO L256 TraceCheckUtils]: 0: Hoare triple {462#true} call ULTIMATE.init(); {462#true} is VALID [2018-11-14 17:47:33,715 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 17:47:33,716 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:47:33,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 17:47:33,717 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 17:47:33,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:47:33,718 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:47:33,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:47:33,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:47:33,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:47:33,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:47:33,814 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 6 states. [2018-11-14 17:47:34,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:47:34,271 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-11-14 17:47:34,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:47:34,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2018-11-14 17:47:34,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:47:34,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:47:34,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2018-11-14 17:47:34,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:47:34,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 72 transitions. [2018-11-14 17:47:34,280 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 72 transitions. [2018-11-14 17:47:34,499 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:47:34,501 INFO L225 Difference]: With dead ends: 60 [2018-11-14 17:47:34,502 INFO L226 Difference]: Without dead ends: 42 [2018-11-14 17:47:34,502 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 17:47:34,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-14 17:47:34,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-14 17:47:34,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:47:34,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-14 17:47:34,533 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 17:47:34,534 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 17:47:34,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:47:34,538 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-14 17:47:34,538 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-14 17:47:34,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:47:34,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:47:34,542 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-14 17:47:34,542 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-14 17:47:34,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:47:34,551 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2018-11-14 17:47:34,551 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-14 17:47:34,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:47:34,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:47:34,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:47:34,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:47:34,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 17:47:34,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-11-14 17:47:34,558 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 49 transitions. Word has length 19 [2018-11-14 17:47:34,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:47:34,558 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-11-14 17:47:34,558 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:47:34,559 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 49 transitions. [2018-11-14 17:47:34,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 17:47:34,561 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:47:34,561 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:47:34,562 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:47:34,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:47:34,562 INFO L82 PathProgramCache]: Analyzing trace with hash -849946229, now seen corresponding path program 2 times [2018-11-14 17:47:34,563 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:47:34,563 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 17:47:34,581 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 17:47:34,659 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:47:34,659 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:47:34,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:47:34,680 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:47:34,787 INFO L256 TraceCheckUtils]: 0: Hoare triple {802#true} call ULTIMATE.init(); {802#true} is VALID [2018-11-14 17:47:34,788 INFO L273 TraceCheckUtils]: 1: Hoare triple {802#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {802#true} is VALID [2018-11-14 17:47:34,788 INFO L273 TraceCheckUtils]: 2: Hoare triple {802#true} assume true; {802#true} is VALID [2018-11-14 17:47:34,788 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {802#true} {802#true} #74#return; {802#true} is VALID [2018-11-14 17:47:34,789 INFO L256 TraceCheckUtils]: 4: Hoare triple {802#true} call #t~ret7 := main(); {802#true} is VALID [2018-11-14 17:47:34,789 INFO L273 TraceCheckUtils]: 5: Hoare triple {802#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000bv32);~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000bv32);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000bv32); {822#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 17:47:34,790 INFO L273 TraceCheckUtils]: 6: Hoare triple {822#(= main_~a~0 (_ bv0 32))} assume true; {822#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 17:47:34,790 INFO L273 TraceCheckUtils]: 7: Hoare triple {822#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {822#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 17:47:34,791 INFO L273 TraceCheckUtils]: 8: Hoare triple {822#(= main_~a~0 (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {822#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 17:47:34,791 INFO L273 TraceCheckUtils]: 9: Hoare triple {822#(= main_~a~0 (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {835#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:34,792 INFO L273 TraceCheckUtils]: 10: Hoare triple {835#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {835#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:34,793 INFO L273 TraceCheckUtils]: 11: Hoare triple {835#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {835#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:34,794 INFO L273 TraceCheckUtils]: 12: Hoare triple {835#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {835#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:34,795 INFO L273 TraceCheckUtils]: 13: Hoare triple {835#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {848#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:34,796 INFO L273 TraceCheckUtils]: 14: Hoare triple {848#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {848#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:34,796 INFO L273 TraceCheckUtils]: 15: Hoare triple {848#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {848#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:34,797 INFO L273 TraceCheckUtils]: 16: Hoare triple {848#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {848#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:34,798 INFO L273 TraceCheckUtils]: 17: Hoare triple {848#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {861#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:34,799 INFO L273 TraceCheckUtils]: 18: Hoare triple {861#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {861#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:34,800 INFO L273 TraceCheckUtils]: 19: Hoare triple {861#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {861#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:34,801 INFO L273 TraceCheckUtils]: 20: Hoare triple {861#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {861#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:34,802 INFO L273 TraceCheckUtils]: 21: Hoare triple {861#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {874#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-14 17:47:34,803 INFO L273 TraceCheckUtils]: 22: Hoare triple {874#(= (_ bv4 32) main_~a~0)} assume true; {874#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-14 17:47:34,804 INFO L273 TraceCheckUtils]: 23: Hoare triple {874#(= (_ bv4 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {803#false} is VALID [2018-11-14 17:47:34,804 INFO L273 TraceCheckUtils]: 24: Hoare triple {803#false} havoc ~x~0;~x~0 := 0bv32; {803#false} is VALID [2018-11-14 17:47:34,805 INFO L273 TraceCheckUtils]: 25: Hoare triple {803#false} assume true; {803#false} is VALID [2018-11-14 17:47:34,805 INFO L273 TraceCheckUtils]: 26: Hoare triple {803#false} assume !!~bvslt32(~x~0, ~b~0);call #t~mem4 := read~intINTTYPE4(~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {803#false} is VALID [2018-11-14 17:47:34,805 INFO L256 TraceCheckUtils]: 27: Hoare triple {803#false} call __VERIFIER_assert((if ~bvsge32(#t~mem4, 0bv32) then 1bv32 else 0bv32)); {803#false} is VALID [2018-11-14 17:47:34,806 INFO L273 TraceCheckUtils]: 28: Hoare triple {803#false} ~cond := #in~cond; {803#false} is VALID [2018-11-14 17:47:34,806 INFO L273 TraceCheckUtils]: 29: Hoare triple {803#false} assume ~cond == 0bv32; {803#false} is VALID [2018-11-14 17:47:34,806 INFO L273 TraceCheckUtils]: 30: Hoare triple {803#false} assume !false; {803#false} is VALID [2018-11-14 17:47:34,809 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:47:34,810 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:47:35,038 INFO L273 TraceCheckUtils]: 30: Hoare triple {803#false} assume !false; {803#false} is VALID [2018-11-14 17:47:35,039 INFO L273 TraceCheckUtils]: 29: Hoare triple {803#false} assume ~cond == 0bv32; {803#false} is VALID [2018-11-14 17:47:35,039 INFO L273 TraceCheckUtils]: 28: Hoare triple {803#false} ~cond := #in~cond; {803#false} is VALID [2018-11-14 17:47:35,039 INFO L256 TraceCheckUtils]: 27: Hoare triple {803#false} call __VERIFIER_assert((if ~bvsge32(#t~mem4, 0bv32) then 1bv32 else 0bv32)); {803#false} is VALID [2018-11-14 17:47:35,040 INFO L273 TraceCheckUtils]: 26: Hoare triple {803#false} assume !!~bvslt32(~x~0, ~b~0);call #t~mem4 := read~intINTTYPE4(~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {803#false} is VALID [2018-11-14 17:47:35,040 INFO L273 TraceCheckUtils]: 25: Hoare triple {803#false} assume true; {803#false} is VALID [2018-11-14 17:47:35,040 INFO L273 TraceCheckUtils]: 24: Hoare triple {803#false} havoc ~x~0;~x~0 := 0bv32; {803#false} is VALID [2018-11-14 17:47:35,041 INFO L273 TraceCheckUtils]: 23: Hoare triple {923#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {803#false} is VALID [2018-11-14 17:47:35,045 INFO L273 TraceCheckUtils]: 22: Hoare triple {923#(bvslt main_~a~0 (_ bv100000 32))} assume true; {923#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-14 17:47:35,046 INFO L273 TraceCheckUtils]: 21: Hoare triple {930#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {923#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-14 17:47:35,047 INFO L273 TraceCheckUtils]: 20: Hoare triple {930#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {930#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:35,047 INFO L273 TraceCheckUtils]: 19: Hoare triple {930#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {930#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:35,048 INFO L273 TraceCheckUtils]: 18: Hoare triple {930#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume true; {930#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:35,054 INFO L273 TraceCheckUtils]: 17: Hoare triple {943#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {930#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:35,055 INFO L273 TraceCheckUtils]: 16: Hoare triple {943#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {943#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:35,056 INFO L273 TraceCheckUtils]: 15: Hoare triple {943#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {943#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:35,056 INFO L273 TraceCheckUtils]: 14: Hoare triple {943#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume true; {943#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:35,061 INFO L273 TraceCheckUtils]: 13: Hoare triple {956#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {943#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:35,062 INFO L273 TraceCheckUtils]: 12: Hoare triple {956#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {956#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:35,062 INFO L273 TraceCheckUtils]: 11: Hoare triple {956#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {956#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:35,063 INFO L273 TraceCheckUtils]: 10: Hoare triple {956#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume true; {956#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:35,072 INFO L273 TraceCheckUtils]: 9: Hoare triple {969#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {956#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:35,073 INFO L273 TraceCheckUtils]: 8: Hoare triple {969#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {969#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:35,087 INFO L273 TraceCheckUtils]: 7: Hoare triple {969#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {969#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:35,088 INFO L273 TraceCheckUtils]: 6: Hoare triple {969#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume true; {969#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:35,089 INFO L273 TraceCheckUtils]: 5: Hoare triple {802#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000bv32);~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000bv32);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000bv32); {969#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:35,089 INFO L256 TraceCheckUtils]: 4: Hoare triple {802#true} call #t~ret7 := main(); {802#true} is VALID [2018-11-14 17:47:35,089 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {802#true} {802#true} #74#return; {802#true} is VALID [2018-11-14 17:47:35,090 INFO L273 TraceCheckUtils]: 2: Hoare triple {802#true} assume true; {802#true} is VALID [2018-11-14 17:47:35,090 INFO L273 TraceCheckUtils]: 1: Hoare triple {802#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {802#true} is VALID [2018-11-14 17:47:35,091 INFO L256 TraceCheckUtils]: 0: Hoare triple {802#true} call ULTIMATE.init(); {802#true} is VALID [2018-11-14 17:47:35,094 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:47:35,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:47:35,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 17:47:35,098 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-14 17:47:35,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:47:35,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 17:47:35,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:47:35,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 17:47:35,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 17:47:35,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:47:35,219 INFO L87 Difference]: Start difference. First operand 42 states and 49 transitions. Second operand 12 states. [2018-11-14 17:47:36,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:47:36,842 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2018-11-14 17:47:36,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 17:47:36,843 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 31 [2018-11-14 17:47:36,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:47:36,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:47:36,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 105 transitions. [2018-11-14 17:47:36,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:47:36,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 105 transitions. [2018-11-14 17:47:36,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 105 transitions. [2018-11-14 17:47:37,080 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:47:37,084 INFO L225 Difference]: With dead ends: 84 [2018-11-14 17:47:37,084 INFO L226 Difference]: Without dead ends: 66 [2018-11-14 17:47:37,085 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-14 17:47:37,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-14 17:47:37,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-14 17:47:37,126 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:47:37,126 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 66 states. [2018-11-14 17:47:37,126 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-14 17:47:37,126 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-14 17:47:37,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:47:37,130 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2018-11-14 17:47:37,130 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2018-11-14 17:47:37,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:47:37,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:47:37,132 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-14 17:47:37,132 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-14 17:47:37,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:47:37,135 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2018-11-14 17:47:37,136 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2018-11-14 17:47:37,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:47:37,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:47:37,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:47:37,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:47:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-14 17:47:37,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 79 transitions. [2018-11-14 17:47:37,141 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 79 transitions. Word has length 31 [2018-11-14 17:47:37,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:47:37,141 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 79 transitions. [2018-11-14 17:47:37,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 17:47:37,142 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 79 transitions. [2018-11-14 17:47:37,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-11-14 17:47:37,143 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:47:37,143 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:47:37,144 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:47:37,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:47:37,144 INFO L82 PathProgramCache]: Analyzing trace with hash 885292431, now seen corresponding path program 3 times [2018-11-14 17:47:37,145 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:47:37,145 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 17:47:37,163 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 17:47:38,407 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-14 17:47:38,407 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:47:38,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:47:38,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:47:38,770 INFO L256 TraceCheckUtils]: 0: Hoare triple {1334#true} call ULTIMATE.init(); {1334#true} is VALID [2018-11-14 17:47:38,770 INFO L273 TraceCheckUtils]: 1: Hoare triple {1334#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1334#true} is VALID [2018-11-14 17:47:38,771 INFO L273 TraceCheckUtils]: 2: Hoare triple {1334#true} assume true; {1334#true} is VALID [2018-11-14 17:47:38,771 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1334#true} {1334#true} #74#return; {1334#true} is VALID [2018-11-14 17:47:38,772 INFO L256 TraceCheckUtils]: 4: Hoare triple {1334#true} call #t~ret7 := main(); {1334#true} is VALID [2018-11-14 17:47:38,772 INFO L273 TraceCheckUtils]: 5: Hoare triple {1334#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000bv32);~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000bv32);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000bv32); {1354#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 17:47:38,773 INFO L273 TraceCheckUtils]: 6: Hoare triple {1354#(= main_~a~0 (_ bv0 32))} assume true; {1354#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 17:47:38,773 INFO L273 TraceCheckUtils]: 7: Hoare triple {1354#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1354#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 17:47:38,774 INFO L273 TraceCheckUtils]: 8: Hoare triple {1354#(= main_~a~0 (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1354#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 17:47:38,774 INFO L273 TraceCheckUtils]: 9: Hoare triple {1354#(= main_~a~0 (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1367#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,775 INFO L273 TraceCheckUtils]: 10: Hoare triple {1367#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1367#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,776 INFO L273 TraceCheckUtils]: 11: Hoare triple {1367#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1367#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,776 INFO L273 TraceCheckUtils]: 12: Hoare triple {1367#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1367#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,778 INFO L273 TraceCheckUtils]: 13: Hoare triple {1367#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1380#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,778 INFO L273 TraceCheckUtils]: 14: Hoare triple {1380#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {1380#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,779 INFO L273 TraceCheckUtils]: 15: Hoare triple {1380#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1380#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,780 INFO L273 TraceCheckUtils]: 16: Hoare triple {1380#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1380#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,781 INFO L273 TraceCheckUtils]: 17: Hoare triple {1380#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1393#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,782 INFO L273 TraceCheckUtils]: 18: Hoare triple {1393#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1393#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,782 INFO L273 TraceCheckUtils]: 19: Hoare triple {1393#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1393#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,783 INFO L273 TraceCheckUtils]: 20: Hoare triple {1393#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1393#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,784 INFO L273 TraceCheckUtils]: 21: Hoare triple {1393#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1406#(= (bvadd main_~a~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,785 INFO L273 TraceCheckUtils]: 22: Hoare triple {1406#(= (bvadd main_~a~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {1406#(= (bvadd main_~a~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,788 INFO L273 TraceCheckUtils]: 23: Hoare triple {1406#(= (bvadd main_~a~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1406#(= (bvadd main_~a~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,789 INFO L273 TraceCheckUtils]: 24: Hoare triple {1406#(= (bvadd main_~a~0 (_ bv4294967292 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1406#(= (bvadd main_~a~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,790 INFO L273 TraceCheckUtils]: 25: Hoare triple {1406#(= (bvadd main_~a~0 (_ bv4294967292 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1419#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,790 INFO L273 TraceCheckUtils]: 26: Hoare triple {1419#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {1419#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,791 INFO L273 TraceCheckUtils]: 27: Hoare triple {1419#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1419#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,791 INFO L273 TraceCheckUtils]: 28: Hoare triple {1419#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1419#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,792 INFO L273 TraceCheckUtils]: 29: Hoare triple {1419#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1432#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,793 INFO L273 TraceCheckUtils]: 30: Hoare triple {1432#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} assume true; {1432#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,793 INFO L273 TraceCheckUtils]: 31: Hoare triple {1432#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1432#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,794 INFO L273 TraceCheckUtils]: 32: Hoare triple {1432#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1432#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,795 INFO L273 TraceCheckUtils]: 33: Hoare triple {1432#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1445#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,796 INFO L273 TraceCheckUtils]: 34: Hoare triple {1445#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {1445#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,797 INFO L273 TraceCheckUtils]: 35: Hoare triple {1445#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1445#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,797 INFO L273 TraceCheckUtils]: 36: Hoare triple {1445#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1445#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,798 INFO L273 TraceCheckUtils]: 37: Hoare triple {1445#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1458#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,799 INFO L273 TraceCheckUtils]: 38: Hoare triple {1458#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {1458#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,800 INFO L273 TraceCheckUtils]: 39: Hoare triple {1458#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1458#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,800 INFO L273 TraceCheckUtils]: 40: Hoare triple {1458#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1458#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,802 INFO L273 TraceCheckUtils]: 41: Hoare triple {1458#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1471#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,802 INFO L273 TraceCheckUtils]: 42: Hoare triple {1471#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} assume true; {1471#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,803 INFO L273 TraceCheckUtils]: 43: Hoare triple {1471#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1471#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,804 INFO L273 TraceCheckUtils]: 44: Hoare triple {1471#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1471#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,805 INFO L273 TraceCheckUtils]: 45: Hoare triple {1471#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1484#(= (bvadd main_~a~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,805 INFO L273 TraceCheckUtils]: 46: Hoare triple {1484#(= (bvadd main_~a~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {1484#(= (bvadd main_~a~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:38,806 INFO L273 TraceCheckUtils]: 47: Hoare triple {1484#(= (bvadd main_~a~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~a~0, 100000bv32); {1335#false} is VALID [2018-11-14 17:47:38,807 INFO L273 TraceCheckUtils]: 48: Hoare triple {1335#false} havoc ~x~0;~x~0 := 0bv32; {1335#false} is VALID [2018-11-14 17:47:38,807 INFO L273 TraceCheckUtils]: 49: Hoare triple {1335#false} assume true; {1335#false} is VALID [2018-11-14 17:47:38,807 INFO L273 TraceCheckUtils]: 50: Hoare triple {1335#false} assume !!~bvslt32(~x~0, ~b~0);call #t~mem4 := read~intINTTYPE4(~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1335#false} is VALID [2018-11-14 17:47:38,808 INFO L256 TraceCheckUtils]: 51: Hoare triple {1335#false} call __VERIFIER_assert((if ~bvsge32(#t~mem4, 0bv32) then 1bv32 else 0bv32)); {1335#false} is VALID [2018-11-14 17:47:38,808 INFO L273 TraceCheckUtils]: 52: Hoare triple {1335#false} ~cond := #in~cond; {1335#false} is VALID [2018-11-14 17:47:38,808 INFO L273 TraceCheckUtils]: 53: Hoare triple {1335#false} assume ~cond == 0bv32; {1335#false} is VALID [2018-11-14 17:47:38,809 INFO L273 TraceCheckUtils]: 54: Hoare triple {1335#false} assume !false; {1335#false} is VALID [2018-11-14 17:47:38,816 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:47:38,816 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:47:39,382 INFO L273 TraceCheckUtils]: 54: Hoare triple {1335#false} assume !false; {1335#false} is VALID [2018-11-14 17:47:39,382 INFO L273 TraceCheckUtils]: 53: Hoare triple {1335#false} assume ~cond == 0bv32; {1335#false} is VALID [2018-11-14 17:47:39,383 INFO L273 TraceCheckUtils]: 52: Hoare triple {1335#false} ~cond := #in~cond; {1335#false} is VALID [2018-11-14 17:47:39,383 INFO L256 TraceCheckUtils]: 51: Hoare triple {1335#false} call __VERIFIER_assert((if ~bvsge32(#t~mem4, 0bv32) then 1bv32 else 0bv32)); {1335#false} is VALID [2018-11-14 17:47:39,383 INFO L273 TraceCheckUtils]: 50: Hoare triple {1335#false} assume !!~bvslt32(~x~0, ~b~0);call #t~mem4 := read~intINTTYPE4(~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1335#false} is VALID [2018-11-14 17:47:39,384 INFO L273 TraceCheckUtils]: 49: Hoare triple {1335#false} assume true; {1335#false} is VALID [2018-11-14 17:47:39,384 INFO L273 TraceCheckUtils]: 48: Hoare triple {1335#false} havoc ~x~0;~x~0 := 0bv32; {1335#false} is VALID [2018-11-14 17:47:39,385 INFO L273 TraceCheckUtils]: 47: Hoare triple {1533#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {1335#false} is VALID [2018-11-14 17:47:39,388 INFO L273 TraceCheckUtils]: 46: Hoare triple {1533#(bvslt main_~a~0 (_ bv100000 32))} assume true; {1533#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-14 17:47:39,389 INFO L273 TraceCheckUtils]: 45: Hoare triple {1540#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1533#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-14 17:47:39,390 INFO L273 TraceCheckUtils]: 44: Hoare triple {1540#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1540#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,390 INFO L273 TraceCheckUtils]: 43: Hoare triple {1540#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1540#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,391 INFO L273 TraceCheckUtils]: 42: Hoare triple {1540#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume true; {1540#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,396 INFO L273 TraceCheckUtils]: 41: Hoare triple {1553#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1540#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,397 INFO L273 TraceCheckUtils]: 40: Hoare triple {1553#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1553#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,397 INFO L273 TraceCheckUtils]: 39: Hoare triple {1553#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1553#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,398 INFO L273 TraceCheckUtils]: 38: Hoare triple {1553#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume true; {1553#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,404 INFO L273 TraceCheckUtils]: 37: Hoare triple {1566#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1553#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,405 INFO L273 TraceCheckUtils]: 36: Hoare triple {1566#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1566#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,405 INFO L273 TraceCheckUtils]: 35: Hoare triple {1566#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1566#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,412 INFO L273 TraceCheckUtils]: 34: Hoare triple {1566#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume true; {1566#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,420 INFO L273 TraceCheckUtils]: 33: Hoare triple {1579#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1566#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,424 INFO L273 TraceCheckUtils]: 32: Hoare triple {1579#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1579#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,425 INFO L273 TraceCheckUtils]: 31: Hoare triple {1579#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1579#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,425 INFO L273 TraceCheckUtils]: 30: Hoare triple {1579#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume true; {1579#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,431 INFO L273 TraceCheckUtils]: 29: Hoare triple {1592#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1579#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,432 INFO L273 TraceCheckUtils]: 28: Hoare triple {1592#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1592#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,432 INFO L273 TraceCheckUtils]: 27: Hoare triple {1592#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1592#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,434 INFO L273 TraceCheckUtils]: 26: Hoare triple {1592#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume true; {1592#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,443 INFO L273 TraceCheckUtils]: 25: Hoare triple {1605#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1592#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,443 INFO L273 TraceCheckUtils]: 24: Hoare triple {1605#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1605#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,444 INFO L273 TraceCheckUtils]: 23: Hoare triple {1605#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1605#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,444 INFO L273 TraceCheckUtils]: 22: Hoare triple {1605#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume true; {1605#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,452 INFO L273 TraceCheckUtils]: 21: Hoare triple {1618#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1605#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,452 INFO L273 TraceCheckUtils]: 20: Hoare triple {1618#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1618#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,453 INFO L273 TraceCheckUtils]: 19: Hoare triple {1618#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1618#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,453 INFO L273 TraceCheckUtils]: 18: Hoare triple {1618#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume true; {1618#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,460 INFO L273 TraceCheckUtils]: 17: Hoare triple {1631#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1618#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,461 INFO L273 TraceCheckUtils]: 16: Hoare triple {1631#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1631#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,462 INFO L273 TraceCheckUtils]: 15: Hoare triple {1631#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1631#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,463 INFO L273 TraceCheckUtils]: 14: Hoare triple {1631#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume true; {1631#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,472 INFO L273 TraceCheckUtils]: 13: Hoare triple {1644#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1631#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,473 INFO L273 TraceCheckUtils]: 12: Hoare triple {1644#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1644#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,473 INFO L273 TraceCheckUtils]: 11: Hoare triple {1644#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1644#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,474 INFO L273 TraceCheckUtils]: 10: Hoare triple {1644#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume true; {1644#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,483 INFO L273 TraceCheckUtils]: 9: Hoare triple {1657#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {1644#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,484 INFO L273 TraceCheckUtils]: 8: Hoare triple {1657#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {1657#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,484 INFO L273 TraceCheckUtils]: 7: Hoare triple {1657#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {1657#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,485 INFO L273 TraceCheckUtils]: 6: Hoare triple {1657#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume true; {1657#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,486 INFO L273 TraceCheckUtils]: 5: Hoare triple {1334#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000bv32);~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000bv32);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000bv32); {1657#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:39,486 INFO L256 TraceCheckUtils]: 4: Hoare triple {1334#true} call #t~ret7 := main(); {1334#true} is VALID [2018-11-14 17:47:39,486 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1334#true} {1334#true} #74#return; {1334#true} is VALID [2018-11-14 17:47:39,486 INFO L273 TraceCheckUtils]: 2: Hoare triple {1334#true} assume true; {1334#true} is VALID [2018-11-14 17:47:39,487 INFO L273 TraceCheckUtils]: 1: Hoare triple {1334#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1334#true} is VALID [2018-11-14 17:47:39,487 INFO L256 TraceCheckUtils]: 0: Hoare triple {1334#true} call ULTIMATE.init(); {1334#true} is VALID [2018-11-14 17:47:39,493 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:47:39,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:47:39,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-14 17:47:39,497 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 55 [2018-11-14 17:47:39,498 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:47:39,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 17:47:39,761 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:47:39,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 17:47:39,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 17:47:39,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-14 17:47:39,763 INFO L87 Difference]: Start difference. First operand 66 states and 79 transitions. Second operand 24 states. [2018-11-14 17:47:46,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:47:46,228 INFO L93 Difference]: Finished difference Result 132 states and 171 transitions. [2018-11-14 17:47:46,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 17:47:46,229 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 55 [2018-11-14 17:47:46,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:47:46,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:47:46,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 171 transitions. [2018-11-14 17:47:46,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:47:46,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 171 transitions. [2018-11-14 17:47:46,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 171 transitions. [2018-11-14 17:47:46,672 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:47:46,678 INFO L225 Difference]: With dead ends: 132 [2018-11-14 17:47:46,678 INFO L226 Difference]: Without dead ends: 114 [2018-11-14 17:47:46,679 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 17:47:46,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-14 17:47:46,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-11-14 17:47:46,758 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:47:46,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 114 states. [2018-11-14 17:47:46,759 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 114 states. [2018-11-14 17:47:46,759 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 114 states. [2018-11-14 17:47:46,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:47:46,766 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2018-11-14 17:47:46,766 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2018-11-14 17:47:46,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:47:46,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:47:46,768 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 114 states. [2018-11-14 17:47:46,768 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 114 states. [2018-11-14 17:47:46,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:47:46,776 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2018-11-14 17:47:46,776 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2018-11-14 17:47:46,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:47:46,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:47:46,777 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:47:46,777 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:47:46,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-14 17:47:46,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 139 transitions. [2018-11-14 17:47:46,785 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 139 transitions. Word has length 55 [2018-11-14 17:47:46,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:47:46,785 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 139 transitions. [2018-11-14 17:47:46,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 17:47:46,785 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2018-11-14 17:47:46,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-11-14 17:47:46,788 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:47:46,789 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:47:46,789 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:47:46,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:47:46,789 INFO L82 PathProgramCache]: Analyzing trace with hash -2054987369, now seen corresponding path program 4 times [2018-11-14 17:47:46,790 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:47:46,790 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 17:47:46,820 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:47:47,001 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:47:47,001 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:47:47,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:47:47,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:47:47,770 INFO L256 TraceCheckUtils]: 0: Hoare triple {2250#true} call ULTIMATE.init(); {2250#true} is VALID [2018-11-14 17:47:47,770 INFO L273 TraceCheckUtils]: 1: Hoare triple {2250#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2250#true} is VALID [2018-11-14 17:47:47,771 INFO L273 TraceCheckUtils]: 2: Hoare triple {2250#true} assume true; {2250#true} is VALID [2018-11-14 17:47:47,771 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2250#true} {2250#true} #74#return; {2250#true} is VALID [2018-11-14 17:47:47,771 INFO L256 TraceCheckUtils]: 4: Hoare triple {2250#true} call #t~ret7 := main(); {2250#true} is VALID [2018-11-14 17:47:47,771 INFO L273 TraceCheckUtils]: 5: Hoare triple {2250#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000bv32);~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000bv32);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000bv32); {2270#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 17:47:47,772 INFO L273 TraceCheckUtils]: 6: Hoare triple {2270#(= main_~a~0 (_ bv0 32))} assume true; {2270#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 17:47:47,772 INFO L273 TraceCheckUtils]: 7: Hoare triple {2270#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2270#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 17:47:47,772 INFO L273 TraceCheckUtils]: 8: Hoare triple {2270#(= main_~a~0 (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2270#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 17:47:47,773 INFO L273 TraceCheckUtils]: 9: Hoare triple {2270#(= main_~a~0 (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2283#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,775 INFO L273 TraceCheckUtils]: 10: Hoare triple {2283#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {2283#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,775 INFO L273 TraceCheckUtils]: 11: Hoare triple {2283#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2283#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,775 INFO L273 TraceCheckUtils]: 12: Hoare triple {2283#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2283#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,776 INFO L273 TraceCheckUtils]: 13: Hoare triple {2283#(= (bvadd main_~a~0 (_ bv4294967295 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2296#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,777 INFO L273 TraceCheckUtils]: 14: Hoare triple {2296#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {2296#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,780 INFO L273 TraceCheckUtils]: 15: Hoare triple {2296#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2296#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,783 INFO L273 TraceCheckUtils]: 16: Hoare triple {2296#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2296#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,784 INFO L273 TraceCheckUtils]: 17: Hoare triple {2296#(= (bvadd main_~a~0 (_ bv4294967294 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2309#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,785 INFO L273 TraceCheckUtils]: 18: Hoare triple {2309#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {2309#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,785 INFO L273 TraceCheckUtils]: 19: Hoare triple {2309#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2309#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,786 INFO L273 TraceCheckUtils]: 20: Hoare triple {2309#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2309#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,786 INFO L273 TraceCheckUtils]: 21: Hoare triple {2309#(= (bvadd main_~a~0 (_ bv4294967293 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2322#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-14 17:47:47,787 INFO L273 TraceCheckUtils]: 22: Hoare triple {2322#(= (_ bv4 32) main_~a~0)} assume true; {2322#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-14 17:47:47,787 INFO L273 TraceCheckUtils]: 23: Hoare triple {2322#(= (_ bv4 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2322#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-14 17:47:47,788 INFO L273 TraceCheckUtils]: 24: Hoare triple {2322#(= (_ bv4 32) main_~a~0)} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2322#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-14 17:47:47,789 INFO L273 TraceCheckUtils]: 25: Hoare triple {2322#(= (_ bv4 32) main_~a~0)} ~a~0 := ~bvadd32(1bv32, ~a~0); {2335#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,789 INFO L273 TraceCheckUtils]: 26: Hoare triple {2335#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {2335#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,790 INFO L273 TraceCheckUtils]: 27: Hoare triple {2335#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2335#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,790 INFO L273 TraceCheckUtils]: 28: Hoare triple {2335#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2335#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,791 INFO L273 TraceCheckUtils]: 29: Hoare triple {2335#(= (bvadd main_~a~0 (_ bv4294967291 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2348#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,792 INFO L273 TraceCheckUtils]: 30: Hoare triple {2348#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} assume true; {2348#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,792 INFO L273 TraceCheckUtils]: 31: Hoare triple {2348#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2348#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,793 INFO L273 TraceCheckUtils]: 32: Hoare triple {2348#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2348#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,794 INFO L273 TraceCheckUtils]: 33: Hoare triple {2348#(= (bvadd main_~a~0 (_ bv4294967290 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2361#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,794 INFO L273 TraceCheckUtils]: 34: Hoare triple {2361#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {2361#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,795 INFO L273 TraceCheckUtils]: 35: Hoare triple {2361#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2361#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,796 INFO L273 TraceCheckUtils]: 36: Hoare triple {2361#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2361#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,796 INFO L273 TraceCheckUtils]: 37: Hoare triple {2361#(= (bvadd main_~a~0 (_ bv4294967289 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2374#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,797 INFO L273 TraceCheckUtils]: 38: Hoare triple {2374#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {2374#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,797 INFO L273 TraceCheckUtils]: 39: Hoare triple {2374#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2374#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,799 INFO L273 TraceCheckUtils]: 40: Hoare triple {2374#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2374#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,800 INFO L273 TraceCheckUtils]: 41: Hoare triple {2374#(= (bvadd main_~a~0 (_ bv4294967288 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2387#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,800 INFO L273 TraceCheckUtils]: 42: Hoare triple {2387#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} assume true; {2387#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,801 INFO L273 TraceCheckUtils]: 43: Hoare triple {2387#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2387#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,801 INFO L273 TraceCheckUtils]: 44: Hoare triple {2387#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2387#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,802 INFO L273 TraceCheckUtils]: 45: Hoare triple {2387#(= (bvadd main_~a~0 (_ bv4294967287 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2400#(= (bvadd main_~a~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,803 INFO L273 TraceCheckUtils]: 46: Hoare triple {2400#(= (bvadd main_~a~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {2400#(= (bvadd main_~a~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,803 INFO L273 TraceCheckUtils]: 47: Hoare triple {2400#(= (bvadd main_~a~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2400#(= (bvadd main_~a~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,804 INFO L273 TraceCheckUtils]: 48: Hoare triple {2400#(= (bvadd main_~a~0 (_ bv4294967286 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2400#(= (bvadd main_~a~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,805 INFO L273 TraceCheckUtils]: 49: Hoare triple {2400#(= (bvadd main_~a~0 (_ bv4294967286 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2413#(= (bvadd main_~a~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,805 INFO L273 TraceCheckUtils]: 50: Hoare triple {2413#(= (bvadd main_~a~0 (_ bv4294967285 32)) (_ bv0 32))} assume true; {2413#(= (bvadd main_~a~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,806 INFO L273 TraceCheckUtils]: 51: Hoare triple {2413#(= (bvadd main_~a~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2413#(= (bvadd main_~a~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,808 INFO L273 TraceCheckUtils]: 52: Hoare triple {2413#(= (bvadd main_~a~0 (_ bv4294967285 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2413#(= (bvadd main_~a~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,809 INFO L273 TraceCheckUtils]: 53: Hoare triple {2413#(= (bvadd main_~a~0 (_ bv4294967285 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2426#(= (bvadd main_~a~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,815 INFO L273 TraceCheckUtils]: 54: Hoare triple {2426#(= (bvadd main_~a~0 (_ bv4294967284 32)) (_ bv0 32))} assume true; {2426#(= (bvadd main_~a~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,816 INFO L273 TraceCheckUtils]: 55: Hoare triple {2426#(= (bvadd main_~a~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2426#(= (bvadd main_~a~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,816 INFO L273 TraceCheckUtils]: 56: Hoare triple {2426#(= (bvadd main_~a~0 (_ bv4294967284 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2426#(= (bvadd main_~a~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,817 INFO L273 TraceCheckUtils]: 57: Hoare triple {2426#(= (bvadd main_~a~0 (_ bv4294967284 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2439#(= (bvadd main_~a~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,817 INFO L273 TraceCheckUtils]: 58: Hoare triple {2439#(= (bvadd main_~a~0 (_ bv4294967283 32)) (_ bv0 32))} assume true; {2439#(= (bvadd main_~a~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,818 INFO L273 TraceCheckUtils]: 59: Hoare triple {2439#(= (bvadd main_~a~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2439#(= (bvadd main_~a~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,818 INFO L273 TraceCheckUtils]: 60: Hoare triple {2439#(= (bvadd main_~a~0 (_ bv4294967283 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2439#(= (bvadd main_~a~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,819 INFO L273 TraceCheckUtils]: 61: Hoare triple {2439#(= (bvadd main_~a~0 (_ bv4294967283 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2452#(= (bvadd main_~a~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,819 INFO L273 TraceCheckUtils]: 62: Hoare triple {2452#(= (bvadd main_~a~0 (_ bv4294967282 32)) (_ bv0 32))} assume true; {2452#(= (bvadd main_~a~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,820 INFO L273 TraceCheckUtils]: 63: Hoare triple {2452#(= (bvadd main_~a~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2452#(= (bvadd main_~a~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,820 INFO L273 TraceCheckUtils]: 64: Hoare triple {2452#(= (bvadd main_~a~0 (_ bv4294967282 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2452#(= (bvadd main_~a~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,821 INFO L273 TraceCheckUtils]: 65: Hoare triple {2452#(= (bvadd main_~a~0 (_ bv4294967282 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2465#(= (bvadd main_~a~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,821 INFO L273 TraceCheckUtils]: 66: Hoare triple {2465#(= (bvadd main_~a~0 (_ bv4294967281 32)) (_ bv0 32))} assume true; {2465#(= (bvadd main_~a~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,822 INFO L273 TraceCheckUtils]: 67: Hoare triple {2465#(= (bvadd main_~a~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2465#(= (bvadd main_~a~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,823 INFO L273 TraceCheckUtils]: 68: Hoare triple {2465#(= (bvadd main_~a~0 (_ bv4294967281 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2465#(= (bvadd main_~a~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,823 INFO L273 TraceCheckUtils]: 69: Hoare triple {2465#(= (bvadd main_~a~0 (_ bv4294967281 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2478#(= (bvadd main_~a~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,825 INFO L273 TraceCheckUtils]: 70: Hoare triple {2478#(= (bvadd main_~a~0 (_ bv4294967280 32)) (_ bv0 32))} assume true; {2478#(= (bvadd main_~a~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,826 INFO L273 TraceCheckUtils]: 71: Hoare triple {2478#(= (bvadd main_~a~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2478#(= (bvadd main_~a~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,826 INFO L273 TraceCheckUtils]: 72: Hoare triple {2478#(= (bvadd main_~a~0 (_ bv4294967280 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2478#(= (bvadd main_~a~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,827 INFO L273 TraceCheckUtils]: 73: Hoare triple {2478#(= (bvadd main_~a~0 (_ bv4294967280 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2491#(= (bvadd main_~a~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,827 INFO L273 TraceCheckUtils]: 74: Hoare triple {2491#(= (bvadd main_~a~0 (_ bv4294967279 32)) (_ bv0 32))} assume true; {2491#(= (bvadd main_~a~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,828 INFO L273 TraceCheckUtils]: 75: Hoare triple {2491#(= (bvadd main_~a~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2491#(= (bvadd main_~a~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,828 INFO L273 TraceCheckUtils]: 76: Hoare triple {2491#(= (bvadd main_~a~0 (_ bv4294967279 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2491#(= (bvadd main_~a~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,829 INFO L273 TraceCheckUtils]: 77: Hoare triple {2491#(= (bvadd main_~a~0 (_ bv4294967279 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2504#(= (bvadd main_~a~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,829 INFO L273 TraceCheckUtils]: 78: Hoare triple {2504#(= (bvadd main_~a~0 (_ bv4294967278 32)) (_ bv0 32))} assume true; {2504#(= (bvadd main_~a~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,829 INFO L273 TraceCheckUtils]: 79: Hoare triple {2504#(= (bvadd main_~a~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2504#(= (bvadd main_~a~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,830 INFO L273 TraceCheckUtils]: 80: Hoare triple {2504#(= (bvadd main_~a~0 (_ bv4294967278 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2504#(= (bvadd main_~a~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,831 INFO L273 TraceCheckUtils]: 81: Hoare triple {2504#(= (bvadd main_~a~0 (_ bv4294967278 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2517#(= (bvadd main_~a~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,831 INFO L273 TraceCheckUtils]: 82: Hoare triple {2517#(= (bvadd main_~a~0 (_ bv4294967277 32)) (_ bv0 32))} assume true; {2517#(= (bvadd main_~a~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,832 INFO L273 TraceCheckUtils]: 83: Hoare triple {2517#(= (bvadd main_~a~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2517#(= (bvadd main_~a~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,832 INFO L273 TraceCheckUtils]: 84: Hoare triple {2517#(= (bvadd main_~a~0 (_ bv4294967277 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2517#(= (bvadd main_~a~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,833 INFO L273 TraceCheckUtils]: 85: Hoare triple {2517#(= (bvadd main_~a~0 (_ bv4294967277 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2530#(= (bvadd main_~a~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,834 INFO L273 TraceCheckUtils]: 86: Hoare triple {2530#(= (bvadd main_~a~0 (_ bv4294967276 32)) (_ bv0 32))} assume true; {2530#(= (bvadd main_~a~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,834 INFO L273 TraceCheckUtils]: 87: Hoare triple {2530#(= (bvadd main_~a~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2530#(= (bvadd main_~a~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,835 INFO L273 TraceCheckUtils]: 88: Hoare triple {2530#(= (bvadd main_~a~0 (_ bv4294967276 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2530#(= (bvadd main_~a~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,835 INFO L273 TraceCheckUtils]: 89: Hoare triple {2530#(= (bvadd main_~a~0 (_ bv4294967276 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2543#(= (bvadd main_~a~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,836 INFO L273 TraceCheckUtils]: 90: Hoare triple {2543#(= (bvadd main_~a~0 (_ bv4294967275 32)) (_ bv0 32))} assume true; {2543#(= (bvadd main_~a~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,837 INFO L273 TraceCheckUtils]: 91: Hoare triple {2543#(= (bvadd main_~a~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2543#(= (bvadd main_~a~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,837 INFO L273 TraceCheckUtils]: 92: Hoare triple {2543#(= (bvadd main_~a~0 (_ bv4294967275 32)) (_ bv0 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2543#(= (bvadd main_~a~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,838 INFO L273 TraceCheckUtils]: 93: Hoare triple {2543#(= (bvadd main_~a~0 (_ bv4294967275 32)) (_ bv0 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2556#(= (bvadd main_~a~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,839 INFO L273 TraceCheckUtils]: 94: Hoare triple {2556#(= (bvadd main_~a~0 (_ bv4294967274 32)) (_ bv0 32))} assume true; {2556#(= (bvadd main_~a~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 17:47:47,840 INFO L273 TraceCheckUtils]: 95: Hoare triple {2556#(= (bvadd main_~a~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~a~0, 100000bv32); {2251#false} is VALID [2018-11-14 17:47:47,840 INFO L273 TraceCheckUtils]: 96: Hoare triple {2251#false} havoc ~x~0;~x~0 := 0bv32; {2251#false} is VALID [2018-11-14 17:47:47,840 INFO L273 TraceCheckUtils]: 97: Hoare triple {2251#false} assume true; {2251#false} is VALID [2018-11-14 17:47:47,840 INFO L273 TraceCheckUtils]: 98: Hoare triple {2251#false} assume !!~bvslt32(~x~0, ~b~0);call #t~mem4 := read~intINTTYPE4(~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2251#false} is VALID [2018-11-14 17:47:47,841 INFO L256 TraceCheckUtils]: 99: Hoare triple {2251#false} call __VERIFIER_assert((if ~bvsge32(#t~mem4, 0bv32) then 1bv32 else 0bv32)); {2251#false} is VALID [2018-11-14 17:47:47,841 INFO L273 TraceCheckUtils]: 100: Hoare triple {2251#false} ~cond := #in~cond; {2251#false} is VALID [2018-11-14 17:47:47,841 INFO L273 TraceCheckUtils]: 101: Hoare triple {2251#false} assume ~cond == 0bv32; {2251#false} is VALID [2018-11-14 17:47:47,841 INFO L273 TraceCheckUtils]: 102: Hoare triple {2251#false} assume !false; {2251#false} is VALID [2018-11-14 17:47:47,854 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:47:47,854 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:47:49,660 INFO L273 TraceCheckUtils]: 102: Hoare triple {2251#false} assume !false; {2251#false} is VALID [2018-11-14 17:47:49,661 INFO L273 TraceCheckUtils]: 101: Hoare triple {2251#false} assume ~cond == 0bv32; {2251#false} is VALID [2018-11-14 17:47:49,661 INFO L273 TraceCheckUtils]: 100: Hoare triple {2251#false} ~cond := #in~cond; {2251#false} is VALID [2018-11-14 17:47:49,661 INFO L256 TraceCheckUtils]: 99: Hoare triple {2251#false} call __VERIFIER_assert((if ~bvsge32(#t~mem4, 0bv32) then 1bv32 else 0bv32)); {2251#false} is VALID [2018-11-14 17:47:49,661 INFO L273 TraceCheckUtils]: 98: Hoare triple {2251#false} assume !!~bvslt32(~x~0, ~b~0);call #t~mem4 := read~intINTTYPE4(~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2251#false} is VALID [2018-11-14 17:47:49,661 INFO L273 TraceCheckUtils]: 97: Hoare triple {2251#false} assume true; {2251#false} is VALID [2018-11-14 17:47:49,662 INFO L273 TraceCheckUtils]: 96: Hoare triple {2251#false} havoc ~x~0;~x~0 := 0bv32; {2251#false} is VALID [2018-11-14 17:47:49,662 INFO L273 TraceCheckUtils]: 95: Hoare triple {2605#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {2251#false} is VALID [2018-11-14 17:47:49,662 INFO L273 TraceCheckUtils]: 94: Hoare triple {2605#(bvslt main_~a~0 (_ bv100000 32))} assume true; {2605#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-14 17:47:49,663 INFO L273 TraceCheckUtils]: 93: Hoare triple {2612#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2605#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-14 17:47:49,663 INFO L273 TraceCheckUtils]: 92: Hoare triple {2612#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2612#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,668 INFO L273 TraceCheckUtils]: 91: Hoare triple {2612#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2612#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,668 INFO L273 TraceCheckUtils]: 90: Hoare triple {2612#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume true; {2612#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,673 INFO L273 TraceCheckUtils]: 89: Hoare triple {2625#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2612#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,674 INFO L273 TraceCheckUtils]: 88: Hoare triple {2625#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2625#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,674 INFO L273 TraceCheckUtils]: 87: Hoare triple {2625#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2625#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,674 INFO L273 TraceCheckUtils]: 86: Hoare triple {2625#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume true; {2625#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,679 INFO L273 TraceCheckUtils]: 85: Hoare triple {2638#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2625#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,680 INFO L273 TraceCheckUtils]: 84: Hoare triple {2638#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2638#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,680 INFO L273 TraceCheckUtils]: 83: Hoare triple {2638#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2638#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,680 INFO L273 TraceCheckUtils]: 82: Hoare triple {2638#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume true; {2638#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,686 INFO L273 TraceCheckUtils]: 81: Hoare triple {2651#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2638#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,686 INFO L273 TraceCheckUtils]: 80: Hoare triple {2651#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2651#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,687 INFO L273 TraceCheckUtils]: 79: Hoare triple {2651#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2651#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,687 INFO L273 TraceCheckUtils]: 78: Hoare triple {2651#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume true; {2651#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,694 INFO L273 TraceCheckUtils]: 77: Hoare triple {2664#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2651#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,695 INFO L273 TraceCheckUtils]: 76: Hoare triple {2664#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2664#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,695 INFO L273 TraceCheckUtils]: 75: Hoare triple {2664#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2664#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,696 INFO L273 TraceCheckUtils]: 74: Hoare triple {2664#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume true; {2664#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,702 INFO L273 TraceCheckUtils]: 73: Hoare triple {2677#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2664#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,702 INFO L273 TraceCheckUtils]: 72: Hoare triple {2677#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2677#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,703 INFO L273 TraceCheckUtils]: 71: Hoare triple {2677#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2677#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,703 INFO L273 TraceCheckUtils]: 70: Hoare triple {2677#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume true; {2677#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,708 INFO L273 TraceCheckUtils]: 69: Hoare triple {2690#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2677#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,708 INFO L273 TraceCheckUtils]: 68: Hoare triple {2690#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2690#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,709 INFO L273 TraceCheckUtils]: 67: Hoare triple {2690#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2690#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,710 INFO L273 TraceCheckUtils]: 66: Hoare triple {2690#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume true; {2690#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,716 INFO L273 TraceCheckUtils]: 65: Hoare triple {2703#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2690#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,717 INFO L273 TraceCheckUtils]: 64: Hoare triple {2703#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2703#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,717 INFO L273 TraceCheckUtils]: 63: Hoare triple {2703#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2703#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,718 INFO L273 TraceCheckUtils]: 62: Hoare triple {2703#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume true; {2703#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,723 INFO L273 TraceCheckUtils]: 61: Hoare triple {2716#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2703#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,725 INFO L273 TraceCheckUtils]: 60: Hoare triple {2716#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2716#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,725 INFO L273 TraceCheckUtils]: 59: Hoare triple {2716#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2716#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,726 INFO L273 TraceCheckUtils]: 58: Hoare triple {2716#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume true; {2716#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,731 INFO L273 TraceCheckUtils]: 57: Hoare triple {2729#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2716#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,731 INFO L273 TraceCheckUtils]: 56: Hoare triple {2729#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2729#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,731 INFO L273 TraceCheckUtils]: 55: Hoare triple {2729#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2729#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,732 INFO L273 TraceCheckUtils]: 54: Hoare triple {2729#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume true; {2729#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,738 INFO L273 TraceCheckUtils]: 53: Hoare triple {2742#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2729#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,738 INFO L273 TraceCheckUtils]: 52: Hoare triple {2742#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2742#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,739 INFO L273 TraceCheckUtils]: 51: Hoare triple {2742#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2742#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,739 INFO L273 TraceCheckUtils]: 50: Hoare triple {2742#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} assume true; {2742#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,746 INFO L273 TraceCheckUtils]: 49: Hoare triple {2755#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2742#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,747 INFO L273 TraceCheckUtils]: 48: Hoare triple {2755#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2755#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,747 INFO L273 TraceCheckUtils]: 47: Hoare triple {2755#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2755#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,748 INFO L273 TraceCheckUtils]: 46: Hoare triple {2755#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} assume true; {2755#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,754 INFO L273 TraceCheckUtils]: 45: Hoare triple {2768#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2755#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,754 INFO L273 TraceCheckUtils]: 44: Hoare triple {2768#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2768#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,755 INFO L273 TraceCheckUtils]: 43: Hoare triple {2768#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2768#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,755 INFO L273 TraceCheckUtils]: 42: Hoare triple {2768#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} assume true; {2768#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,761 INFO L273 TraceCheckUtils]: 41: Hoare triple {2781#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2768#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,761 INFO L273 TraceCheckUtils]: 40: Hoare triple {2781#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2781#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,761 INFO L273 TraceCheckUtils]: 39: Hoare triple {2781#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2781#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,762 INFO L273 TraceCheckUtils]: 38: Hoare triple {2781#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} assume true; {2781#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,768 INFO L273 TraceCheckUtils]: 37: Hoare triple {2794#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2781#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,769 INFO L273 TraceCheckUtils]: 36: Hoare triple {2794#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2794#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,769 INFO L273 TraceCheckUtils]: 35: Hoare triple {2794#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2794#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,769 INFO L273 TraceCheckUtils]: 34: Hoare triple {2794#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} assume true; {2794#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,775 INFO L273 TraceCheckUtils]: 33: Hoare triple {2807#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2794#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,775 INFO L273 TraceCheckUtils]: 32: Hoare triple {2807#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2807#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,775 INFO L273 TraceCheckUtils]: 31: Hoare triple {2807#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2807#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,776 INFO L273 TraceCheckUtils]: 30: Hoare triple {2807#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} assume true; {2807#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,779 INFO L273 TraceCheckUtils]: 29: Hoare triple {2820#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2807#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,780 INFO L273 TraceCheckUtils]: 28: Hoare triple {2820#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2820#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,780 INFO L273 TraceCheckUtils]: 27: Hoare triple {2820#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2820#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,780 INFO L273 TraceCheckUtils]: 26: Hoare triple {2820#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} assume true; {2820#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,786 INFO L273 TraceCheckUtils]: 25: Hoare triple {2833#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2820#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,787 INFO L273 TraceCheckUtils]: 24: Hoare triple {2833#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2833#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,787 INFO L273 TraceCheckUtils]: 23: Hoare triple {2833#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2833#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,787 INFO L273 TraceCheckUtils]: 22: Hoare triple {2833#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} assume true; {2833#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,793 INFO L273 TraceCheckUtils]: 21: Hoare triple {2846#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2833#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,802 INFO L273 TraceCheckUtils]: 20: Hoare triple {2846#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2846#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,802 INFO L273 TraceCheckUtils]: 19: Hoare triple {2846#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2846#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,803 INFO L273 TraceCheckUtils]: 18: Hoare triple {2846#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} assume true; {2846#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,811 INFO L273 TraceCheckUtils]: 17: Hoare triple {2859#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2846#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,812 INFO L273 TraceCheckUtils]: 16: Hoare triple {2859#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2859#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,812 INFO L273 TraceCheckUtils]: 15: Hoare triple {2859#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2859#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,812 INFO L273 TraceCheckUtils]: 14: Hoare triple {2859#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} assume true; {2859#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,820 INFO L273 TraceCheckUtils]: 13: Hoare triple {2872#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2859#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,820 INFO L273 TraceCheckUtils]: 12: Hoare triple {2872#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2872#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,820 INFO L273 TraceCheckUtils]: 11: Hoare triple {2872#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2872#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,821 INFO L273 TraceCheckUtils]: 10: Hoare triple {2872#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} assume true; {2872#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,825 INFO L273 TraceCheckUtils]: 9: Hoare triple {2885#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} ~a~0 := ~bvadd32(1bv32, ~a~0); {2872#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,825 INFO L273 TraceCheckUtils]: 8: Hoare triple {2885#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem0, 0bv32);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#bb~0.base, ~bvadd32(~#bb~0.offset, ~bvmul32(4bv32, ~b~0)), 4bv32);havoc #t~mem1;~b~0 := ~bvadd32(1bv32, ~b~0); {2885#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,826 INFO L273 TraceCheckUtils]: 7: Hoare triple {2885#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#aa~0.base, ~bvadd32(~#aa~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32); {2885#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,826 INFO L273 TraceCheckUtils]: 6: Hoare triple {2885#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} assume true; {2885#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,827 INFO L273 TraceCheckUtils]: 5: Hoare triple {2250#true} call ~#aa~0.base, ~#aa~0.offset := #Ultimate.alloc(400000bv32);~a~0 := 0bv32;~b~0 := 0bv32;~c~0 := 0bv32;call ~#bb~0.base, ~#bb~0.offset := #Ultimate.alloc(400000bv32);call ~#cc~0.base, ~#cc~0.offset := #Ultimate.alloc(400000bv32); {2885#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 17:47:49,827 INFO L256 TraceCheckUtils]: 4: Hoare triple {2250#true} call #t~ret7 := main(); {2250#true} is VALID [2018-11-14 17:47:49,827 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2250#true} {2250#true} #74#return; {2250#true} is VALID [2018-11-14 17:47:49,827 INFO L273 TraceCheckUtils]: 2: Hoare triple {2250#true} assume true; {2250#true} is VALID [2018-11-14 17:47:49,827 INFO L273 TraceCheckUtils]: 1: Hoare triple {2250#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2250#true} is VALID [2018-11-14 17:47:49,827 INFO L256 TraceCheckUtils]: 0: Hoare triple {2250#true} call ULTIMATE.init(); {2250#true} is VALID [2018-11-14 17:47:49,839 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:47:49,842 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:47:49,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-14 17:47:49,843 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 103 [2018-11-14 17:47:49,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:47:49,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-14 17:47:50,371 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:47:50,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-14 17:47:50,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-14 17:47:50,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-14 17:47:50,374 INFO L87 Difference]: Start difference. First operand 114 states and 139 transitions. Second operand 48 states. [2018-11-14 17:48:05,086 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-14 17:48:05,622 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-14 17:48:06,209 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-14 17:48:06,840 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-14 17:48:07,504 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-14 17:48:08,192 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-14 17:48:16,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:48:16,700 INFO L93 Difference]: Finished difference Result 228 states and 303 transitions. [2018-11-14 17:48:16,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-14 17:48:16,701 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 103 [2018-11-14 17:48:16,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:48:16,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 17:48:16,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 303 transitions. [2018-11-14 17:48:16,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 17:48:16,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 303 transitions. [2018-11-14 17:48:16,713 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 303 transitions. [2018-11-14 17:48:17,439 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 303 edges. 303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:48:17,445 INFO L225 Difference]: With dead ends: 228 [2018-11-14 17:48:17,445 INFO L226 Difference]: Without dead ends: 210 [2018-11-14 17:48:17,447 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-14 17:48:17,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-14 17:48:17,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-11-14 17:48:17,544 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:48:17,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand 210 states. [2018-11-14 17:48:17,544 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 210 states. [2018-11-14 17:48:17,545 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 210 states. [2018-11-14 17:48:17,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:48:17,552 INFO L93 Difference]: Finished difference Result 210 states and 259 transitions. [2018-11-14 17:48:17,552 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 259 transitions. [2018-11-14 17:48:17,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:48:17,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:48:17,553 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 210 states. [2018-11-14 17:48:17,554 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 210 states. [2018-11-14 17:48:17,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:48:17,562 INFO L93 Difference]: Finished difference Result 210 states and 259 transitions. [2018-11-14 17:48:17,562 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 259 transitions. [2018-11-14 17:48:17,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:48:17,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:48:17,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:48:17,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:48:17,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-14 17:48:17,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 259 transitions. [2018-11-14 17:48:17,571 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 259 transitions. Word has length 103 [2018-11-14 17:48:17,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:48:17,571 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 259 transitions. [2018-11-14 17:48:17,571 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-14 17:48:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 259 transitions. [2018-11-14 17:48:17,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-11-14 17:48:17,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:48:17,575 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:48:17,575 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:48:17,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:48:17,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1014995367, now seen corresponding path program 5 times [2018-11-14 17:48:17,576 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:48:17,576 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 17:48:17,594 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1