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_compareModified_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:43:54,285 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:43:54,287 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:43:54,299 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:43:54,300 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:43:54,301 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:43:54,302 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:43:54,304 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:43:54,306 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:43:54,307 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:43:54,308 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:43:54,308 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:43:54,309 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:43:54,310 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:43:54,311 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:43:54,312 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:43:54,313 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:43:54,315 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:43:54,318 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:43:54,319 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:43:54,321 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:43:54,322 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:43:54,325 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:43:54,325 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:43:54,326 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:43:54,327 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:43:54,328 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:43:54,329 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:43:54,329 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:43:54,331 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:43:54,331 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:43:54,332 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:43:54,332 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:43:54,332 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:43:54,333 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:43:54,334 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:43:54,334 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:43:54,351 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:43:54,351 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:43:54,352 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:43:54,352 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:43:54,353 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:43:54,353 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:43:54,353 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:43:54,353 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:43:54,353 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:43:54,354 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:43:54,354 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:43:54,354 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:43:54,354 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:43:54,354 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:43:54,355 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 17:43:54,355 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 17:43:54,355 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:43:54,355 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:43:54,355 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 17:43:54,355 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:43:54,356 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:43:54,356 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:43:54,356 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:43:54,356 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:43:54,356 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:43:54,357 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:43:54,357 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:43:54,357 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:43:54,357 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 17:43:54,357 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:43:54,358 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 17:43:54,358 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 17:43:54,358 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:43:54,402 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:43:54,415 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:43:54,419 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:43:54,421 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:43:54,421 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:43:54,422 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_compareModified_true-unreach-call_ground.i [2018-11-14 17:43:54,486 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd53d04f3/9213ad0d423e49f9b897f117061a40d0/FLAG96985275e [2018-11-14 17:43:54,900 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:43:54,901 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_compareModified_true-unreach-call_ground.i [2018-11-14 17:43:54,906 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd53d04f3/9213ad0d423e49f9b897f117061a40d0/FLAG96985275e [2018-11-14 17:43:54,924 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd53d04f3/9213ad0d423e49f9b897f117061a40d0 [2018-11-14 17:43:54,936 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:43:54,937 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:43:54,938 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:43:54,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:43:54,944 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:43:54,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:43:54" (1/1) ... [2018-11-14 17:43:54,948 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47e0cb41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:43:54, skipping insertion in model container [2018-11-14 17:43:54,948 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:43:54" (1/1) ... [2018-11-14 17:43:54,959 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:43:54,980 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:43:55,221 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:43:55,233 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:43:55,269 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:43:55,298 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:43:55,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:43:55 WrapperNode [2018-11-14 17:43:55,299 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:43:55,300 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:43:55,300 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:43:55,300 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:43:55,313 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:43:55" (1/1) ... [2018-11-14 17:43:55,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:43:55" (1/1) ... [2018-11-14 17:43:55,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:43:55" (1/1) ... [2018-11-14 17:43:55,322 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:43:55" (1/1) ... [2018-11-14 17:43:55,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:43:55" (1/1) ... [2018-11-14 17:43:55,347 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:43:55" (1/1) ... [2018-11-14 17:43:55,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:43:55" (1/1) ... [2018-11-14 17:43:55,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:43:55,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:43:55,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:43:55,353 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:43:55,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:43:55" (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:43:55,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:43:55,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:43:55,488 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:43:55,488 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:43:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:43:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:43:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:43:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:43:55,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 17:43:55,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 17:43:55,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:43:55,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:43:55,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:43:55,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 17:43:56,118 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:43:56,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:43:56 BoogieIcfgContainer [2018-11-14 17:43:56,119 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:43:56,120 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:43:56,121 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:43:56,124 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:43:56,125 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:43:54" (1/3) ... [2018-11-14 17:43:56,125 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a63738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:43:56, skipping insertion in model container [2018-11-14 17:43:56,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:43:55" (2/3) ... [2018-11-14 17:43:56,126 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50a63738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:43:56, skipping insertion in model container [2018-11-14 17:43:56,126 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:43:56" (3/3) ... [2018-11-14 17:43:56,128 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_compareModified_true-unreach-call_ground.i [2018-11-14 17:43:56,139 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:43:56,148 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:43:56,167 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:43:56,202 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:43:56,203 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:43:56,203 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:43:56,203 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:43:56,204 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:43:56,204 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:43:56,204 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:43:56,204 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:43:56,204 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:43:56,223 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-14 17:43:56,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 17:43:56,230 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:43:56,231 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:43:56,234 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:43:56,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:43:56,240 INFO L82 PathProgramCache]: Analyzing trace with hash -2147091842, now seen corresponding path program 1 times [2018-11-14 17:43:56,245 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:43:56,246 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:43:56,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:43:56,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:43:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:43:56,374 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:43:56,459 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-14 17:43:56,463 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {37#true} is VALID [2018-11-14 17:43:56,463 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 17:43:56,464 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #80#return; {37#true} is VALID [2018-11-14 17:43:56,464 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret9 := main(); {37#true} is VALID [2018-11-14 17:43:56,464 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~rv~0 := 1bv32; {37#true} is VALID [2018-11-14 17:43:56,465 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-14 17:43:56,466 INFO L273 TraceCheckUtils]: 7: Hoare triple {38#false} havoc ~x~0; {38#false} is VALID [2018-11-14 17:43:56,466 INFO L273 TraceCheckUtils]: 8: Hoare triple {38#false} assume ~rv~0 != 0bv32;~x~0 := 0bv32; {38#false} is VALID [2018-11-14 17:43:56,467 INFO L273 TraceCheckUtils]: 9: Hoare triple {38#false} assume true; {38#false} is VALID [2018-11-14 17:43:56,467 INFO L273 TraceCheckUtils]: 10: Hoare triple {38#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {38#false} is VALID [2018-11-14 17:43:56,468 INFO L256 TraceCheckUtils]: 11: Hoare triple {38#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1bv32 else 0bv32)); {38#false} is VALID [2018-11-14 17:43:56,468 INFO L273 TraceCheckUtils]: 12: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2018-11-14 17:43:56,469 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#false} assume ~cond == 0bv32; {38#false} is VALID [2018-11-14 17:43:56,469 INFO L273 TraceCheckUtils]: 14: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-14 17:43:56,473 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:43:56,474 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:43:56,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:43:56,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:43:56,485 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-14 17:43:56,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:43:56,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:43:56,634 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:43:56,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:43:56,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:43:56,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:43:56,648 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-14 17:43:56,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:43:56,913 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2018-11-14 17:43:56,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:43:56,913 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-14 17:43:56,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:43:56,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:43:56,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2018-11-14 17:43:56,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:43:56,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2018-11-14 17:43:56,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 75 transitions. [2018-11-14 17:43:57,273 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:43:57,285 INFO L225 Difference]: With dead ends: 58 [2018-11-14 17:43:57,286 INFO L226 Difference]: Without dead ends: 29 [2018-11-14 17:43:57,290 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:43:57,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-14 17:43:57,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-14 17:43:57,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:43:57,340 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-14 17:43:57,341 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 17:43:57,341 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 17:43:57,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:43:57,348 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-14 17:43:57,348 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-14 17:43:57,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:43:57,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:43:57,349 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 17:43:57,349 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 17:43:57,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:43:57,354 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-14 17:43:57,355 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-14 17:43:57,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:43:57,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:43:57,356 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:43:57,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:43:57,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 17:43:57,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-11-14 17:43:57,361 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 15 [2018-11-14 17:43:57,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:43:57,362 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-11-14 17:43:57,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:43:57,362 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-14 17:43:57,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:43:57,364 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:43:57,364 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:43:57,364 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:43:57,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:43:57,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1833302188, now seen corresponding path program 1 times [2018-11-14 17:43:57,365 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:43:57,366 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:43:57,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:43:57,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:43:57,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:43:57,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:43:57,507 INFO L256 TraceCheckUtils]: 0: Hoare triple {253#true} call ULTIMATE.init(); {253#true} is VALID [2018-11-14 17:43:57,508 INFO L273 TraceCheckUtils]: 1: Hoare triple {253#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {253#true} is VALID [2018-11-14 17:43:57,508 INFO L273 TraceCheckUtils]: 2: Hoare triple {253#true} assume true; {253#true} is VALID [2018-11-14 17:43:57,508 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {253#true} {253#true} #80#return; {253#true} is VALID [2018-11-14 17:43:57,509 INFO L256 TraceCheckUtils]: 4: Hoare triple {253#true} call #t~ret9 := main(); {253#true} is VALID [2018-11-14 17:43:57,513 INFO L273 TraceCheckUtils]: 5: Hoare triple {253#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~rv~0 := 1bv32; {273#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:43:57,516 INFO L273 TraceCheckUtils]: 6: Hoare triple {273#(= main_~i~0 (_ bv0 32))} assume true; {273#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:43:57,517 INFO L273 TraceCheckUtils]: 7: Hoare triple {273#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {254#false} is VALID [2018-11-14 17:43:57,517 INFO L273 TraceCheckUtils]: 8: Hoare triple {254#false} havoc ~x~0; {254#false} is VALID [2018-11-14 17:43:57,517 INFO L273 TraceCheckUtils]: 9: Hoare triple {254#false} assume ~rv~0 != 0bv32;~x~0 := 0bv32; {254#false} is VALID [2018-11-14 17:43:57,518 INFO L273 TraceCheckUtils]: 10: Hoare triple {254#false} assume true; {254#false} is VALID [2018-11-14 17:43:57,518 INFO L273 TraceCheckUtils]: 11: Hoare triple {254#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {254#false} is VALID [2018-11-14 17:43:57,518 INFO L256 TraceCheckUtils]: 12: Hoare triple {254#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1bv32 else 0bv32)); {254#false} is VALID [2018-11-14 17:43:57,519 INFO L273 TraceCheckUtils]: 13: Hoare triple {254#false} ~cond := #in~cond; {254#false} is VALID [2018-11-14 17:43:57,519 INFO L273 TraceCheckUtils]: 14: Hoare triple {254#false} assume ~cond == 0bv32; {254#false} is VALID [2018-11-14 17:43:57,520 INFO L273 TraceCheckUtils]: 15: Hoare triple {254#false} assume !false; {254#false} is VALID [2018-11-14 17:43:57,521 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:43:57,522 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:43:57,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:43:57,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:43:57,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-14 17:43:57,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:43:57,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:43:57,746 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:43:57,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:43:57,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:43:57,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:43:57,747 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 3 states. [2018-11-14 17:43:58,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:43:58,066 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-11-14 17:43:58,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:43:58,067 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-14 17:43:58,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:43:58,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:43:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-14 17:43:58,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:43:58,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-14 17:43:58,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2018-11-14 17:43:58,253 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:43:58,255 INFO L225 Difference]: With dead ends: 52 [2018-11-14 17:43:58,256 INFO L226 Difference]: Without dead ends: 33 [2018-11-14 17:43:58,257 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:43:58,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-14 17:43:58,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-11-14 17:43:58,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:43:58,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 31 states. [2018-11-14 17:43:58,312 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 31 states. [2018-11-14 17:43:58,312 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 31 states. [2018-11-14 17:43:58,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:43:58,315 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-14 17:43:58,316 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-14 17:43:58,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:43:58,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:43:58,317 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 33 states. [2018-11-14 17:43:58,317 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 33 states. [2018-11-14 17:43:58,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:43:58,321 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-14 17:43:58,321 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-14 17:43:58,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:43:58,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:43:58,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:43:58,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:43:58,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 17:43:58,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-14 17:43:58,326 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 16 [2018-11-14 17:43:58,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:43:58,327 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-14 17:43:58,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:43:58,327 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-14 17:43:58,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 17:43:58,328 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:43:58,328 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:43:58,329 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:43:58,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:43:58,329 INFO L82 PathProgramCache]: Analyzing trace with hash -976213442, now seen corresponding path program 1 times [2018-11-14 17:43:58,330 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:43:58,330 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:43:58,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:43:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:43:58,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:43:58,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:43:58,457 INFO L256 TraceCheckUtils]: 0: Hoare triple {479#true} call ULTIMATE.init(); {479#true} is VALID [2018-11-14 17:43:58,457 INFO L273 TraceCheckUtils]: 1: Hoare triple {479#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {479#true} is VALID [2018-11-14 17:43:58,458 INFO L273 TraceCheckUtils]: 2: Hoare triple {479#true} assume true; {479#true} is VALID [2018-11-14 17:43:58,458 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {479#true} {479#true} #80#return; {479#true} is VALID [2018-11-14 17:43:58,459 INFO L256 TraceCheckUtils]: 4: Hoare triple {479#true} call #t~ret9 := main(); {479#true} is VALID [2018-11-14 17:43:58,459 INFO L273 TraceCheckUtils]: 5: Hoare triple {479#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~rv~0 := 1bv32; {479#true} is VALID [2018-11-14 17:43:58,460 INFO L273 TraceCheckUtils]: 6: Hoare triple {479#true} assume true; {479#true} is VALID [2018-11-14 17:43:58,460 INFO L273 TraceCheckUtils]: 7: Hoare triple {479#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {479#true} is VALID [2018-11-14 17:43:58,462 INFO L273 TraceCheckUtils]: 8: Hoare triple {479#true} assume #t~mem0 != #t~mem1;havoc #t~mem0;havoc #t~mem1;~rv~0 := 0bv32; {508#(= (_ bv0 32) main_~rv~0)} is VALID [2018-11-14 17:43:58,462 INFO L273 TraceCheckUtils]: 9: Hoare triple {508#(= (_ bv0 32) main_~rv~0)} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {508#(= (_ bv0 32) main_~rv~0)} is VALID [2018-11-14 17:43:58,463 INFO L273 TraceCheckUtils]: 10: Hoare triple {508#(= (_ bv0 32) main_~rv~0)} assume true; {508#(= (_ bv0 32) main_~rv~0)} is VALID [2018-11-14 17:43:58,464 INFO L273 TraceCheckUtils]: 11: Hoare triple {508#(= (_ bv0 32) main_~rv~0)} assume !~bvslt32(~i~0, 100000bv32); {508#(= (_ bv0 32) main_~rv~0)} is VALID [2018-11-14 17:43:58,466 INFO L273 TraceCheckUtils]: 12: Hoare triple {508#(= (_ bv0 32) main_~rv~0)} havoc ~x~0; {508#(= (_ bv0 32) main_~rv~0)} is VALID [2018-11-14 17:43:58,467 INFO L273 TraceCheckUtils]: 13: Hoare triple {508#(= (_ bv0 32) main_~rv~0)} assume ~rv~0 != 0bv32;~x~0 := 0bv32; {480#false} is VALID [2018-11-14 17:43:58,467 INFO L273 TraceCheckUtils]: 14: Hoare triple {480#false} assume true; {480#false} is VALID [2018-11-14 17:43:58,468 INFO L273 TraceCheckUtils]: 15: Hoare triple {480#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {480#false} is VALID [2018-11-14 17:43:58,468 INFO L256 TraceCheckUtils]: 16: Hoare triple {480#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1bv32 else 0bv32)); {480#false} is VALID [2018-11-14 17:43:58,469 INFO L273 TraceCheckUtils]: 17: Hoare triple {480#false} ~cond := #in~cond; {480#false} is VALID [2018-11-14 17:43:58,469 INFO L273 TraceCheckUtils]: 18: Hoare triple {480#false} assume ~cond == 0bv32; {480#false} is VALID [2018-11-14 17:43:58,470 INFO L273 TraceCheckUtils]: 19: Hoare triple {480#false} assume !false; {480#false} is VALID [2018-11-14 17:43:58,472 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:43:58,473 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:43:58,484 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:43:58,484 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:43:58,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 17:43:58,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:43:58,485 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:43:58,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:43:58,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:43:58,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:43:58,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:43:58,533 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 3 states. [2018-11-14 17:43:58,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:43:58,859 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-11-14 17:43:58,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:43:58,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 17:43:58,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:43:58,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:43:58,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2018-11-14 17:43:58,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:43:58,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2018-11-14 17:43:58,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2018-11-14 17:43:59,197 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:43:59,199 INFO L225 Difference]: With dead ends: 60 [2018-11-14 17:43:59,200 INFO L226 Difference]: Without dead ends: 43 [2018-11-14 17:43:59,200 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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:43:59,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-14 17:43:59,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2018-11-14 17:43:59,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:43:59,258 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 37 states. [2018-11-14 17:43:59,258 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 37 states. [2018-11-14 17:43:59,259 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 37 states. [2018-11-14 17:43:59,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:43:59,265 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-14 17:43:59,265 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-14 17:43:59,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:43:59,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:43:59,271 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 43 states. [2018-11-14 17:43:59,272 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 43 states. [2018-11-14 17:43:59,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:43:59,277 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-14 17:43:59,278 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-14 17:43:59,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:43:59,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:43:59,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:43:59,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:43:59,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 17:43:59,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-11-14 17:43:59,289 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 20 [2018-11-14 17:43:59,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:43:59,290 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-14 17:43:59,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:43:59,290 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-14 17:43:59,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 17:43:59,293 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:43:59,293 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:43:59,293 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:43:59,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:43:59,294 INFO L82 PathProgramCache]: Analyzing trace with hash -718048004, now seen corresponding path program 1 times [2018-11-14 17:43:59,295 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:43:59,295 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:43:59,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:43:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:43:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:43:59,359 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:43:59,441 INFO L256 TraceCheckUtils]: 0: Hoare triple {755#true} call ULTIMATE.init(); {755#true} is VALID [2018-11-14 17:43:59,441 INFO L273 TraceCheckUtils]: 1: Hoare triple {755#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {755#true} is VALID [2018-11-14 17:43:59,441 INFO L273 TraceCheckUtils]: 2: Hoare triple {755#true} assume true; {755#true} is VALID [2018-11-14 17:43:59,442 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {755#true} {755#true} #80#return; {755#true} is VALID [2018-11-14 17:43:59,442 INFO L256 TraceCheckUtils]: 4: Hoare triple {755#true} call #t~ret9 := main(); {755#true} is VALID [2018-11-14 17:43:59,443 INFO L273 TraceCheckUtils]: 5: Hoare triple {755#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~rv~0 := 1bv32; {775#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:43:59,444 INFO L273 TraceCheckUtils]: 6: Hoare triple {775#(= main_~i~0 (_ bv0 32))} assume true; {775#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:43:59,444 INFO L273 TraceCheckUtils]: 7: Hoare triple {775#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {775#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:43:59,446 INFO L273 TraceCheckUtils]: 8: Hoare triple {775#(= main_~i~0 (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {775#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:43:59,447 INFO L273 TraceCheckUtils]: 9: Hoare triple {775#(= main_~i~0 (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {788#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:43:59,447 INFO L273 TraceCheckUtils]: 10: Hoare triple {788#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {788#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:43:59,450 INFO L273 TraceCheckUtils]: 11: Hoare triple {788#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {756#false} is VALID [2018-11-14 17:43:59,450 INFO L273 TraceCheckUtils]: 12: Hoare triple {756#false} havoc ~x~0; {756#false} is VALID [2018-11-14 17:43:59,450 INFO L273 TraceCheckUtils]: 13: Hoare triple {756#false} assume ~rv~0 != 0bv32;~x~0 := 0bv32; {756#false} is VALID [2018-11-14 17:43:59,451 INFO L273 TraceCheckUtils]: 14: Hoare triple {756#false} assume true; {756#false} is VALID [2018-11-14 17:43:59,451 INFO L273 TraceCheckUtils]: 15: Hoare triple {756#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {756#false} is VALID [2018-11-14 17:43:59,451 INFO L256 TraceCheckUtils]: 16: Hoare triple {756#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1bv32 else 0bv32)); {756#false} is VALID [2018-11-14 17:43:59,451 INFO L273 TraceCheckUtils]: 17: Hoare triple {756#false} ~cond := #in~cond; {756#false} is VALID [2018-11-14 17:43:59,452 INFO L273 TraceCheckUtils]: 18: Hoare triple {756#false} assume ~cond == 0bv32; {756#false} is VALID [2018-11-14 17:43:59,452 INFO L273 TraceCheckUtils]: 19: Hoare triple {756#false} assume !false; {756#false} is VALID [2018-11-14 17:43:59,453 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:43:59,453 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:43:59,538 INFO L273 TraceCheckUtils]: 19: Hoare triple {756#false} assume !false; {756#false} is VALID [2018-11-14 17:43:59,539 INFO L273 TraceCheckUtils]: 18: Hoare triple {756#false} assume ~cond == 0bv32; {756#false} is VALID [2018-11-14 17:43:59,539 INFO L273 TraceCheckUtils]: 17: Hoare triple {756#false} ~cond := #in~cond; {756#false} is VALID [2018-11-14 17:43:59,539 INFO L256 TraceCheckUtils]: 16: Hoare triple {756#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1bv32 else 0bv32)); {756#false} is VALID [2018-11-14 17:43:59,540 INFO L273 TraceCheckUtils]: 15: Hoare triple {756#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {756#false} is VALID [2018-11-14 17:43:59,540 INFO L273 TraceCheckUtils]: 14: Hoare triple {756#false} assume true; {756#false} is VALID [2018-11-14 17:43:59,541 INFO L273 TraceCheckUtils]: 13: Hoare triple {756#false} assume ~rv~0 != 0bv32;~x~0 := 0bv32; {756#false} is VALID [2018-11-14 17:43:59,541 INFO L273 TraceCheckUtils]: 12: Hoare triple {756#false} havoc ~x~0; {756#false} is VALID [2018-11-14 17:43:59,543 INFO L273 TraceCheckUtils]: 11: Hoare triple {843#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {756#false} is VALID [2018-11-14 17:43:59,545 INFO L273 TraceCheckUtils]: 10: Hoare triple {843#(bvslt main_~i~0 (_ bv100000 32))} assume true; {843#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 17:43:59,546 INFO L273 TraceCheckUtils]: 9: Hoare triple {850#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {843#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 17:43:59,546 INFO L273 TraceCheckUtils]: 8: Hoare triple {850#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {850#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:43:59,547 INFO L273 TraceCheckUtils]: 7: Hoare triple {850#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {850#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:43:59,547 INFO L273 TraceCheckUtils]: 6: Hoare triple {850#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {850#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:43:59,548 INFO L273 TraceCheckUtils]: 5: Hoare triple {755#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~rv~0 := 1bv32; {850#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:43:59,548 INFO L256 TraceCheckUtils]: 4: Hoare triple {755#true} call #t~ret9 := main(); {755#true} is VALID [2018-11-14 17:43:59,549 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {755#true} {755#true} #80#return; {755#true} is VALID [2018-11-14 17:43:59,549 INFO L273 TraceCheckUtils]: 2: Hoare triple {755#true} assume true; {755#true} is VALID [2018-11-14 17:43:59,549 INFO L273 TraceCheckUtils]: 1: Hoare triple {755#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {755#true} is VALID [2018-11-14 17:43:59,550 INFO L256 TraceCheckUtils]: 0: Hoare triple {755#true} call ULTIMATE.init(); {755#true} is VALID [2018-11-14 17:43:59,551 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:43:59,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:43:59,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 17:43:59,553 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-14 17:43:59,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:43:59,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:43:59,604 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:43:59,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:43:59,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:43:59,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:43:59,605 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 6 states. [2018-11-14 17:43:59,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:43:59,920 INFO L93 Difference]: Finished difference Result 81 states and 102 transitions. [2018-11-14 17:43:59,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:43:59,920 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-14 17:43:59,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:43:59,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:43:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2018-11-14 17:43:59,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:43:59,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2018-11-14 17:43:59,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 76 transitions. [2018-11-14 17:44:00,054 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:44:00,057 INFO L225 Difference]: With dead ends: 81 [2018-11-14 17:44:00,057 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 17:44:00,058 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 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:44:00,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 17:44:00,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-14 17:44:00,104 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:44:00,104 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2018-11-14 17:44:00,104 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-14 17:44:00,104 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-14 17:44:00,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:00,108 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-11-14 17:44:00,109 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-11-14 17:44:00,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:44:00,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:44:00,110 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-14 17:44:00,110 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-14 17:44:00,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:00,113 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-11-14 17:44:00,114 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-11-14 17:44:00,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:44:00,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:44:00,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:44:00,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:44:00,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-14 17:44:00,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-11-14 17:44:00,118 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 20 [2018-11-14 17:44:00,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:44:00,119 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-11-14 17:44:00,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:44:00,119 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-11-14 17:44:00,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:44:00,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:44:00,121 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:44:00,121 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:44:00,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:44:00,121 INFO L82 PathProgramCache]: Analyzing trace with hash 181224948, now seen corresponding path program 2 times [2018-11-14 17:44:00,122 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:44:00,122 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:44:00,150 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 17:44:00,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:44:00,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:44:00,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:44:00,235 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:44:00,413 INFO L256 TraceCheckUtils]: 0: Hoare triple {1184#true} call ULTIMATE.init(); {1184#true} is VALID [2018-11-14 17:44:00,414 INFO L273 TraceCheckUtils]: 1: Hoare triple {1184#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1184#true} is VALID [2018-11-14 17:44:00,414 INFO L273 TraceCheckUtils]: 2: Hoare triple {1184#true} assume true; {1184#true} is VALID [2018-11-14 17:44:00,415 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1184#true} {1184#true} #80#return; {1184#true} is VALID [2018-11-14 17:44:00,415 INFO L256 TraceCheckUtils]: 4: Hoare triple {1184#true} call #t~ret9 := main(); {1184#true} is VALID [2018-11-14 17:44:00,416 INFO L273 TraceCheckUtils]: 5: Hoare triple {1184#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~rv~0 := 1bv32; {1204#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:44:00,417 INFO L273 TraceCheckUtils]: 6: Hoare triple {1204#(= main_~i~0 (_ bv0 32))} assume true; {1204#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:44:00,417 INFO L273 TraceCheckUtils]: 7: Hoare triple {1204#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1204#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:44:00,418 INFO L273 TraceCheckUtils]: 8: Hoare triple {1204#(= main_~i~0 (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1204#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:44:00,419 INFO L273 TraceCheckUtils]: 9: Hoare triple {1204#(= main_~i~0 (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1217#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:00,419 INFO L273 TraceCheckUtils]: 10: Hoare triple {1217#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1217#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:00,420 INFO L273 TraceCheckUtils]: 11: Hoare triple {1217#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1217#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:00,421 INFO L273 TraceCheckUtils]: 12: Hoare triple {1217#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1217#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:00,422 INFO L273 TraceCheckUtils]: 13: Hoare triple {1217#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1230#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 17:44:00,423 INFO L273 TraceCheckUtils]: 14: Hoare triple {1230#(= (_ bv2 32) main_~i~0)} assume true; {1230#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 17:44:00,430 INFO L273 TraceCheckUtils]: 15: Hoare triple {1230#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1230#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 17:44:00,431 INFO L273 TraceCheckUtils]: 16: Hoare triple {1230#(= (_ bv2 32) main_~i~0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1230#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 17:44:00,431 INFO L273 TraceCheckUtils]: 17: Hoare triple {1230#(= (_ bv2 32) main_~i~0)} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1243#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:00,433 INFO L273 TraceCheckUtils]: 18: Hoare triple {1243#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1243#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:00,433 INFO L273 TraceCheckUtils]: 19: Hoare triple {1243#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1243#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:00,434 INFO L273 TraceCheckUtils]: 20: Hoare triple {1243#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1243#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:00,434 INFO L273 TraceCheckUtils]: 21: Hoare triple {1243#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1256#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 17:44:00,435 INFO L273 TraceCheckUtils]: 22: Hoare triple {1256#(= (_ bv4 32) main_~i~0)} assume true; {1256#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-14 17:44:00,436 INFO L273 TraceCheckUtils]: 23: Hoare triple {1256#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {1185#false} is VALID [2018-11-14 17:44:00,436 INFO L273 TraceCheckUtils]: 24: Hoare triple {1185#false} havoc ~x~0; {1185#false} is VALID [2018-11-14 17:44:00,437 INFO L273 TraceCheckUtils]: 25: Hoare triple {1185#false} assume ~rv~0 != 0bv32;~x~0 := 0bv32; {1185#false} is VALID [2018-11-14 17:44:00,437 INFO L273 TraceCheckUtils]: 26: Hoare triple {1185#false} assume true; {1185#false} is VALID [2018-11-14 17:44:00,437 INFO L273 TraceCheckUtils]: 27: Hoare triple {1185#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1185#false} is VALID [2018-11-14 17:44:00,438 INFO L256 TraceCheckUtils]: 28: Hoare triple {1185#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1bv32 else 0bv32)); {1185#false} is VALID [2018-11-14 17:44:00,438 INFO L273 TraceCheckUtils]: 29: Hoare triple {1185#false} ~cond := #in~cond; {1185#false} is VALID [2018-11-14 17:44:00,438 INFO L273 TraceCheckUtils]: 30: Hoare triple {1185#false} assume ~cond == 0bv32; {1185#false} is VALID [2018-11-14 17:44:00,439 INFO L273 TraceCheckUtils]: 31: Hoare triple {1185#false} assume !false; {1185#false} is VALID [2018-11-14 17:44:00,442 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:44:00,442 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:44:00,773 INFO L273 TraceCheckUtils]: 31: Hoare triple {1185#false} assume !false; {1185#false} is VALID [2018-11-14 17:44:00,774 INFO L273 TraceCheckUtils]: 30: Hoare triple {1185#false} assume ~cond == 0bv32; {1185#false} is VALID [2018-11-14 17:44:00,774 INFO L273 TraceCheckUtils]: 29: Hoare triple {1185#false} ~cond := #in~cond; {1185#false} is VALID [2018-11-14 17:44:00,774 INFO L256 TraceCheckUtils]: 28: Hoare triple {1185#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1bv32 else 0bv32)); {1185#false} is VALID [2018-11-14 17:44:00,775 INFO L273 TraceCheckUtils]: 27: Hoare triple {1185#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1185#false} is VALID [2018-11-14 17:44:00,775 INFO L273 TraceCheckUtils]: 26: Hoare triple {1185#false} assume true; {1185#false} is VALID [2018-11-14 17:44:00,775 INFO L273 TraceCheckUtils]: 25: Hoare triple {1185#false} assume ~rv~0 != 0bv32;~x~0 := 0bv32; {1185#false} is VALID [2018-11-14 17:44:00,776 INFO L273 TraceCheckUtils]: 24: Hoare triple {1185#false} havoc ~x~0; {1185#false} is VALID [2018-11-14 17:44:00,776 INFO L273 TraceCheckUtils]: 23: Hoare triple {1311#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1185#false} is VALID [2018-11-14 17:44:00,778 INFO L273 TraceCheckUtils]: 22: Hoare triple {1311#(bvslt main_~i~0 (_ bv100000 32))} assume true; {1311#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 17:44:00,779 INFO L273 TraceCheckUtils]: 21: Hoare triple {1318#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1311#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 17:44:00,779 INFO L273 TraceCheckUtils]: 20: Hoare triple {1318#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1318#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:00,780 INFO L273 TraceCheckUtils]: 19: Hoare triple {1318#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1318#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:00,781 INFO L273 TraceCheckUtils]: 18: Hoare triple {1318#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {1318#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:00,789 INFO L273 TraceCheckUtils]: 17: Hoare triple {1331#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1318#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:00,790 INFO L273 TraceCheckUtils]: 16: Hoare triple {1331#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1331#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:00,791 INFO L273 TraceCheckUtils]: 15: Hoare triple {1331#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1331#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:00,791 INFO L273 TraceCheckUtils]: 14: Hoare triple {1331#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume true; {1331#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:00,798 INFO L273 TraceCheckUtils]: 13: Hoare triple {1344#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1331#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:00,799 INFO L273 TraceCheckUtils]: 12: Hoare triple {1344#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1344#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:00,799 INFO L273 TraceCheckUtils]: 11: Hoare triple {1344#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1344#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:00,802 INFO L273 TraceCheckUtils]: 10: Hoare triple {1344#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume true; {1344#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:00,810 INFO L273 TraceCheckUtils]: 9: Hoare triple {1357#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1344#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:00,810 INFO L273 TraceCheckUtils]: 8: Hoare triple {1357#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1357#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:00,811 INFO L273 TraceCheckUtils]: 7: Hoare triple {1357#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1357#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:00,811 INFO L273 TraceCheckUtils]: 6: Hoare triple {1357#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume true; {1357#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:00,812 INFO L273 TraceCheckUtils]: 5: Hoare triple {1184#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~rv~0 := 1bv32; {1357#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:00,812 INFO L256 TraceCheckUtils]: 4: Hoare triple {1184#true} call #t~ret9 := main(); {1184#true} is VALID [2018-11-14 17:44:00,813 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1184#true} {1184#true} #80#return; {1184#true} is VALID [2018-11-14 17:44:00,813 INFO L273 TraceCheckUtils]: 2: Hoare triple {1184#true} assume true; {1184#true} is VALID [2018-11-14 17:44:00,813 INFO L273 TraceCheckUtils]: 1: Hoare triple {1184#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1184#true} is VALID [2018-11-14 17:44:00,813 INFO L256 TraceCheckUtils]: 0: Hoare triple {1184#true} call ULTIMATE.init(); {1184#true} is VALID [2018-11-14 17:44:00,816 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:44:00,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:44:00,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 17:44:00,826 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-11-14 17:44:00,826 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:44:00,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 17:44:01,004 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:44:01,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 17:44:01,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 17:44:01,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-14 17:44:01,005 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 12 states. [2018-11-14 17:44:02,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:02,214 INFO L93 Difference]: Finished difference Result 129 states and 168 transitions. [2018-11-14 17:44:02,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 17:44:02,214 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-11-14 17:44:02,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:44:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:44:02,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2018-11-14 17:44:02,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 17:44:02,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2018-11-14 17:44:02,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 109 transitions. [2018-11-14 17:44:02,389 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:44:02,392 INFO L225 Difference]: With dead ends: 129 [2018-11-14 17:44:02,392 INFO L226 Difference]: Without dead ends: 108 [2018-11-14 17:44:02,395 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 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:44:02,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-14 17:44:02,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-11-14 17:44:02,457 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:44:02,457 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 108 states. [2018-11-14 17:44:02,457 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 108 states. [2018-11-14 17:44:02,457 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 108 states. [2018-11-14 17:44:02,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:02,463 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2018-11-14 17:44:02,463 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2018-11-14 17:44:02,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:44:02,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:44:02,464 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 108 states. [2018-11-14 17:44:02,464 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 108 states. [2018-11-14 17:44:02,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:02,470 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2018-11-14 17:44:02,470 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2018-11-14 17:44:02,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:44:02,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:44:02,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:44:02,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:44:02,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-14 17:44:02,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 132 transitions. [2018-11-14 17:44:02,476 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 132 transitions. Word has length 32 [2018-11-14 17:44:02,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:44:02,476 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 132 transitions. [2018-11-14 17:44:02,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 17:44:02,476 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2018-11-14 17:44:02,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-14 17:44:02,478 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:44:02,478 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:44:02,478 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:44:02,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:44:02,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1357788188, now seen corresponding path program 3 times [2018-11-14 17:44:02,479 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:44:02,480 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:44:02,503 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 17:44:03,738 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-14 17:44:03,738 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:44:03,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:44:03,782 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:44:04,104 INFO L256 TraceCheckUtils]: 0: Hoare triple {1913#true} call ULTIMATE.init(); {1913#true} is VALID [2018-11-14 17:44:04,104 INFO L273 TraceCheckUtils]: 1: Hoare triple {1913#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1913#true} is VALID [2018-11-14 17:44:04,104 INFO L273 TraceCheckUtils]: 2: Hoare triple {1913#true} assume true; {1913#true} is VALID [2018-11-14 17:44:04,104 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1913#true} {1913#true} #80#return; {1913#true} is VALID [2018-11-14 17:44:04,105 INFO L256 TraceCheckUtils]: 4: Hoare triple {1913#true} call #t~ret9 := main(); {1913#true} is VALID [2018-11-14 17:44:04,105 INFO L273 TraceCheckUtils]: 5: Hoare triple {1913#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~rv~0 := 1bv32; {1933#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:44:04,106 INFO L273 TraceCheckUtils]: 6: Hoare triple {1933#(= main_~i~0 (_ bv0 32))} assume true; {1933#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:44:04,106 INFO L273 TraceCheckUtils]: 7: Hoare triple {1933#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1933#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:44:04,106 INFO L273 TraceCheckUtils]: 8: Hoare triple {1933#(= main_~i~0 (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1933#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:44:04,107 INFO L273 TraceCheckUtils]: 9: Hoare triple {1933#(= main_~i~0 (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1946#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:04,108 INFO L273 TraceCheckUtils]: 10: Hoare triple {1946#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1946#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:04,108 INFO L273 TraceCheckUtils]: 11: Hoare triple {1946#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1946#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:04,109 INFO L273 TraceCheckUtils]: 12: Hoare triple {1946#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1946#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:04,110 INFO L273 TraceCheckUtils]: 13: Hoare triple {1946#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1959#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 17:44:04,110 INFO L273 TraceCheckUtils]: 14: Hoare triple {1959#(= (_ bv2 32) main_~i~0)} assume true; {1959#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 17:44:04,111 INFO L273 TraceCheckUtils]: 15: Hoare triple {1959#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1959#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 17:44:04,112 INFO L273 TraceCheckUtils]: 16: Hoare triple {1959#(= (_ bv2 32) main_~i~0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1959#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 17:44:04,113 INFO L273 TraceCheckUtils]: 17: Hoare triple {1959#(= (_ bv2 32) main_~i~0)} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1972#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:04,114 INFO L273 TraceCheckUtils]: 18: Hoare triple {1972#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {1972#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:04,131 INFO L273 TraceCheckUtils]: 19: Hoare triple {1972#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1972#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:04,132 INFO L273 TraceCheckUtils]: 20: Hoare triple {1972#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1972#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:04,132 INFO L273 TraceCheckUtils]: 21: Hoare triple {1972#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1985#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:04,133 INFO L273 TraceCheckUtils]: 22: Hoare triple {1985#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {1985#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:04,133 INFO L273 TraceCheckUtils]: 23: Hoare triple {1985#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1985#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:04,134 INFO L273 TraceCheckUtils]: 24: Hoare triple {1985#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1985#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:04,135 INFO L273 TraceCheckUtils]: 25: Hoare triple {1985#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {1998#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:04,136 INFO L273 TraceCheckUtils]: 26: Hoare triple {1998#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {1998#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:04,136 INFO L273 TraceCheckUtils]: 27: Hoare triple {1998#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1998#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:04,137 INFO L273 TraceCheckUtils]: 28: Hoare triple {1998#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {1998#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:04,138 INFO L273 TraceCheckUtils]: 29: Hoare triple {1998#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2011#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 17:44:04,139 INFO L273 TraceCheckUtils]: 30: Hoare triple {2011#(= (_ bv6 32) main_~i~0)} assume true; {2011#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 17:44:04,140 INFO L273 TraceCheckUtils]: 31: Hoare triple {2011#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2011#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 17:44:04,140 INFO L273 TraceCheckUtils]: 32: Hoare triple {2011#(= (_ bv6 32) main_~i~0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2011#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-14 17:44:04,141 INFO L273 TraceCheckUtils]: 33: Hoare triple {2011#(= (_ bv6 32) main_~i~0)} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2024#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:04,142 INFO L273 TraceCheckUtils]: 34: Hoare triple {2024#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {2024#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:04,143 INFO L273 TraceCheckUtils]: 35: Hoare triple {2024#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2024#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:04,144 INFO L273 TraceCheckUtils]: 36: Hoare triple {2024#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2024#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:04,150 INFO L273 TraceCheckUtils]: 37: Hoare triple {2024#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2037#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:04,151 INFO L273 TraceCheckUtils]: 38: Hoare triple {2037#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {2037#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:04,151 INFO L273 TraceCheckUtils]: 39: Hoare triple {2037#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2037#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:04,152 INFO L273 TraceCheckUtils]: 40: Hoare triple {2037#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2037#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:04,152 INFO L273 TraceCheckUtils]: 41: Hoare triple {2037#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2050#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-14 17:44:04,153 INFO L273 TraceCheckUtils]: 42: Hoare triple {2050#(= (_ bv9 32) main_~i~0)} assume true; {2050#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-14 17:44:04,153 INFO L273 TraceCheckUtils]: 43: Hoare triple {2050#(= (_ bv9 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2050#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-14 17:44:04,154 INFO L273 TraceCheckUtils]: 44: Hoare triple {2050#(= (_ bv9 32) main_~i~0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2050#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-14 17:44:04,155 INFO L273 TraceCheckUtils]: 45: Hoare triple {2050#(= (_ bv9 32) main_~i~0)} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2063#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:04,156 INFO L273 TraceCheckUtils]: 46: Hoare triple {2063#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {2063#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:04,156 INFO L273 TraceCheckUtils]: 47: Hoare triple {2063#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1914#false} is VALID [2018-11-14 17:44:04,157 INFO L273 TraceCheckUtils]: 48: Hoare triple {1914#false} havoc ~x~0; {1914#false} is VALID [2018-11-14 17:44:04,157 INFO L273 TraceCheckUtils]: 49: Hoare triple {1914#false} assume ~rv~0 != 0bv32;~x~0 := 0bv32; {1914#false} is VALID [2018-11-14 17:44:04,158 INFO L273 TraceCheckUtils]: 50: Hoare triple {1914#false} assume true; {1914#false} is VALID [2018-11-14 17:44:04,158 INFO L273 TraceCheckUtils]: 51: Hoare triple {1914#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1914#false} is VALID [2018-11-14 17:44:04,159 INFO L256 TraceCheckUtils]: 52: Hoare triple {1914#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1bv32 else 0bv32)); {1914#false} is VALID [2018-11-14 17:44:04,159 INFO L273 TraceCheckUtils]: 53: Hoare triple {1914#false} ~cond := #in~cond; {1914#false} is VALID [2018-11-14 17:44:04,160 INFO L273 TraceCheckUtils]: 54: Hoare triple {1914#false} assume ~cond == 0bv32; {1914#false} is VALID [2018-11-14 17:44:04,160 INFO L273 TraceCheckUtils]: 55: Hoare triple {1914#false} assume !false; {1914#false} is VALID [2018-11-14 17:44:04,168 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:44:04,168 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:44:04,734 INFO L273 TraceCheckUtils]: 55: Hoare triple {1914#false} assume !false; {1914#false} is VALID [2018-11-14 17:44:04,735 INFO L273 TraceCheckUtils]: 54: Hoare triple {1914#false} assume ~cond == 0bv32; {1914#false} is VALID [2018-11-14 17:44:04,735 INFO L273 TraceCheckUtils]: 53: Hoare triple {1914#false} ~cond := #in~cond; {1914#false} is VALID [2018-11-14 17:44:04,735 INFO L256 TraceCheckUtils]: 52: Hoare triple {1914#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1bv32 else 0bv32)); {1914#false} is VALID [2018-11-14 17:44:04,736 INFO L273 TraceCheckUtils]: 51: Hoare triple {1914#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1914#false} is VALID [2018-11-14 17:44:04,736 INFO L273 TraceCheckUtils]: 50: Hoare triple {1914#false} assume true; {1914#false} is VALID [2018-11-14 17:44:04,736 INFO L273 TraceCheckUtils]: 49: Hoare triple {1914#false} assume ~rv~0 != 0bv32;~x~0 := 0bv32; {1914#false} is VALID [2018-11-14 17:44:04,736 INFO L273 TraceCheckUtils]: 48: Hoare triple {1914#false} havoc ~x~0; {1914#false} is VALID [2018-11-14 17:44:04,737 INFO L273 TraceCheckUtils]: 47: Hoare triple {2118#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1914#false} is VALID [2018-11-14 17:44:04,737 INFO L273 TraceCheckUtils]: 46: Hoare triple {2118#(bvslt main_~i~0 (_ bv100000 32))} assume true; {2118#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 17:44:04,738 INFO L273 TraceCheckUtils]: 45: Hoare triple {2125#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2118#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 17:44:04,738 INFO L273 TraceCheckUtils]: 44: Hoare triple {2125#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2125#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,739 INFO L273 TraceCheckUtils]: 43: Hoare triple {2125#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2125#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,740 INFO L273 TraceCheckUtils]: 42: Hoare triple {2125#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {2125#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,747 INFO L273 TraceCheckUtils]: 41: Hoare triple {2138#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2125#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,748 INFO L273 TraceCheckUtils]: 40: Hoare triple {2138#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2138#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,749 INFO L273 TraceCheckUtils]: 39: Hoare triple {2138#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2138#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,749 INFO L273 TraceCheckUtils]: 38: Hoare triple {2138#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume true; {2138#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,756 INFO L273 TraceCheckUtils]: 37: Hoare triple {2151#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2138#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,756 INFO L273 TraceCheckUtils]: 36: Hoare triple {2151#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2151#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,757 INFO L273 TraceCheckUtils]: 35: Hoare triple {2151#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2151#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,758 INFO L273 TraceCheckUtils]: 34: Hoare triple {2151#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume true; {2151#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,764 INFO L273 TraceCheckUtils]: 33: Hoare triple {2164#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2151#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,765 INFO L273 TraceCheckUtils]: 32: Hoare triple {2164#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2164#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,765 INFO L273 TraceCheckUtils]: 31: Hoare triple {2164#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2164#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,766 INFO L273 TraceCheckUtils]: 30: Hoare triple {2164#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume true; {2164#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,774 INFO L273 TraceCheckUtils]: 29: Hoare triple {2177#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2164#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,774 INFO L273 TraceCheckUtils]: 28: Hoare triple {2177#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2177#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,775 INFO L273 TraceCheckUtils]: 27: Hoare triple {2177#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2177#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,775 INFO L273 TraceCheckUtils]: 26: Hoare triple {2177#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume true; {2177#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,783 INFO L273 TraceCheckUtils]: 25: Hoare triple {2190#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2177#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,783 INFO L273 TraceCheckUtils]: 24: Hoare triple {2190#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2190#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,784 INFO L273 TraceCheckUtils]: 23: Hoare triple {2190#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2190#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,784 INFO L273 TraceCheckUtils]: 22: Hoare triple {2190#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume true; {2190#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,792 INFO L273 TraceCheckUtils]: 21: Hoare triple {2203#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2190#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,792 INFO L273 TraceCheckUtils]: 20: Hoare triple {2203#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2203#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,793 INFO L273 TraceCheckUtils]: 19: Hoare triple {2203#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2203#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,793 INFO L273 TraceCheckUtils]: 18: Hoare triple {2203#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume true; {2203#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,801 INFO L273 TraceCheckUtils]: 17: Hoare triple {2216#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2203#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,802 INFO L273 TraceCheckUtils]: 16: Hoare triple {2216#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2216#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,803 INFO L273 TraceCheckUtils]: 15: Hoare triple {2216#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2216#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,804 INFO L273 TraceCheckUtils]: 14: Hoare triple {2216#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume true; {2216#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,812 INFO L273 TraceCheckUtils]: 13: Hoare triple {2229#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2216#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,814 INFO L273 TraceCheckUtils]: 12: Hoare triple {2229#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2229#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,818 INFO L273 TraceCheckUtils]: 11: Hoare triple {2229#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2229#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,820 INFO L273 TraceCheckUtils]: 10: Hoare triple {2229#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume true; {2229#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,827 INFO L273 TraceCheckUtils]: 9: Hoare triple {2242#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {2229#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,827 INFO L273 TraceCheckUtils]: 8: Hoare triple {2242#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {2242#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,828 INFO L273 TraceCheckUtils]: 7: Hoare triple {2242#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2242#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,828 INFO L273 TraceCheckUtils]: 6: Hoare triple {2242#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume true; {2242#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,829 INFO L273 TraceCheckUtils]: 5: Hoare triple {1913#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~rv~0 := 1bv32; {2242#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:04,829 INFO L256 TraceCheckUtils]: 4: Hoare triple {1913#true} call #t~ret9 := main(); {1913#true} is VALID [2018-11-14 17:44:04,829 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1913#true} {1913#true} #80#return; {1913#true} is VALID [2018-11-14 17:44:04,830 INFO L273 TraceCheckUtils]: 2: Hoare triple {1913#true} assume true; {1913#true} is VALID [2018-11-14 17:44:04,830 INFO L273 TraceCheckUtils]: 1: Hoare triple {1913#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1913#true} is VALID [2018-11-14 17:44:04,830 INFO L256 TraceCheckUtils]: 0: Hoare triple {1913#true} call ULTIMATE.init(); {1913#true} is VALID [2018-11-14 17:44:04,837 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:44:04,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:44:04,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-14 17:44:04,849 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2018-11-14 17:44:04,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:44:04,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 17:44:05,079 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:44:05,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 17:44:05,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 17:44:05,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-14 17:44:05,081 INFO L87 Difference]: Start difference. First operand 108 states and 132 transitions. Second operand 24 states. [2018-11-14 17:44:09,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:09,918 INFO L93 Difference]: Finished difference Result 225 states and 300 transitions. [2018-11-14 17:44:09,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 17:44:09,918 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2018-11-14 17:44:09,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:44:09,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:44:09,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 175 transitions. [2018-11-14 17:44:09,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 17:44:09,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 175 transitions. [2018-11-14 17:44:09,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 175 transitions. [2018-11-14 17:44:10,214 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:44:10,219 INFO L225 Difference]: With dead ends: 225 [2018-11-14 17:44:10,219 INFO L226 Difference]: Without dead ends: 204 [2018-11-14 17:44:10,220 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 89 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:44:10,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-11-14 17:44:10,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-11-14 17:44:10,302 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:44:10,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 204 states. Second operand 204 states. [2018-11-14 17:44:10,302 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand 204 states. [2018-11-14 17:44:10,302 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 204 states. [2018-11-14 17:44:10,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:10,310 INFO L93 Difference]: Finished difference Result 204 states and 252 transitions. [2018-11-14 17:44:10,310 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 252 transitions. [2018-11-14 17:44:10,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:44:10,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:44:10,311 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand 204 states. [2018-11-14 17:44:10,311 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 204 states. [2018-11-14 17:44:10,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:10,320 INFO L93 Difference]: Finished difference Result 204 states and 252 transitions. [2018-11-14 17:44:10,320 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 252 transitions. [2018-11-14 17:44:10,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:44:10,321 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:44:10,321 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:44:10,321 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:44:10,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-14 17:44:10,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 252 transitions. [2018-11-14 17:44:10,330 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 252 transitions. Word has length 56 [2018-11-14 17:44:10,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:44:10,330 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 252 transitions. [2018-11-14 17:44:10,330 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 17:44:10,331 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 252 transitions. [2018-11-14 17:44:10,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-14 17:44:10,336 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:44:10,336 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:44:10,337 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:44:10,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:44:10,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1726375876, now seen corresponding path program 4 times [2018-11-14 17:44:10,337 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:44:10,337 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:44:10,353 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:44:10,512 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:44:10,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:44:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:44:10,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:44:11,515 INFO L256 TraceCheckUtils]: 0: Hoare triple {3242#true} call ULTIMATE.init(); {3242#true} is VALID [2018-11-14 17:44:11,515 INFO L273 TraceCheckUtils]: 1: Hoare triple {3242#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3242#true} is VALID [2018-11-14 17:44:11,515 INFO L273 TraceCheckUtils]: 2: Hoare triple {3242#true} assume true; {3242#true} is VALID [2018-11-14 17:44:11,515 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3242#true} {3242#true} #80#return; {3242#true} is VALID [2018-11-14 17:44:11,516 INFO L256 TraceCheckUtils]: 4: Hoare triple {3242#true} call #t~ret9 := main(); {3242#true} is VALID [2018-11-14 17:44:11,516 INFO L273 TraceCheckUtils]: 5: Hoare triple {3242#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~rv~0 := 1bv32; {3262#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:44:11,517 INFO L273 TraceCheckUtils]: 6: Hoare triple {3262#(= main_~i~0 (_ bv0 32))} assume true; {3262#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:44:11,517 INFO L273 TraceCheckUtils]: 7: Hoare triple {3262#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3262#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:44:11,519 INFO L273 TraceCheckUtils]: 8: Hoare triple {3262#(= main_~i~0 (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3262#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:44:11,519 INFO L273 TraceCheckUtils]: 9: Hoare triple {3262#(= main_~i~0 (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3275#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,521 INFO L273 TraceCheckUtils]: 10: Hoare triple {3275#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3275#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,521 INFO L273 TraceCheckUtils]: 11: Hoare triple {3275#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3275#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,523 INFO L273 TraceCheckUtils]: 12: Hoare triple {3275#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3275#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,523 INFO L273 TraceCheckUtils]: 13: Hoare triple {3275#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3288#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 17:44:11,525 INFO L273 TraceCheckUtils]: 14: Hoare triple {3288#(= (_ bv2 32) main_~i~0)} assume true; {3288#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 17:44:11,525 INFO L273 TraceCheckUtils]: 15: Hoare triple {3288#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3288#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 17:44:11,527 INFO L273 TraceCheckUtils]: 16: Hoare triple {3288#(= (_ bv2 32) main_~i~0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3288#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-14 17:44:11,529 INFO L273 TraceCheckUtils]: 17: Hoare triple {3288#(= (_ bv2 32) main_~i~0)} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3301#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,531 INFO L273 TraceCheckUtils]: 18: Hoare triple {3301#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {3301#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,531 INFO L273 TraceCheckUtils]: 19: Hoare triple {3301#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3301#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,531 INFO L273 TraceCheckUtils]: 20: Hoare triple {3301#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3301#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,532 INFO L273 TraceCheckUtils]: 21: Hoare triple {3301#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3314#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,533 INFO L273 TraceCheckUtils]: 22: Hoare triple {3314#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {3314#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,533 INFO L273 TraceCheckUtils]: 23: Hoare triple {3314#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3314#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,534 INFO L273 TraceCheckUtils]: 24: Hoare triple {3314#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3314#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,535 INFO L273 TraceCheckUtils]: 25: Hoare triple {3314#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3327#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,535 INFO L273 TraceCheckUtils]: 26: Hoare triple {3327#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3327#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,537 INFO L273 TraceCheckUtils]: 27: Hoare triple {3327#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3327#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,540 INFO L273 TraceCheckUtils]: 28: Hoare triple {3327#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3327#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,541 INFO L273 TraceCheckUtils]: 29: Hoare triple {3327#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3340#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,542 INFO L273 TraceCheckUtils]: 30: Hoare triple {3340#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume true; {3340#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,542 INFO L273 TraceCheckUtils]: 31: Hoare triple {3340#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3340#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,544 INFO L273 TraceCheckUtils]: 32: Hoare triple {3340#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3340#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,545 INFO L273 TraceCheckUtils]: 33: Hoare triple {3340#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3353#(= (_ bv7 32) main_~i~0)} is VALID [2018-11-14 17:44:11,546 INFO L273 TraceCheckUtils]: 34: Hoare triple {3353#(= (_ bv7 32) main_~i~0)} assume true; {3353#(= (_ bv7 32) main_~i~0)} is VALID [2018-11-14 17:44:11,546 INFO L273 TraceCheckUtils]: 35: Hoare triple {3353#(= (_ bv7 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3353#(= (_ bv7 32) main_~i~0)} is VALID [2018-11-14 17:44:11,548 INFO L273 TraceCheckUtils]: 36: Hoare triple {3353#(= (_ bv7 32) main_~i~0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3353#(= (_ bv7 32) main_~i~0)} is VALID [2018-11-14 17:44:11,548 INFO L273 TraceCheckUtils]: 37: Hoare triple {3353#(= (_ bv7 32) main_~i~0)} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3366#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,550 INFO L273 TraceCheckUtils]: 38: Hoare triple {3366#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {3366#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,550 INFO L273 TraceCheckUtils]: 39: Hoare triple {3366#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3366#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,552 INFO L273 TraceCheckUtils]: 40: Hoare triple {3366#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3366#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,556 INFO L273 TraceCheckUtils]: 41: Hoare triple {3366#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3379#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,558 INFO L273 TraceCheckUtils]: 42: Hoare triple {3379#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume true; {3379#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,558 INFO L273 TraceCheckUtils]: 43: Hoare triple {3379#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3379#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,560 INFO L273 TraceCheckUtils]: 44: Hoare triple {3379#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3379#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,560 INFO L273 TraceCheckUtils]: 45: Hoare triple {3379#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3392#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-14 17:44:11,562 INFO L273 TraceCheckUtils]: 46: Hoare triple {3392#(= (_ bv10 32) main_~i~0)} assume true; {3392#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-14 17:44:11,562 INFO L273 TraceCheckUtils]: 47: Hoare triple {3392#(= (_ bv10 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3392#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-14 17:44:11,564 INFO L273 TraceCheckUtils]: 48: Hoare triple {3392#(= (_ bv10 32) main_~i~0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3392#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-14 17:44:11,564 INFO L273 TraceCheckUtils]: 49: Hoare triple {3392#(= (_ bv10 32) main_~i~0)} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3405#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,566 INFO L273 TraceCheckUtils]: 50: Hoare triple {3405#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume true; {3405#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,566 INFO L273 TraceCheckUtils]: 51: Hoare triple {3405#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3405#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,568 INFO L273 TraceCheckUtils]: 52: Hoare triple {3405#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3405#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,568 INFO L273 TraceCheckUtils]: 53: Hoare triple {3405#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3418#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,570 INFO L273 TraceCheckUtils]: 54: Hoare triple {3418#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume true; {3418#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,570 INFO L273 TraceCheckUtils]: 55: Hoare triple {3418#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3418#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,572 INFO L273 TraceCheckUtils]: 56: Hoare triple {3418#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3418#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,572 INFO L273 TraceCheckUtils]: 57: Hoare triple {3418#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3431#(= (_ bv13 32) main_~i~0)} is VALID [2018-11-14 17:44:11,574 INFO L273 TraceCheckUtils]: 58: Hoare triple {3431#(= (_ bv13 32) main_~i~0)} assume true; {3431#(= (_ bv13 32) main_~i~0)} is VALID [2018-11-14 17:44:11,574 INFO L273 TraceCheckUtils]: 59: Hoare triple {3431#(= (_ bv13 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3431#(= (_ bv13 32) main_~i~0)} is VALID [2018-11-14 17:44:11,576 INFO L273 TraceCheckUtils]: 60: Hoare triple {3431#(= (_ bv13 32) main_~i~0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3431#(= (_ bv13 32) main_~i~0)} is VALID [2018-11-14 17:44:11,577 INFO L273 TraceCheckUtils]: 61: Hoare triple {3431#(= (_ bv13 32) main_~i~0)} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3444#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,578 INFO L273 TraceCheckUtils]: 62: Hoare triple {3444#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume true; {3444#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,578 INFO L273 TraceCheckUtils]: 63: Hoare triple {3444#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3444#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,580 INFO L273 TraceCheckUtils]: 64: Hoare triple {3444#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3444#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,581 INFO L273 TraceCheckUtils]: 65: Hoare triple {3444#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3457#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,582 INFO L273 TraceCheckUtils]: 66: Hoare triple {3457#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume true; {3457#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,582 INFO L273 TraceCheckUtils]: 67: Hoare triple {3457#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3457#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,584 INFO L273 TraceCheckUtils]: 68: Hoare triple {3457#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3457#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,586 INFO L273 TraceCheckUtils]: 69: Hoare triple {3457#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3470#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-14 17:44:11,586 INFO L273 TraceCheckUtils]: 70: Hoare triple {3470#(= (_ bv16 32) main_~i~0)} assume true; {3470#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-14 17:44:11,588 INFO L273 TraceCheckUtils]: 71: Hoare triple {3470#(= (_ bv16 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3470#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-14 17:44:11,588 INFO L273 TraceCheckUtils]: 72: Hoare triple {3470#(= (_ bv16 32) main_~i~0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3470#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-14 17:44:11,589 INFO L273 TraceCheckUtils]: 73: Hoare triple {3470#(= (_ bv16 32) main_~i~0)} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3483#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,589 INFO L273 TraceCheckUtils]: 74: Hoare triple {3483#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume true; {3483#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,590 INFO L273 TraceCheckUtils]: 75: Hoare triple {3483#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3483#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,590 INFO L273 TraceCheckUtils]: 76: Hoare triple {3483#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3483#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,591 INFO L273 TraceCheckUtils]: 77: Hoare triple {3483#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3496#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,591 INFO L273 TraceCheckUtils]: 78: Hoare triple {3496#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume true; {3496#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,592 INFO L273 TraceCheckUtils]: 79: Hoare triple {3496#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3496#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,592 INFO L273 TraceCheckUtils]: 80: Hoare triple {3496#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3496#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,593 INFO L273 TraceCheckUtils]: 81: Hoare triple {3496#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3509#(= (_ bv19 32) main_~i~0)} is VALID [2018-11-14 17:44:11,602 INFO L273 TraceCheckUtils]: 82: Hoare triple {3509#(= (_ bv19 32) main_~i~0)} assume true; {3509#(= (_ bv19 32) main_~i~0)} is VALID [2018-11-14 17:44:11,602 INFO L273 TraceCheckUtils]: 83: Hoare triple {3509#(= (_ bv19 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3509#(= (_ bv19 32) main_~i~0)} is VALID [2018-11-14 17:44:11,603 INFO L273 TraceCheckUtils]: 84: Hoare triple {3509#(= (_ bv19 32) main_~i~0)} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3509#(= (_ bv19 32) main_~i~0)} is VALID [2018-11-14 17:44:11,603 INFO L273 TraceCheckUtils]: 85: Hoare triple {3509#(= (_ bv19 32) main_~i~0)} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3522#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,604 INFO L273 TraceCheckUtils]: 86: Hoare triple {3522#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume true; {3522#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,604 INFO L273 TraceCheckUtils]: 87: Hoare triple {3522#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3522#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,604 INFO L273 TraceCheckUtils]: 88: Hoare triple {3522#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3522#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,606 INFO L273 TraceCheckUtils]: 89: Hoare triple {3522#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3535#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,606 INFO L273 TraceCheckUtils]: 90: Hoare triple {3535#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume true; {3535#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,607 INFO L273 TraceCheckUtils]: 91: Hoare triple {3535#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3535#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,608 INFO L273 TraceCheckUtils]: 92: Hoare triple {3535#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3535#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,608 INFO L273 TraceCheckUtils]: 93: Hoare triple {3535#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3548#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,609 INFO L273 TraceCheckUtils]: 94: Hoare triple {3548#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume true; {3548#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 17:44:11,610 INFO L273 TraceCheckUtils]: 95: Hoare triple {3548#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {3243#false} is VALID [2018-11-14 17:44:11,610 INFO L273 TraceCheckUtils]: 96: Hoare triple {3243#false} havoc ~x~0; {3243#false} is VALID [2018-11-14 17:44:11,610 INFO L273 TraceCheckUtils]: 97: Hoare triple {3243#false} assume ~rv~0 != 0bv32;~x~0 := 0bv32; {3243#false} is VALID [2018-11-14 17:44:11,610 INFO L273 TraceCheckUtils]: 98: Hoare triple {3243#false} assume true; {3243#false} is VALID [2018-11-14 17:44:11,610 INFO L273 TraceCheckUtils]: 99: Hoare triple {3243#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3243#false} is VALID [2018-11-14 17:44:11,611 INFO L256 TraceCheckUtils]: 100: Hoare triple {3243#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1bv32 else 0bv32)); {3243#false} is VALID [2018-11-14 17:44:11,611 INFO L273 TraceCheckUtils]: 101: Hoare triple {3243#false} ~cond := #in~cond; {3243#false} is VALID [2018-11-14 17:44:11,611 INFO L273 TraceCheckUtils]: 102: Hoare triple {3243#false} assume ~cond == 0bv32; {3243#false} is VALID [2018-11-14 17:44:11,611 INFO L273 TraceCheckUtils]: 103: Hoare triple {3243#false} assume !false; {3243#false} is VALID [2018-11-14 17:44:11,624 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:44:11,624 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:44:13,443 INFO L273 TraceCheckUtils]: 103: Hoare triple {3243#false} assume !false; {3243#false} is VALID [2018-11-14 17:44:13,444 INFO L273 TraceCheckUtils]: 102: Hoare triple {3243#false} assume ~cond == 0bv32; {3243#false} is VALID [2018-11-14 17:44:13,444 INFO L273 TraceCheckUtils]: 101: Hoare triple {3243#false} ~cond := #in~cond; {3243#false} is VALID [2018-11-14 17:44:13,444 INFO L256 TraceCheckUtils]: 100: Hoare triple {3243#false} call __VERIFIER_assert((if #t~mem4 == #t~mem5 then 1bv32 else 0bv32)); {3243#false} is VALID [2018-11-14 17:44:13,445 INFO L273 TraceCheckUtils]: 99: Hoare triple {3243#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem4 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3243#false} is VALID [2018-11-14 17:44:13,445 INFO L273 TraceCheckUtils]: 98: Hoare triple {3243#false} assume true; {3243#false} is VALID [2018-11-14 17:44:13,445 INFO L273 TraceCheckUtils]: 97: Hoare triple {3243#false} assume ~rv~0 != 0bv32;~x~0 := 0bv32; {3243#false} is VALID [2018-11-14 17:44:13,445 INFO L273 TraceCheckUtils]: 96: Hoare triple {3243#false} havoc ~x~0; {3243#false} is VALID [2018-11-14 17:44:13,447 INFO L273 TraceCheckUtils]: 95: Hoare triple {3603#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {3243#false} is VALID [2018-11-14 17:44:13,448 INFO L273 TraceCheckUtils]: 94: Hoare triple {3603#(bvslt main_~i~0 (_ bv100000 32))} assume true; {3603#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 17:44:13,448 INFO L273 TraceCheckUtils]: 93: Hoare triple {3610#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3603#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 17:44:13,449 INFO L273 TraceCheckUtils]: 92: Hoare triple {3610#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3610#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,450 INFO L273 TraceCheckUtils]: 91: Hoare triple {3610#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3610#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,465 INFO L273 TraceCheckUtils]: 90: Hoare triple {3610#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {3610#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,471 INFO L273 TraceCheckUtils]: 89: Hoare triple {3623#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3610#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,472 INFO L273 TraceCheckUtils]: 88: Hoare triple {3623#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3623#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,472 INFO L273 TraceCheckUtils]: 87: Hoare triple {3623#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3623#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,472 INFO L273 TraceCheckUtils]: 86: Hoare triple {3623#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume true; {3623#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,480 INFO L273 TraceCheckUtils]: 85: Hoare triple {3636#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3623#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,480 INFO L273 TraceCheckUtils]: 84: Hoare triple {3636#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3636#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,481 INFO L273 TraceCheckUtils]: 83: Hoare triple {3636#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3636#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,481 INFO L273 TraceCheckUtils]: 82: Hoare triple {3636#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume true; {3636#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,499 INFO L273 TraceCheckUtils]: 81: Hoare triple {3649#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3636#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,500 INFO L273 TraceCheckUtils]: 80: Hoare triple {3649#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3649#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,500 INFO L273 TraceCheckUtils]: 79: Hoare triple {3649#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3649#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,500 INFO L273 TraceCheckUtils]: 78: Hoare triple {3649#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume true; {3649#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,508 INFO L273 TraceCheckUtils]: 77: Hoare triple {3662#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3649#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,509 INFO L273 TraceCheckUtils]: 76: Hoare triple {3662#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3662#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,509 INFO L273 TraceCheckUtils]: 75: Hoare triple {3662#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3662#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,509 INFO L273 TraceCheckUtils]: 74: Hoare triple {3662#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume true; {3662#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,519 INFO L273 TraceCheckUtils]: 73: Hoare triple {3675#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3662#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,520 INFO L273 TraceCheckUtils]: 72: Hoare triple {3675#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3675#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,520 INFO L273 TraceCheckUtils]: 71: Hoare triple {3675#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3675#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,521 INFO L273 TraceCheckUtils]: 70: Hoare triple {3675#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume true; {3675#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,530 INFO L273 TraceCheckUtils]: 69: Hoare triple {3688#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3675#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,530 INFO L273 TraceCheckUtils]: 68: Hoare triple {3688#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3688#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,531 INFO L273 TraceCheckUtils]: 67: Hoare triple {3688#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3688#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,531 INFO L273 TraceCheckUtils]: 66: Hoare triple {3688#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume true; {3688#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,540 INFO L273 TraceCheckUtils]: 65: Hoare triple {3701#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3688#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,541 INFO L273 TraceCheckUtils]: 64: Hoare triple {3701#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3701#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,541 INFO L273 TraceCheckUtils]: 63: Hoare triple {3701#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3701#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,542 INFO L273 TraceCheckUtils]: 62: Hoare triple {3701#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume true; {3701#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,548 INFO L273 TraceCheckUtils]: 61: Hoare triple {3714#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3701#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,549 INFO L273 TraceCheckUtils]: 60: Hoare triple {3714#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3714#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,549 INFO L273 TraceCheckUtils]: 59: Hoare triple {3714#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3714#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,550 INFO L273 TraceCheckUtils]: 58: Hoare triple {3714#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume true; {3714#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,557 INFO L273 TraceCheckUtils]: 57: Hoare triple {3727#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3714#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,558 INFO L273 TraceCheckUtils]: 56: Hoare triple {3727#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3727#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,558 INFO L273 TraceCheckUtils]: 55: Hoare triple {3727#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3727#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,558 INFO L273 TraceCheckUtils]: 54: Hoare triple {3727#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume true; {3727#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,567 INFO L273 TraceCheckUtils]: 53: Hoare triple {3740#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3727#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,568 INFO L273 TraceCheckUtils]: 52: Hoare triple {3740#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3740#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,568 INFO L273 TraceCheckUtils]: 51: Hoare triple {3740#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3740#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,569 INFO L273 TraceCheckUtils]: 50: Hoare triple {3740#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume true; {3740#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,575 INFO L273 TraceCheckUtils]: 49: Hoare triple {3753#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3740#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,575 INFO L273 TraceCheckUtils]: 48: Hoare triple {3753#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3753#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,576 INFO L273 TraceCheckUtils]: 47: Hoare triple {3753#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3753#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,576 INFO L273 TraceCheckUtils]: 46: Hoare triple {3753#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume true; {3753#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,583 INFO L273 TraceCheckUtils]: 45: Hoare triple {3766#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3753#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,583 INFO L273 TraceCheckUtils]: 44: Hoare triple {3766#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3766#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,584 INFO L273 TraceCheckUtils]: 43: Hoare triple {3766#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3766#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,584 INFO L273 TraceCheckUtils]: 42: Hoare triple {3766#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume true; {3766#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,589 INFO L273 TraceCheckUtils]: 41: Hoare triple {3779#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3766#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,590 INFO L273 TraceCheckUtils]: 40: Hoare triple {3779#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3779#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,590 INFO L273 TraceCheckUtils]: 39: Hoare triple {3779#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3779#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,591 INFO L273 TraceCheckUtils]: 38: Hoare triple {3779#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume true; {3779#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,598 INFO L273 TraceCheckUtils]: 37: Hoare triple {3792#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3779#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,599 INFO L273 TraceCheckUtils]: 36: Hoare triple {3792#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3792#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,599 INFO L273 TraceCheckUtils]: 35: Hoare triple {3792#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3792#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,600 INFO L273 TraceCheckUtils]: 34: Hoare triple {3792#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume true; {3792#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,607 INFO L273 TraceCheckUtils]: 33: Hoare triple {3805#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3792#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,608 INFO L273 TraceCheckUtils]: 32: Hoare triple {3805#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3805#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,608 INFO L273 TraceCheckUtils]: 31: Hoare triple {3805#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3805#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,608 INFO L273 TraceCheckUtils]: 30: Hoare triple {3805#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume true; {3805#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,616 INFO L273 TraceCheckUtils]: 29: Hoare triple {3818#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3805#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,616 INFO L273 TraceCheckUtils]: 28: Hoare triple {3818#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3818#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,617 INFO L273 TraceCheckUtils]: 27: Hoare triple {3818#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3818#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,617 INFO L273 TraceCheckUtils]: 26: Hoare triple {3818#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume true; {3818#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,623 INFO L273 TraceCheckUtils]: 25: Hoare triple {3831#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3818#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,624 INFO L273 TraceCheckUtils]: 24: Hoare triple {3831#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3831#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,628 INFO L273 TraceCheckUtils]: 23: Hoare triple {3831#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3831#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,629 INFO L273 TraceCheckUtils]: 22: Hoare triple {3831#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume true; {3831#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,635 INFO L273 TraceCheckUtils]: 21: Hoare triple {3844#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3831#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,635 INFO L273 TraceCheckUtils]: 20: Hoare triple {3844#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3844#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,636 INFO L273 TraceCheckUtils]: 19: Hoare triple {3844#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3844#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,636 INFO L273 TraceCheckUtils]: 18: Hoare triple {3844#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume true; {3844#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,642 INFO L273 TraceCheckUtils]: 17: Hoare triple {3857#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3844#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,643 INFO L273 TraceCheckUtils]: 16: Hoare triple {3857#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3857#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,643 INFO L273 TraceCheckUtils]: 15: Hoare triple {3857#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3857#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,644 INFO L273 TraceCheckUtils]: 14: Hoare triple {3857#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume true; {3857#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,652 INFO L273 TraceCheckUtils]: 13: Hoare triple {3870#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3857#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,653 INFO L273 TraceCheckUtils]: 12: Hoare triple {3870#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3870#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,653 INFO L273 TraceCheckUtils]: 11: Hoare triple {3870#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3870#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,654 INFO L273 TraceCheckUtils]: 10: Hoare triple {3870#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume true; {3870#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,663 INFO L273 TraceCheckUtils]: 9: Hoare triple {3883#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#c~0.base, ~bvadd32(~#c~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem2;~i~0 := ~bvadd32(1bv32, ~i~0); {3870#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,664 INFO L273 TraceCheckUtils]: 8: Hoare triple {3883#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !(#t~mem0 != #t~mem1);havoc #t~mem0;havoc #t~mem1; {3883#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,664 INFO L273 TraceCheckUtils]: 7: Hoare triple {3883#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3883#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,664 INFO L273 TraceCheckUtils]: 6: Hoare triple {3883#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume true; {3883#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,666 INFO L273 TraceCheckUtils]: 5: Hoare triple {3242#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;call ~#c~0.base, ~#c~0.offset := #Ultimate.alloc(400000bv32);~rv~0 := 1bv32; {3883#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 17:44:13,666 INFO L256 TraceCheckUtils]: 4: Hoare triple {3242#true} call #t~ret9 := main(); {3242#true} is VALID [2018-11-14 17:44:13,666 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3242#true} {3242#true} #80#return; {3242#true} is VALID [2018-11-14 17:44:13,667 INFO L273 TraceCheckUtils]: 2: Hoare triple {3242#true} assume true; {3242#true} is VALID [2018-11-14 17:44:13,667 INFO L273 TraceCheckUtils]: 1: Hoare triple {3242#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3242#true} is VALID [2018-11-14 17:44:13,667 INFO L256 TraceCheckUtils]: 0: Hoare triple {3242#true} call ULTIMATE.init(); {3242#true} is VALID [2018-11-14 17:44:13,688 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:44:13,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:44:13,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-14 17:44:13,693 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 104 [2018-11-14 17:44:13,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:44:13,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-14 17:44:14,157 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:44:14,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-14 17:44:14,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-14 17:44:14,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-14 17:44:14,159 INFO L87 Difference]: Start difference. First operand 204 states and 252 transitions. Second operand 48 states. [2018-11-14 17:44:23,744 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-14 17:44:24,275 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-14 17:44:24,864 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:44:25,477 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-14 17:44:26,079 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-14 17:44:26,714 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-14 17:44:27,334 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-14 17:44:35,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:35,283 INFO L93 Difference]: Finished difference Result 417 states and 564 transitions. [2018-11-14 17:44:35,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-14 17:44:35,284 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 104 [2018-11-14 17:44:35,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:44:35,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 17:44:35,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 307 transitions. [2018-11-14 17:44:35,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 17:44:35,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 307 transitions. [2018-11-14 17:44:35,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 307 transitions. [2018-11-14 17:44:35,954 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 307 edges. 307 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:44:35,966 INFO L225 Difference]: With dead ends: 417 [2018-11-14 17:44:35,966 INFO L226 Difference]: Without dead ends: 396 [2018-11-14 17:44:35,968 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-14 17:44:35,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-11-14 17:44:36,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2018-11-14 17:44:36,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:44:36,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states. Second operand 396 states. [2018-11-14 17:44:36,618 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand 396 states. [2018-11-14 17:44:36,618 INFO L87 Difference]: Start difference. First operand 396 states. Second operand 396 states. [2018-11-14 17:44:36,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:36,635 INFO L93 Difference]: Finished difference Result 396 states and 492 transitions. [2018-11-14 17:44:36,635 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 492 transitions. [2018-11-14 17:44:36,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:44:36,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:44:36,636 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand 396 states. [2018-11-14 17:44:36,636 INFO L87 Difference]: Start difference. First operand 396 states. Second operand 396 states. [2018-11-14 17:44:36,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:44:36,653 INFO L93 Difference]: Finished difference Result 396 states and 492 transitions. [2018-11-14 17:44:36,653 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 492 transitions. [2018-11-14 17:44:36,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:44:36,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:44:36,655 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:44:36,655 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:44:36,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-11-14 17:44:36,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 492 transitions. [2018-11-14 17:44:36,671 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 492 transitions. Word has length 104 [2018-11-14 17:44:36,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:44:36,672 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 492 transitions. [2018-11-14 17:44:36,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-14 17:44:36,672 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 492 transitions. [2018-11-14 17:44:36,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-14 17:44:36,675 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:44:36,676 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:44:36,676 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:44:36,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:44:36,677 INFO L82 PathProgramCache]: Analyzing trace with hash 66969476, now seen corresponding path program 5 times [2018-11-14 17:44:36,677 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:44:36,678 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:44:36,709 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1