java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-examples/standard_compareModified_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 15:52:50,441 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 15:52:50,443 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 15:52:50,455 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 15:52:50,456 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 15:52:50,457 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 15:52:50,458 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 15:52:50,460 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 15:52:50,462 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 15:52:50,463 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 15:52:50,463 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 15:52:50,464 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 15:52:50,465 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 15:52:50,466 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 15:52:50,467 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 15:52:50,468 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 15:52:50,468 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 15:52:50,470 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 15:52:50,472 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 15:52:50,474 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 15:52:50,475 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 15:52:50,477 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 15:52:50,479 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 15:52:50,479 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 15:52:50,483 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 15:52:50,484 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 15:52:50,487 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 15:52:50,488 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 15:52:50,489 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 15:52:50,493 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 15:52:50,493 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 15:52:50,494 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 15:52:50,494 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 15:52:50,494 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 15:52:50,496 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 15:52:50,497 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 15:52:50,497 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 15:52:50,533 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 15:52:50,533 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 15:52:50,534 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 15:52:50,534 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 15:52:50,535 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 15:52:50,535 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 15:52:50,536 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 15:52:50,536 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 15:52:50,536 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 15:52:50,536 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 15:52:50,536 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 15:52:50,537 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 15:52:50,537 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 15:52:50,537 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 15:52:50,537 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 15:52:50,537 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 15:52:50,539 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 15:52:50,539 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 15:52:50,539 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 15:52:50,539 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 15:52:50,540 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 15:52:50,540 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 15:52:50,540 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 15:52:50,540 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 15:52:50,540 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 15:52:50,541 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 15:52:50,541 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 15:52:50,541 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 15:52:50,541 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 15:52:50,542 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 15:52:50,542 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 15:52:50,542 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 15:52:50,606 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 15:52:50,624 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 15:52:50,629 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 15:52:50,631 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 15:52:50,631 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 15:52:50,632 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 15:52:50,710 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c1f70603/1210ae3aedef417fa520c6e9eb44e67b/FLAG601a4177d [2018-11-14 15:52:51,155 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 15:52:51,156 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_compareModified_true-unreach-call_ground.i [2018-11-14 15:52:51,163 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c1f70603/1210ae3aedef417fa520c6e9eb44e67b/FLAG601a4177d [2018-11-14 15:52:51,178 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1c1f70603/1210ae3aedef417fa520c6e9eb44e67b [2018-11-14 15:52:51,187 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 15:52:51,189 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 15:52:51,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 15:52:51,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 15:52:51,194 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 15:52:51,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:52:51" (1/1) ... [2018-11-14 15:52:51,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fd3c464 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:52:51, skipping insertion in model container [2018-11-14 15:52:51,199 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:52:51" (1/1) ... [2018-11-14 15:52:51,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 15:52:51,233 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 15:52:51,474 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 15:52:51,480 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 15:52:51,519 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 15:52:51,549 INFO L195 MainTranslator]: Completed translation [2018-11-14 15:52:51,549 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:52:51 WrapperNode [2018-11-14 15:52:51,549 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 15:52:51,550 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 15:52:51,550 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 15:52:51,551 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 15:52:51,567 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:52:51" (1/1) ... [2018-11-14 15:52:51,568 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:52:51" (1/1) ... [2018-11-14 15:52:51,583 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:52:51" (1/1) ... [2018-11-14 15:52:51,584 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:52:51" (1/1) ... [2018-11-14 15:52:51,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:52:51" (1/1) ... [2018-11-14 15:52:51,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:52:51" (1/1) ... [2018-11-14 15:52:51,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:52:51" (1/1) ... [2018-11-14 15:52:51,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 15:52:51,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 15:52:51,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 15:52:51,619 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 15:52:51,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:52:51" (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 15:52:51,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 15:52:51,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 15:52:51,773 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 15:52:51,774 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 15:52:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 15:52:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 15:52:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 15:52:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 15:52:51,774 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 15:52:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 15:52:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 15:52:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 15:52:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 15:52:51,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 15:52:52,425 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 15:52:52,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:52:52 BoogieIcfgContainer [2018-11-14 15:52:52,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 15:52:52,431 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 15:52:52,431 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 15:52:52,436 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 15:52:52,436 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:52:51" (1/3) ... [2018-11-14 15:52:52,437 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6b428b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:52:52, skipping insertion in model container [2018-11-14 15:52:52,437 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:52:51" (2/3) ... [2018-11-14 15:52:52,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d6b428b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:52:52, skipping insertion in model container [2018-11-14 15:52:52,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:52:52" (3/3) ... [2018-11-14 15:52:52,441 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_compareModified_true-unreach-call_ground.i [2018-11-14 15:52:52,449 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 15:52:52,456 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 15:52:52,472 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 15:52:52,508 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 15:52:52,509 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 15:52:52,509 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 15:52:52,509 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 15:52:52,510 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 15:52:52,510 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 15:52:52,510 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 15:52:52,510 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 15:52:52,510 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 15:52:52,529 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-14 15:52:52,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-14 15:52:52,535 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:52:52,537 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:52:52,539 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:52:52,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:52:52,546 INFO L82 PathProgramCache]: Analyzing trace with hash -2147091842, now seen corresponding path program 1 times [2018-11-14 15:52:52,551 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:52:52,551 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 15:52:52,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 15:52:52,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:52:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:52:52,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:52:52,865 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-14 15:52:52,869 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 15:52:52,869 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-14 15:52:52,869 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #80#return; {37#true} is VALID [2018-11-14 15:52:52,870 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret9 := main(); {37#true} is VALID [2018-11-14 15:52:52,870 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 15:52:52,871 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-14 15:52:52,871 INFO L273 TraceCheckUtils]: 7: Hoare triple {38#false} havoc ~x~0; {38#false} is VALID [2018-11-14 15:52:52,872 INFO L273 TraceCheckUtils]: 8: Hoare triple {38#false} assume ~rv~0 != 0bv32;~x~0 := 0bv32; {38#false} is VALID [2018-11-14 15:52:52,872 INFO L273 TraceCheckUtils]: 9: Hoare triple {38#false} assume true; {38#false} is VALID [2018-11-14 15:52:52,872 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 15:52:52,872 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 15:52:52,873 INFO L273 TraceCheckUtils]: 12: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2018-11-14 15:52:52,873 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#false} assume ~cond == 0bv32; {38#false} is VALID [2018-11-14 15:52:52,873 INFO L273 TraceCheckUtils]: 14: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-14 15:52:52,876 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 15:52:52,877 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 15:52:52,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 15:52:52,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 15:52:52,890 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-14 15:52:52,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:52:52,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 15:52:53,105 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 15:52:53,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 15:52:53,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 15:52:53,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 15:52:53,118 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-14 15:52:53,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:53,246 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2018-11-14 15:52:53,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 15:52:53,246 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-14 15:52:53,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:52:53,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 15:52:53,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2018-11-14 15:52:53,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 15:52:53,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2018-11-14 15:52:53,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 75 transitions. [2018-11-14 15:52:53,620 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 15:52:53,635 INFO L225 Difference]: With dead ends: 58 [2018-11-14 15:52:53,636 INFO L226 Difference]: Without dead ends: 29 [2018-11-14 15:52:53,640 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 15:52:53,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-14 15:52:53,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-14 15:52:53,690 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:52:53,691 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-14 15:52:53,691 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 15:52:53,692 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 15:52:53,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:53,699 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-14 15:52:53,700 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-14 15:52:53,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:52:53,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:52:53,701 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-14 15:52:53,701 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-14 15:52:53,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:53,706 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2018-11-14 15:52:53,706 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-14 15:52:53,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:52:53,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:52:53,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:52:53,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:52:53,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-14 15:52:53,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-11-14 15:52:53,713 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 15 [2018-11-14 15:52:53,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:52:53,714 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-11-14 15:52:53,714 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 15:52:53,714 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-11-14 15:52:53,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 15:52:53,715 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:52:53,716 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:52:53,716 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:52:53,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:52:53,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1833302188, now seen corresponding path program 1 times [2018-11-14 15:52:53,717 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:52:53,717 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 15:52:53,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 15:52:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:52:53,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:52:53,784 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:52:53,867 INFO L256 TraceCheckUtils]: 0: Hoare triple {253#true} call ULTIMATE.init(); {253#true} is VALID [2018-11-14 15:52:53,868 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 15:52:53,868 INFO L273 TraceCheckUtils]: 2: Hoare triple {253#true} assume true; {253#true} is VALID [2018-11-14 15:52:53,869 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {253#true} {253#true} #80#return; {253#true} is VALID [2018-11-14 15:52:53,869 INFO L256 TraceCheckUtils]: 4: Hoare triple {253#true} call #t~ret9 := main(); {253#true} is VALID [2018-11-14 15:52:53,871 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 15:52:53,876 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 15:52:53,876 INFO L273 TraceCheckUtils]: 7: Hoare triple {273#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {254#false} is VALID [2018-11-14 15:52:53,877 INFO L273 TraceCheckUtils]: 8: Hoare triple {254#false} havoc ~x~0; {254#false} is VALID [2018-11-14 15:52:53,877 INFO L273 TraceCheckUtils]: 9: Hoare triple {254#false} assume ~rv~0 != 0bv32;~x~0 := 0bv32; {254#false} is VALID [2018-11-14 15:52:53,877 INFO L273 TraceCheckUtils]: 10: Hoare triple {254#false} assume true; {254#false} is VALID [2018-11-14 15:52:53,877 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 15:52:53,878 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 15:52:53,878 INFO L273 TraceCheckUtils]: 13: Hoare triple {254#false} ~cond := #in~cond; {254#false} is VALID [2018-11-14 15:52:53,878 INFO L273 TraceCheckUtils]: 14: Hoare triple {254#false} assume ~cond == 0bv32; {254#false} is VALID [2018-11-14 15:52:53,879 INFO L273 TraceCheckUtils]: 15: Hoare triple {254#false} assume !false; {254#false} is VALID [2018-11-14 15:52:53,880 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 15:52:53,881 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 15:52:53,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 15:52:53,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 15:52:53,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-14 15:52:53,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:52:53,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 15:52:54,008 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 15:52:54,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 15:52:54,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 15:52:54,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 15:52:54,009 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 3 states. [2018-11-14 15:52:54,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:54,554 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-11-14 15:52:54,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 15:52:54,555 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-14 15:52:54,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:52:54,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 15:52:54,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-14 15:52:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 15:52:54,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2018-11-14 15:52:54,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 62 transitions. [2018-11-14 15:52:54,707 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 15:52:54,710 INFO L225 Difference]: With dead ends: 52 [2018-11-14 15:52:54,711 INFO L226 Difference]: Without dead ends: 33 [2018-11-14 15:52:54,712 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 15:52:54,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-14 15:52:54,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-11-14 15:52:54,747 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:52:54,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 31 states. [2018-11-14 15:52:54,747 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 31 states. [2018-11-14 15:52:54,747 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 31 states. [2018-11-14 15:52:54,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:54,751 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-14 15:52:54,751 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-14 15:52:54,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:52:54,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:52:54,752 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 33 states. [2018-11-14 15:52:54,752 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 33 states. [2018-11-14 15:52:54,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:54,756 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-14 15:52:54,756 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-14 15:52:54,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:52:54,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:52:54,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:52:54,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:52:54,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-14 15:52:54,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-14 15:52:54,761 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 16 [2018-11-14 15:52:54,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:52:54,761 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-14 15:52:54,761 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 15:52:54,762 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-14 15:52:54,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 15:52:54,763 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:52:54,763 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 15:52:54,763 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:52:54,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:52:54,764 INFO L82 PathProgramCache]: Analyzing trace with hash -976213442, now seen corresponding path program 1 times [2018-11-14 15:52:54,764 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:52:54,764 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 15:52:54,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 15:52:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:52:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:52:54,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:52:54,909 INFO L256 TraceCheckUtils]: 0: Hoare triple {479#true} call ULTIMATE.init(); {479#true} is VALID [2018-11-14 15:52:54,909 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 15:52:54,909 INFO L273 TraceCheckUtils]: 2: Hoare triple {479#true} assume true; {479#true} is VALID [2018-11-14 15:52:54,910 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {479#true} {479#true} #80#return; {479#true} is VALID [2018-11-14 15:52:54,910 INFO L256 TraceCheckUtils]: 4: Hoare triple {479#true} call #t~ret9 := main(); {479#true} is VALID [2018-11-14 15:52:54,910 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 15:52:54,910 INFO L273 TraceCheckUtils]: 6: Hoare triple {479#true} assume true; {479#true} is VALID [2018-11-14 15:52:54,911 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 15:52:54,927 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 15:52:54,932 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 15:52:54,934 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 15:52:54,934 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 15:52:54,937 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 15:52:54,937 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 15:52:54,938 INFO L273 TraceCheckUtils]: 14: Hoare triple {480#false} assume true; {480#false} is VALID [2018-11-14 15:52:54,938 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 15:52:54,938 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 15:52:54,939 INFO L273 TraceCheckUtils]: 17: Hoare triple {480#false} ~cond := #in~cond; {480#false} is VALID [2018-11-14 15:52:54,939 INFO L273 TraceCheckUtils]: 18: Hoare triple {480#false} assume ~cond == 0bv32; {480#false} is VALID [2018-11-14 15:52:54,939 INFO L273 TraceCheckUtils]: 19: Hoare triple {480#false} assume !false; {480#false} is VALID [2018-11-14 15:52:54,941 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 15:52:54,941 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 15:52:54,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 15:52:54,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 15:52:54,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 15:52:54,948 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:52:54,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 15:52:55,004 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 15:52:55,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 15:52:55,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 15:52:55,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 15:52:55,005 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 3 states. [2018-11-14 15:52:55,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:55,235 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-11-14 15:52:55,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 15:52:55,235 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 15:52:55,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:52:55,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 15:52:55,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2018-11-14 15:52:55,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 15:52:55,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2018-11-14 15:52:55,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 69 transitions. [2018-11-14 15:52:55,564 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 15:52:55,567 INFO L225 Difference]: With dead ends: 60 [2018-11-14 15:52:55,567 INFO L226 Difference]: Without dead ends: 43 [2018-11-14 15:52:55,568 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 15:52:55,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-14 15:52:55,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2018-11-14 15:52:55,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:52:55,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 37 states. [2018-11-14 15:52:55,593 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 37 states. [2018-11-14 15:52:55,593 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 37 states. [2018-11-14 15:52:55,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:55,597 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-14 15:52:55,597 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-14 15:52:55,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:52:55,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:52:55,598 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 43 states. [2018-11-14 15:52:55,599 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 43 states. [2018-11-14 15:52:55,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:55,602 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-14 15:52:55,602 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-14 15:52:55,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:52:55,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:52:55,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:52:55,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:52:55,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 15:52:55,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-11-14 15:52:55,607 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 20 [2018-11-14 15:52:55,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:52:55,607 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-14 15:52:55,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 15:52:55,607 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-14 15:52:55,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 15:52:55,608 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:52:55,609 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 15:52:55,609 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:52:55,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:52:55,609 INFO L82 PathProgramCache]: Analyzing trace with hash -718048004, now seen corresponding path program 1 times [2018-11-14 15:52:55,610 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:52:55,610 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 15:52:55,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 15:52:55,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:52:55,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:52:55,682 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:52:55,748 INFO L256 TraceCheckUtils]: 0: Hoare triple {755#true} call ULTIMATE.init(); {755#true} is VALID [2018-11-14 15:52:55,748 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 15:52:55,749 INFO L273 TraceCheckUtils]: 2: Hoare triple {755#true} assume true; {755#true} is VALID [2018-11-14 15:52:55,749 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {755#true} {755#true} #80#return; {755#true} is VALID [2018-11-14 15:52:55,749 INFO L256 TraceCheckUtils]: 4: Hoare triple {755#true} call #t~ret9 := main(); {755#true} is VALID [2018-11-14 15:52:55,751 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 15:52:55,752 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 15:52:55,753 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 15:52:55,755 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 15:52:55,756 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 15:52:55,757 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 15:52:55,760 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 15:52:55,760 INFO L273 TraceCheckUtils]: 12: Hoare triple {756#false} havoc ~x~0; {756#false} is VALID [2018-11-14 15:52:55,761 INFO L273 TraceCheckUtils]: 13: Hoare triple {756#false} assume ~rv~0 != 0bv32;~x~0 := 0bv32; {756#false} is VALID [2018-11-14 15:52:55,761 INFO L273 TraceCheckUtils]: 14: Hoare triple {756#false} assume true; {756#false} is VALID [2018-11-14 15:52:55,762 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 15:52:55,762 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 15:52:55,763 INFO L273 TraceCheckUtils]: 17: Hoare triple {756#false} ~cond := #in~cond; {756#false} is VALID [2018-11-14 15:52:55,763 INFO L273 TraceCheckUtils]: 18: Hoare triple {756#false} assume ~cond == 0bv32; {756#false} is VALID [2018-11-14 15:52:55,763 INFO L273 TraceCheckUtils]: 19: Hoare triple {756#false} assume !false; {756#false} is VALID [2018-11-14 15:52:55,764 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 15:52:55,765 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:52:55,857 INFO L273 TraceCheckUtils]: 19: Hoare triple {756#false} assume !false; {756#false} is VALID [2018-11-14 15:52:55,858 INFO L273 TraceCheckUtils]: 18: Hoare triple {756#false} assume ~cond == 0bv32; {756#false} is VALID [2018-11-14 15:52:55,858 INFO L273 TraceCheckUtils]: 17: Hoare triple {756#false} ~cond := #in~cond; {756#false} is VALID [2018-11-14 15:52:55,858 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 15:52:55,858 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 15:52:55,859 INFO L273 TraceCheckUtils]: 14: Hoare triple {756#false} assume true; {756#false} is VALID [2018-11-14 15:52:55,859 INFO L273 TraceCheckUtils]: 13: Hoare triple {756#false} assume ~rv~0 != 0bv32;~x~0 := 0bv32; {756#false} is VALID [2018-11-14 15:52:55,859 INFO L273 TraceCheckUtils]: 12: Hoare triple {756#false} havoc ~x~0; {756#false} is VALID [2018-11-14 15:52:55,861 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 15:52:55,861 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 15:52:55,862 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 15:52:55,863 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 15:52:55,863 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 15:52:55,865 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 15:52:55,867 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 15:52:55,867 INFO L256 TraceCheckUtils]: 4: Hoare triple {755#true} call #t~ret9 := main(); {755#true} is VALID [2018-11-14 15:52:55,867 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {755#true} {755#true} #80#return; {755#true} is VALID [2018-11-14 15:52:55,868 INFO L273 TraceCheckUtils]: 2: Hoare triple {755#true} assume true; {755#true} is VALID [2018-11-14 15:52:55,868 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 15:52:55,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {755#true} call ULTIMATE.init(); {755#true} is VALID [2018-11-14 15:52:55,869 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 15:52:55,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:52:55,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 15:52:55,871 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-14 15:52:55,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:52:55,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 15:52:55,910 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 15:52:55,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 15:52:55,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 15:52:55,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 15:52:55,910 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 6 states. [2018-11-14 15:52:56,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:56,221 INFO L93 Difference]: Finished difference Result 81 states and 102 transitions. [2018-11-14 15:52:56,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 15:52:56,221 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-14 15:52:56,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:52:56,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 15:52:56,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2018-11-14 15:52:56,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 15:52:56,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2018-11-14 15:52:56,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 76 transitions. [2018-11-14 15:52:56,349 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 15:52:56,352 INFO L225 Difference]: With dead ends: 81 [2018-11-14 15:52:56,352 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 15:52:56,353 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 15:52:56,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 15:52:56,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2018-11-14 15:52:56,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:52:56,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 60 states. [2018-11-14 15:52:56,396 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-14 15:52:56,397 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-14 15:52:56,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:56,401 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-11-14 15:52:56,402 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-11-14 15:52:56,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:52:56,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:52:56,403 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 60 states. [2018-11-14 15:52:56,403 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 60 states. [2018-11-14 15:52:56,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:56,407 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-11-14 15:52:56,407 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-11-14 15:52:56,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:52:56,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:52:56,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:52:56,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:52:56,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-14 15:52:56,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2018-11-14 15:52:56,412 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 20 [2018-11-14 15:52:56,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:52:56,412 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2018-11-14 15:52:56,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 15:52:56,413 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2018-11-14 15:52:56,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 15:52:56,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:52:56,414 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 15:52:56,414 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:52:56,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:52:56,415 INFO L82 PathProgramCache]: Analyzing trace with hash 181224948, now seen corresponding path program 2 times [2018-11-14 15:52:56,415 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:52:56,415 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 15:52:56,449 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 15:52:56,528 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 15:52:56,529 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 15:52:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:52:56,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:52:56,702 INFO L256 TraceCheckUtils]: 0: Hoare triple {1184#true} call ULTIMATE.init(); {1184#true} is VALID [2018-11-14 15:52:56,703 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 15:52:56,703 INFO L273 TraceCheckUtils]: 2: Hoare triple {1184#true} assume true; {1184#true} is VALID [2018-11-14 15:52:56,704 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1184#true} {1184#true} #80#return; {1184#true} is VALID [2018-11-14 15:52:56,704 INFO L256 TraceCheckUtils]: 4: Hoare triple {1184#true} call #t~ret9 := main(); {1184#true} is VALID [2018-11-14 15:52:56,705 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 15:52:56,705 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 15:52:56,706 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 15:52:56,706 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 15:52:56,707 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 15:52:56,708 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 15:52:56,709 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 15:52:56,710 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 15:52:56,711 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 15:52:56,712 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 15:52:56,717 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 15:52:56,718 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 15:52:56,719 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 15:52:56,720 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 15:52:56,720 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 15:52:56,721 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 15:52:56,722 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 15:52:56,723 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 15:52:56,724 INFO L273 TraceCheckUtils]: 23: Hoare triple {1256#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {1185#false} is VALID [2018-11-14 15:52:56,724 INFO L273 TraceCheckUtils]: 24: Hoare triple {1185#false} havoc ~x~0; {1185#false} is VALID [2018-11-14 15:52:56,725 INFO L273 TraceCheckUtils]: 25: Hoare triple {1185#false} assume ~rv~0 != 0bv32;~x~0 := 0bv32; {1185#false} is VALID [2018-11-14 15:52:56,725 INFO L273 TraceCheckUtils]: 26: Hoare triple {1185#false} assume true; {1185#false} is VALID [2018-11-14 15:52:56,726 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 15:52:56,726 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 15:52:56,726 INFO L273 TraceCheckUtils]: 29: Hoare triple {1185#false} ~cond := #in~cond; {1185#false} is VALID [2018-11-14 15:52:56,727 INFO L273 TraceCheckUtils]: 30: Hoare triple {1185#false} assume ~cond == 0bv32; {1185#false} is VALID [2018-11-14 15:52:56,727 INFO L273 TraceCheckUtils]: 31: Hoare triple {1185#false} assume !false; {1185#false} is VALID [2018-11-14 15:52:56,730 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 15:52:56,730 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:52:57,064 INFO L273 TraceCheckUtils]: 31: Hoare triple {1185#false} assume !false; {1185#false} is VALID [2018-11-14 15:52:57,065 INFO L273 TraceCheckUtils]: 30: Hoare triple {1185#false} assume ~cond == 0bv32; {1185#false} is VALID [2018-11-14 15:52:57,065 INFO L273 TraceCheckUtils]: 29: Hoare triple {1185#false} ~cond := #in~cond; {1185#false} is VALID [2018-11-14 15:52:57,066 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 15:52:57,066 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 15:52:57,066 INFO L273 TraceCheckUtils]: 26: Hoare triple {1185#false} assume true; {1185#false} is VALID [2018-11-14 15:52:57,067 INFO L273 TraceCheckUtils]: 25: Hoare triple {1185#false} assume ~rv~0 != 0bv32;~x~0 := 0bv32; {1185#false} is VALID [2018-11-14 15:52:57,067 INFO L273 TraceCheckUtils]: 24: Hoare triple {1185#false} havoc ~x~0; {1185#false} is VALID [2018-11-14 15:52:57,067 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 15:52:57,068 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 15:52:57,069 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 15:52:57,069 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 15:52:57,069 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 15:52:57,070 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 15:52:57,078 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 15:52:57,079 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 15:52:57,080 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 15:52:57,080 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 15:52:57,087 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 15:52:57,088 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 15:52:57,089 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 15:52:57,091 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 15:52:57,098 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 15:52:57,098 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 15:52:57,099 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 15:52:57,099 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 15:52:57,100 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 15:52:57,101 INFO L256 TraceCheckUtils]: 4: Hoare triple {1184#true} call #t~ret9 := main(); {1184#true} is VALID [2018-11-14 15:52:57,101 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1184#true} {1184#true} #80#return; {1184#true} is VALID [2018-11-14 15:52:57,102 INFO L273 TraceCheckUtils]: 2: Hoare triple {1184#true} assume true; {1184#true} is VALID [2018-11-14 15:52:57,102 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 15:52:57,102 INFO L256 TraceCheckUtils]: 0: Hoare triple {1184#true} call ULTIMATE.init(); {1184#true} is VALID [2018-11-14 15:52:57,105 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 15:52:57,114 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:52:57,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 15:52:57,115 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-11-14 15:52:57,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:52:57,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 15:52:57,275 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 15:52:57,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 15:52:57,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 15:52:57,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-14 15:52:57,276 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand 12 states. [2018-11-14 15:52:58,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:58,413 INFO L93 Difference]: Finished difference Result 129 states and 168 transitions. [2018-11-14 15:52:58,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 15:52:58,414 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 32 [2018-11-14 15:52:58,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:52:58,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 15:52:58,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2018-11-14 15:52:58,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 15:52:58,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2018-11-14 15:52:58,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 109 transitions. [2018-11-14 15:52:58,641 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 15:52:58,644 INFO L225 Difference]: With dead ends: 129 [2018-11-14 15:52:58,644 INFO L226 Difference]: Without dead ends: 108 [2018-11-14 15:52:58,645 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 15:52:58,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-11-14 15:52:58,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2018-11-14 15:52:58,693 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:52:58,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 108 states. Second operand 108 states. [2018-11-14 15:52:58,694 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 108 states. [2018-11-14 15:52:58,694 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 108 states. [2018-11-14 15:52:58,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:58,699 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2018-11-14 15:52:58,700 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2018-11-14 15:52:58,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:52:58,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:52:58,701 INFO L74 IsIncluded]: Start isIncluded. First operand 108 states. Second operand 108 states. [2018-11-14 15:52:58,701 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 108 states. [2018-11-14 15:52:58,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:58,706 INFO L93 Difference]: Finished difference Result 108 states and 132 transitions. [2018-11-14 15:52:58,706 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2018-11-14 15:52:58,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:52:58,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:52:58,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:52:58,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:52:58,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-11-14 15:52:58,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 132 transitions. [2018-11-14 15:52:58,712 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 132 transitions. Word has length 32 [2018-11-14 15:52:58,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:52:58,712 INFO L480 AbstractCegarLoop]: Abstraction has 108 states and 132 transitions. [2018-11-14 15:52:58,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 15:52:58,713 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 132 transitions. [2018-11-14 15:52:58,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-14 15:52:58,714 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:52:58,714 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 15:52:58,715 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:52:58,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:52:58,715 INFO L82 PathProgramCache]: Analyzing trace with hash -1357788188, now seen corresponding path program 3 times [2018-11-14 15:52:58,716 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:52:58,716 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 15:52:58,740 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 15:52:59,969 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-14 15:52:59,969 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 15:53:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:53:00,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:53:00,383 INFO L256 TraceCheckUtils]: 0: Hoare triple {1913#true} call ULTIMATE.init(); {1913#true} is VALID [2018-11-14 15:53:00,383 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 15:53:00,384 INFO L273 TraceCheckUtils]: 2: Hoare triple {1913#true} assume true; {1913#true} is VALID [2018-11-14 15:53:00,384 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1913#true} {1913#true} #80#return; {1913#true} is VALID [2018-11-14 15:53:00,384 INFO L256 TraceCheckUtils]: 4: Hoare triple {1913#true} call #t~ret9 := main(); {1913#true} is VALID [2018-11-14 15:53:00,385 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 15:53:00,385 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 15:53:00,386 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 15:53:00,386 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 15:53:00,387 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 15:53:00,387 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 15:53:00,388 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 15:53:00,388 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 15:53:00,389 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 15:53:00,389 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 15:53:00,390 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 15:53:00,391 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 15:53:00,392 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 15:53:00,393 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 15:53:00,393 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 15:53:00,394 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 15:53:00,395 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 15:53:00,396 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 15:53:00,397 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 15:53:00,397 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 15:53:00,398 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 15:53:00,399 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 15:53:00,400 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 15:53:00,401 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 15:53:00,402 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 15:53:00,402 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 15:53:00,403 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 15:53:00,404 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 15:53:00,405 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 15:53:00,406 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 15:53:00,406 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 15:53:00,407 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 15:53:00,413 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 15:53:00,413 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 15:53:00,414 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 15:53:00,414 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 15:53:00,415 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 15:53:00,416 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 15:53:00,416 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 15:53:00,417 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 15:53:00,418 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 15:53:00,419 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 15:53:00,420 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 15:53:00,420 INFO L273 TraceCheckUtils]: 48: Hoare triple {1914#false} havoc ~x~0; {1914#false} is VALID [2018-11-14 15:53:00,421 INFO L273 TraceCheckUtils]: 49: Hoare triple {1914#false} assume ~rv~0 != 0bv32;~x~0 := 0bv32; {1914#false} is VALID [2018-11-14 15:53:00,421 INFO L273 TraceCheckUtils]: 50: Hoare triple {1914#false} assume true; {1914#false} is VALID [2018-11-14 15:53:00,421 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 15:53:00,422 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 15:53:00,422 INFO L273 TraceCheckUtils]: 53: Hoare triple {1914#false} ~cond := #in~cond; {1914#false} is VALID [2018-11-14 15:53:00,423 INFO L273 TraceCheckUtils]: 54: Hoare triple {1914#false} assume ~cond == 0bv32; {1914#false} is VALID [2018-11-14 15:53:00,423 INFO L273 TraceCheckUtils]: 55: Hoare triple {1914#false} assume !false; {1914#false} is VALID [2018-11-14 15:53:00,430 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 15:53:00,430 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:53:01,044 INFO L273 TraceCheckUtils]: 55: Hoare triple {1914#false} assume !false; {1914#false} is VALID [2018-11-14 15:53:01,045 INFO L273 TraceCheckUtils]: 54: Hoare triple {1914#false} assume ~cond == 0bv32; {1914#false} is VALID [2018-11-14 15:53:01,045 INFO L273 TraceCheckUtils]: 53: Hoare triple {1914#false} ~cond := #in~cond; {1914#false} is VALID [2018-11-14 15:53:01,045 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 15:53:01,045 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 15:53:01,045 INFO L273 TraceCheckUtils]: 50: Hoare triple {1914#false} assume true; {1914#false} is VALID [2018-11-14 15:53:01,046 INFO L273 TraceCheckUtils]: 49: Hoare triple {1914#false} assume ~rv~0 != 0bv32;~x~0 := 0bv32; {1914#false} is VALID [2018-11-14 15:53:01,046 INFO L273 TraceCheckUtils]: 48: Hoare triple {1914#false} havoc ~x~0; {1914#false} is VALID [2018-11-14 15:53:01,047 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 15:53:01,047 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 15:53:01,048 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 15:53:01,048 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 15:53:01,049 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 15:53:01,050 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 15:53:01,057 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 15:53:01,058 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 15:53:01,058 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 15:53:01,059 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 15:53:01,066 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 15:53:01,066 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 15:53:01,067 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 15:53:01,068 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 15:53:01,074 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 15:53:01,075 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 15:53:01,075 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 15:53:01,076 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 15:53:01,084 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 15:53:01,085 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 15:53:01,085 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 15:53:01,086 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 15:53:01,093 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 15:53:01,094 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 15:53:01,094 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 15:53:01,095 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 15:53:01,103 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 15:53:01,104 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 15:53:01,104 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 15:53:01,105 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 15:53:01,114 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 15:53:01,115 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 15:53:01,116 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 15:53:01,117 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 15:53:01,126 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 15:53:01,128 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 15:53:01,132 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 15:53:01,133 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 15:53:01,141 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 15:53:01,141 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 15:53:01,142 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 15:53:01,142 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 15:53:01,143 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 15:53:01,144 INFO L256 TraceCheckUtils]: 4: Hoare triple {1913#true} call #t~ret9 := main(); {1913#true} is VALID [2018-11-14 15:53:01,144 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1913#true} {1913#true} #80#return; {1913#true} is VALID [2018-11-14 15:53:01,144 INFO L273 TraceCheckUtils]: 2: Hoare triple {1913#true} assume true; {1913#true} is VALID [2018-11-14 15:53:01,145 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 15:53:01,145 INFO L256 TraceCheckUtils]: 0: Hoare triple {1913#true} call ULTIMATE.init(); {1913#true} is VALID [2018-11-14 15:53:01,151 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 15:53:01,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:53:01,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-14 15:53:01,155 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2018-11-14 15:53:01,156 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:53:01,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 15:53:01,386 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 15:53:01,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 15:53:01,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 15:53:01,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-14 15:53:01,388 INFO L87 Difference]: Start difference. First operand 108 states and 132 transitions. Second operand 24 states. [2018-11-14 15:53:06,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:53:06,362 INFO L93 Difference]: Finished difference Result 225 states and 300 transitions. [2018-11-14 15:53:06,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 15:53:06,362 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 56 [2018-11-14 15:53:06,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:53:06,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 15:53:06,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 175 transitions. [2018-11-14 15:53:06,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 15:53:06,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 175 transitions. [2018-11-14 15:53:06,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 175 transitions. [2018-11-14 15:53:06,664 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 15:53:06,669 INFO L225 Difference]: With dead ends: 225 [2018-11-14 15:53:06,669 INFO L226 Difference]: Without dead ends: 204 [2018-11-14 15:53:06,670 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 89 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-14 15:53:06,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-11-14 15:53:06,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2018-11-14 15:53:06,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:53:06,768 INFO L82 GeneralOperation]: Start isEquivalent. First operand 204 states. Second operand 204 states. [2018-11-14 15:53:06,768 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand 204 states. [2018-11-14 15:53:06,768 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 204 states. [2018-11-14 15:53:06,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:53:06,776 INFO L93 Difference]: Finished difference Result 204 states and 252 transitions. [2018-11-14 15:53:06,776 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 252 transitions. [2018-11-14 15:53:06,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:53:06,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:53:06,777 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand 204 states. [2018-11-14 15:53:06,777 INFO L87 Difference]: Start difference. First operand 204 states. Second operand 204 states. [2018-11-14 15:53:06,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:53:06,785 INFO L93 Difference]: Finished difference Result 204 states and 252 transitions. [2018-11-14 15:53:06,786 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 252 transitions. [2018-11-14 15:53:06,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:53:06,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:53:06,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:53:06,787 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:53:06,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-11-14 15:53:06,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 252 transitions. [2018-11-14 15:53:06,794 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 252 transitions. Word has length 56 [2018-11-14 15:53:06,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:53:06,795 INFO L480 AbstractCegarLoop]: Abstraction has 204 states and 252 transitions. [2018-11-14 15:53:06,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 15:53:06,795 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 252 transitions. [2018-11-14 15:53:06,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-14 15:53:06,797 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:53:06,798 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 15:53:06,798 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:53:06,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:53:06,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1726375876, now seen corresponding path program 4 times [2018-11-14 15:53:06,799 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:53:06,799 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 15:53:06,818 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 15:53:06,962 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 15:53:06,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 15:53:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:53:07,023 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:53:07,781 INFO L256 TraceCheckUtils]: 0: Hoare triple {3242#true} call ULTIMATE.init(); {3242#true} is VALID [2018-11-14 15:53:07,782 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 15:53:07,782 INFO L273 TraceCheckUtils]: 2: Hoare triple {3242#true} assume true; {3242#true} is VALID [2018-11-14 15:53:07,782 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3242#true} {3242#true} #80#return; {3242#true} is VALID [2018-11-14 15:53:07,782 INFO L256 TraceCheckUtils]: 4: Hoare triple {3242#true} call #t~ret9 := main(); {3242#true} is VALID [2018-11-14 15:53:07,782 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 15:53:07,783 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 15:53:07,783 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 15:53:07,784 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 15:53:07,784 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 15:53:07,784 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 15:53:07,785 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 15:53:07,785 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 15:53:07,786 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 15:53:07,786 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 15:53:07,787 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 15:53:07,788 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 15:53:07,789 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 15:53:07,789 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 15:53:07,790 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 15:53:07,790 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 15:53:07,791 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 15:53:07,792 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 15:53:07,792 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 15:53:07,793 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 15:53:07,794 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 15:53:07,795 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 15:53:07,796 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 15:53:07,798 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 15:53:07,800 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 15:53:07,800 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 15:53:07,800 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 15:53:07,801 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 15:53:07,801 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 15:53:07,802 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 15:53:07,802 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 15:53:07,802 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 15:53:07,803 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 15:53:07,804 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 15:53:07,804 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 15:53:07,807 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 15:53:07,808 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 15:53:07,808 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 15:53:07,808 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 15:53:07,809 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 15:53:07,809 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 15:53:07,810 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 15:53:07,810 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 15:53:07,810 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 15:53:07,811 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 15:53:07,811 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 15:53:07,811 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 15:53:07,812 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 15:53:07,813 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 15:53:07,814 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 15:53:07,814 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 15:53:07,815 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 15:53:07,816 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 15:53:07,816 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 15:53:07,817 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 15:53:07,817 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 15:53:07,819 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 15:53:07,820 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 15:53:07,821 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 15:53:07,821 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 15:53:07,821 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 15:53:07,822 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 15:53:07,822 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 15:53:07,823 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 15:53:07,823 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 15:53:07,824 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 15:53:07,825 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 15:53:07,825 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 15:53:07,827 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 15:53:07,828 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 15:53:07,828 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 15:53:07,829 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 15:53:07,830 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 15:53:07,838 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 15:53:07,838 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 15:53:07,839 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 15:53:07,839 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 15:53:07,845 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 15:53:07,845 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 15:53:07,846 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 15:53:07,846 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 15:53:07,847 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 15:53:07,847 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 15:53:07,847 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 15:53:07,848 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 15:53:07,849 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 15:53:07,849 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 15:53:07,850 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 15:53:07,850 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 15:53:07,851 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 15:53:07,852 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 15:53:07,852 INFO L273 TraceCheckUtils]: 96: Hoare triple {3243#false} havoc ~x~0; {3243#false} is VALID [2018-11-14 15:53:07,852 INFO L273 TraceCheckUtils]: 97: Hoare triple {3243#false} assume ~rv~0 != 0bv32;~x~0 := 0bv32; {3243#false} is VALID [2018-11-14 15:53:07,853 INFO L273 TraceCheckUtils]: 98: Hoare triple {3243#false} assume true; {3243#false} is VALID [2018-11-14 15:53:07,853 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 15:53:07,853 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 15:53:07,853 INFO L273 TraceCheckUtils]: 101: Hoare triple {3243#false} ~cond := #in~cond; {3243#false} is VALID [2018-11-14 15:53:07,854 INFO L273 TraceCheckUtils]: 102: Hoare triple {3243#false} assume ~cond == 0bv32; {3243#false} is VALID [2018-11-14 15:53:07,854 INFO L273 TraceCheckUtils]: 103: Hoare triple {3243#false} assume !false; {3243#false} is VALID [2018-11-14 15:53:07,865 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 15:53:07,866 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:53:09,659 INFO L273 TraceCheckUtils]: 103: Hoare triple {3243#false} assume !false; {3243#false} is VALID [2018-11-14 15:53:09,660 INFO L273 TraceCheckUtils]: 102: Hoare triple {3243#false} assume ~cond == 0bv32; {3243#false} is VALID [2018-11-14 15:53:09,660 INFO L273 TraceCheckUtils]: 101: Hoare triple {3243#false} ~cond := #in~cond; {3243#false} is VALID [2018-11-14 15:53:09,660 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 15:53:09,660 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 15:53:09,660 INFO L273 TraceCheckUtils]: 98: Hoare triple {3243#false} assume true; {3243#false} is VALID [2018-11-14 15:53:09,661 INFO L273 TraceCheckUtils]: 97: Hoare triple {3243#false} assume ~rv~0 != 0bv32;~x~0 := 0bv32; {3243#false} is VALID [2018-11-14 15:53:09,661 INFO L273 TraceCheckUtils]: 96: Hoare triple {3243#false} havoc ~x~0; {3243#false} is VALID [2018-11-14 15:53:09,663 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 15:53:09,664 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 15:53:09,664 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 15:53:09,665 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 15:53:09,665 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 15:53:09,673 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 15:53:09,679 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 15:53:09,679 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 15:53:09,679 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 15:53:09,680 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 15:53:09,686 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 15:53:09,687 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 15:53:09,687 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 15:53:09,687 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 15:53:09,694 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 15:53:09,694 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 15:53:09,694 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 15:53:09,695 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 15:53:09,703 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 15:53:09,704 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 15:53:09,704 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 15:53:09,704 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 15:53:09,713 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 15:53:09,714 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 15:53:09,714 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 15:53:09,715 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 15:53:09,723 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 15:53:09,723 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 15:53:09,724 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 15:53:09,724 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 15:53:09,733 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 15:53:09,734 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 15:53:09,734 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 15:53:09,735 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 15:53:09,741 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 15:53:09,742 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 15:53:09,742 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 15:53:09,743 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 15:53:09,749 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 15:53:09,750 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 15:53:09,750 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 15:53:09,751 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 15:53:09,758 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 15:53:09,758 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 15:53:09,759 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 15:53:09,759 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 15:53:09,765 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 15:53:09,765 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 15:53:09,766 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 15:53:09,766 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 15:53:09,774 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 15:53:09,774 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 15:53:09,774 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 15:53:09,775 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 15:53:09,780 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 15:53:09,780 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 15:53:09,781 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 15:53:09,781 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 15:53:09,789 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 15:53:09,789 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 15:53:09,789 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 15:53:09,795 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 15:53:09,802 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 15:53:09,803 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 15:53:09,803 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 15:53:09,804 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 15:53:09,810 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 15:53:09,811 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 15:53:09,811 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 15:53:09,811 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 15:53:09,818 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 15:53:09,819 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 15:53:09,819 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 15:53:09,819 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 15:53:09,825 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 15:53:09,826 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 15:53:09,826 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 15:53:09,826 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 15:53:09,833 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 15:53:09,833 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 15:53:09,834 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 15:53:09,834 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 15:53:09,843 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 15:53:09,843 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 15:53:09,843 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 15:53:09,844 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 15:53:09,853 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 15:53:09,853 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 15:53:09,854 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 15:53:09,854 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 15:53:09,855 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 15:53:09,855 INFO L256 TraceCheckUtils]: 4: Hoare triple {3242#true} call #t~ret9 := main(); {3242#true} is VALID [2018-11-14 15:53:09,855 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3242#true} {3242#true} #80#return; {3242#true} is VALID [2018-11-14 15:53:09,855 INFO L273 TraceCheckUtils]: 2: Hoare triple {3242#true} assume true; {3242#true} is VALID [2018-11-14 15:53:09,855 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 15:53:09,855 INFO L256 TraceCheckUtils]: 0: Hoare triple {3242#true} call ULTIMATE.init(); {3242#true} is VALID [2018-11-14 15:53:09,868 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 15:53:09,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:53:09,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-14 15:53:09,871 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 104 [2018-11-14 15:53:09,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:53:09,873 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-14 15:53:10,411 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 15:53:10,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-14 15:53:10,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-14 15:53:10,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-14 15:53:10,414 INFO L87 Difference]: Start difference. First operand 204 states and 252 transitions. Second operand 48 states. [2018-11-14 15:53:20,141 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-14 15:53:20,699 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-14 15:53:21,293 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-14 15:53:21,916 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-14 15:53:22,509 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-14 15:53:23,138 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-14 15:53:23,742 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-14 15:53:24,366 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-14 15:53:31,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:53:31,817 INFO L93 Difference]: Finished difference Result 417 states and 564 transitions. [2018-11-14 15:53:31,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-14 15:53:31,818 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 104 [2018-11-14 15:53:31,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:53:31,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 15:53:31,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 307 transitions. [2018-11-14 15:53:31,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 15:53:31,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 307 transitions. [2018-11-14 15:53:31,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 307 transitions. [2018-11-14 15:53:32,504 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 15:53:32,516 INFO L225 Difference]: With dead ends: 417 [2018-11-14 15:53:32,516 INFO L226 Difference]: Without dead ends: 396 [2018-11-14 15:53:32,519 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-14 15:53:32,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-11-14 15:53:33,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2018-11-14 15:53:33,211 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:53:33,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 396 states. Second operand 396 states. [2018-11-14 15:53:33,211 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand 396 states. [2018-11-14 15:53:33,211 INFO L87 Difference]: Start difference. First operand 396 states. Second operand 396 states. [2018-11-14 15:53:33,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:53:33,230 INFO L93 Difference]: Finished difference Result 396 states and 492 transitions. [2018-11-14 15:53:33,230 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 492 transitions. [2018-11-14 15:53:33,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:53:33,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:53:33,232 INFO L74 IsIncluded]: Start isIncluded. First operand 396 states. Second operand 396 states. [2018-11-14 15:53:33,232 INFO L87 Difference]: Start difference. First operand 396 states. Second operand 396 states. [2018-11-14 15:53:33,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:53:33,266 INFO L93 Difference]: Finished difference Result 396 states and 492 transitions. [2018-11-14 15:53:33,267 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 492 transitions. [2018-11-14 15:53:33,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:53:33,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:53:33,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:53:33,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:53:33,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-11-14 15:53:33,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 492 transitions. [2018-11-14 15:53:33,285 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 492 transitions. Word has length 104 [2018-11-14 15:53:33,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:53:33,285 INFO L480 AbstractCegarLoop]: Abstraction has 396 states and 492 transitions. [2018-11-14 15:53:33,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-14 15:53:33,285 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 492 transitions. [2018-11-14 15:53:33,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-11-14 15:53:33,290 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:53:33,290 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 15:53:33,290 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:53:33,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:53:33,291 INFO L82 PathProgramCache]: Analyzing trace with hash 66969476, now seen corresponding path program 5 times [2018-11-14 15:53:33,292 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:53:33,292 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 15:53:33,323 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1