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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-multidimensional/copy-partial-2-n-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:44:03,687 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:44:03,690 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:44:03,702 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:44:03,703 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:44:03,704 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:44:03,705 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:44:03,707 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:44:03,709 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:44:03,710 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:44:03,711 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:44:03,711 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:44:03,712 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:44:03,713 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:44:03,714 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:44:03,717 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:44:03,718 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:44:03,723 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:44:03,725 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:44:03,729 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:44:03,731 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:44:03,733 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:44:03,736 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:44:03,736 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:44:03,736 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:44:03,737 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:44:03,739 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:44:03,739 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:44:03,740 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:44:03,744 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:44:03,745 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:44:03,745 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:44:03,747 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:44:03,747 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:44:03,748 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:44:03,750 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:44:03,751 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-23 10:44:03,775 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:44:03,776 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:44:03,777 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:44:03,777 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:44:03,778 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:44:03,778 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:44:03,778 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:44:03,781 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:44:03,781 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:44:03,782 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:44:03,782 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:44:03,782 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:44:03,782 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:44:03,782 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:44:03,783 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:44:03,783 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:44:03,783 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:44:03,783 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:44:03,783 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:44:03,784 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:44:03,784 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:44:03,784 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:44:03,784 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:44:03,784 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:44:03,786 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:44:03,786 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:44:03,786 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:44:03,786 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:44:03,787 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:44:03,787 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:44:03,787 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:44:03,787 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:44:03,787 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:44:03,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:44:03,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:44:03,879 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:44:03,880 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:44:03,881 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:44:03,882 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/copy-partial-2-n-u_true-unreach-call.i [2018-11-23 10:44:03,944 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/885bb212a/d5728d2ab17b4bdc908876c046976e71/FLAG719620417 [2018-11-23 10:44:04,403 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:44:04,404 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/copy-partial-2-n-u_true-unreach-call.i [2018-11-23 10:44:04,411 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/885bb212a/d5728d2ab17b4bdc908876c046976e71/FLAG719620417 [2018-11-23 10:44:04,776 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/885bb212a/d5728d2ab17b4bdc908876c046976e71 [2018-11-23 10:44:04,789 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:44:04,790 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:44:04,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:44:04,792 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:44:04,797 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:44:04,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:44:04" (1/1) ... [2018-11-23 10:44:04,802 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@506d41ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:44:04, skipping insertion in model container [2018-11-23 10:44:04,803 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:44:04" (1/1) ... [2018-11-23 10:44:04,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:44:04,844 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:44:05,089 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:44:05,096 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:44:05,141 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:44:05,167 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:44:05,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:44:05 WrapperNode [2018-11-23 10:44:05,168 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:44:05,169 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:44:05,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:44:05,169 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:44:05,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:44:05" (1/1) ... [2018-11-23 10:44:05,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:44:05" (1/1) ... [2018-11-23 10:44:05,196 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:44:05,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:44:05,196 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:44:05,197 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:44:05,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:44:05" (1/1) ... [2018-11-23 10:44:05,205 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:44:05" (1/1) ... [2018-11-23 10:44:05,208 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:44:05" (1/1) ... [2018-11-23 10:44:05,208 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:44:05" (1/1) ... [2018-11-23 10:44:05,234 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:44:05" (1/1) ... [2018-11-23 10:44:05,242 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:44:05" (1/1) ... [2018-11-23 10:44:05,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:44:05" (1/1) ... [2018-11-23 10:44:05,247 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:44:05,248 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:44:05,248 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:44:05,248 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:44:05,249 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:44:05" (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-23 10:44:05,369 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:44:05,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:44:05,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:44:05,370 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:44:05,370 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:44:05,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:44:05,370 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:44:05,370 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:44:05,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:44:05,371 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:44:05,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:44:05,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:44:06,047 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:44:06,048 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 10:44:06,048 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:44:06 BoogieIcfgContainer [2018-11-23 10:44:06,049 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:44:06,050 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:44:06,050 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:44:06,053 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:44:06,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:44:04" (1/3) ... [2018-11-23 10:44:06,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@310714a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:44:06, skipping insertion in model container [2018-11-23 10:44:06,055 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:44:05" (2/3) ... [2018-11-23 10:44:06,055 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@310714a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:44:06, skipping insertion in model container [2018-11-23 10:44:06,056 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:44:06" (3/3) ... [2018-11-23 10:44:06,058 INFO L112 eAbstractionObserver]: Analyzing ICFG copy-partial-2-n-u_true-unreach-call.i [2018-11-23 10:44:06,067 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:44:06,074 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:44:06,094 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:44:06,127 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:44:06,128 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:44:06,128 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:44:06,128 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:44:06,129 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:44:06,129 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:44:06,129 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:44:06,129 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:44:06,130 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:44:06,147 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-23 10:44:06,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 10:44:06,153 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:44:06,154 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:44:06,156 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:44:06,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:44:06,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1035913628, now seen corresponding path program 1 times [2018-11-23 10:44:06,166 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:44:06,167 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-23 10:44:06,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:44:06,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:44:06,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:44:06,303 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:44:06,500 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-23 10:44:06,504 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {33#true} is VALID [2018-11-23 10:44:06,504 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-23 10:44:06,505 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #99#return; {33#true} is VALID [2018-11-23 10:44:06,505 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret5 := main(); {33#true} is VALID [2018-11-23 10:44:06,519 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~q~0 := 500bv32;~s~0 := 700bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));assume 0bv32 != (if ~bvslt32(~q~0, ~m~0) then 1bv32 else 0bv32);assume 0bv32 != (if ~bvslt32(~s~0, ~n~0) then 1bv32 else 0bv32);~i~0 := 0bv32;~j~0 := 0bv32; {53#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:44:06,528 INFO L273 TraceCheckUtils]: 6: Hoare triple {53#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !~bvslt32(~i~0, ~m~0); {34#false} is VALID [2018-11-23 10:44:06,529 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#false} ~i~0 := 0bv32;~j~0 := 0bv32; {34#false} is VALID [2018-11-23 10:44:06,529 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#false} assume !~bvslt32(~i~0, ~q~0); {34#false} is VALID [2018-11-23 10:44:06,529 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} ~i~0 := 0bv32;~j~0 := 0bv32; {34#false} is VALID [2018-11-23 10:44:06,530 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} assume !!~bvslt32(~i~0, ~q~0);~j~0 := 0bv32; {34#false} is VALID [2018-11-23 10:44:06,530 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#false} assume !!~bvslt32(~j~0, ~s~0);call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32); {34#false} is VALID [2018-11-23 10:44:06,530 INFO L256 TraceCheckUtils]: 12: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1bv32 else 0bv32)); {34#false} is VALID [2018-11-23 10:44:06,531 INFO L273 TraceCheckUtils]: 13: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-23 10:44:06,531 INFO L273 TraceCheckUtils]: 14: Hoare triple {34#false} assume 0bv32 == ~cond; {34#false} is VALID [2018-11-23 10:44:06,531 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-23 10:44:06,535 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-23 10:44:06,535 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:44:06,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:44:06,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:44:06,544 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 10:44:06,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:44:06,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:44:06,738 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-23 10:44:06,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:44:06,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:44:06,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:44:06,749 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2018-11-23 10:44:07,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:44:07,281 INFO L93 Difference]: Finished difference Result 57 states and 86 transitions. [2018-11-23 10:44:07,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:44:07,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 10:44:07,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:44:07,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:44:07,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2018-11-23 10:44:07,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:44:07,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 86 transitions. [2018-11-23 10:44:07,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 86 transitions. [2018-11-23 10:44:07,764 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:44:07,780 INFO L225 Difference]: With dead ends: 57 [2018-11-23 10:44:07,781 INFO L226 Difference]: Without dead ends: 28 [2018-11-23 10:44:07,788 INFO L631 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-23 10:44:07,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-11-23 10:44:07,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2018-11-23 10:44:07,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:44:07,962 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 26 states. [2018-11-23 10:44:07,962 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 26 states. [2018-11-23 10:44:07,962 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 26 states. [2018-11-23 10:44:07,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:44:07,967 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-11-23 10:44:07,967 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-23 10:44:07,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:44:07,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:44:07,969 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 28 states. [2018-11-23 10:44:07,969 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 28 states. [2018-11-23 10:44:07,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:44:07,973 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2018-11-23 10:44:07,974 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-23 10:44:07,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:44:07,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:44:07,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:44:07,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:44:07,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 10:44:07,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-11-23 10:44:07,980 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 16 [2018-11-23 10:44:07,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:44:07,981 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-23 10:44:07,981 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:44:07,981 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-11-23 10:44:07,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 10:44:07,982 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:44:07,982 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:44:07,982 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:44:07,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:44:07,983 INFO L82 PathProgramCache]: Analyzing trace with hash 573516244, now seen corresponding path program 1 times [2018-11-23 10:44:07,984 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:44:07,984 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-23 10:44:08,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:44:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:44:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:44:08,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:44:08,178 INFO L256 TraceCheckUtils]: 0: Hoare triple {257#true} call ULTIMATE.init(); {257#true} is VALID [2018-11-23 10:44:08,179 INFO L273 TraceCheckUtils]: 1: Hoare triple {257#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {257#true} is VALID [2018-11-23 10:44:08,180 INFO L273 TraceCheckUtils]: 2: Hoare triple {257#true} assume true; {257#true} is VALID [2018-11-23 10:44:08,180 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {257#true} {257#true} #99#return; {257#true} is VALID [2018-11-23 10:44:08,181 INFO L256 TraceCheckUtils]: 4: Hoare triple {257#true} call #t~ret5 := main(); {257#true} is VALID [2018-11-23 10:44:08,183 INFO L273 TraceCheckUtils]: 5: Hoare triple {257#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~q~0 := 500bv32;~s~0 := 700bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));assume 0bv32 != (if ~bvslt32(~q~0, ~m~0) then 1bv32 else 0bv32);assume 0bv32 != (if ~bvslt32(~s~0, ~n~0) then 1bv32 else 0bv32);~i~0 := 0bv32;~j~0 := 0bv32; {277#(= (_ bv1500 32) main_~n~0)} is VALID [2018-11-23 10:44:08,184 INFO L273 TraceCheckUtils]: 6: Hoare triple {277#(= (_ bv1500 32) main_~n~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {281#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:44:08,185 INFO L273 TraceCheckUtils]: 7: Hoare triple {281#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !~bvslt32(~j~0, ~n~0); {258#false} is VALID [2018-11-23 10:44:08,186 INFO L273 TraceCheckUtils]: 8: Hoare triple {258#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {258#false} is VALID [2018-11-23 10:44:08,186 INFO L273 TraceCheckUtils]: 9: Hoare triple {258#false} assume !~bvslt32(~i~0, ~m~0); {258#false} is VALID [2018-11-23 10:44:08,186 INFO L273 TraceCheckUtils]: 10: Hoare triple {258#false} ~i~0 := 0bv32;~j~0 := 0bv32; {258#false} is VALID [2018-11-23 10:44:08,187 INFO L273 TraceCheckUtils]: 11: Hoare triple {258#false} assume !~bvslt32(~i~0, ~q~0); {258#false} is VALID [2018-11-23 10:44:08,187 INFO L273 TraceCheckUtils]: 12: Hoare triple {258#false} ~i~0 := 0bv32;~j~0 := 0bv32; {258#false} is VALID [2018-11-23 10:44:08,188 INFO L273 TraceCheckUtils]: 13: Hoare triple {258#false} assume !!~bvslt32(~i~0, ~q~0);~j~0 := 0bv32; {258#false} is VALID [2018-11-23 10:44:08,188 INFO L273 TraceCheckUtils]: 14: Hoare triple {258#false} assume !!~bvslt32(~j~0, ~s~0);call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32); {258#false} is VALID [2018-11-23 10:44:08,189 INFO L256 TraceCheckUtils]: 15: Hoare triple {258#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1bv32 else 0bv32)); {258#false} is VALID [2018-11-23 10:44:08,189 INFO L273 TraceCheckUtils]: 16: Hoare triple {258#false} ~cond := #in~cond; {258#false} is VALID [2018-11-23 10:44:08,189 INFO L273 TraceCheckUtils]: 17: Hoare triple {258#false} assume 0bv32 == ~cond; {258#false} is VALID [2018-11-23 10:44:08,190 INFO L273 TraceCheckUtils]: 18: Hoare triple {258#false} assume !false; {258#false} is VALID [2018-11-23 10:44:08,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:44:08,192 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:44:08,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:44:08,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 10:44:08,202 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-23 10:44:08,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:44:08,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 10:44:08,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:44:08,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 10:44:08,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 10:44:08,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:44:08,285 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 4 states. [2018-11-23 10:44:08,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:44:08,816 INFO L93 Difference]: Finished difference Result 55 states and 70 transitions. [2018-11-23 10:44:08,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 10:44:08,817 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-23 10:44:08,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:44:08,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:44:08,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2018-11-23 10:44:08,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:44:08,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2018-11-23 10:44:08,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2018-11-23 10:44:09,075 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:44:09,077 INFO L225 Difference]: With dead ends: 55 [2018-11-23 10:44:09,078 INFO L226 Difference]: Without dead ends: 36 [2018-11-23 10:44:09,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:44:09,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-23 10:44:09,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-11-23 10:44:09,159 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:44:09,159 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 27 states. [2018-11-23 10:44:09,159 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 27 states. [2018-11-23 10:44:09,159 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 27 states. [2018-11-23 10:44:09,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:44:09,170 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2018-11-23 10:44:09,170 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2018-11-23 10:44:09,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:44:09,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:44:09,171 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 36 states. [2018-11-23 10:44:09,171 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 36 states. [2018-11-23 10:44:09,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:44:09,176 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2018-11-23 10:44:09,176 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2018-11-23 10:44:09,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:44:09,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:44:09,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:44:09,177 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:44:09,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 10:44:09,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2018-11-23 10:44:09,180 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 19 [2018-11-23 10:44:09,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:44:09,180 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2018-11-23 10:44:09,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 10:44:09,181 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2018-11-23 10:44:09,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 10:44:09,181 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:44:09,182 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:44:09,182 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:44:09,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:44:09,182 INFO L82 PathProgramCache]: Analyzing trace with hash -1173975853, now seen corresponding path program 1 times [2018-11-23 10:44:09,183 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:44:09,183 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-23 10:44:09,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:44:09,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:44:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:44:09,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:44:09,391 INFO L256 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2018-11-23 10:44:09,391 INFO L273 TraceCheckUtils]: 1: Hoare triple {512#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {512#true} is VALID [2018-11-23 10:44:09,391 INFO L273 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2018-11-23 10:44:09,392 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #99#return; {512#true} is VALID [2018-11-23 10:44:09,392 INFO L256 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2018-11-23 10:44:09,393 INFO L273 TraceCheckUtils]: 5: Hoare triple {512#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~q~0 := 500bv32;~s~0 := 700bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));assume 0bv32 != (if ~bvslt32(~q~0, ~m~0) then 1bv32 else 0bv32);assume 0bv32 != (if ~bvslt32(~s~0, ~n~0) then 1bv32 else 0bv32);~i~0 := 0bv32;~j~0 := 0bv32; {532#(= (_ bv1500 32) main_~n~0)} is VALID [2018-11-23 10:44:09,394 INFO L273 TraceCheckUtils]: 6: Hoare triple {532#(= (_ bv1500 32) main_~n~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {536#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:44:09,395 INFO L273 TraceCheckUtils]: 7: Hoare triple {536#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {540#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:44:09,396 INFO L273 TraceCheckUtils]: 8: Hoare triple {540#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~j~0, ~n~0); {513#false} is VALID [2018-11-23 10:44:09,396 INFO L273 TraceCheckUtils]: 9: Hoare triple {513#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {513#false} is VALID [2018-11-23 10:44:09,397 INFO L273 TraceCheckUtils]: 10: Hoare triple {513#false} assume !~bvslt32(~i~0, ~m~0); {513#false} is VALID [2018-11-23 10:44:09,397 INFO L273 TraceCheckUtils]: 11: Hoare triple {513#false} ~i~0 := 0bv32;~j~0 := 0bv32; {513#false} is VALID [2018-11-23 10:44:09,398 INFO L273 TraceCheckUtils]: 12: Hoare triple {513#false} assume !~bvslt32(~i~0, ~q~0); {513#false} is VALID [2018-11-23 10:44:09,398 INFO L273 TraceCheckUtils]: 13: Hoare triple {513#false} ~i~0 := 0bv32;~j~0 := 0bv32; {513#false} is VALID [2018-11-23 10:44:09,398 INFO L273 TraceCheckUtils]: 14: Hoare triple {513#false} assume !!~bvslt32(~i~0, ~q~0);~j~0 := 0bv32; {513#false} is VALID [2018-11-23 10:44:09,399 INFO L273 TraceCheckUtils]: 15: Hoare triple {513#false} assume !!~bvslt32(~j~0, ~s~0);call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32); {513#false} is VALID [2018-11-23 10:44:09,399 INFO L256 TraceCheckUtils]: 16: Hoare triple {513#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1bv32 else 0bv32)); {513#false} is VALID [2018-11-23 10:44:09,399 INFO L273 TraceCheckUtils]: 17: Hoare triple {513#false} ~cond := #in~cond; {513#false} is VALID [2018-11-23 10:44:09,400 INFO L273 TraceCheckUtils]: 18: Hoare triple {513#false} assume 0bv32 == ~cond; {513#false} is VALID [2018-11-23 10:44:09,400 INFO L273 TraceCheckUtils]: 19: Hoare triple {513#false} assume !false; {513#false} is VALID [2018-11-23 10:44:09,401 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:44:09,402 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:44:09,499 INFO L273 TraceCheckUtils]: 19: Hoare triple {513#false} assume !false; {513#false} is VALID [2018-11-23 10:44:09,500 INFO L273 TraceCheckUtils]: 18: Hoare triple {513#false} assume 0bv32 == ~cond; {513#false} is VALID [2018-11-23 10:44:09,500 INFO L273 TraceCheckUtils]: 17: Hoare triple {513#false} ~cond := #in~cond; {513#false} is VALID [2018-11-23 10:44:09,501 INFO L256 TraceCheckUtils]: 16: Hoare triple {513#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1bv32 else 0bv32)); {513#false} is VALID [2018-11-23 10:44:09,501 INFO L273 TraceCheckUtils]: 15: Hoare triple {513#false} assume !!~bvslt32(~j~0, ~s~0);call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32); {513#false} is VALID [2018-11-23 10:44:09,501 INFO L273 TraceCheckUtils]: 14: Hoare triple {513#false} assume !!~bvslt32(~i~0, ~q~0);~j~0 := 0bv32; {513#false} is VALID [2018-11-23 10:44:09,502 INFO L273 TraceCheckUtils]: 13: Hoare triple {513#false} ~i~0 := 0bv32;~j~0 := 0bv32; {513#false} is VALID [2018-11-23 10:44:09,502 INFO L273 TraceCheckUtils]: 12: Hoare triple {513#false} assume !~bvslt32(~i~0, ~q~0); {513#false} is VALID [2018-11-23 10:44:09,503 INFO L273 TraceCheckUtils]: 11: Hoare triple {513#false} ~i~0 := 0bv32;~j~0 := 0bv32; {513#false} is VALID [2018-11-23 10:44:09,503 INFO L273 TraceCheckUtils]: 10: Hoare triple {513#false} assume !~bvslt32(~i~0, ~m~0); {513#false} is VALID [2018-11-23 10:44:09,504 INFO L273 TraceCheckUtils]: 9: Hoare triple {513#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {513#false} is VALID [2018-11-23 10:44:09,507 INFO L273 TraceCheckUtils]: 8: Hoare triple {610#(bvslt main_~j~0 main_~n~0)} assume !~bvslt32(~j~0, ~n~0); {513#false} is VALID [2018-11-23 10:44:09,509 INFO L273 TraceCheckUtils]: 7: Hoare triple {614#(bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {610#(bvslt main_~j~0 main_~n~0)} is VALID [2018-11-23 10:44:09,510 INFO L273 TraceCheckUtils]: 6: Hoare triple {618#(bvslt (_ bv1 32) main_~n~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {614#(bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:44:09,511 INFO L273 TraceCheckUtils]: 5: Hoare triple {512#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~q~0 := 500bv32;~s~0 := 700bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));assume 0bv32 != (if ~bvslt32(~q~0, ~m~0) then 1bv32 else 0bv32);assume 0bv32 != (if ~bvslt32(~s~0, ~n~0) then 1bv32 else 0bv32);~i~0 := 0bv32;~j~0 := 0bv32; {618#(bvslt (_ bv1 32) main_~n~0)} is VALID [2018-11-23 10:44:09,512 INFO L256 TraceCheckUtils]: 4: Hoare triple {512#true} call #t~ret5 := main(); {512#true} is VALID [2018-11-23 10:44:09,512 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {512#true} {512#true} #99#return; {512#true} is VALID [2018-11-23 10:44:09,513 INFO L273 TraceCheckUtils]: 2: Hoare triple {512#true} assume true; {512#true} is VALID [2018-11-23 10:44:09,514 INFO L273 TraceCheckUtils]: 1: Hoare triple {512#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {512#true} is VALID [2018-11-23 10:44:09,514 INFO L256 TraceCheckUtils]: 0: Hoare triple {512#true} call ULTIMATE.init(); {512#true} is VALID [2018-11-23 10:44:09,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:44:09,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:44:09,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 10:44:09,519 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 10:44:09,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:44:09,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 10:44:09,609 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:44:09,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 10:44:09,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 10:44:09,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 10:44:09,610 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand 8 states. [2018-11-23 10:44:11,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:44:11,208 INFO L93 Difference]: Finished difference Result 86 states and 115 transitions. [2018-11-23 10:44:11,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 10:44:11,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-11-23 10:44:11,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:44:11,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 10:44:11,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2018-11-23 10:44:11,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 10:44:11,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2018-11-23 10:44:11,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2018-11-23 10:44:11,612 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:44:11,616 INFO L225 Difference]: With dead ends: 86 [2018-11-23 10:44:11,616 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 10:44:11,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-23 10:44:11,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 10:44:11,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 30. [2018-11-23 10:44:11,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:44:11,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 30 states. [2018-11-23 10:44:11,700 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 30 states. [2018-11-23 10:44:11,701 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 30 states. [2018-11-23 10:44:11,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:44:11,707 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2018-11-23 10:44:11,708 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2018-11-23 10:44:11,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:44:11,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:44:11,714 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 66 states. [2018-11-23 10:44:11,714 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 66 states. [2018-11-23 10:44:11,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:44:11,723 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2018-11-23 10:44:11,723 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 87 transitions. [2018-11-23 10:44:11,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:44:11,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:44:11,725 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:44:11,725 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:44:11,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 10:44:11,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 10:44:11,729 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 20 [2018-11-23 10:44:11,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:44:11,729 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 10:44:11,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 10:44:11,730 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 10:44:11,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 10:44:11,731 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:44:11,731 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:44:11,731 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:44:11,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:44:11,732 INFO L82 PathProgramCache]: Analyzing trace with hash 242184596, now seen corresponding path program 2 times [2018-11-23 10:44:11,732 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:44:11,732 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-23 10:44:11,760 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:44:11,797 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 10:44:11,798 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:44:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:44:11,812 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:44:11,886 INFO L256 TraceCheckUtils]: 0: Hoare triple {954#true} call ULTIMATE.init(); {954#true} is VALID [2018-11-23 10:44:11,887 INFO L273 TraceCheckUtils]: 1: Hoare triple {954#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {954#true} is VALID [2018-11-23 10:44:11,887 INFO L273 TraceCheckUtils]: 2: Hoare triple {954#true} assume true; {954#true} is VALID [2018-11-23 10:44:11,887 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {954#true} {954#true} #99#return; {954#true} is VALID [2018-11-23 10:44:11,888 INFO L256 TraceCheckUtils]: 4: Hoare triple {954#true} call #t~ret5 := main(); {954#true} is VALID [2018-11-23 10:44:11,889 INFO L273 TraceCheckUtils]: 5: Hoare triple {954#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~q~0 := 500bv32;~s~0 := 700bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));assume 0bv32 != (if ~bvslt32(~q~0, ~m~0) then 1bv32 else 0bv32);assume 0bv32 != (if ~bvslt32(~s~0, ~n~0) then 1bv32 else 0bv32);~i~0 := 0bv32;~j~0 := 0bv32; {974#(= (bvadd main_~q~0 (_ bv4294966796 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:11,890 INFO L273 TraceCheckUtils]: 6: Hoare triple {974#(= (bvadd main_~q~0 (_ bv4294966796 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {974#(= (bvadd main_~q~0 (_ bv4294966796 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:11,891 INFO L273 TraceCheckUtils]: 7: Hoare triple {974#(= (bvadd main_~q~0 (_ bv4294966796 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {974#(= (bvadd main_~q~0 (_ bv4294966796 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:11,891 INFO L273 TraceCheckUtils]: 8: Hoare triple {974#(= (bvadd main_~q~0 (_ bv4294966796 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {974#(= (bvadd main_~q~0 (_ bv4294966796 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:11,891 INFO L273 TraceCheckUtils]: 9: Hoare triple {974#(= (bvadd main_~q~0 (_ bv4294966796 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {974#(= (bvadd main_~q~0 (_ bv4294966796 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:11,892 INFO L273 TraceCheckUtils]: 10: Hoare triple {974#(= (bvadd main_~q~0 (_ bv4294966796 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {974#(= (bvadd main_~q~0 (_ bv4294966796 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:11,893 INFO L273 TraceCheckUtils]: 11: Hoare triple {974#(= (bvadd main_~q~0 (_ bv4294966796 32)) (_ bv0 32))} assume !~bvslt32(~j~0, ~n~0); {974#(= (bvadd main_~q~0 (_ bv4294966796 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:11,894 INFO L273 TraceCheckUtils]: 12: Hoare triple {974#(= (bvadd main_~q~0 (_ bv4294966796 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {974#(= (bvadd main_~q~0 (_ bv4294966796 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:11,895 INFO L273 TraceCheckUtils]: 13: Hoare triple {974#(= (bvadd main_~q~0 (_ bv4294966796 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~m~0); {974#(= (bvadd main_~q~0 (_ bv4294966796 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:11,896 INFO L273 TraceCheckUtils]: 14: Hoare triple {974#(= (bvadd main_~q~0 (_ bv4294966796 32)) (_ bv0 32))} ~i~0 := 0bv32;~j~0 := 0bv32; {1002#(and (= (bvadd main_~q~0 (_ bv4294966796 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:44:11,897 INFO L273 TraceCheckUtils]: 15: Hoare triple {1002#(and (= (bvadd main_~q~0 (_ bv4294966796 32)) (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !~bvslt32(~i~0, ~q~0); {955#false} is VALID [2018-11-23 10:44:11,898 INFO L273 TraceCheckUtils]: 16: Hoare triple {955#false} ~i~0 := 0bv32;~j~0 := 0bv32; {955#false} is VALID [2018-11-23 10:44:11,898 INFO L273 TraceCheckUtils]: 17: Hoare triple {955#false} assume !!~bvslt32(~i~0, ~q~0);~j~0 := 0bv32; {955#false} is VALID [2018-11-23 10:44:11,899 INFO L273 TraceCheckUtils]: 18: Hoare triple {955#false} assume !!~bvslt32(~j~0, ~s~0);call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32); {955#false} is VALID [2018-11-23 10:44:11,899 INFO L256 TraceCheckUtils]: 19: Hoare triple {955#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1bv32 else 0bv32)); {955#false} is VALID [2018-11-23 10:44:11,899 INFO L273 TraceCheckUtils]: 20: Hoare triple {955#false} ~cond := #in~cond; {955#false} is VALID [2018-11-23 10:44:11,900 INFO L273 TraceCheckUtils]: 21: Hoare triple {955#false} assume 0bv32 == ~cond; {955#false} is VALID [2018-11-23 10:44:11,900 INFO L273 TraceCheckUtils]: 22: Hoare triple {955#false} assume !false; {955#false} is VALID [2018-11-23 10:44:11,903 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-11-23 10:44:11,903 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:44:11,905 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:44:11,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 10:44:11,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 10:44:11,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:44:11,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 10:44:11,946 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-23 10:44:11,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 10:44:11,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 10:44:11,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:44:11,947 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 4 states. [2018-11-23 10:44:12,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:44:12,405 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2018-11-23 10:44:12,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 10:44:12,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 10:44:12,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:44:12,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:44:12,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2018-11-23 10:44:12,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:44:12,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2018-11-23 10:44:12,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 59 transitions. [2018-11-23 10:44:12,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:44:12,584 INFO L225 Difference]: With dead ends: 56 [2018-11-23 10:44:12,584 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 10:44:12,585 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:44:12,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 10:44:12,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2018-11-23 10:44:12,712 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:44:12,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 31 states. [2018-11-23 10:44:12,713 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 31 states. [2018-11-23 10:44:12,713 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 31 states. [2018-11-23 10:44:12,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:44:12,716 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-23 10:44:12,716 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 10:44:12,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:44:12,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:44:12,717 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 44 states. [2018-11-23 10:44:12,718 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 44 states. [2018-11-23 10:44:12,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:44:12,721 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2018-11-23 10:44:12,721 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 10:44:12,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:44:12,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:44:12,722 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:44:12,722 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:44:12,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 10:44:12,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-23 10:44:12,724 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 23 [2018-11-23 10:44:12,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:44:12,725 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-23 10:44:12,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 10:44:12,725 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 10:44:12,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 10:44:12,726 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:44:12,726 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:44:12,726 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:44:12,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:44:12,727 INFO L82 PathProgramCache]: Analyzing trace with hash 2107399800, now seen corresponding path program 1 times [2018-11-23 10:44:12,727 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:44:12,727 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-23 10:44:12,746 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:44:12,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:44:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:44:12,823 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:44:13,024 INFO L256 TraceCheckUtils]: 0: Hoare triple {1250#true} call ULTIMATE.init(); {1250#true} is VALID [2018-11-23 10:44:13,024 INFO L273 TraceCheckUtils]: 1: Hoare triple {1250#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1250#true} is VALID [2018-11-23 10:44:13,024 INFO L273 TraceCheckUtils]: 2: Hoare triple {1250#true} assume true; {1250#true} is VALID [2018-11-23 10:44:13,025 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1250#true} {1250#true} #99#return; {1250#true} is VALID [2018-11-23 10:44:13,025 INFO L256 TraceCheckUtils]: 4: Hoare triple {1250#true} call #t~ret5 := main(); {1250#true} is VALID [2018-11-23 10:44:13,030 INFO L273 TraceCheckUtils]: 5: Hoare triple {1250#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~q~0 := 500bv32;~s~0 := 700bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));assume 0bv32 != (if ~bvslt32(~q~0, ~m~0) then 1bv32 else 0bv32);assume 0bv32 != (if ~bvslt32(~s~0, ~n~0) then 1bv32 else 0bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1270#(= (_ bv1500 32) main_~n~0)} is VALID [2018-11-23 10:44:13,031 INFO L273 TraceCheckUtils]: 6: Hoare triple {1270#(= (_ bv1500 32) main_~n~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {1274#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:44:13,032 INFO L273 TraceCheckUtils]: 7: Hoare triple {1274#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {1278#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:44:13,038 INFO L273 TraceCheckUtils]: 8: Hoare triple {1278#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {1282#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:44:13,039 INFO L273 TraceCheckUtils]: 9: Hoare triple {1282#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {1286#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 10:44:13,044 INFO L273 TraceCheckUtils]: 10: Hoare triple {1286#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {1290#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-23 10:44:13,045 INFO L273 TraceCheckUtils]: 11: Hoare triple {1290#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)))} assume !~bvslt32(~j~0, ~n~0); {1251#false} is VALID [2018-11-23 10:44:13,046 INFO L273 TraceCheckUtils]: 12: Hoare triple {1251#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {1251#false} is VALID [2018-11-23 10:44:13,046 INFO L273 TraceCheckUtils]: 13: Hoare triple {1251#false} assume !~bvslt32(~i~0, ~m~0); {1251#false} is VALID [2018-11-23 10:44:13,046 INFO L273 TraceCheckUtils]: 14: Hoare triple {1251#false} ~i~0 := 0bv32;~j~0 := 0bv32; {1251#false} is VALID [2018-11-23 10:44:13,046 INFO L273 TraceCheckUtils]: 15: Hoare triple {1251#false} assume !!~bvslt32(~i~0, ~q~0);~j~0 := 0bv32; {1251#false} is VALID [2018-11-23 10:44:13,047 INFO L273 TraceCheckUtils]: 16: Hoare triple {1251#false} assume !~bvslt32(~j~0, ~s~0); {1251#false} is VALID [2018-11-23 10:44:13,047 INFO L273 TraceCheckUtils]: 17: Hoare triple {1251#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {1251#false} is VALID [2018-11-23 10:44:13,047 INFO L273 TraceCheckUtils]: 18: Hoare triple {1251#false} assume !~bvslt32(~i~0, ~q~0); {1251#false} is VALID [2018-11-23 10:44:13,047 INFO L273 TraceCheckUtils]: 19: Hoare triple {1251#false} ~i~0 := 0bv32;~j~0 := 0bv32; {1251#false} is VALID [2018-11-23 10:44:13,047 INFO L273 TraceCheckUtils]: 20: Hoare triple {1251#false} assume !!~bvslt32(~i~0, ~q~0);~j~0 := 0bv32; {1251#false} is VALID [2018-11-23 10:44:13,048 INFO L273 TraceCheckUtils]: 21: Hoare triple {1251#false} assume !!~bvslt32(~j~0, ~s~0);call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32); {1251#false} is VALID [2018-11-23 10:44:13,048 INFO L256 TraceCheckUtils]: 22: Hoare triple {1251#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1bv32 else 0bv32)); {1251#false} is VALID [2018-11-23 10:44:13,048 INFO L273 TraceCheckUtils]: 23: Hoare triple {1251#false} ~cond := #in~cond; {1251#false} is VALID [2018-11-23 10:44:13,048 INFO L273 TraceCheckUtils]: 24: Hoare triple {1251#false} assume 0bv32 == ~cond; {1251#false} is VALID [2018-11-23 10:44:13,049 INFO L273 TraceCheckUtils]: 25: Hoare triple {1251#false} assume !false; {1251#false} is VALID [2018-11-23 10:44:13,051 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 10:44:13,051 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:44:13,292 INFO L273 TraceCheckUtils]: 25: Hoare triple {1251#false} assume !false; {1251#false} is VALID [2018-11-23 10:44:13,292 INFO L273 TraceCheckUtils]: 24: Hoare triple {1251#false} assume 0bv32 == ~cond; {1251#false} is VALID [2018-11-23 10:44:13,293 INFO L273 TraceCheckUtils]: 23: Hoare triple {1251#false} ~cond := #in~cond; {1251#false} is VALID [2018-11-23 10:44:13,293 INFO L256 TraceCheckUtils]: 22: Hoare triple {1251#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1bv32 else 0bv32)); {1251#false} is VALID [2018-11-23 10:44:13,293 INFO L273 TraceCheckUtils]: 21: Hoare triple {1251#false} assume !!~bvslt32(~j~0, ~s~0);call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32); {1251#false} is VALID [2018-11-23 10:44:13,294 INFO L273 TraceCheckUtils]: 20: Hoare triple {1251#false} assume !!~bvslt32(~i~0, ~q~0);~j~0 := 0bv32; {1251#false} is VALID [2018-11-23 10:44:13,294 INFO L273 TraceCheckUtils]: 19: Hoare triple {1251#false} ~i~0 := 0bv32;~j~0 := 0bv32; {1251#false} is VALID [2018-11-23 10:44:13,294 INFO L273 TraceCheckUtils]: 18: Hoare triple {1251#false} assume !~bvslt32(~i~0, ~q~0); {1251#false} is VALID [2018-11-23 10:44:13,295 INFO L273 TraceCheckUtils]: 17: Hoare triple {1251#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {1251#false} is VALID [2018-11-23 10:44:13,295 INFO L273 TraceCheckUtils]: 16: Hoare triple {1251#false} assume !~bvslt32(~j~0, ~s~0); {1251#false} is VALID [2018-11-23 10:44:13,295 INFO L273 TraceCheckUtils]: 15: Hoare triple {1251#false} assume !!~bvslt32(~i~0, ~q~0);~j~0 := 0bv32; {1251#false} is VALID [2018-11-23 10:44:13,295 INFO L273 TraceCheckUtils]: 14: Hoare triple {1251#false} ~i~0 := 0bv32;~j~0 := 0bv32; {1251#false} is VALID [2018-11-23 10:44:13,295 INFO L273 TraceCheckUtils]: 13: Hoare triple {1251#false} assume !~bvslt32(~i~0, ~m~0); {1251#false} is VALID [2018-11-23 10:44:13,296 INFO L273 TraceCheckUtils]: 12: Hoare triple {1251#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {1251#false} is VALID [2018-11-23 10:44:13,296 INFO L273 TraceCheckUtils]: 11: Hoare triple {1378#(bvslt main_~j~0 main_~n~0)} assume !~bvslt32(~j~0, ~n~0); {1251#false} is VALID [2018-11-23 10:44:13,297 INFO L273 TraceCheckUtils]: 10: Hoare triple {1382#(bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {1378#(bvslt main_~j~0 main_~n~0)} is VALID [2018-11-23 10:44:13,394 INFO L273 TraceCheckUtils]: 9: Hoare triple {1386#(bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {1382#(bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:44:13,487 INFO L273 TraceCheckUtils]: 8: Hoare triple {1390#(bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {1386#(bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)} is VALID [2018-11-23 10:44:13,574 INFO L273 TraceCheckUtils]: 7: Hoare triple {1394#(bvslt (bvadd main_~j~0 (_ bv4 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {1390#(bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0)} is VALID [2018-11-23 10:44:13,575 INFO L273 TraceCheckUtils]: 6: Hoare triple {1398#(bvslt (_ bv4 32) main_~n~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {1394#(bvslt (bvadd main_~j~0 (_ bv4 32)) main_~n~0)} is VALID [2018-11-23 10:44:13,576 INFO L273 TraceCheckUtils]: 5: Hoare triple {1250#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~q~0 := 500bv32;~s~0 := 700bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));assume 0bv32 != (if ~bvslt32(~q~0, ~m~0) then 1bv32 else 0bv32);assume 0bv32 != (if ~bvslt32(~s~0, ~n~0) then 1bv32 else 0bv32);~i~0 := 0bv32;~j~0 := 0bv32; {1398#(bvslt (_ bv4 32) main_~n~0)} is VALID [2018-11-23 10:44:13,577 INFO L256 TraceCheckUtils]: 4: Hoare triple {1250#true} call #t~ret5 := main(); {1250#true} is VALID [2018-11-23 10:44:13,577 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1250#true} {1250#true} #99#return; {1250#true} is VALID [2018-11-23 10:44:13,577 INFO L273 TraceCheckUtils]: 2: Hoare triple {1250#true} assume true; {1250#true} is VALID [2018-11-23 10:44:13,578 INFO L273 TraceCheckUtils]: 1: Hoare triple {1250#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1250#true} is VALID [2018-11-23 10:44:13,578 INFO L256 TraceCheckUtils]: 0: Hoare triple {1250#true} call ULTIMATE.init(); {1250#true} is VALID [2018-11-23 10:44:13,580 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (6)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:44:13,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:44:13,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 10:44:13,587 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-11-23 10:44:13,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:44:13,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 10:44:13,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:44:13,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 10:44:13,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 10:44:13,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-23 10:44:13,852 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 14 states. [2018-11-23 10:44:20,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:44:20,722 INFO L93 Difference]: Finished difference Result 151 states and 207 transitions. [2018-11-23 10:44:20,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 10:44:20,722 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-11-23 10:44:20,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:44:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 10:44:20,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 201 transitions. [2018-11-23 10:44:20,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 10:44:20,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 201 transitions. [2018-11-23 10:44:20,736 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 201 transitions. [2018-11-23 10:44:21,427 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:44:21,433 INFO L225 Difference]: With dead ends: 151 [2018-11-23 10:44:21,433 INFO L226 Difference]: Without dead ends: 127 [2018-11-23 10:44:21,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2018-11-23 10:44:21,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-23 10:44:21,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 37. [2018-11-23 10:44:21,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:44:21,645 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 37 states. [2018-11-23 10:44:21,645 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 37 states. [2018-11-23 10:44:21,645 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 37 states. [2018-11-23 10:44:21,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:44:21,653 INFO L93 Difference]: Finished difference Result 127 states and 172 transitions. [2018-11-23 10:44:21,654 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 172 transitions. [2018-11-23 10:44:21,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:44:21,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:44:21,655 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 127 states. [2018-11-23 10:44:21,655 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 127 states. [2018-11-23 10:44:21,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:44:21,662 INFO L93 Difference]: Finished difference Result 127 states and 172 transitions. [2018-11-23 10:44:21,662 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 172 transitions. [2018-11-23 10:44:21,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:44:21,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:44:21,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:44:21,664 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:44:21,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 10:44:21,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-11-23 10:44:21,666 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 26 [2018-11-23 10:44:21,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:44:21,666 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-23 10:44:21,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 10:44:21,666 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-23 10:44:21,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 10:44:21,667 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:44:21,667 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:44:21,667 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:44:21,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:44:21,668 INFO L82 PathProgramCache]: Analyzing trace with hash -2028809512, now seen corresponding path program 2 times [2018-11-23 10:44:21,668 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:44:21,668 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-23 10:44:21,699 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:44:21,863 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:44:21,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:44:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:44:21,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:44:22,361 INFO L256 TraceCheckUtils]: 0: Hoare triple {1982#true} call ULTIMATE.init(); {1982#true} is VALID [2018-11-23 10:44:22,361 INFO L273 TraceCheckUtils]: 1: Hoare triple {1982#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1982#true} is VALID [2018-11-23 10:44:22,362 INFO L273 TraceCheckUtils]: 2: Hoare triple {1982#true} assume true; {1982#true} is VALID [2018-11-23 10:44:22,362 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1982#true} {1982#true} #99#return; {1982#true} is VALID [2018-11-23 10:44:22,362 INFO L256 TraceCheckUtils]: 4: Hoare triple {1982#true} call #t~ret5 := main(); {1982#true} is VALID [2018-11-23 10:44:22,363 INFO L273 TraceCheckUtils]: 5: Hoare triple {1982#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~q~0 := 500bv32;~s~0 := 700bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));assume 0bv32 != (if ~bvslt32(~q~0, ~m~0) then 1bv32 else 0bv32);assume 0bv32 != (if ~bvslt32(~s~0, ~n~0) then 1bv32 else 0bv32);~i~0 := 0bv32;~j~0 := 0bv32; {2002#(= (_ bv1500 32) main_~n~0)} is VALID [2018-11-23 10:44:22,363 INFO L273 TraceCheckUtils]: 6: Hoare triple {2002#(= (_ bv1500 32) main_~n~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {2006#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:44:22,368 INFO L273 TraceCheckUtils]: 7: Hoare triple {2006#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {2010#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:44:22,369 INFO L273 TraceCheckUtils]: 8: Hoare triple {2010#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {2014#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:44:22,369 INFO L273 TraceCheckUtils]: 9: Hoare triple {2014#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {2018#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 10:44:22,370 INFO L273 TraceCheckUtils]: 10: Hoare triple {2018#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {2022#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-23 10:44:22,371 INFO L273 TraceCheckUtils]: 11: Hoare triple {2022#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {2026#(and (= (bvadd main_~j~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:44:22,389 INFO L273 TraceCheckUtils]: 12: Hoare triple {2026#(and (= (bvadd main_~j~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {2030#(and (= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:44:22,404 INFO L273 TraceCheckUtils]: 13: Hoare triple {2030#(and (= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {2034#(and (= (_ bv1500 32) main_~n~0) (= (_ bv7 32) main_~j~0))} is VALID [2018-11-23 10:44:22,413 INFO L273 TraceCheckUtils]: 14: Hoare triple {2034#(and (= (_ bv1500 32) main_~n~0) (= (_ bv7 32) main_~j~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {2038#(and (= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:44:22,427 INFO L273 TraceCheckUtils]: 15: Hoare triple {2038#(and (= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {2042#(and (= (_ bv1500 32) main_~n~0) (= (_ bv9 32) main_~j~0))} is VALID [2018-11-23 10:44:22,442 INFO L273 TraceCheckUtils]: 16: Hoare triple {2042#(and (= (_ bv1500 32) main_~n~0) (= (_ bv9 32) main_~j~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {2046#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:44:22,451 INFO L273 TraceCheckUtils]: 17: Hoare triple {2046#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)))} assume !~bvslt32(~j~0, ~n~0); {1983#false} is VALID [2018-11-23 10:44:22,452 INFO L273 TraceCheckUtils]: 18: Hoare triple {1983#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {1983#false} is VALID [2018-11-23 10:44:22,452 INFO L273 TraceCheckUtils]: 19: Hoare triple {1983#false} assume !~bvslt32(~i~0, ~m~0); {1983#false} is VALID [2018-11-23 10:44:22,452 INFO L273 TraceCheckUtils]: 20: Hoare triple {1983#false} ~i~0 := 0bv32;~j~0 := 0bv32; {1983#false} is VALID [2018-11-23 10:44:22,452 INFO L273 TraceCheckUtils]: 21: Hoare triple {1983#false} assume !!~bvslt32(~i~0, ~q~0);~j~0 := 0bv32; {1983#false} is VALID [2018-11-23 10:44:22,453 INFO L273 TraceCheckUtils]: 22: Hoare triple {1983#false} assume !~bvslt32(~j~0, ~s~0); {1983#false} is VALID [2018-11-23 10:44:22,453 INFO L273 TraceCheckUtils]: 23: Hoare triple {1983#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {1983#false} is VALID [2018-11-23 10:44:22,453 INFO L273 TraceCheckUtils]: 24: Hoare triple {1983#false} assume !~bvslt32(~i~0, ~q~0); {1983#false} is VALID [2018-11-23 10:44:22,453 INFO L273 TraceCheckUtils]: 25: Hoare triple {1983#false} ~i~0 := 0bv32;~j~0 := 0bv32; {1983#false} is VALID [2018-11-23 10:44:22,454 INFO L273 TraceCheckUtils]: 26: Hoare triple {1983#false} assume !!~bvslt32(~i~0, ~q~0);~j~0 := 0bv32; {1983#false} is VALID [2018-11-23 10:44:22,454 INFO L273 TraceCheckUtils]: 27: Hoare triple {1983#false} assume !!~bvslt32(~j~0, ~s~0);call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32); {1983#false} is VALID [2018-11-23 10:44:22,454 INFO L256 TraceCheckUtils]: 28: Hoare triple {1983#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1bv32 else 0bv32)); {1983#false} is VALID [2018-11-23 10:44:22,454 INFO L273 TraceCheckUtils]: 29: Hoare triple {1983#false} ~cond := #in~cond; {1983#false} is VALID [2018-11-23 10:44:22,455 INFO L273 TraceCheckUtils]: 30: Hoare triple {1983#false} assume 0bv32 == ~cond; {1983#false} is VALID [2018-11-23 10:44:22,455 INFO L273 TraceCheckUtils]: 31: Hoare triple {1983#false} assume !false; {1983#false} is VALID [2018-11-23 10:44:22,457 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 10:44:22,457 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:44:23,173 INFO L273 TraceCheckUtils]: 31: Hoare triple {1983#false} assume !false; {1983#false} is VALID [2018-11-23 10:44:23,174 INFO L273 TraceCheckUtils]: 30: Hoare triple {1983#false} assume 0bv32 == ~cond; {1983#false} is VALID [2018-11-23 10:44:23,174 INFO L273 TraceCheckUtils]: 29: Hoare triple {1983#false} ~cond := #in~cond; {1983#false} is VALID [2018-11-23 10:44:23,174 INFO L256 TraceCheckUtils]: 28: Hoare triple {1983#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1bv32 else 0bv32)); {1983#false} is VALID [2018-11-23 10:44:23,174 INFO L273 TraceCheckUtils]: 27: Hoare triple {1983#false} assume !!~bvslt32(~j~0, ~s~0);call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32); {1983#false} is VALID [2018-11-23 10:44:23,175 INFO L273 TraceCheckUtils]: 26: Hoare triple {1983#false} assume !!~bvslt32(~i~0, ~q~0);~j~0 := 0bv32; {1983#false} is VALID [2018-11-23 10:44:23,175 INFO L273 TraceCheckUtils]: 25: Hoare triple {1983#false} ~i~0 := 0bv32;~j~0 := 0bv32; {1983#false} is VALID [2018-11-23 10:44:23,175 INFO L273 TraceCheckUtils]: 24: Hoare triple {1983#false} assume !~bvslt32(~i~0, ~q~0); {1983#false} is VALID [2018-11-23 10:44:23,175 INFO L273 TraceCheckUtils]: 23: Hoare triple {1983#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {1983#false} is VALID [2018-11-23 10:44:23,176 INFO L273 TraceCheckUtils]: 22: Hoare triple {1983#false} assume !~bvslt32(~j~0, ~s~0); {1983#false} is VALID [2018-11-23 10:44:23,176 INFO L273 TraceCheckUtils]: 21: Hoare triple {1983#false} assume !!~bvslt32(~i~0, ~q~0);~j~0 := 0bv32; {1983#false} is VALID [2018-11-23 10:44:23,176 INFO L273 TraceCheckUtils]: 20: Hoare triple {1983#false} ~i~0 := 0bv32;~j~0 := 0bv32; {1983#false} is VALID [2018-11-23 10:44:23,176 INFO L273 TraceCheckUtils]: 19: Hoare triple {1983#false} assume !~bvslt32(~i~0, ~m~0); {1983#false} is VALID [2018-11-23 10:44:23,177 INFO L273 TraceCheckUtils]: 18: Hoare triple {1983#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {1983#false} is VALID [2018-11-23 10:44:23,180 INFO L273 TraceCheckUtils]: 17: Hoare triple {2134#(bvslt main_~j~0 main_~n~0)} assume !~bvslt32(~j~0, ~n~0); {1983#false} is VALID [2018-11-23 10:44:23,181 INFO L273 TraceCheckUtils]: 16: Hoare triple {2138#(bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {2134#(bvslt main_~j~0 main_~n~0)} is VALID [2018-11-23 10:44:23,265 INFO L273 TraceCheckUtils]: 15: Hoare triple {2142#(bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {2138#(bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:44:23,360 INFO L273 TraceCheckUtils]: 14: Hoare triple {2146#(bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {2142#(bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)} is VALID [2018-11-23 10:44:23,459 INFO L273 TraceCheckUtils]: 13: Hoare triple {2150#(bvslt (bvadd main_~j~0 (_ bv4 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {2146#(bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0)} is VALID [2018-11-23 10:44:23,541 INFO L273 TraceCheckUtils]: 12: Hoare triple {2154#(bvslt (bvadd main_~j~0 (_ bv5 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {2150#(bvslt (bvadd main_~j~0 (_ bv4 32)) main_~n~0)} is VALID [2018-11-23 10:44:23,634 INFO L273 TraceCheckUtils]: 11: Hoare triple {2158#(bvslt (bvadd main_~j~0 (_ bv6 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {2154#(bvslt (bvadd main_~j~0 (_ bv5 32)) main_~n~0)} is VALID [2018-11-23 10:44:23,715 INFO L273 TraceCheckUtils]: 10: Hoare triple {2162#(bvslt (bvadd main_~j~0 (_ bv7 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {2158#(bvslt (bvadd main_~j~0 (_ bv6 32)) main_~n~0)} is VALID [2018-11-23 10:44:23,792 INFO L273 TraceCheckUtils]: 9: Hoare triple {2166#(bvslt (bvadd main_~j~0 (_ bv8 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {2162#(bvslt (bvadd main_~j~0 (_ bv7 32)) main_~n~0)} is VALID [2018-11-23 10:44:23,869 INFO L273 TraceCheckUtils]: 8: Hoare triple {2170#(bvslt (bvadd main_~j~0 (_ bv9 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {2166#(bvslt (bvadd main_~j~0 (_ bv8 32)) main_~n~0)} is VALID [2018-11-23 10:44:23,959 INFO L273 TraceCheckUtils]: 7: Hoare triple {2174#(bvslt (bvadd main_~j~0 (_ bv10 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {2170#(bvslt (bvadd main_~j~0 (_ bv9 32)) main_~n~0)} is VALID [2018-11-23 10:44:23,960 INFO L273 TraceCheckUtils]: 6: Hoare triple {2178#(bvslt (_ bv10 32) main_~n~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {2174#(bvslt (bvadd main_~j~0 (_ bv10 32)) main_~n~0)} is VALID [2018-11-23 10:44:23,979 INFO L273 TraceCheckUtils]: 5: Hoare triple {1982#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~q~0 := 500bv32;~s~0 := 700bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));assume 0bv32 != (if ~bvslt32(~q~0, ~m~0) then 1bv32 else 0bv32);assume 0bv32 != (if ~bvslt32(~s~0, ~n~0) then 1bv32 else 0bv32);~i~0 := 0bv32;~j~0 := 0bv32; {2178#(bvslt (_ bv10 32) main_~n~0)} is VALID [2018-11-23 10:44:23,979 INFO L256 TraceCheckUtils]: 4: Hoare triple {1982#true} call #t~ret5 := main(); {1982#true} is VALID [2018-11-23 10:44:23,980 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1982#true} {1982#true} #99#return; {1982#true} is VALID [2018-11-23 10:44:23,980 INFO L273 TraceCheckUtils]: 2: Hoare triple {1982#true} assume true; {1982#true} is VALID [2018-11-23 10:44:23,980 INFO L273 TraceCheckUtils]: 1: Hoare triple {1982#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1982#true} is VALID [2018-11-23 10:44:23,981 INFO L256 TraceCheckUtils]: 0: Hoare triple {1982#true} call ULTIMATE.init(); {1982#true} is VALID [2018-11-23 10:44:23,983 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 1 proven. 55 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 10:44:23,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:44:23,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-11-23 10:44:23,986 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2018-11-23 10:44:23,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:44:23,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 10:44:24,721 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:44:24,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 10:44:24,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 10:44:24,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-23 10:44:24,722 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 26 states. [2018-11-23 10:44:28,252 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 9 [2018-11-23 10:44:51,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:44:51,360 INFO L93 Difference]: Finished difference Result 277 states and 387 transitions. [2018-11-23 10:44:51,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 10:44:51,360 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 32 [2018-11-23 10:44:51,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:44:51,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 10:44:51,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 375 transitions. [2018-11-23 10:44:51,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 10:44:51,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 375 transitions. [2018-11-23 10:44:51,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 375 transitions. [2018-11-23 10:44:52,809 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 375 edges. 375 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:44:52,817 INFO L225 Difference]: With dead ends: 277 [2018-11-23 10:44:52,817 INFO L226 Difference]: Without dead ends: 247 [2018-11-23 10:44:52,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=479, Invalid=853, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 10:44:52,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-11-23 10:44:52,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 49. [2018-11-23 10:44:52,987 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:44:52,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand 49 states. [2018-11-23 10:44:52,987 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand 49 states. [2018-11-23 10:44:52,988 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 49 states. [2018-11-23 10:44:53,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:44:53,002 INFO L93 Difference]: Finished difference Result 247 states and 340 transitions. [2018-11-23 10:44:53,002 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 340 transitions. [2018-11-23 10:44:53,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:44:53,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:44:53,003 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 247 states. [2018-11-23 10:44:53,004 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 247 states. [2018-11-23 10:44:53,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:44:53,016 INFO L93 Difference]: Finished difference Result 247 states and 340 transitions. [2018-11-23 10:44:53,016 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 340 transitions. [2018-11-23 10:44:53,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:44:53,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:44:53,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:44:53,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:44:53,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 10:44:53,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2018-11-23 10:44:53,020 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 32 [2018-11-23 10:44:53,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:44:53,020 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2018-11-23 10:44:53,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 10:44:53,021 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2018-11-23 10:44:53,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 10:44:53,022 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:44:53,022 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:44:53,022 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:44:53,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:44:53,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1581030504, now seen corresponding path program 3 times [2018-11-23 10:44:53,023 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:44:53,023 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-23 10:44:53,052 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:44:53,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 10:44:53,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:44:53,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:44:53,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:44:53,308 INFO L256 TraceCheckUtils]: 0: Hoare triple {3242#true} call ULTIMATE.init(); {3242#true} is VALID [2018-11-23 10:44:53,309 INFO L273 TraceCheckUtils]: 1: Hoare triple {3242#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3242#true} is VALID [2018-11-23 10:44:53,309 INFO L273 TraceCheckUtils]: 2: Hoare triple {3242#true} assume true; {3242#true} is VALID [2018-11-23 10:44:53,309 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3242#true} {3242#true} #99#return; {3242#true} is VALID [2018-11-23 10:44:53,309 INFO L256 TraceCheckUtils]: 4: Hoare triple {3242#true} call #t~ret5 := main(); {3242#true} is VALID [2018-11-23 10:44:53,311 INFO L273 TraceCheckUtils]: 5: Hoare triple {3242#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~q~0 := 500bv32;~s~0 := 700bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));assume 0bv32 != (if ~bvslt32(~q~0, ~m~0) then 1bv32 else 0bv32);assume 0bv32 != (if ~bvslt32(~s~0, ~n~0) then 1bv32 else 0bv32);~i~0 := 0bv32;~j~0 := 0bv32; {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,312 INFO L273 TraceCheckUtils]: 6: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,312 INFO L273 TraceCheckUtils]: 7: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,313 INFO L273 TraceCheckUtils]: 8: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,313 INFO L273 TraceCheckUtils]: 9: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,313 INFO L273 TraceCheckUtils]: 10: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,314 INFO L273 TraceCheckUtils]: 11: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,314 INFO L273 TraceCheckUtils]: 12: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,315 INFO L273 TraceCheckUtils]: 13: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,315 INFO L273 TraceCheckUtils]: 14: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,315 INFO L273 TraceCheckUtils]: 15: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,316 INFO L273 TraceCheckUtils]: 16: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,317 INFO L273 TraceCheckUtils]: 17: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,317 INFO L273 TraceCheckUtils]: 18: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,318 INFO L273 TraceCheckUtils]: 19: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,327 INFO L273 TraceCheckUtils]: 20: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,328 INFO L273 TraceCheckUtils]: 21: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,329 INFO L273 TraceCheckUtils]: 22: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,329 INFO L273 TraceCheckUtils]: 23: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,331 INFO L273 TraceCheckUtils]: 24: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,331 INFO L273 TraceCheckUtils]: 25: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,331 INFO L273 TraceCheckUtils]: 26: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,332 INFO L273 TraceCheckUtils]: 27: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,332 INFO L273 TraceCheckUtils]: 28: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,332 INFO L273 TraceCheckUtils]: 29: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} assume !~bvslt32(~j~0, ~n~0); {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,333 INFO L273 TraceCheckUtils]: 30: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,333 INFO L273 TraceCheckUtils]: 31: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} assume !~bvslt32(~i~0, ~m~0); {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,334 INFO L273 TraceCheckUtils]: 32: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} ~i~0 := 0bv32;~j~0 := 0bv32; {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} is VALID [2018-11-23 10:44:53,334 INFO L273 TraceCheckUtils]: 33: Hoare triple {3262#(= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, ~q~0);~j~0 := 0bv32; {3347#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32)))} is VALID [2018-11-23 10:44:53,335 INFO L273 TraceCheckUtils]: 34: Hoare triple {3347#(and (= main_~j~0 (_ bv0 32)) (= (bvadd main_~s~0 (_ bv4294966596 32)) (_ bv0 32)))} assume !~bvslt32(~j~0, ~s~0); {3243#false} is VALID [2018-11-23 10:44:53,335 INFO L273 TraceCheckUtils]: 35: Hoare triple {3243#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {3243#false} is VALID [2018-11-23 10:44:53,335 INFO L273 TraceCheckUtils]: 36: Hoare triple {3243#false} assume !~bvslt32(~i~0, ~q~0); {3243#false} is VALID [2018-11-23 10:44:53,336 INFO L273 TraceCheckUtils]: 37: Hoare triple {3243#false} ~i~0 := 0bv32;~j~0 := 0bv32; {3243#false} is VALID [2018-11-23 10:44:53,336 INFO L273 TraceCheckUtils]: 38: Hoare triple {3243#false} assume !!~bvslt32(~i~0, ~q~0);~j~0 := 0bv32; {3243#false} is VALID [2018-11-23 10:44:53,336 INFO L273 TraceCheckUtils]: 39: Hoare triple {3243#false} assume !!~bvslt32(~j~0, ~s~0);call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32); {3243#false} is VALID [2018-11-23 10:44:53,337 INFO L256 TraceCheckUtils]: 40: Hoare triple {3243#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1bv32 else 0bv32)); {3243#false} is VALID [2018-11-23 10:44:53,337 INFO L273 TraceCheckUtils]: 41: Hoare triple {3243#false} ~cond := #in~cond; {3243#false} is VALID [2018-11-23 10:44:53,338 INFO L273 TraceCheckUtils]: 42: Hoare triple {3243#false} assume 0bv32 == ~cond; {3243#false} is VALID [2018-11-23 10:44:53,338 INFO L273 TraceCheckUtils]: 43: Hoare triple {3243#false} assume !false; {3243#false} is VALID [2018-11-23 10:44:53,342 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2018-11-23 10:44:53,342 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:44:53,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:44:53,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 10:44:53,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-23 10:44:53,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:44:53,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 10:44:53,432 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:44:53,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 10:44:53,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 10:44:53,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:44:53,433 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand 4 states. [2018-11-23 10:44:54,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:44:54,191 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-11-23 10:44:54,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 10:44:54,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-11-23 10:44:54,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:44:54,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:44:54,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2018-11-23 10:44:54,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:44:54,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 59 transitions. [2018-11-23 10:44:54,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 59 transitions. [2018-11-23 10:44:54,378 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:44:54,379 INFO L225 Difference]: With dead ends: 69 [2018-11-23 10:44:54,380 INFO L226 Difference]: Without dead ends: 54 [2018-11-23 10:44:54,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:44:54,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-11-23 10:44:54,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-11-23 10:44:54,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:44:54,536 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 51 states. [2018-11-23 10:44:54,536 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 51 states. [2018-11-23 10:44:54,536 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 51 states. [2018-11-23 10:44:54,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:44:54,539 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-11-23 10:44:54,539 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-11-23 10:44:54,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:44:54,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:44:54,539 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 54 states. [2018-11-23 10:44:54,540 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 54 states. [2018-11-23 10:44:54,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:44:54,541 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2018-11-23 10:44:54,541 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-11-23 10:44:54,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:44:54,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:44:54,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:44:54,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:44:54,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 10:44:54,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2018-11-23 10:44:54,544 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 44 [2018-11-23 10:44:54,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:44:54,544 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2018-11-23 10:44:54,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 10:44:54,545 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2018-11-23 10:44:54,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 10:44:54,545 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:44:54,546 INFO L402 BasicCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:44:54,546 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:44:54,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:44:54,546 INFO L82 PathProgramCache]: Analyzing trace with hash 337417123, now seen corresponding path program 1 times [2018-11-23 10:44:54,547 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:44:54,547 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-23 10:44:54,564 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:44:54,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:44:54,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:44:54,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:44:55,704 INFO L256 TraceCheckUtils]: 0: Hoare triple {3689#true} call ULTIMATE.init(); {3689#true} is VALID [2018-11-23 10:44:55,704 INFO L273 TraceCheckUtils]: 1: Hoare triple {3689#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3689#true} is VALID [2018-11-23 10:44:55,705 INFO L273 TraceCheckUtils]: 2: Hoare triple {3689#true} assume true; {3689#true} is VALID [2018-11-23 10:44:55,705 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3689#true} {3689#true} #99#return; {3689#true} is VALID [2018-11-23 10:44:55,705 INFO L256 TraceCheckUtils]: 4: Hoare triple {3689#true} call #t~ret5 := main(); {3689#true} is VALID [2018-11-23 10:44:55,706 INFO L273 TraceCheckUtils]: 5: Hoare triple {3689#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~q~0 := 500bv32;~s~0 := 700bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));assume 0bv32 != (if ~bvslt32(~q~0, ~m~0) then 1bv32 else 0bv32);assume 0bv32 != (if ~bvslt32(~s~0, ~n~0) then 1bv32 else 0bv32);~i~0 := 0bv32;~j~0 := 0bv32; {3709#(= (_ bv1500 32) main_~n~0)} is VALID [2018-11-23 10:44:55,707 INFO L273 TraceCheckUtils]: 6: Hoare triple {3709#(= (_ bv1500 32) main_~n~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {3713#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:44:55,708 INFO L273 TraceCheckUtils]: 7: Hoare triple {3713#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3717#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:44:55,709 INFO L273 TraceCheckUtils]: 8: Hoare triple {3717#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3721#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:44:55,709 INFO L273 TraceCheckUtils]: 9: Hoare triple {3721#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3725#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 10:44:55,710 INFO L273 TraceCheckUtils]: 10: Hoare triple {3725#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3729#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-23 10:44:55,710 INFO L273 TraceCheckUtils]: 11: Hoare triple {3729#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3733#(and (= (bvadd main_~j~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:44:55,711 INFO L273 TraceCheckUtils]: 12: Hoare triple {3733#(and (= (bvadd main_~j~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3737#(and (= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:44:55,712 INFO L273 TraceCheckUtils]: 13: Hoare triple {3737#(and (= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3741#(and (= (_ bv1500 32) main_~n~0) (= (_ bv7 32) main_~j~0))} is VALID [2018-11-23 10:44:55,713 INFO L273 TraceCheckUtils]: 14: Hoare triple {3741#(and (= (_ bv1500 32) main_~n~0) (= (_ bv7 32) main_~j~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3745#(and (= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:44:55,714 INFO L273 TraceCheckUtils]: 15: Hoare triple {3745#(and (= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3749#(and (= (bvadd main_~j~0 (_ bv4294967287 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:44:55,715 INFO L273 TraceCheckUtils]: 16: Hoare triple {3749#(and (= (bvadd main_~j~0 (_ bv4294967287 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3753#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:44:55,716 INFO L273 TraceCheckUtils]: 17: Hoare triple {3753#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3757#(and (= (bvadd main_~j~0 (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:44:55,717 INFO L273 TraceCheckUtils]: 18: Hoare triple {3757#(and (= (bvadd main_~j~0 (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3761#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967284 32)) (_ bv0 32)))} is VALID [2018-11-23 10:44:55,718 INFO L273 TraceCheckUtils]: 19: Hoare triple {3761#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967284 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3765#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967283 32)) (_ bv0 32)))} is VALID [2018-11-23 10:44:55,719 INFO L273 TraceCheckUtils]: 20: Hoare triple {3765#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967283 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3769#(and (= (bvadd main_~j~0 (_ bv4294967282 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:44:55,720 INFO L273 TraceCheckUtils]: 21: Hoare triple {3769#(and (= (bvadd main_~j~0 (_ bv4294967282 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3773#(and (= (_ bv15 32) main_~j~0) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:44:55,721 INFO L273 TraceCheckUtils]: 22: Hoare triple {3773#(and (= (_ bv15 32) main_~j~0) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3777#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967280 32)) (_ bv0 32)))} is VALID [2018-11-23 10:44:55,722 INFO L273 TraceCheckUtils]: 23: Hoare triple {3777#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967280 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3781#(and (= (_ bv17 32) main_~j~0) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:44:55,723 INFO L273 TraceCheckUtils]: 24: Hoare triple {3781#(and (= (_ bv17 32) main_~j~0) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3785#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967278 32)) (_ bv0 32)))} is VALID [2018-11-23 10:44:55,724 INFO L273 TraceCheckUtils]: 25: Hoare triple {3785#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967278 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3789#(and (= (_ bv19 32) main_~j~0) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:44:55,725 INFO L273 TraceCheckUtils]: 26: Hoare triple {3789#(and (= (_ bv19 32) main_~j~0) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3793#(and (= (bvadd main_~j~0 (_ bv4294967276 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:44:55,727 INFO L273 TraceCheckUtils]: 27: Hoare triple {3793#(and (= (bvadd main_~j~0 (_ bv4294967276 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3797#(and (= (_ bv21 32) main_~j~0) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:44:55,728 INFO L273 TraceCheckUtils]: 28: Hoare triple {3797#(and (= (_ bv21 32) main_~j~0) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3801#(and (= (bvadd main_~j~0 (_ bv4294967274 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:44:55,729 INFO L273 TraceCheckUtils]: 29: Hoare triple {3801#(and (= (bvadd main_~j~0 (_ bv4294967274 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !~bvslt32(~j~0, ~n~0); {3690#false} is VALID [2018-11-23 10:44:55,730 INFO L273 TraceCheckUtils]: 30: Hoare triple {3690#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {3690#false} is VALID [2018-11-23 10:44:55,730 INFO L273 TraceCheckUtils]: 31: Hoare triple {3690#false} assume !~bvslt32(~i~0, ~m~0); {3690#false} is VALID [2018-11-23 10:44:55,730 INFO L273 TraceCheckUtils]: 32: Hoare triple {3690#false} ~i~0 := 0bv32;~j~0 := 0bv32; {3690#false} is VALID [2018-11-23 10:44:55,731 INFO L273 TraceCheckUtils]: 33: Hoare triple {3690#false} assume !!~bvslt32(~i~0, ~q~0);~j~0 := 0bv32; {3690#false} is VALID [2018-11-23 10:44:55,731 INFO L273 TraceCheckUtils]: 34: Hoare triple {3690#false} assume !!~bvslt32(~j~0, ~s~0);call #t~mem2 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem2;~j~0 := ~bvadd32(1bv32, ~j~0); {3690#false} is VALID [2018-11-23 10:44:55,731 INFO L273 TraceCheckUtils]: 35: Hoare triple {3690#false} assume !~bvslt32(~j~0, ~s~0); {3690#false} is VALID [2018-11-23 10:44:55,732 INFO L273 TraceCheckUtils]: 36: Hoare triple {3690#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {3690#false} is VALID [2018-11-23 10:44:55,732 INFO L273 TraceCheckUtils]: 37: Hoare triple {3690#false} assume !~bvslt32(~i~0, ~q~0); {3690#false} is VALID [2018-11-23 10:44:55,732 INFO L273 TraceCheckUtils]: 38: Hoare triple {3690#false} ~i~0 := 0bv32;~j~0 := 0bv32; {3690#false} is VALID [2018-11-23 10:44:55,732 INFO L273 TraceCheckUtils]: 39: Hoare triple {3690#false} assume !!~bvslt32(~i~0, ~q~0);~j~0 := 0bv32; {3690#false} is VALID [2018-11-23 10:44:55,733 INFO L273 TraceCheckUtils]: 40: Hoare triple {3690#false} assume !!~bvslt32(~j~0, ~s~0);call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32); {3690#false} is VALID [2018-11-23 10:44:55,733 INFO L256 TraceCheckUtils]: 41: Hoare triple {3690#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1bv32 else 0bv32)); {3690#false} is VALID [2018-11-23 10:44:55,733 INFO L273 TraceCheckUtils]: 42: Hoare triple {3690#false} ~cond := #in~cond; {3690#false} is VALID [2018-11-23 10:44:55,734 INFO L273 TraceCheckUtils]: 43: Hoare triple {3690#false} assume 0bv32 == ~cond; {3690#false} is VALID [2018-11-23 10:44:55,734 INFO L273 TraceCheckUtils]: 44: Hoare triple {3690#false} assume !false; {3690#false} is VALID [2018-11-23 10:44:55,737 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 253 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 10:44:55,738 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:44:57,472 INFO L273 TraceCheckUtils]: 44: Hoare triple {3690#false} assume !false; {3690#false} is VALID [2018-11-23 10:44:57,472 INFO L273 TraceCheckUtils]: 43: Hoare triple {3690#false} assume 0bv32 == ~cond; {3690#false} is VALID [2018-11-23 10:44:57,473 INFO L273 TraceCheckUtils]: 42: Hoare triple {3690#false} ~cond := #in~cond; {3690#false} is VALID [2018-11-23 10:44:57,473 INFO L256 TraceCheckUtils]: 41: Hoare triple {3690#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1bv32 else 0bv32)); {3690#false} is VALID [2018-11-23 10:44:57,473 INFO L273 TraceCheckUtils]: 40: Hoare triple {3690#false} assume !!~bvslt32(~j~0, ~s~0);call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32); {3690#false} is VALID [2018-11-23 10:44:57,474 INFO L273 TraceCheckUtils]: 39: Hoare triple {3690#false} assume !!~bvslt32(~i~0, ~q~0);~j~0 := 0bv32; {3690#false} is VALID [2018-11-23 10:44:57,474 INFO L273 TraceCheckUtils]: 38: Hoare triple {3690#false} ~i~0 := 0bv32;~j~0 := 0bv32; {3690#false} is VALID [2018-11-23 10:44:57,474 INFO L273 TraceCheckUtils]: 37: Hoare triple {3690#false} assume !~bvslt32(~i~0, ~q~0); {3690#false} is VALID [2018-11-23 10:44:57,475 INFO L273 TraceCheckUtils]: 36: Hoare triple {3690#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {3690#false} is VALID [2018-11-23 10:44:57,475 INFO L273 TraceCheckUtils]: 35: Hoare triple {3690#false} assume !~bvslt32(~j~0, ~s~0); {3690#false} is VALID [2018-11-23 10:44:57,475 INFO L273 TraceCheckUtils]: 34: Hoare triple {3690#false} assume !!~bvslt32(~j~0, ~s~0);call #t~mem2 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem2;~j~0 := ~bvadd32(1bv32, ~j~0); {3690#false} is VALID [2018-11-23 10:44:57,475 INFO L273 TraceCheckUtils]: 33: Hoare triple {3690#false} assume !!~bvslt32(~i~0, ~q~0);~j~0 := 0bv32; {3690#false} is VALID [2018-11-23 10:44:57,476 INFO L273 TraceCheckUtils]: 32: Hoare triple {3690#false} ~i~0 := 0bv32;~j~0 := 0bv32; {3690#false} is VALID [2018-11-23 10:44:57,476 INFO L273 TraceCheckUtils]: 31: Hoare triple {3690#false} assume !~bvslt32(~i~0, ~m~0); {3690#false} is VALID [2018-11-23 10:44:57,476 INFO L273 TraceCheckUtils]: 30: Hoare triple {3690#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {3690#false} is VALID [2018-11-23 10:44:57,476 INFO L273 TraceCheckUtils]: 29: Hoare triple {3895#(bvslt main_~j~0 main_~n~0)} assume !~bvslt32(~j~0, ~n~0); {3690#false} is VALID [2018-11-23 10:44:57,477 INFO L273 TraceCheckUtils]: 28: Hoare triple {3899#(bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3895#(bvslt main_~j~0 main_~n~0)} is VALID [2018-11-23 10:44:57,559 INFO L273 TraceCheckUtils]: 27: Hoare triple {3903#(bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3899#(bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:44:57,645 INFO L273 TraceCheckUtils]: 26: Hoare triple {3907#(bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3903#(bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)} is VALID [2018-11-23 10:44:57,731 INFO L273 TraceCheckUtils]: 25: Hoare triple {3911#(bvslt (bvadd main_~j~0 (_ bv4 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3907#(bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0)} is VALID [2018-11-23 10:44:57,802 INFO L273 TraceCheckUtils]: 24: Hoare triple {3915#(bvslt (bvadd main_~j~0 (_ bv5 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3911#(bvslt (bvadd main_~j~0 (_ bv4 32)) main_~n~0)} is VALID [2018-11-23 10:44:57,928 INFO L273 TraceCheckUtils]: 23: Hoare triple {3919#(bvslt (bvadd main_~j~0 (_ bv6 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3915#(bvslt (bvadd main_~j~0 (_ bv5 32)) main_~n~0)} is VALID [2018-11-23 10:44:57,999 INFO L273 TraceCheckUtils]: 22: Hoare triple {3923#(bvslt (bvadd main_~j~0 (_ bv7 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3919#(bvslt (bvadd main_~j~0 (_ bv6 32)) main_~n~0)} is VALID [2018-11-23 10:44:58,072 INFO L273 TraceCheckUtils]: 21: Hoare triple {3927#(bvslt (bvadd main_~j~0 (_ bv8 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3923#(bvslt (bvadd main_~j~0 (_ bv7 32)) main_~n~0)} is VALID [2018-11-23 10:44:58,163 INFO L273 TraceCheckUtils]: 20: Hoare triple {3931#(bvslt (bvadd main_~j~0 (_ bv9 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3927#(bvslt (bvadd main_~j~0 (_ bv8 32)) main_~n~0)} is VALID [2018-11-23 10:44:58,263 INFO L273 TraceCheckUtils]: 19: Hoare triple {3935#(bvslt (bvadd main_~j~0 (_ bv10 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3931#(bvslt (bvadd main_~j~0 (_ bv9 32)) main_~n~0)} is VALID [2018-11-23 10:44:58,357 INFO L273 TraceCheckUtils]: 18: Hoare triple {3939#(bvslt (bvadd main_~j~0 (_ bv11 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3935#(bvslt (bvadd main_~j~0 (_ bv10 32)) main_~n~0)} is VALID [2018-11-23 10:44:58,427 INFO L273 TraceCheckUtils]: 17: Hoare triple {3943#(bvslt (bvadd main_~j~0 (_ bv12 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3939#(bvslt (bvadd main_~j~0 (_ bv11 32)) main_~n~0)} is VALID [2018-11-23 10:44:58,501 INFO L273 TraceCheckUtils]: 16: Hoare triple {3947#(bvslt (bvadd main_~j~0 (_ bv13 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3943#(bvslt (bvadd main_~j~0 (_ bv12 32)) main_~n~0)} is VALID [2018-11-23 10:44:58,596 INFO L273 TraceCheckUtils]: 15: Hoare triple {3951#(bvslt (bvadd main_~j~0 (_ bv14 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3947#(bvslt (bvadd main_~j~0 (_ bv13 32)) main_~n~0)} is VALID [2018-11-23 10:44:58,662 INFO L273 TraceCheckUtils]: 14: Hoare triple {3955#(bvslt (bvadd main_~j~0 (_ bv15 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3951#(bvslt (bvadd main_~j~0 (_ bv14 32)) main_~n~0)} is VALID [2018-11-23 10:44:58,740 INFO L273 TraceCheckUtils]: 13: Hoare triple {3959#(bvslt (bvadd main_~j~0 (_ bv16 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3955#(bvslt (bvadd main_~j~0 (_ bv15 32)) main_~n~0)} is VALID [2018-11-23 10:44:58,824 INFO L273 TraceCheckUtils]: 12: Hoare triple {3963#(bvslt (bvadd main_~j~0 (_ bv17 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3959#(bvslt (bvadd main_~j~0 (_ bv16 32)) main_~n~0)} is VALID [2018-11-23 10:44:58,894 INFO L273 TraceCheckUtils]: 11: Hoare triple {3967#(bvslt (bvadd main_~j~0 (_ bv18 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3963#(bvslt (bvadd main_~j~0 (_ bv17 32)) main_~n~0)} is VALID [2018-11-23 10:44:58,967 INFO L273 TraceCheckUtils]: 10: Hoare triple {3971#(bvslt (bvadd main_~j~0 (_ bv19 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3967#(bvslt (bvadd main_~j~0 (_ bv18 32)) main_~n~0)} is VALID [2018-11-23 10:44:59,054 INFO L273 TraceCheckUtils]: 9: Hoare triple {3975#(bvslt (bvadd main_~j~0 (_ bv20 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3971#(bvslt (bvadd main_~j~0 (_ bv19 32)) main_~n~0)} is VALID [2018-11-23 10:44:59,123 INFO L273 TraceCheckUtils]: 8: Hoare triple {3979#(bvslt (bvadd main_~j~0 (_ bv21 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3975#(bvslt (bvadd main_~j~0 (_ bv20 32)) main_~n~0)} is VALID [2018-11-23 10:44:59,202 INFO L273 TraceCheckUtils]: 7: Hoare triple {3983#(bvslt (bvadd main_~j~0 (_ bv22 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {3979#(bvslt (bvadd main_~j~0 (_ bv21 32)) main_~n~0)} is VALID [2018-11-23 10:44:59,203 INFO L273 TraceCheckUtils]: 6: Hoare triple {3987#(bvslt (_ bv22 32) main_~n~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {3983#(bvslt (bvadd main_~j~0 (_ bv22 32)) main_~n~0)} is VALID [2018-11-23 10:44:59,204 INFO L273 TraceCheckUtils]: 5: Hoare triple {3689#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~q~0 := 500bv32;~s~0 := 700bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));assume 0bv32 != (if ~bvslt32(~q~0, ~m~0) then 1bv32 else 0bv32);assume 0bv32 != (if ~bvslt32(~s~0, ~n~0) then 1bv32 else 0bv32);~i~0 := 0bv32;~j~0 := 0bv32; {3987#(bvslt (_ bv22 32) main_~n~0)} is VALID [2018-11-23 10:44:59,204 INFO L256 TraceCheckUtils]: 4: Hoare triple {3689#true} call #t~ret5 := main(); {3689#true} is VALID [2018-11-23 10:44:59,205 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3689#true} {3689#true} #99#return; {3689#true} is VALID [2018-11-23 10:44:59,205 INFO L273 TraceCheckUtils]: 2: Hoare triple {3689#true} assume true; {3689#true} is VALID [2018-11-23 10:44:59,205 INFO L273 TraceCheckUtils]: 1: Hoare triple {3689#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3689#true} is VALID [2018-11-23 10:44:59,205 INFO L256 TraceCheckUtils]: 0: Hoare triple {3689#true} call ULTIMATE.init(); {3689#true} is VALID [2018-11-23 10:44:59,208 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 1 proven. 253 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 10:44:59,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:44:59,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2018-11-23 10:44:59,214 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 45 [2018-11-23 10:44:59,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:44:59,215 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-23 10:45:00,628 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:45:00,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-23 10:45:00,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 10:45:00,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=673, Invalid=1777, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 10:45:00,630 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand 50 states. [2018-11-23 10:45:13,478 WARN L180 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 9 [2018-11-23 10:45:14,255 WARN L180 SmtUtils]: Spent 278.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 9 [2018-11-23 10:45:15,008 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 9 [2018-11-23 10:45:15,836 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 9 [2018-11-23 10:45:16,603 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 9 [2018-11-23 10:45:17,372 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 9 [2018-11-23 10:45:18,164 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 9 [2018-11-23 10:45:18,953 WARN L180 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 9 [2018-11-23 10:45:19,739 WARN L180 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 9 [2018-11-23 10:45:20,494 WARN L180 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 9 [2018-11-23 10:45:21,216 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 9 [2018-11-23 10:45:21,921 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 39 DAG size of output: 9 [2018-11-23 10:45:22,594 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 9 [2018-11-23 10:46:42,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:46:42,698 INFO L93 Difference]: Finished difference Result 527 states and 742 transitions. [2018-11-23 10:46:42,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 10:46:42,699 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 45 [2018-11-23 10:46:42,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:46:42,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 10:46:42,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 717 transitions. [2018-11-23 10:46:42,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 10:46:42,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 717 transitions. [2018-11-23 10:46:42,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 717 transitions. [2018-11-23 10:46:46,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 717 edges. 717 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:46:46,276 INFO L225 Difference]: With dead ends: 527 [2018-11-23 10:46:46,276 INFO L226 Difference]: Without dead ends: 483 [2018-11-23 10:46:46,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 828 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=1823, Invalid=3433, Unknown=0, NotChecked=0, Total=5256 [2018-11-23 10:46:46,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2018-11-23 10:46:46,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 75. [2018-11-23 10:46:46,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:46:46,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 483 states. Second operand 75 states. [2018-11-23 10:46:46,690 INFO L74 IsIncluded]: Start isIncluded. First operand 483 states. Second operand 75 states. [2018-11-23 10:46:46,690 INFO L87 Difference]: Start difference. First operand 483 states. Second operand 75 states. [2018-11-23 10:46:46,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:46:46,718 INFO L93 Difference]: Finished difference Result 483 states and 669 transitions. [2018-11-23 10:46:46,718 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 669 transitions. [2018-11-23 10:46:46,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:46:46,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:46:46,720 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 483 states. [2018-11-23 10:46:46,721 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 483 states. [2018-11-23 10:46:46,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:46:46,747 INFO L93 Difference]: Finished difference Result 483 states and 669 transitions. [2018-11-23 10:46:46,747 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 669 transitions. [2018-11-23 10:46:46,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:46:46,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:46:46,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:46:46,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:46:46,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 10:46:46,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2018-11-23 10:46:46,753 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 45 [2018-11-23 10:46:46,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:46:46,754 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2018-11-23 10:46:46,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-23 10:46:46,754 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2018-11-23 10:46:46,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 10:46:46,755 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:46:46,755 INFO L402 BasicCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:46:46,755 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:46:46,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:46:46,756 INFO L82 PathProgramCache]: Analyzing trace with hash -331546077, now seen corresponding path program 2 times [2018-11-23 10:46:46,756 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:46:46,756 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:46:46,788 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:46:47,096 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:46:47,096 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:46:47,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:46:47,174 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:46:49,260 INFO L256 TraceCheckUtils]: 0: Hoare triple {6006#true} call ULTIMATE.init(); {6006#true} is VALID [2018-11-23 10:46:49,260 INFO L273 TraceCheckUtils]: 1: Hoare triple {6006#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6006#true} is VALID [2018-11-23 10:46:49,280 INFO L273 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2018-11-23 10:46:49,281 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6006#true} #99#return; {6006#true} is VALID [2018-11-23 10:46:49,281 INFO L256 TraceCheckUtils]: 4: Hoare triple {6006#true} call #t~ret5 := main(); {6006#true} is VALID [2018-11-23 10:46:49,286 INFO L273 TraceCheckUtils]: 5: Hoare triple {6006#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~q~0 := 500bv32;~s~0 := 700bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));assume 0bv32 != (if ~bvslt32(~q~0, ~m~0) then 1bv32 else 0bv32);assume 0bv32 != (if ~bvslt32(~s~0, ~n~0) then 1bv32 else 0bv32);~i~0 := 0bv32;~j~0 := 0bv32; {6026#(= (_ bv1500 32) main_~n~0)} is VALID [2018-11-23 10:46:49,286 INFO L273 TraceCheckUtils]: 6: Hoare triple {6026#(= (_ bv1500 32) main_~n~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {6030#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:46:49,288 INFO L273 TraceCheckUtils]: 7: Hoare triple {6030#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6034#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:46:49,288 INFO L273 TraceCheckUtils]: 8: Hoare triple {6034#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6038#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:46:49,289 INFO L273 TraceCheckUtils]: 9: Hoare triple {6038#(and (= (bvadd main_~j~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6042#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 10:46:49,289 INFO L273 TraceCheckUtils]: 10: Hoare triple {6042#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6046#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-23 10:46:49,290 INFO L273 TraceCheckUtils]: 11: Hoare triple {6046#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967292 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6050#(and (= (bvadd main_~j~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:46:49,291 INFO L273 TraceCheckUtils]: 12: Hoare triple {6050#(and (= (bvadd main_~j~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6054#(and (= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:46:49,292 INFO L273 TraceCheckUtils]: 13: Hoare triple {6054#(and (= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6058#(and (= (_ bv1500 32) main_~n~0) (= (_ bv7 32) main_~j~0))} is VALID [2018-11-23 10:46:49,293 INFO L273 TraceCheckUtils]: 14: Hoare triple {6058#(and (= (_ bv1500 32) main_~n~0) (= (_ bv7 32) main_~j~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6062#(and (= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:46:49,294 INFO L273 TraceCheckUtils]: 15: Hoare triple {6062#(and (= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6066#(and (= (_ bv1500 32) main_~n~0) (= (_ bv9 32) main_~j~0))} is VALID [2018-11-23 10:46:49,295 INFO L273 TraceCheckUtils]: 16: Hoare triple {6066#(and (= (_ bv1500 32) main_~n~0) (= (_ bv9 32) main_~j~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6070#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)))} is VALID [2018-11-23 10:46:49,296 INFO L273 TraceCheckUtils]: 17: Hoare triple {6070#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6074#(and (= (bvadd main_~j~0 (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:46:49,297 INFO L273 TraceCheckUtils]: 18: Hoare triple {6074#(and (= (bvadd main_~j~0 (_ bv4294967285 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6078#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967284 32)) (_ bv0 32)))} is VALID [2018-11-23 10:46:49,298 INFO L273 TraceCheckUtils]: 19: Hoare triple {6078#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967284 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6082#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967283 32)) (_ bv0 32)))} is VALID [2018-11-23 10:46:49,299 INFO L273 TraceCheckUtils]: 20: Hoare triple {6082#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967283 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6086#(and (= (bvadd main_~j~0 (_ bv4294967282 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:46:49,300 INFO L273 TraceCheckUtils]: 21: Hoare triple {6086#(and (= (bvadd main_~j~0 (_ bv4294967282 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6090#(and (= (_ bv15 32) main_~j~0) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:46:49,301 INFO L273 TraceCheckUtils]: 22: Hoare triple {6090#(and (= (_ bv15 32) main_~j~0) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6094#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967280 32)) (_ bv0 32)))} is VALID [2018-11-23 10:46:49,302 INFO L273 TraceCheckUtils]: 23: Hoare triple {6094#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967280 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6098#(and (= (_ bv17 32) main_~j~0) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:46:49,303 INFO L273 TraceCheckUtils]: 24: Hoare triple {6098#(and (= (_ bv17 32) main_~j~0) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6102#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967278 32)) (_ bv0 32)))} is VALID [2018-11-23 10:46:49,304 INFO L273 TraceCheckUtils]: 25: Hoare triple {6102#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967278 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6106#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967277 32)) (_ bv0 32)))} is VALID [2018-11-23 10:46:49,304 INFO L273 TraceCheckUtils]: 26: Hoare triple {6106#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967277 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6110#(and (= (bvadd main_~j~0 (_ bv4294967276 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:46:49,305 INFO L273 TraceCheckUtils]: 27: Hoare triple {6110#(and (= (bvadd main_~j~0 (_ bv4294967276 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6114#(and (= (bvadd main_~j~0 (_ bv4294967275 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:46:49,306 INFO L273 TraceCheckUtils]: 28: Hoare triple {6114#(and (= (bvadd main_~j~0 (_ bv4294967275 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6118#(and (= (bvadd main_~j~0 (_ bv4294967274 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:46:49,307 INFO L273 TraceCheckUtils]: 29: Hoare triple {6118#(and (= (bvadd main_~j~0 (_ bv4294967274 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6122#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967273 32)) (_ bv0 32)))} is VALID [2018-11-23 10:46:49,308 INFO L273 TraceCheckUtils]: 30: Hoare triple {6122#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967273 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6126#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967272 32)) (_ bv0 32)))} is VALID [2018-11-23 10:46:49,309 INFO L273 TraceCheckUtils]: 31: Hoare triple {6126#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967272 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6130#(and (= (bvadd main_~j~0 (_ bv4294967271 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:46:49,312 INFO L273 TraceCheckUtils]: 32: Hoare triple {6130#(and (= (bvadd main_~j~0 (_ bv4294967271 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6134#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967270 32)) (_ bv0 32)))} is VALID [2018-11-23 10:46:49,313 INFO L273 TraceCheckUtils]: 33: Hoare triple {6134#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967270 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6138#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967269 32)) (_ bv0 32)))} is VALID [2018-11-23 10:46:49,316 INFO L273 TraceCheckUtils]: 34: Hoare triple {6138#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967269 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6142#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967268 32)) (_ bv0 32)))} is VALID [2018-11-23 10:46:49,321 INFO L273 TraceCheckUtils]: 35: Hoare triple {6142#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967268 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6146#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967267 32)) (_ bv0 32)))} is VALID [2018-11-23 10:46:49,330 INFO L273 TraceCheckUtils]: 36: Hoare triple {6146#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967267 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6150#(and (= (bvadd main_~j~0 (_ bv4294967266 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:46:49,332 INFO L273 TraceCheckUtils]: 37: Hoare triple {6150#(and (= (bvadd main_~j~0 (_ bv4294967266 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6154#(and (= (bvadd main_~j~0 (_ bv4294967265 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:46:49,334 INFO L273 TraceCheckUtils]: 38: Hoare triple {6154#(and (= (bvadd main_~j~0 (_ bv4294967265 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6158#(and (= (bvadd main_~j~0 (_ bv4294967264 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:46:49,336 INFO L273 TraceCheckUtils]: 39: Hoare triple {6158#(and (= (bvadd main_~j~0 (_ bv4294967264 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6162#(and (= (_ bv1500 32) main_~n~0) (= (_ bv33 32) main_~j~0))} is VALID [2018-11-23 10:46:49,337 INFO L273 TraceCheckUtils]: 40: Hoare triple {6162#(and (= (_ bv1500 32) main_~n~0) (= (_ bv33 32) main_~j~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6166#(and (= (bvadd main_~j~0 (_ bv4294967262 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:46:49,338 INFO L273 TraceCheckUtils]: 41: Hoare triple {6166#(and (= (bvadd main_~j~0 (_ bv4294967262 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6170#(and (= (_ bv35 32) main_~j~0) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:46:49,340 INFO L273 TraceCheckUtils]: 42: Hoare triple {6170#(and (= (_ bv35 32) main_~j~0) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6174#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967260 32)) (_ bv0 32)))} is VALID [2018-11-23 10:46:49,340 INFO L273 TraceCheckUtils]: 43: Hoare triple {6174#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967260 32)) (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6178#(and (= (bvadd main_~j~0 (_ bv4294967259 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:46:49,342 INFO L273 TraceCheckUtils]: 44: Hoare triple {6178#(and (= (bvadd main_~j~0 (_ bv4294967259 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6182#(and (= (bvadd main_~j~0 (_ bv4294967258 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:46:49,343 INFO L273 TraceCheckUtils]: 45: Hoare triple {6182#(and (= (bvadd main_~j~0 (_ bv4294967258 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6186#(and (= (_ bv1500 32) main_~n~0) (= (_ bv39 32) main_~j~0))} is VALID [2018-11-23 10:46:49,344 INFO L273 TraceCheckUtils]: 46: Hoare triple {6186#(and (= (_ bv1500 32) main_~n~0) (= (_ bv39 32) main_~j~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6190#(and (= (bvadd main_~j~0 (_ bv4294967256 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:46:49,344 INFO L273 TraceCheckUtils]: 47: Hoare triple {6190#(and (= (bvadd main_~j~0 (_ bv4294967256 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6194#(and (= (bvadd main_~j~0 (_ bv4294967255 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:46:49,345 INFO L273 TraceCheckUtils]: 48: Hoare triple {6194#(and (= (bvadd main_~j~0 (_ bv4294967255 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6198#(and (= (bvadd main_~j~0 (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:46:49,346 INFO L273 TraceCheckUtils]: 49: Hoare triple {6198#(and (= (bvadd main_~j~0 (_ bv4294967254 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6202#(and (= (_ bv1500 32) main_~n~0) (= (_ bv43 32) main_~j~0))} is VALID [2018-11-23 10:46:49,347 INFO L273 TraceCheckUtils]: 50: Hoare triple {6202#(and (= (_ bv1500 32) main_~n~0) (= (_ bv43 32) main_~j~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6206#(and (= (bvadd main_~j~0 (_ bv4294967252 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:46:49,348 INFO L273 TraceCheckUtils]: 51: Hoare triple {6206#(and (= (bvadd main_~j~0 (_ bv4294967252 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6210#(and (= (bvadd main_~j~0 (_ bv4294967251 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-23 10:46:49,349 INFO L273 TraceCheckUtils]: 52: Hoare triple {6210#(and (= (bvadd main_~j~0 (_ bv4294967251 32)) (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6214#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967250 32)) (_ bv0 32)))} is VALID [2018-11-23 10:46:49,350 INFO L273 TraceCheckUtils]: 53: Hoare triple {6214#(and (= (_ bv1500 32) main_~n~0) (= (bvadd main_~j~0 (_ bv4294967250 32)) (_ bv0 32)))} assume !~bvslt32(~j~0, ~n~0); {6007#false} is VALID [2018-11-23 10:46:49,350 INFO L273 TraceCheckUtils]: 54: Hoare triple {6007#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {6007#false} is VALID [2018-11-23 10:46:49,350 INFO L273 TraceCheckUtils]: 55: Hoare triple {6007#false} assume !~bvslt32(~i~0, ~m~0); {6007#false} is VALID [2018-11-23 10:46:49,351 INFO L273 TraceCheckUtils]: 56: Hoare triple {6007#false} ~i~0 := 0bv32;~j~0 := 0bv32; {6007#false} is VALID [2018-11-23 10:46:49,351 INFO L273 TraceCheckUtils]: 57: Hoare triple {6007#false} assume !!~bvslt32(~i~0, ~q~0);~j~0 := 0bv32; {6007#false} is VALID [2018-11-23 10:46:49,351 INFO L273 TraceCheckUtils]: 58: Hoare triple {6007#false} assume !!~bvslt32(~j~0, ~s~0);call #t~mem2 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem2;~j~0 := ~bvadd32(1bv32, ~j~0); {6007#false} is VALID [2018-11-23 10:46:49,352 INFO L273 TraceCheckUtils]: 59: Hoare triple {6007#false} assume !~bvslt32(~j~0, ~s~0); {6007#false} is VALID [2018-11-23 10:46:49,352 INFO L273 TraceCheckUtils]: 60: Hoare triple {6007#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {6007#false} is VALID [2018-11-23 10:46:49,352 INFO L273 TraceCheckUtils]: 61: Hoare triple {6007#false} assume !~bvslt32(~i~0, ~q~0); {6007#false} is VALID [2018-11-23 10:46:49,353 INFO L273 TraceCheckUtils]: 62: Hoare triple {6007#false} ~i~0 := 0bv32;~j~0 := 0bv32; {6007#false} is VALID [2018-11-23 10:46:49,353 INFO L273 TraceCheckUtils]: 63: Hoare triple {6007#false} assume !!~bvslt32(~i~0, ~q~0);~j~0 := 0bv32; {6007#false} is VALID [2018-11-23 10:46:49,353 INFO L273 TraceCheckUtils]: 64: Hoare triple {6007#false} assume !!~bvslt32(~j~0, ~s~0);call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32); {6007#false} is VALID [2018-11-23 10:46:49,354 INFO L256 TraceCheckUtils]: 65: Hoare triple {6007#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1bv32 else 0bv32)); {6007#false} is VALID [2018-11-23 10:46:49,354 INFO L273 TraceCheckUtils]: 66: Hoare triple {6007#false} ~cond := #in~cond; {6007#false} is VALID [2018-11-23 10:46:49,354 INFO L273 TraceCheckUtils]: 67: Hoare triple {6007#false} assume 0bv32 == ~cond; {6007#false} is VALID [2018-11-23 10:46:49,355 INFO L273 TraceCheckUtils]: 68: Hoare triple {6007#false} assume !false; {6007#false} is VALID [2018-11-23 10:46:49,364 INFO L134 CoverageAnalysis]: Checked inductivity of 1084 backedges. 1 proven. 1081 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 10:46:49,364 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:46:56,144 INFO L273 TraceCheckUtils]: 68: Hoare triple {6007#false} assume !false; {6007#false} is VALID [2018-11-23 10:46:56,144 INFO L273 TraceCheckUtils]: 67: Hoare triple {6007#false} assume 0bv32 == ~cond; {6007#false} is VALID [2018-11-23 10:46:56,145 INFO L273 TraceCheckUtils]: 66: Hoare triple {6007#false} ~cond := #in~cond; {6007#false} is VALID [2018-11-23 10:46:56,145 INFO L256 TraceCheckUtils]: 65: Hoare triple {6007#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1bv32 else 0bv32)); {6007#false} is VALID [2018-11-23 10:46:56,145 INFO L273 TraceCheckUtils]: 64: Hoare triple {6007#false} assume !!~bvslt32(~j~0, ~s~0);call #t~mem3 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);call #t~mem4 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32); {6007#false} is VALID [2018-11-23 10:46:56,145 INFO L273 TraceCheckUtils]: 63: Hoare triple {6007#false} assume !!~bvslt32(~i~0, ~q~0);~j~0 := 0bv32; {6007#false} is VALID [2018-11-23 10:46:56,146 INFO L273 TraceCheckUtils]: 62: Hoare triple {6007#false} ~i~0 := 0bv32;~j~0 := 0bv32; {6007#false} is VALID [2018-11-23 10:46:56,146 INFO L273 TraceCheckUtils]: 61: Hoare triple {6007#false} assume !~bvslt32(~i~0, ~q~0); {6007#false} is VALID [2018-11-23 10:46:56,146 INFO L273 TraceCheckUtils]: 60: Hoare triple {6007#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {6007#false} is VALID [2018-11-23 10:46:56,146 INFO L273 TraceCheckUtils]: 59: Hoare triple {6007#false} assume !~bvslt32(~j~0, ~s~0); {6007#false} is VALID [2018-11-23 10:46:56,146 INFO L273 TraceCheckUtils]: 58: Hoare triple {6007#false} assume !!~bvslt32(~j~0, ~s~0);call #t~mem2 := read~intINTTYPE4(~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);call write~intINTTYPE4(#t~mem2, ~#A~0.base, ~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~mem2;~j~0 := ~bvadd32(1bv32, ~j~0); {6007#false} is VALID [2018-11-23 10:46:56,146 INFO L273 TraceCheckUtils]: 57: Hoare triple {6007#false} assume !!~bvslt32(~i~0, ~q~0);~j~0 := 0bv32; {6007#false} is VALID [2018-11-23 10:46:56,146 INFO L273 TraceCheckUtils]: 56: Hoare triple {6007#false} ~i~0 := 0bv32;~j~0 := 0bv32; {6007#false} is VALID [2018-11-23 10:46:56,146 INFO L273 TraceCheckUtils]: 55: Hoare triple {6007#false} assume !~bvslt32(~i~0, ~m~0); {6007#false} is VALID [2018-11-23 10:46:56,147 INFO L273 TraceCheckUtils]: 54: Hoare triple {6007#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {6007#false} is VALID [2018-11-23 10:46:56,147 INFO L273 TraceCheckUtils]: 53: Hoare triple {6308#(bvslt main_~j~0 main_~n~0)} assume !~bvslt32(~j~0, ~n~0); {6007#false} is VALID [2018-11-23 10:46:56,147 INFO L273 TraceCheckUtils]: 52: Hoare triple {6312#(bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6308#(bvslt main_~j~0 main_~n~0)} is VALID [2018-11-23 10:46:56,224 INFO L273 TraceCheckUtils]: 51: Hoare triple {6316#(bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6312#(bvslt (bvadd main_~j~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:46:56,289 INFO L273 TraceCheckUtils]: 50: Hoare triple {6320#(bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6316#(bvslt (bvadd main_~j~0 (_ bv2 32)) main_~n~0)} is VALID [2018-11-23 10:46:56,384 INFO L273 TraceCheckUtils]: 49: Hoare triple {6324#(bvslt (bvadd main_~j~0 (_ bv4 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6320#(bvslt (bvadd main_~j~0 (_ bv3 32)) main_~n~0)} is VALID [2018-11-23 10:46:56,458 INFO L273 TraceCheckUtils]: 48: Hoare triple {6328#(bvslt (bvadd main_~j~0 (_ bv5 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6324#(bvslt (bvadd main_~j~0 (_ bv4 32)) main_~n~0)} is VALID [2018-11-23 10:46:56,546 INFO L273 TraceCheckUtils]: 47: Hoare triple {6332#(bvslt (bvadd main_~j~0 (_ bv6 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6328#(bvslt (bvadd main_~j~0 (_ bv5 32)) main_~n~0)} is VALID [2018-11-23 10:46:56,634 INFO L273 TraceCheckUtils]: 46: Hoare triple {6336#(bvslt (bvadd main_~j~0 (_ bv7 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6332#(bvslt (bvadd main_~j~0 (_ bv6 32)) main_~n~0)} is VALID [2018-11-23 10:46:56,711 INFO L273 TraceCheckUtils]: 45: Hoare triple {6340#(bvslt (bvadd main_~j~0 (_ bv8 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6336#(bvslt (bvadd main_~j~0 (_ bv7 32)) main_~n~0)} is VALID [2018-11-23 10:46:56,770 INFO L273 TraceCheckUtils]: 44: Hoare triple {6344#(bvslt (bvadd main_~j~0 (_ bv9 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6340#(bvslt (bvadd main_~j~0 (_ bv8 32)) main_~n~0)} is VALID [2018-11-23 10:46:56,863 INFO L273 TraceCheckUtils]: 43: Hoare triple {6348#(bvslt (bvadd main_~j~0 (_ bv10 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6344#(bvslt (bvadd main_~j~0 (_ bv9 32)) main_~n~0)} is VALID [2018-11-23 10:46:56,943 INFO L273 TraceCheckUtils]: 42: Hoare triple {6352#(bvslt (bvadd main_~j~0 (_ bv11 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6348#(bvslt (bvadd main_~j~0 (_ bv10 32)) main_~n~0)} is VALID [2018-11-23 10:46:57,047 INFO L273 TraceCheckUtils]: 41: Hoare triple {6356#(bvslt (bvadd main_~j~0 (_ bv12 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6352#(bvslt (bvadd main_~j~0 (_ bv11 32)) main_~n~0)} is VALID [2018-11-23 10:46:57,123 INFO L273 TraceCheckUtils]: 40: Hoare triple {6360#(bvslt (bvadd main_~j~0 (_ bv13 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6356#(bvslt (bvadd main_~j~0 (_ bv12 32)) main_~n~0)} is VALID [2018-11-23 10:46:57,207 INFO L273 TraceCheckUtils]: 39: Hoare triple {6364#(bvslt (bvadd main_~j~0 (_ bv14 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6360#(bvslt (bvadd main_~j~0 (_ bv13 32)) main_~n~0)} is VALID [2018-11-23 10:46:57,278 INFO L273 TraceCheckUtils]: 38: Hoare triple {6368#(bvslt (bvadd main_~j~0 (_ bv15 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6364#(bvslt (bvadd main_~j~0 (_ bv14 32)) main_~n~0)} is VALID [2018-11-23 10:46:57,350 INFO L273 TraceCheckUtils]: 37: Hoare triple {6372#(bvslt (bvadd main_~j~0 (_ bv16 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6368#(bvslt (bvadd main_~j~0 (_ bv15 32)) main_~n~0)} is VALID [2018-11-23 10:46:57,412 INFO L273 TraceCheckUtils]: 36: Hoare triple {6376#(bvslt (bvadd main_~j~0 (_ bv17 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6372#(bvslt (bvadd main_~j~0 (_ bv16 32)) main_~n~0)} is VALID [2018-11-23 10:46:57,478 INFO L273 TraceCheckUtils]: 35: Hoare triple {6380#(bvslt (bvadd main_~j~0 (_ bv18 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6376#(bvslt (bvadd main_~j~0 (_ bv17 32)) main_~n~0)} is VALID [2018-11-23 10:46:57,536 INFO L273 TraceCheckUtils]: 34: Hoare triple {6384#(bvslt (bvadd main_~j~0 (_ bv19 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6380#(bvslt (bvadd main_~j~0 (_ bv18 32)) main_~n~0)} is VALID [2018-11-23 10:46:57,657 INFO L273 TraceCheckUtils]: 33: Hoare triple {6388#(bvslt (bvadd main_~j~0 (_ bv20 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6384#(bvslt (bvadd main_~j~0 (_ bv19 32)) main_~n~0)} is VALID [2018-11-23 10:46:57,745 INFO L273 TraceCheckUtils]: 32: Hoare triple {6392#(bvslt (bvadd main_~j~0 (_ bv21 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6388#(bvslt (bvadd main_~j~0 (_ bv20 32)) main_~n~0)} is VALID [2018-11-23 10:46:57,826 INFO L273 TraceCheckUtils]: 31: Hoare triple {6396#(bvslt (bvadd main_~j~0 (_ bv22 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6392#(bvslt (bvadd main_~j~0 (_ bv21 32)) main_~n~0)} is VALID [2018-11-23 10:46:57,896 INFO L273 TraceCheckUtils]: 30: Hoare triple {6400#(bvslt (bvadd main_~j~0 (_ bv23 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6396#(bvslt (bvadd main_~j~0 (_ bv22 32)) main_~n~0)} is VALID [2018-11-23 10:46:57,951 INFO L273 TraceCheckUtils]: 29: Hoare triple {6404#(bvslt (bvadd main_~j~0 (_ bv24 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6400#(bvslt (bvadd main_~j~0 (_ bv23 32)) main_~n~0)} is VALID [2018-11-23 10:46:58,022 INFO L273 TraceCheckUtils]: 28: Hoare triple {6408#(bvslt (bvadd main_~j~0 (_ bv25 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6404#(bvslt (bvadd main_~j~0 (_ bv24 32)) main_~n~0)} is VALID [2018-11-23 10:46:58,104 INFO L273 TraceCheckUtils]: 27: Hoare triple {6412#(bvslt (bvadd main_~j~0 (_ bv26 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6408#(bvslt (bvadd main_~j~0 (_ bv25 32)) main_~n~0)} is VALID [2018-11-23 10:46:58,183 INFO L273 TraceCheckUtils]: 26: Hoare triple {6416#(bvslt (bvadd main_~j~0 (_ bv27 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6412#(bvslt (bvadd main_~j~0 (_ bv26 32)) main_~n~0)} is VALID [2018-11-23 10:46:58,286 INFO L273 TraceCheckUtils]: 25: Hoare triple {6420#(bvslt (bvadd main_~j~0 (_ bv28 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6416#(bvslt (bvadd main_~j~0 (_ bv27 32)) main_~n~0)} is VALID [2018-11-23 10:46:58,356 INFO L273 TraceCheckUtils]: 24: Hoare triple {6424#(bvslt (bvadd main_~j~0 (_ bv29 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6420#(bvslt (bvadd main_~j~0 (_ bv28 32)) main_~n~0)} is VALID [2018-11-23 10:46:58,424 INFO L273 TraceCheckUtils]: 23: Hoare triple {6428#(bvslt (bvadd main_~j~0 (_ bv30 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6424#(bvslt (bvadd main_~j~0 (_ bv29 32)) main_~n~0)} is VALID [2018-11-23 10:46:58,497 INFO L273 TraceCheckUtils]: 22: Hoare triple {6432#(bvslt (bvadd main_~j~0 (_ bv31 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6428#(bvslt (bvadd main_~j~0 (_ bv30 32)) main_~n~0)} is VALID [2018-11-23 10:46:58,581 INFO L273 TraceCheckUtils]: 21: Hoare triple {6436#(bvslt (bvadd main_~j~0 (_ bv32 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6432#(bvslt (bvadd main_~j~0 (_ bv31 32)) main_~n~0)} is VALID [2018-11-23 10:46:58,640 INFO L273 TraceCheckUtils]: 20: Hoare triple {6440#(bvslt (bvadd main_~j~0 (_ bv33 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6436#(bvslt (bvadd main_~j~0 (_ bv32 32)) main_~n~0)} is VALID [2018-11-23 10:46:58,713 INFO L273 TraceCheckUtils]: 19: Hoare triple {6444#(bvslt (bvadd main_~j~0 (_ bv34 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6440#(bvslt (bvadd main_~j~0 (_ bv33 32)) main_~n~0)} is VALID [2018-11-23 10:46:58,803 INFO L273 TraceCheckUtils]: 18: Hoare triple {6448#(bvslt (bvadd main_~j~0 (_ bv35 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6444#(bvslt (bvadd main_~j~0 (_ bv34 32)) main_~n~0)} is VALID [2018-11-23 10:46:58,867 INFO L273 TraceCheckUtils]: 17: Hoare triple {6452#(bvslt (bvadd main_~j~0 (_ bv36 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6448#(bvslt (bvadd main_~j~0 (_ bv35 32)) main_~n~0)} is VALID [2018-11-23 10:46:58,923 INFO L273 TraceCheckUtils]: 16: Hoare triple {6456#(bvslt (bvadd main_~j~0 (_ bv37 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6452#(bvslt (bvadd main_~j~0 (_ bv36 32)) main_~n~0)} is VALID [2018-11-23 10:46:58,982 INFO L273 TraceCheckUtils]: 15: Hoare triple {6460#(bvslt (bvadd main_~j~0 (_ bv38 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6456#(bvslt (bvadd main_~j~0 (_ bv37 32)) main_~n~0)} is VALID [2018-11-23 10:46:59,046 INFO L273 TraceCheckUtils]: 14: Hoare triple {6464#(bvslt (bvadd main_~j~0 (_ bv39 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6460#(bvslt (bvadd main_~j~0 (_ bv38 32)) main_~n~0)} is VALID [2018-11-23 10:46:59,131 INFO L273 TraceCheckUtils]: 13: Hoare triple {6468#(bvslt (bvadd main_~j~0 (_ bv40 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6464#(bvslt (bvadd main_~j~0 (_ bv39 32)) main_~n~0)} is VALID [2018-11-23 10:46:59,194 INFO L273 TraceCheckUtils]: 12: Hoare triple {6472#(bvslt (bvadd main_~j~0 (_ bv41 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6468#(bvslt (bvadd main_~j~0 (_ bv40 32)) main_~n~0)} is VALID [2018-11-23 10:46:59,250 INFO L273 TraceCheckUtils]: 11: Hoare triple {6476#(bvslt (bvadd main_~j~0 (_ bv42 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6472#(bvslt (bvadd main_~j~0 (_ bv41 32)) main_~n~0)} is VALID [2018-11-23 10:46:59,342 INFO L273 TraceCheckUtils]: 10: Hoare triple {6480#(bvslt (bvadd main_~j~0 (_ bv43 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6476#(bvslt (bvadd main_~j~0 (_ bv42 32)) main_~n~0)} is VALID [2018-11-23 10:46:59,445 INFO L273 TraceCheckUtils]: 9: Hoare triple {6484#(bvslt (bvadd main_~j~0 (_ bv44 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6480#(bvslt (bvadd main_~j~0 (_ bv43 32)) main_~n~0)} is VALID [2018-11-23 10:46:59,540 INFO L273 TraceCheckUtils]: 8: Hoare triple {6488#(bvslt (bvadd main_~j~0 (_ bv45 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6484#(bvslt (bvadd main_~j~0 (_ bv44 32)) main_~n~0)} is VALID [2018-11-23 10:46:59,621 INFO L273 TraceCheckUtils]: 7: Hoare triple {6492#(bvslt (bvadd main_~j~0 (_ bv46 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);call write~intINTTYPE4(#t~nondet1, ~#B~0.base, ~bvadd32(~bvadd32(~#B~0.offset, ~bvmul32(~i~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~j~0)), 4bv32);havoc #t~nondet1;~j~0 := ~bvadd32(1bv32, ~j~0); {6488#(bvslt (bvadd main_~j~0 (_ bv45 32)) main_~n~0)} is VALID [2018-11-23 10:46:59,622 INFO L273 TraceCheckUtils]: 6: Hoare triple {6496#(bvslt (_ bv46 32) main_~n~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32; {6492#(bvslt (bvadd main_~j~0 (_ bv46 32)) main_~n~0)} is VALID [2018-11-23 10:46:59,630 INFO L273 TraceCheckUtils]: 5: Hoare triple {6006#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~q~0 := 500bv32;~s~0 := 700bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(4bv32, ~n~0), ~m~0));assume 0bv32 != (if ~bvslt32(~q~0, ~m~0) then 1bv32 else 0bv32);assume 0bv32 != (if ~bvslt32(~s~0, ~n~0) then 1bv32 else 0bv32);~i~0 := 0bv32;~j~0 := 0bv32; {6496#(bvslt (_ bv46 32) main_~n~0)} is VALID [2018-11-23 10:46:59,630 INFO L256 TraceCheckUtils]: 4: Hoare triple {6006#true} call #t~ret5 := main(); {6006#true} is VALID [2018-11-23 10:46:59,630 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6006#true} {6006#true} #99#return; {6006#true} is VALID [2018-11-23 10:46:59,630 INFO L273 TraceCheckUtils]: 2: Hoare triple {6006#true} assume true; {6006#true} is VALID [2018-11-23 10:46:59,630 INFO L273 TraceCheckUtils]: 1: Hoare triple {6006#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6006#true} is VALID [2018-11-23 10:46:59,631 INFO L256 TraceCheckUtils]: 0: Hoare triple {6006#true} call ULTIMATE.init(); {6006#true} is VALID [2018-11-23 10:46:59,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1084 backedges. 1 proven. 1081 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 10:46:59,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:46:59,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 98 [2018-11-23 10:46:59,639 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 69 [2018-11-23 10:46:59,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:46:59,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 98 states. [2018-11-23 10:47:02,409 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:02,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-11-23 10:47:02,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-11-23 10:47:02,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2497, Invalid=7009, Unknown=0, NotChecked=0, Total=9506 [2018-11-23 10:47:02,413 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand 98 states.