java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-multidimensional/init-4-n-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 21:27:22,562 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 21:27:22,564 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 21:27:22,580 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 21:27:22,581 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 21:27:22,582 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 21:27:22,583 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 21:27:22,585 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 21:27:22,587 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 21:27:22,587 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 21:27:22,588 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 21:27:22,589 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 21:27:22,590 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 21:27:22,591 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 21:27:22,592 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 21:27:22,593 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 21:27:22,594 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 21:27:22,595 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 21:27:22,598 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 21:27:22,599 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 21:27:22,600 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 21:27:22,601 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 21:27:22,604 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 21:27:22,604 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 21:27:22,605 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 21:27:22,606 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 21:27:22,607 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 21:27:22,608 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 21:27:22,608 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 21:27:22,610 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 21:27:22,610 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 21:27:22,611 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 21:27:22,611 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 21:27:22,611 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 21:27:22,612 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 21:27:22,613 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 21:27:22,613 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-18 21:27:22,635 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 21:27:22,635 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 21:27:22,636 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 21:27:22,637 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 21:27:22,637 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 21:27:22,637 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 21:27:22,638 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 21:27:22,639 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 21:27:22,639 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 21:27:22,639 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 21:27:22,639 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 21:27:22,640 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 21:27:22,640 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 21:27:22,640 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 21:27:22,640 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-18 21:27:22,640 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-18 21:27:22,641 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 21:27:22,642 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 21:27:22,642 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 21:27:22,642 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 21:27:22,642 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 21:27:22,643 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 21:27:22,643 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 21:27:22,643 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 21:27:22,643 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 21:27:22,644 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 21:27:22,644 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 21:27:22,644 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 21:27:22,644 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-18 21:27:22,644 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 21:27:22,645 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-18 21:27:22,645 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-18 21:27:22,645 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 21:27:22,711 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 21:27:22,732 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 21:27:22,736 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 21:27:22,737 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 21:27:22,738 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 21:27:22,738 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/init-4-n-u_true-unreach-call.i [2018-11-18 21:27:22,796 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5db5b5e55/8dbc95bf41ea4cafbb9b14dd9d7b1135/FLAG02bc57ecc [2018-11-18 21:27:23,263 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 21:27:23,264 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/init-4-n-u_true-unreach-call.i [2018-11-18 21:27:23,271 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5db5b5e55/8dbc95bf41ea4cafbb9b14dd9d7b1135/FLAG02bc57ecc [2018-11-18 21:27:23,646 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5db5b5e55/8dbc95bf41ea4cafbb9b14dd9d7b1135 [2018-11-18 21:27:23,656 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 21:27:23,658 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 21:27:23,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 21:27:23,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 21:27:23,663 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 21:27:23,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:27:23" (1/1) ... [2018-11-18 21:27:23,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a33e89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:27:23, skipping insertion in model container [2018-11-18 21:27:23,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:27:23" (1/1) ... [2018-11-18 21:27:23,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 21:27:23,708 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 21:27:23,989 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:27:23,995 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 21:27:24,031 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 21:27:24,068 INFO L195 MainTranslator]: Completed translation [2018-11-18 21:27:24,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:27:24 WrapperNode [2018-11-18 21:27:24,068 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 21:27:24,070 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 21:27:24,070 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 21:27:24,070 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 21:27:24,088 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:27:24" (1/1) ... [2018-11-18 21:27:24,088 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:27:24" (1/1) ... [2018-11-18 21:27:24,101 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:27:24" (1/1) ... [2018-11-18 21:27:24,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:27:24" (1/1) ... [2018-11-18 21:27:24,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:27:24" (1/1) ... [2018-11-18 21:27:24,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:27:24" (1/1) ... [2018-11-18 21:27:24,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:27:24" (1/1) ... [2018-11-18 21:27:24,158 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 21:27:24,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 21:27:24,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 21:27:24,159 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 21:27:24,159 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:27:24" (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-18 21:27:24,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 21:27:24,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 21:27:24,302 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 21:27:24,302 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 21:27:24,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 21:27:24,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 21:27:24,302 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 21:27:24,302 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 21:27:24,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 21:27:24,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-18 21:27:24,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-18 21:27:24,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 21:27:24,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 21:27:24,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 21:27:24,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-18 21:27:25,482 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 21:27:25,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:27:25 BoogieIcfgContainer [2018-11-18 21:27:25,483 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 21:27:25,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 21:27:25,484 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 21:27:25,488 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 21:27:25,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 09:27:23" (1/3) ... [2018-11-18 21:27:25,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@286673f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:27:25, skipping insertion in model container [2018-11-18 21:27:25,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:27:24" (2/3) ... [2018-11-18 21:27:25,490 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@286673f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 09:27:25, skipping insertion in model container [2018-11-18 21:27:25,490 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:27:25" (3/3) ... [2018-11-18 21:27:25,492 INFO L112 eAbstractionObserver]: Analyzing ICFG init-4-n-u_true-unreach-call.i [2018-11-18 21:27:25,499 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 21:27:25,508 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 21:27:25,524 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 21:27:25,566 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 21:27:25,567 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 21:27:25,567 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 21:27:25,567 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 21:27:25,568 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 21:27:25,568 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 21:27:25,568 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 21:27:25,568 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 21:27:25,569 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 21:27:25,585 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-18 21:27:25,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-18 21:27:25,592 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:27:25,593 INFO L375 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-18 21:27:25,595 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:27:25,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:27:25,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1911485235, now seen corresponding path program 1 times [2018-11-18 21:27:25,608 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:27:25,609 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-18 21:27:25,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:27:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:27:25,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:27:25,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:27:25,831 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-18 21:27:25,835 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {45#true} is VALID [2018-11-18 21:27:25,835 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-18 21:27:25,836 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #133#return; {45#true} is VALID [2018-11-18 21:27:25,836 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret2 := main(); {45#true} is VALID [2018-11-18 21:27:25,837 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~p~0 := 1800bv32;~q~0 := 2000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {45#true} is VALID [2018-11-18 21:27:25,838 INFO L273 TraceCheckUtils]: 6: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-18 21:27:25,838 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {46#false} is VALID [2018-11-18 21:27:25,838 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#false} assume true; {46#false} is VALID [2018-11-18 21:27:25,839 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {46#false} is VALID [2018-11-18 21:27:25,839 INFO L273 TraceCheckUtils]: 10: Hoare triple {46#false} assume true; {46#false} is VALID [2018-11-18 21:27:25,839 INFO L273 TraceCheckUtils]: 11: Hoare triple {46#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {46#false} is VALID [2018-11-18 21:27:25,840 INFO L273 TraceCheckUtils]: 12: Hoare triple {46#false} assume true; {46#false} is VALID [2018-11-18 21:27:25,840 INFO L273 TraceCheckUtils]: 13: Hoare triple {46#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {46#false} is VALID [2018-11-18 21:27:25,840 INFO L273 TraceCheckUtils]: 14: Hoare triple {46#false} assume true; {46#false} is VALID [2018-11-18 21:27:25,841 INFO L273 TraceCheckUtils]: 15: Hoare triple {46#false} assume !!~bvslt32(~l~0, ~q~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32); {46#false} is VALID [2018-11-18 21:27:25,841 INFO L256 TraceCheckUtils]: 16: Hoare triple {46#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {46#false} is VALID [2018-11-18 21:27:25,841 INFO L273 TraceCheckUtils]: 17: Hoare triple {46#false} ~cond := #in~cond; {46#false} is VALID [2018-11-18 21:27:25,842 INFO L273 TraceCheckUtils]: 18: Hoare triple {46#false} assume 0bv32 == ~cond; {46#false} is VALID [2018-11-18 21:27:25,842 INFO L273 TraceCheckUtils]: 19: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-18 21:27:25,846 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-18 21:27:25,847 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:27:25,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:27:25,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 21:27:25,860 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-18 21:27:25,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:27:25,867 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 21:27:26,115 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-18 21:27:26,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 21:27:26,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 21:27:26,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 21:27:26,129 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-18 21:27:26,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:27:26,596 INFO L93 Difference]: Finished difference Result 78 states and 111 transitions. [2018-11-18 21:27:26,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 21:27:26,596 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-18 21:27:26,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:27:26,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 21:27:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 111 transitions. [2018-11-18 21:27:26,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 21:27:26,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 111 transitions. [2018-11-18 21:27:26,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 111 transitions. [2018-11-18 21:27:27,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:27:27,409 INFO L225 Difference]: With dead ends: 78 [2018-11-18 21:27:27,412 INFO L226 Difference]: Without dead ends: 37 [2018-11-18 21:27:27,417 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 21:27:27,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-18 21:27:27,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-18 21:27:27,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:27:27,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-18 21:27:27,534 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-18 21:27:27,535 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-18 21:27:27,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:27:27,540 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-18 21:27:27,541 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-18 21:27:27,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:27:27,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:27:27,542 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-18 21:27:27,542 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-18 21:27:27,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:27:27,547 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2018-11-18 21:27:27,548 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-18 21:27:27,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:27:27,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:27:27,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:27:27,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:27:27,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 21:27:27,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2018-11-18 21:27:27,563 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 20 [2018-11-18 21:27:27,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:27:27,563 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2018-11-18 21:27:27,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 21:27:27,564 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2018-11-18 21:27:27,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-18 21:27:27,568 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:27:27,568 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:27:27,568 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:27:27,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:27:27,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1207347132, now seen corresponding path program 1 times [2018-11-18 21:27:27,570 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:27:27,571 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-18 21:27:27,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:27:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:27:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:27:27,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:27:27,826 INFO L256 TraceCheckUtils]: 0: Hoare triple {333#true} call ULTIMATE.init(); {333#true} is VALID [2018-11-18 21:27:27,827 INFO L273 TraceCheckUtils]: 1: Hoare triple {333#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {333#true} is VALID [2018-11-18 21:27:27,827 INFO L273 TraceCheckUtils]: 2: Hoare triple {333#true} assume true; {333#true} is VALID [2018-11-18 21:27:27,828 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {333#true} {333#true} #133#return; {333#true} is VALID [2018-11-18 21:27:27,828 INFO L256 TraceCheckUtils]: 4: Hoare triple {333#true} call #t~ret2 := main(); {333#true} is VALID [2018-11-18 21:27:27,829 INFO L273 TraceCheckUtils]: 5: Hoare triple {333#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~p~0 := 1800bv32;~q~0 := 2000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {353#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:27:27,830 INFO L273 TraceCheckUtils]: 6: Hoare triple {353#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume true; {353#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:27:27,830 INFO L273 TraceCheckUtils]: 7: Hoare triple {353#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !~bvslt32(~i~0, ~m~0); {334#false} is VALID [2018-11-18 21:27:27,831 INFO L273 TraceCheckUtils]: 8: Hoare triple {334#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {334#false} is VALID [2018-11-18 21:27:27,832 INFO L273 TraceCheckUtils]: 9: Hoare triple {334#false} assume true; {334#false} is VALID [2018-11-18 21:27:27,832 INFO L273 TraceCheckUtils]: 10: Hoare triple {334#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {334#false} is VALID [2018-11-18 21:27:27,833 INFO L273 TraceCheckUtils]: 11: Hoare triple {334#false} assume true; {334#false} is VALID [2018-11-18 21:27:27,833 INFO L273 TraceCheckUtils]: 12: Hoare triple {334#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {334#false} is VALID [2018-11-18 21:27:27,833 INFO L273 TraceCheckUtils]: 13: Hoare triple {334#false} assume true; {334#false} is VALID [2018-11-18 21:27:27,833 INFO L273 TraceCheckUtils]: 14: Hoare triple {334#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {334#false} is VALID [2018-11-18 21:27:27,834 INFO L273 TraceCheckUtils]: 15: Hoare triple {334#false} assume true; {334#false} is VALID [2018-11-18 21:27:27,834 INFO L273 TraceCheckUtils]: 16: Hoare triple {334#false} assume !!~bvslt32(~l~0, ~q~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32); {334#false} is VALID [2018-11-18 21:27:27,834 INFO L256 TraceCheckUtils]: 17: Hoare triple {334#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {334#false} is VALID [2018-11-18 21:27:27,834 INFO L273 TraceCheckUtils]: 18: Hoare triple {334#false} ~cond := #in~cond; {334#false} is VALID [2018-11-18 21:27:27,835 INFO L273 TraceCheckUtils]: 19: Hoare triple {334#false} assume 0bv32 == ~cond; {334#false} is VALID [2018-11-18 21:27:27,835 INFO L273 TraceCheckUtils]: 20: Hoare triple {334#false} assume !false; {334#false} is VALID [2018-11-18 21:27:27,837 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-18 21:27:27,838 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:27:27,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:27:27,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 21:27:27,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 21:27:27,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:27:27,846 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 21:27:27,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:27:27,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 21:27:27,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 21:27:27,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 21:27:27,920 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand 3 states. [2018-11-18 21:27:28,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:27:28,928 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2018-11-18 21:27:28,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 21:27:28,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-18 21:27:28,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:27:28,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:27:28,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-18 21:27:28,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 21:27:28,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2018-11-18 21:27:28,938 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2018-11-18 21:27:29,325 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:27:29,330 INFO L225 Difference]: With dead ends: 68 [2018-11-18 21:27:29,330 INFO L226 Difference]: Without dead ends: 48 [2018-11-18 21:27:29,331 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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-18 21:27:29,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-18 21:27:29,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 39. [2018-11-18 21:27:29,357 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:27:29,358 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 39 states. [2018-11-18 21:27:29,358 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 39 states. [2018-11-18 21:27:29,358 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 39 states. [2018-11-18 21:27:29,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:27:29,362 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-11-18 21:27:29,362 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-18 21:27:29,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:27:29,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:27:29,363 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 48 states. [2018-11-18 21:27:29,363 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 48 states. [2018-11-18 21:27:29,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:27:29,367 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-11-18 21:27:29,367 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-18 21:27:29,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:27:29,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:27:29,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:27:29,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:27:29,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-18 21:27:29,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 46 transitions. [2018-11-18 21:27:29,372 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 46 transitions. Word has length 21 [2018-11-18 21:27:29,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:27:29,372 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 46 transitions. [2018-11-18 21:27:29,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 21:27:29,373 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 46 transitions. [2018-11-18 21:27:29,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 21:27:29,374 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:27:29,374 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 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-18 21:27:29,374 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:27:29,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:27:29,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1010001099, now seen corresponding path program 1 times [2018-11-18 21:27:29,375 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:27:29,376 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-18 21:27:29,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:27:29,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:27:29,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:27:29,466 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:27:29,570 INFO L256 TraceCheckUtils]: 0: Hoare triple {640#true} call ULTIMATE.init(); {640#true} is VALID [2018-11-18 21:27:29,570 INFO L273 TraceCheckUtils]: 1: Hoare triple {640#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {640#true} is VALID [2018-11-18 21:27:29,570 INFO L273 TraceCheckUtils]: 2: Hoare triple {640#true} assume true; {640#true} is VALID [2018-11-18 21:27:29,571 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {640#true} {640#true} #133#return; {640#true} is VALID [2018-11-18 21:27:29,571 INFO L256 TraceCheckUtils]: 4: Hoare triple {640#true} call #t~ret2 := main(); {640#true} is VALID [2018-11-18 21:27:29,573 INFO L273 TraceCheckUtils]: 5: Hoare triple {640#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~p~0 := 1800bv32;~q~0 := 2000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {660#(= (_ bv1500 32) main_~n~0)} is VALID [2018-11-18 21:27:29,574 INFO L273 TraceCheckUtils]: 6: Hoare triple {660#(= (_ bv1500 32) main_~n~0)} assume true; {660#(= (_ bv1500 32) main_~n~0)} is VALID [2018-11-18 21:27:29,579 INFO L273 TraceCheckUtils]: 7: Hoare triple {660#(= (_ bv1500 32) main_~n~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {667#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-18 21:27:29,580 INFO L273 TraceCheckUtils]: 8: Hoare triple {667#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume true; {667#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} is VALID [2018-11-18 21:27:29,580 INFO L273 TraceCheckUtils]: 9: Hoare triple {667#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1500 32) main_~n~0))} assume !~bvslt32(~j~0, ~n~0); {641#false} is VALID [2018-11-18 21:27:29,580 INFO L273 TraceCheckUtils]: 10: Hoare triple {641#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {641#false} is VALID [2018-11-18 21:27:29,581 INFO L273 TraceCheckUtils]: 11: Hoare triple {641#false} assume true; {641#false} is VALID [2018-11-18 21:27:29,581 INFO L273 TraceCheckUtils]: 12: Hoare triple {641#false} assume !~bvslt32(~i~0, ~m~0); {641#false} is VALID [2018-11-18 21:27:29,582 INFO L273 TraceCheckUtils]: 13: Hoare triple {641#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {641#false} is VALID [2018-11-18 21:27:29,582 INFO L273 TraceCheckUtils]: 14: Hoare triple {641#false} assume true; {641#false} is VALID [2018-11-18 21:27:29,582 INFO L273 TraceCheckUtils]: 15: Hoare triple {641#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {641#false} is VALID [2018-11-18 21:27:29,583 INFO L273 TraceCheckUtils]: 16: Hoare triple {641#false} assume true; {641#false} is VALID [2018-11-18 21:27:29,583 INFO L273 TraceCheckUtils]: 17: Hoare triple {641#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {641#false} is VALID [2018-11-18 21:27:29,583 INFO L273 TraceCheckUtils]: 18: Hoare triple {641#false} assume true; {641#false} is VALID [2018-11-18 21:27:29,584 INFO L273 TraceCheckUtils]: 19: Hoare triple {641#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {641#false} is VALID [2018-11-18 21:27:29,584 INFO L273 TraceCheckUtils]: 20: Hoare triple {641#false} assume true; {641#false} is VALID [2018-11-18 21:27:29,584 INFO L273 TraceCheckUtils]: 21: Hoare triple {641#false} assume !!~bvslt32(~l~0, ~q~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32); {641#false} is VALID [2018-11-18 21:27:29,585 INFO L256 TraceCheckUtils]: 22: Hoare triple {641#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {641#false} is VALID [2018-11-18 21:27:29,585 INFO L273 TraceCheckUtils]: 23: Hoare triple {641#false} ~cond := #in~cond; {641#false} is VALID [2018-11-18 21:27:29,585 INFO L273 TraceCheckUtils]: 24: Hoare triple {641#false} assume 0bv32 == ~cond; {641#false} is VALID [2018-11-18 21:27:29,586 INFO L273 TraceCheckUtils]: 25: Hoare triple {641#false} assume !false; {641#false} is VALID [2018-11-18 21:27:29,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:27:29,588 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:27:29,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:27:29,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 21:27:29,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-18 21:27:29,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:27:29,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 21:27:29,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:27:29,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 21:27:29,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 21:27:29,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 21:27:29,685 INFO L87 Difference]: Start difference. First operand 39 states and 46 transitions. Second operand 4 states. [2018-11-18 21:27:30,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:27:30,684 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2018-11-18 21:27:30,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 21:27:30,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-18 21:27:30,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:27:30,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 21:27:30,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2018-11-18 21:27:30,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 21:27:30,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2018-11-18 21:27:30,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 111 transitions. [2018-11-18 21:27:31,130 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:27:31,134 INFO L225 Difference]: With dead ends: 90 [2018-11-18 21:27:31,135 INFO L226 Difference]: Without dead ends: 59 [2018-11-18 21:27:31,136 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 23 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-18 21:27:31,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-11-18 21:27:31,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 43. [2018-11-18 21:27:31,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:27:31,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand 43 states. [2018-11-18 21:27:31,190 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 43 states. [2018-11-18 21:27:31,190 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 43 states. [2018-11-18 21:27:31,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:27:31,195 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2018-11-18 21:27:31,196 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2018-11-18 21:27:31,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:27:31,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:27:31,197 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 59 states. [2018-11-18 21:27:31,197 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 59 states. [2018-11-18 21:27:31,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:27:31,201 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2018-11-18 21:27:31,201 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 71 transitions. [2018-11-18 21:27:31,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:27:31,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:27:31,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:27:31,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:27:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 21:27:31,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-11-18 21:27:31,206 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 26 [2018-11-18 21:27:31,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:27:31,206 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-18 21:27:31,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 21:27:31,206 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-11-18 21:27:31,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-18 21:27:31,208 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:27:31,208 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 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-18 21:27:31,208 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:27:31,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:27:31,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1077297772, now seen corresponding path program 1 times [2018-11-18 21:27:31,209 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:27:31,209 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-18 21:27:31,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:27:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:27:31,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:27:31,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:27:31,363 INFO L256 TraceCheckUtils]: 0: Hoare triple {1022#true} call ULTIMATE.init(); {1022#true} is VALID [2018-11-18 21:27:31,364 INFO L273 TraceCheckUtils]: 1: Hoare triple {1022#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1022#true} is VALID [2018-11-18 21:27:31,364 INFO L273 TraceCheckUtils]: 2: Hoare triple {1022#true} assume true; {1022#true} is VALID [2018-11-18 21:27:31,364 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1022#true} {1022#true} #133#return; {1022#true} is VALID [2018-11-18 21:27:31,365 INFO L256 TraceCheckUtils]: 4: Hoare triple {1022#true} call #t~ret2 := main(); {1022#true} is VALID [2018-11-18 21:27:31,366 INFO L273 TraceCheckUtils]: 5: Hoare triple {1022#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~p~0 := 1800bv32;~q~0 := 2000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1042#(= (_ bv1800 32) main_~p~0)} is VALID [2018-11-18 21:27:31,367 INFO L273 TraceCheckUtils]: 6: Hoare triple {1042#(= (_ bv1800 32) main_~p~0)} assume true; {1042#(= (_ bv1800 32) main_~p~0)} is VALID [2018-11-18 21:27:31,368 INFO L273 TraceCheckUtils]: 7: Hoare triple {1042#(= (_ bv1800 32) main_~p~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1042#(= (_ bv1800 32) main_~p~0)} is VALID [2018-11-18 21:27:31,368 INFO L273 TraceCheckUtils]: 8: Hoare triple {1042#(= (_ bv1800 32) main_~p~0)} assume true; {1042#(= (_ bv1800 32) main_~p~0)} is VALID [2018-11-18 21:27:31,369 INFO L273 TraceCheckUtils]: 9: Hoare triple {1042#(= (_ bv1800 32) main_~p~0)} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {1055#(and (= (_ bv1800 32) main_~p~0) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-18 21:27:31,369 INFO L273 TraceCheckUtils]: 10: Hoare triple {1055#(and (= (_ bv1800 32) main_~p~0) (= main_~k~0 (_ bv0 32)))} assume true; {1055#(and (= (_ bv1800 32) main_~p~0) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-18 21:27:31,370 INFO L273 TraceCheckUtils]: 11: Hoare triple {1055#(and (= (_ bv1800 32) main_~p~0) (= main_~k~0 (_ bv0 32)))} assume !~bvslt32(~k~0, ~p~0); {1023#false} is VALID [2018-11-18 21:27:31,370 INFO L273 TraceCheckUtils]: 12: Hoare triple {1023#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {1023#false} is VALID [2018-11-18 21:27:31,371 INFO L273 TraceCheckUtils]: 13: Hoare triple {1023#false} assume true; {1023#false} is VALID [2018-11-18 21:27:31,371 INFO L273 TraceCheckUtils]: 14: Hoare triple {1023#false} assume !~bvslt32(~j~0, ~n~0); {1023#false} is VALID [2018-11-18 21:27:31,372 INFO L273 TraceCheckUtils]: 15: Hoare triple {1023#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {1023#false} is VALID [2018-11-18 21:27:31,372 INFO L273 TraceCheckUtils]: 16: Hoare triple {1023#false} assume true; {1023#false} is VALID [2018-11-18 21:27:31,372 INFO L273 TraceCheckUtils]: 17: Hoare triple {1023#false} assume !~bvslt32(~i~0, ~m~0); {1023#false} is VALID [2018-11-18 21:27:31,373 INFO L273 TraceCheckUtils]: 18: Hoare triple {1023#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1023#false} is VALID [2018-11-18 21:27:31,373 INFO L273 TraceCheckUtils]: 19: Hoare triple {1023#false} assume true; {1023#false} is VALID [2018-11-18 21:27:31,373 INFO L273 TraceCheckUtils]: 20: Hoare triple {1023#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1023#false} is VALID [2018-11-18 21:27:31,374 INFO L273 TraceCheckUtils]: 21: Hoare triple {1023#false} assume true; {1023#false} is VALID [2018-11-18 21:27:31,374 INFO L273 TraceCheckUtils]: 22: Hoare triple {1023#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {1023#false} is VALID [2018-11-18 21:27:31,374 INFO L273 TraceCheckUtils]: 23: Hoare triple {1023#false} assume true; {1023#false} is VALID [2018-11-18 21:27:31,374 INFO L273 TraceCheckUtils]: 24: Hoare triple {1023#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {1023#false} is VALID [2018-11-18 21:27:31,375 INFO L273 TraceCheckUtils]: 25: Hoare triple {1023#false} assume true; {1023#false} is VALID [2018-11-18 21:27:31,375 INFO L273 TraceCheckUtils]: 26: Hoare triple {1023#false} assume !!~bvslt32(~l~0, ~q~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32); {1023#false} is VALID [2018-11-18 21:27:31,375 INFO L256 TraceCheckUtils]: 27: Hoare triple {1023#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {1023#false} is VALID [2018-11-18 21:27:31,375 INFO L273 TraceCheckUtils]: 28: Hoare triple {1023#false} ~cond := #in~cond; {1023#false} is VALID [2018-11-18 21:27:31,376 INFO L273 TraceCheckUtils]: 29: Hoare triple {1023#false} assume 0bv32 == ~cond; {1023#false} is VALID [2018-11-18 21:27:31,376 INFO L273 TraceCheckUtils]: 30: Hoare triple {1023#false} assume !false; {1023#false} is VALID [2018-11-18 21:27:31,378 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:27:31,378 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:27:31,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:27:31,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 21:27:31,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-11-18 21:27:31,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:27:31,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 21:27:31,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:27:31,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 21:27:31,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 21:27:31,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 21:27:31,474 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 4 states. [2018-11-18 21:27:32,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:27:32,659 INFO L93 Difference]: Finished difference Result 92 states and 111 transitions. [2018-11-18 21:27:32,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 21:27:32,660 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-11-18 21:27:32,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:27:32,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 21:27:32,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2018-11-18 21:27:32,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 21:27:32,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2018-11-18 21:27:32,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2018-11-18 21:27:33,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:27:33,063 INFO L225 Difference]: With dead ends: 92 [2018-11-18 21:27:33,063 INFO L226 Difference]: Without dead ends: 57 [2018-11-18 21:27:33,064 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 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-18 21:27:33,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-18 21:27:33,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 47. [2018-11-18 21:27:33,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:27:33,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 47 states. [2018-11-18 21:27:33,120 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 47 states. [2018-11-18 21:27:33,120 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 47 states. [2018-11-18 21:27:33,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:27:33,124 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2018-11-18 21:27:33,125 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-11-18 21:27:33,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:27:33,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:27:33,127 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 57 states. [2018-11-18 21:27:33,127 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 57 states. [2018-11-18 21:27:33,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:27:33,132 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2018-11-18 21:27:33,132 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2018-11-18 21:27:33,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:27:33,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:27:33,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:27:33,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:27:33,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 21:27:33,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 54 transitions. [2018-11-18 21:27:33,141 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 54 transitions. Word has length 31 [2018-11-18 21:27:33,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:27:33,142 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 54 transitions. [2018-11-18 21:27:33,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 21:27:33,142 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-11-18 21:27:33,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-18 21:27:33,143 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:27:33,143 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-18 21:27:33,143 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:27:33,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:27:33,144 INFO L82 PathProgramCache]: Analyzing trace with hash 843638117, now seen corresponding path program 1 times [2018-11-18 21:27:33,144 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:27:33,144 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-18 21:27:33,161 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:27:33,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:27:33,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:27:33,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:27:33,421 INFO L256 TraceCheckUtils]: 0: Hoare triple {1425#true} call ULTIMATE.init(); {1425#true} is VALID [2018-11-18 21:27:33,422 INFO L273 TraceCheckUtils]: 1: Hoare triple {1425#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1425#true} is VALID [2018-11-18 21:27:33,422 INFO L273 TraceCheckUtils]: 2: Hoare triple {1425#true} assume true; {1425#true} is VALID [2018-11-18 21:27:33,423 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1425#true} {1425#true} #133#return; {1425#true} is VALID [2018-11-18 21:27:33,423 INFO L256 TraceCheckUtils]: 4: Hoare triple {1425#true} call #t~ret2 := main(); {1425#true} is VALID [2018-11-18 21:27:33,424 INFO L273 TraceCheckUtils]: 5: Hoare triple {1425#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~p~0 := 1800bv32;~q~0 := 2000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1445#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-18 21:27:33,425 INFO L273 TraceCheckUtils]: 6: Hoare triple {1445#(= (_ bv2000 32) main_~q~0)} assume true; {1445#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-18 21:27:33,425 INFO L273 TraceCheckUtils]: 7: Hoare triple {1445#(= (_ bv2000 32) main_~q~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1445#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-18 21:27:33,432 INFO L273 TraceCheckUtils]: 8: Hoare triple {1445#(= (_ bv2000 32) main_~q~0)} assume true; {1445#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-18 21:27:33,433 INFO L273 TraceCheckUtils]: 9: Hoare triple {1445#(= (_ bv2000 32) main_~q~0)} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {1445#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-18 21:27:33,434 INFO L273 TraceCheckUtils]: 10: Hoare triple {1445#(= (_ bv2000 32) main_~q~0)} assume true; {1445#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-18 21:27:33,435 INFO L273 TraceCheckUtils]: 11: Hoare triple {1445#(= (_ bv2000 32) main_~q~0)} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {1464#(and (= main_~l~0 (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:27:33,435 INFO L273 TraceCheckUtils]: 12: Hoare triple {1464#(and (= main_~l~0 (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume true; {1464#(and (= main_~l~0 (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:27:33,436 INFO L273 TraceCheckUtils]: 13: Hoare triple {1464#(and (= main_~l~0 (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !~bvslt32(~l~0, ~q~0); {1426#false} is VALID [2018-11-18 21:27:33,436 INFO L273 TraceCheckUtils]: 14: Hoare triple {1426#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {1426#false} is VALID [2018-11-18 21:27:33,436 INFO L273 TraceCheckUtils]: 15: Hoare triple {1426#false} assume true; {1426#false} is VALID [2018-11-18 21:27:33,437 INFO L273 TraceCheckUtils]: 16: Hoare triple {1426#false} assume !~bvslt32(~k~0, ~p~0); {1426#false} is VALID [2018-11-18 21:27:33,437 INFO L273 TraceCheckUtils]: 17: Hoare triple {1426#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {1426#false} is VALID [2018-11-18 21:27:33,437 INFO L273 TraceCheckUtils]: 18: Hoare triple {1426#false} assume true; {1426#false} is VALID [2018-11-18 21:27:33,437 INFO L273 TraceCheckUtils]: 19: Hoare triple {1426#false} assume !~bvslt32(~j~0, ~n~0); {1426#false} is VALID [2018-11-18 21:27:33,438 INFO L273 TraceCheckUtils]: 20: Hoare triple {1426#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {1426#false} is VALID [2018-11-18 21:27:33,438 INFO L273 TraceCheckUtils]: 21: Hoare triple {1426#false} assume true; {1426#false} is VALID [2018-11-18 21:27:33,439 INFO L273 TraceCheckUtils]: 22: Hoare triple {1426#false} assume !~bvslt32(~i~0, ~m~0); {1426#false} is VALID [2018-11-18 21:27:33,439 INFO L273 TraceCheckUtils]: 23: Hoare triple {1426#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1426#false} is VALID [2018-11-18 21:27:33,439 INFO L273 TraceCheckUtils]: 24: Hoare triple {1426#false} assume true; {1426#false} is VALID [2018-11-18 21:27:33,439 INFO L273 TraceCheckUtils]: 25: Hoare triple {1426#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1426#false} is VALID [2018-11-18 21:27:33,440 INFO L273 TraceCheckUtils]: 26: Hoare triple {1426#false} assume true; {1426#false} is VALID [2018-11-18 21:27:33,440 INFO L273 TraceCheckUtils]: 27: Hoare triple {1426#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {1426#false} is VALID [2018-11-18 21:27:33,440 INFO L273 TraceCheckUtils]: 28: Hoare triple {1426#false} assume true; {1426#false} is VALID [2018-11-18 21:27:33,441 INFO L273 TraceCheckUtils]: 29: Hoare triple {1426#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {1426#false} is VALID [2018-11-18 21:27:33,441 INFO L273 TraceCheckUtils]: 30: Hoare triple {1426#false} assume true; {1426#false} is VALID [2018-11-18 21:27:33,441 INFO L273 TraceCheckUtils]: 31: Hoare triple {1426#false} assume !!~bvslt32(~l~0, ~q~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32); {1426#false} is VALID [2018-11-18 21:27:33,442 INFO L256 TraceCheckUtils]: 32: Hoare triple {1426#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {1426#false} is VALID [2018-11-18 21:27:33,442 INFO L273 TraceCheckUtils]: 33: Hoare triple {1426#false} ~cond := #in~cond; {1426#false} is VALID [2018-11-18 21:27:33,442 INFO L273 TraceCheckUtils]: 34: Hoare triple {1426#false} assume 0bv32 == ~cond; {1426#false} is VALID [2018-11-18 21:27:33,442 INFO L273 TraceCheckUtils]: 35: Hoare triple {1426#false} assume !false; {1426#false} is VALID [2018-11-18 21:27:33,445 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:27:33,445 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-18 21:27:33,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 21:27:33,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 21:27:33,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-18 21:27:33,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:27:33,452 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 21:27:33,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:27:33,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 21:27:33,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 21:27:33,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 21:27:33,544 INFO L87 Difference]: Start difference. First operand 47 states and 54 transitions. Second operand 4 states. [2018-11-18 21:27:34,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:27:34,589 INFO L93 Difference]: Finished difference Result 94 states and 111 transitions. [2018-11-18 21:27:34,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 21:27:34,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-18 21:27:34,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:27:34,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 21:27:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2018-11-18 21:27:34,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 21:27:34,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 103 transitions. [2018-11-18 21:27:34,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 103 transitions. [2018-11-18 21:27:35,072 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:27:35,074 INFO L225 Difference]: With dead ends: 94 [2018-11-18 21:27:35,074 INFO L226 Difference]: Without dead ends: 55 [2018-11-18 21:27:35,075 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 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-18 21:27:35,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-18 21:27:35,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 51. [2018-11-18 21:27:35,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:27:35,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 51 states. [2018-11-18 21:27:35,253 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 51 states. [2018-11-18 21:27:35,254 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 51 states. [2018-11-18 21:27:35,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:27:35,257 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-18 21:27:35,257 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-11-18 21:27:35,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:27:35,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:27:35,258 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 55 states. [2018-11-18 21:27:35,258 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 55 states. [2018-11-18 21:27:35,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:27:35,261 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-18 21:27:35,262 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 63 transitions. [2018-11-18 21:27:35,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:27:35,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:27:35,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:27:35,263 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:27:35,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-18 21:27:35,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 58 transitions. [2018-11-18 21:27:35,265 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 58 transitions. Word has length 36 [2018-11-18 21:27:35,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:27:35,266 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 58 transitions. [2018-11-18 21:27:35,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 21:27:35,266 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 58 transitions. [2018-11-18 21:27:35,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-18 21:27:35,267 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:27:35,267 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-18 21:27:35,267 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:27:35,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:27:35,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1254429749, now seen corresponding path program 1 times [2018-11-18 21:27:35,268 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:27:35,268 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-18 21:27:35,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 21:27:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:27:35,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:27:35,369 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:27:35,478 INFO L256 TraceCheckUtils]: 0: Hoare triple {1849#true} call ULTIMATE.init(); {1849#true} is VALID [2018-11-18 21:27:35,478 INFO L273 TraceCheckUtils]: 1: Hoare triple {1849#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1849#true} is VALID [2018-11-18 21:27:35,479 INFO L273 TraceCheckUtils]: 2: Hoare triple {1849#true} assume true; {1849#true} is VALID [2018-11-18 21:27:35,479 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1849#true} {1849#true} #133#return; {1849#true} is VALID [2018-11-18 21:27:35,480 INFO L256 TraceCheckUtils]: 4: Hoare triple {1849#true} call #t~ret2 := main(); {1849#true} is VALID [2018-11-18 21:27:35,481 INFO L273 TraceCheckUtils]: 5: Hoare triple {1849#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~p~0 := 1800bv32;~q~0 := 2000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1869#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-18 21:27:35,481 INFO L273 TraceCheckUtils]: 6: Hoare triple {1869#(= (_ bv2000 32) main_~q~0)} assume true; {1869#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-18 21:27:35,482 INFO L273 TraceCheckUtils]: 7: Hoare triple {1869#(= (_ bv2000 32) main_~q~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1869#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-18 21:27:35,482 INFO L273 TraceCheckUtils]: 8: Hoare triple {1869#(= (_ bv2000 32) main_~q~0)} assume true; {1869#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-18 21:27:35,483 INFO L273 TraceCheckUtils]: 9: Hoare triple {1869#(= (_ bv2000 32) main_~q~0)} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {1869#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-18 21:27:35,483 INFO L273 TraceCheckUtils]: 10: Hoare triple {1869#(= (_ bv2000 32) main_~q~0)} assume true; {1869#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-18 21:27:35,484 INFO L273 TraceCheckUtils]: 11: Hoare triple {1869#(= (_ bv2000 32) main_~q~0)} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {1888#(and (= main_~l~0 (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:27:35,485 INFO L273 TraceCheckUtils]: 12: Hoare triple {1888#(and (= main_~l~0 (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume true; {1888#(and (= main_~l~0 (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:27:35,517 INFO L273 TraceCheckUtils]: 13: Hoare triple {1888#(and (= main_~l~0 (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {1895#(and (= (bvadd main_~l~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:27:35,518 INFO L273 TraceCheckUtils]: 14: Hoare triple {1895#(and (= (bvadd main_~l~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume true; {1895#(and (= (bvadd main_~l~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:27:35,518 INFO L273 TraceCheckUtils]: 15: Hoare triple {1895#(and (= (bvadd main_~l~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !~bvslt32(~l~0, ~q~0); {1850#false} is VALID [2018-11-18 21:27:35,518 INFO L273 TraceCheckUtils]: 16: Hoare triple {1850#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {1850#false} is VALID [2018-11-18 21:27:35,519 INFO L273 TraceCheckUtils]: 17: Hoare triple {1850#false} assume true; {1850#false} is VALID [2018-11-18 21:27:35,519 INFO L273 TraceCheckUtils]: 18: Hoare triple {1850#false} assume !~bvslt32(~k~0, ~p~0); {1850#false} is VALID [2018-11-18 21:27:35,519 INFO L273 TraceCheckUtils]: 19: Hoare triple {1850#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {1850#false} is VALID [2018-11-18 21:27:35,519 INFO L273 TraceCheckUtils]: 20: Hoare triple {1850#false} assume true; {1850#false} is VALID [2018-11-18 21:27:35,520 INFO L273 TraceCheckUtils]: 21: Hoare triple {1850#false} assume !~bvslt32(~j~0, ~n~0); {1850#false} is VALID [2018-11-18 21:27:35,520 INFO L273 TraceCheckUtils]: 22: Hoare triple {1850#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {1850#false} is VALID [2018-11-18 21:27:35,520 INFO L273 TraceCheckUtils]: 23: Hoare triple {1850#false} assume true; {1850#false} is VALID [2018-11-18 21:27:35,521 INFO L273 TraceCheckUtils]: 24: Hoare triple {1850#false} assume !~bvslt32(~i~0, ~m~0); {1850#false} is VALID [2018-11-18 21:27:35,521 INFO L273 TraceCheckUtils]: 25: Hoare triple {1850#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1850#false} is VALID [2018-11-18 21:27:35,521 INFO L273 TraceCheckUtils]: 26: Hoare triple {1850#false} assume true; {1850#false} is VALID [2018-11-18 21:27:35,521 INFO L273 TraceCheckUtils]: 27: Hoare triple {1850#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1850#false} is VALID [2018-11-18 21:27:35,521 INFO L273 TraceCheckUtils]: 28: Hoare triple {1850#false} assume true; {1850#false} is VALID [2018-11-18 21:27:35,521 INFO L273 TraceCheckUtils]: 29: Hoare triple {1850#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {1850#false} is VALID [2018-11-18 21:27:35,522 INFO L273 TraceCheckUtils]: 30: Hoare triple {1850#false} assume true; {1850#false} is VALID [2018-11-18 21:27:35,522 INFO L273 TraceCheckUtils]: 31: Hoare triple {1850#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {1850#false} is VALID [2018-11-18 21:27:35,522 INFO L273 TraceCheckUtils]: 32: Hoare triple {1850#false} assume true; {1850#false} is VALID [2018-11-18 21:27:35,522 INFO L273 TraceCheckUtils]: 33: Hoare triple {1850#false} assume !!~bvslt32(~l~0, ~q~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32); {1850#false} is VALID [2018-11-18 21:27:35,523 INFO L256 TraceCheckUtils]: 34: Hoare triple {1850#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {1850#false} is VALID [2018-11-18 21:27:35,523 INFO L273 TraceCheckUtils]: 35: Hoare triple {1850#false} ~cond := #in~cond; {1850#false} is VALID [2018-11-18 21:27:35,523 INFO L273 TraceCheckUtils]: 36: Hoare triple {1850#false} assume 0bv32 == ~cond; {1850#false} is VALID [2018-11-18 21:27:35,523 INFO L273 TraceCheckUtils]: 37: Hoare triple {1850#false} assume !false; {1850#false} is VALID [2018-11-18 21:27:35,525 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:27:35,526 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 21:27:35,634 INFO L273 TraceCheckUtils]: 37: Hoare triple {1850#false} assume !false; {1850#false} is VALID [2018-11-18 21:27:35,634 INFO L273 TraceCheckUtils]: 36: Hoare triple {1850#false} assume 0bv32 == ~cond; {1850#false} is VALID [2018-11-18 21:27:35,635 INFO L273 TraceCheckUtils]: 35: Hoare triple {1850#false} ~cond := #in~cond; {1850#false} is VALID [2018-11-18 21:27:35,635 INFO L256 TraceCheckUtils]: 34: Hoare triple {1850#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {1850#false} is VALID [2018-11-18 21:27:35,635 INFO L273 TraceCheckUtils]: 33: Hoare triple {1850#false} assume !!~bvslt32(~l~0, ~q~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32); {1850#false} is VALID [2018-11-18 21:27:35,635 INFO L273 TraceCheckUtils]: 32: Hoare triple {1850#false} assume true; {1850#false} is VALID [2018-11-18 21:27:35,635 INFO L273 TraceCheckUtils]: 31: Hoare triple {1850#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {1850#false} is VALID [2018-11-18 21:27:35,635 INFO L273 TraceCheckUtils]: 30: Hoare triple {1850#false} assume true; {1850#false} is VALID [2018-11-18 21:27:35,636 INFO L273 TraceCheckUtils]: 29: Hoare triple {1850#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {1850#false} is VALID [2018-11-18 21:27:35,636 INFO L273 TraceCheckUtils]: 28: Hoare triple {1850#false} assume true; {1850#false} is VALID [2018-11-18 21:27:35,636 INFO L273 TraceCheckUtils]: 27: Hoare triple {1850#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1850#false} is VALID [2018-11-18 21:27:35,636 INFO L273 TraceCheckUtils]: 26: Hoare triple {1850#false} assume true; {1850#false} is VALID [2018-11-18 21:27:35,637 INFO L273 TraceCheckUtils]: 25: Hoare triple {1850#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {1850#false} is VALID [2018-11-18 21:27:35,637 INFO L273 TraceCheckUtils]: 24: Hoare triple {1850#false} assume !~bvslt32(~i~0, ~m~0); {1850#false} is VALID [2018-11-18 21:27:35,637 INFO L273 TraceCheckUtils]: 23: Hoare triple {1850#false} assume true; {1850#false} is VALID [2018-11-18 21:27:35,637 INFO L273 TraceCheckUtils]: 22: Hoare triple {1850#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {1850#false} is VALID [2018-11-18 21:27:35,638 INFO L273 TraceCheckUtils]: 21: Hoare triple {1850#false} assume !~bvslt32(~j~0, ~n~0); {1850#false} is VALID [2018-11-18 21:27:35,638 INFO L273 TraceCheckUtils]: 20: Hoare triple {1850#false} assume true; {1850#false} is VALID [2018-11-18 21:27:35,638 INFO L273 TraceCheckUtils]: 19: Hoare triple {1850#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {1850#false} is VALID [2018-11-18 21:27:35,638 INFO L273 TraceCheckUtils]: 18: Hoare triple {1850#false} assume !~bvslt32(~k~0, ~p~0); {1850#false} is VALID [2018-11-18 21:27:35,638 INFO L273 TraceCheckUtils]: 17: Hoare triple {1850#false} assume true; {1850#false} is VALID [2018-11-18 21:27:35,639 INFO L273 TraceCheckUtils]: 16: Hoare triple {1850#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {1850#false} is VALID [2018-11-18 21:27:35,653 INFO L273 TraceCheckUtils]: 15: Hoare triple {2034#(bvslt main_~l~0 main_~q~0)} assume !~bvslt32(~l~0, ~q~0); {1850#false} is VALID [2018-11-18 21:27:35,657 INFO L273 TraceCheckUtils]: 14: Hoare triple {2034#(bvslt main_~l~0 main_~q~0)} assume true; {2034#(bvslt main_~l~0 main_~q~0)} is VALID [2018-11-18 21:27:35,658 INFO L273 TraceCheckUtils]: 13: Hoare triple {2041#(bvslt (bvadd main_~l~0 (_ bv1 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2034#(bvslt main_~l~0 main_~q~0)} is VALID [2018-11-18 21:27:35,662 INFO L273 TraceCheckUtils]: 12: Hoare triple {2041#(bvslt (bvadd main_~l~0 (_ bv1 32)) main_~q~0)} assume true; {2041#(bvslt (bvadd main_~l~0 (_ bv1 32)) main_~q~0)} is VALID [2018-11-18 21:27:35,662 INFO L273 TraceCheckUtils]: 11: Hoare triple {2048#(bvslt (_ bv1 32) main_~q~0)} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {2041#(bvslt (bvadd main_~l~0 (_ bv1 32)) main_~q~0)} is VALID [2018-11-18 21:27:35,664 INFO L273 TraceCheckUtils]: 10: Hoare triple {2048#(bvslt (_ bv1 32) main_~q~0)} assume true; {2048#(bvslt (_ bv1 32) main_~q~0)} is VALID [2018-11-18 21:27:35,664 INFO L273 TraceCheckUtils]: 9: Hoare triple {2048#(bvslt (_ bv1 32) main_~q~0)} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {2048#(bvslt (_ bv1 32) main_~q~0)} is VALID [2018-11-18 21:27:35,664 INFO L273 TraceCheckUtils]: 8: Hoare triple {2048#(bvslt (_ bv1 32) main_~q~0)} assume true; {2048#(bvslt (_ bv1 32) main_~q~0)} is VALID [2018-11-18 21:27:35,665 INFO L273 TraceCheckUtils]: 7: Hoare triple {2048#(bvslt (_ bv1 32) main_~q~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {2048#(bvslt (_ bv1 32) main_~q~0)} is VALID [2018-11-18 21:27:35,665 INFO L273 TraceCheckUtils]: 6: Hoare triple {2048#(bvslt (_ bv1 32) main_~q~0)} assume true; {2048#(bvslt (_ bv1 32) main_~q~0)} is VALID [2018-11-18 21:27:35,671 INFO L273 TraceCheckUtils]: 5: Hoare triple {1849#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~p~0 := 1800bv32;~q~0 := 2000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {2048#(bvslt (_ bv1 32) main_~q~0)} is VALID [2018-11-18 21:27:35,671 INFO L256 TraceCheckUtils]: 4: Hoare triple {1849#true} call #t~ret2 := main(); {1849#true} is VALID [2018-11-18 21:27:35,671 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1849#true} {1849#true} #133#return; {1849#true} is VALID [2018-11-18 21:27:35,672 INFO L273 TraceCheckUtils]: 2: Hoare triple {1849#true} assume true; {1849#true} is VALID [2018-11-18 21:27:35,672 INFO L273 TraceCheckUtils]: 1: Hoare triple {1849#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1849#true} is VALID [2018-11-18 21:27:35,672 INFO L256 TraceCheckUtils]: 0: Hoare triple {1849#true} call ULTIMATE.init(); {1849#true} is VALID [2018-11-18 21:27:35,674 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:27:35,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 21:27:35,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-18 21:27:35,679 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-11-18 21:27:35,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:27:35,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 21:27:35,886 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:27:35,886 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 21:27:35,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 21:27:35,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-18 21:27:35,887 INFO L87 Difference]: Start difference. First operand 51 states and 58 transitions. Second operand 8 states. [2018-11-18 21:27:39,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:27:39,552 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2018-11-18 21:27:39,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 21:27:39,552 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 38 [2018-11-18 21:27:39,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:27:39,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 21:27:39,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2018-11-18 21:27:39,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 21:27:39,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 125 transitions. [2018-11-18 21:27:39,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 125 transitions. [2018-11-18 21:27:40,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:27:40,343 INFO L225 Difference]: With dead ends: 114 [2018-11-18 21:27:40,344 INFO L226 Difference]: Without dead ends: 71 [2018-11-18 21:27:40,344 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 69 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-18 21:27:40,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-18 21:27:40,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 69. [2018-11-18 21:27:40,542 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:27:40,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 69 states. [2018-11-18 21:27:40,542 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 69 states. [2018-11-18 21:27:40,543 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 69 states. [2018-11-18 21:27:40,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:27:40,546 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-11-18 21:27:40,547 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2018-11-18 21:27:40,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:27:40,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:27:40,547 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 71 states. [2018-11-18 21:27:40,547 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 71 states. [2018-11-18 21:27:40,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:27:40,551 INFO L93 Difference]: Finished difference Result 71 states and 81 transitions. [2018-11-18 21:27:40,551 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2018-11-18 21:27:40,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:27:40,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:27:40,552 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:27:40,552 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:27:40,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-18 21:27:40,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2018-11-18 21:27:40,555 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 38 [2018-11-18 21:27:40,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:27:40,555 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2018-11-18 21:27:40,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 21:27:40,555 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2018-11-18 21:27:40,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-18 21:27:40,556 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:27:40,557 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-18 21:27:40,557 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:27:40,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:27:40,557 INFO L82 PathProgramCache]: Analyzing trace with hash -697141763, now seen corresponding path program 2 times [2018-11-18 21:27:40,558 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:27:40,558 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-18 21:27:40,580 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-18 21:27:40,930 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 21:27:40,930 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 21:27:40,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:27:40,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:27:41,117 INFO L256 TraceCheckUtils]: 0: Hoare triple {2490#true} call ULTIMATE.init(); {2490#true} is VALID [2018-11-18 21:27:41,117 INFO L273 TraceCheckUtils]: 1: Hoare triple {2490#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2490#true} is VALID [2018-11-18 21:27:41,117 INFO L273 TraceCheckUtils]: 2: Hoare triple {2490#true} assume true; {2490#true} is VALID [2018-11-18 21:27:41,118 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2490#true} {2490#true} #133#return; {2490#true} is VALID [2018-11-18 21:27:41,118 INFO L256 TraceCheckUtils]: 4: Hoare triple {2490#true} call #t~ret2 := main(); {2490#true} is VALID [2018-11-18 21:27:41,128 INFO L273 TraceCheckUtils]: 5: Hoare triple {2490#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~p~0 := 1800bv32;~q~0 := 2000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {2510#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-18 21:27:41,143 INFO L273 TraceCheckUtils]: 6: Hoare triple {2510#(= (_ bv2000 32) main_~q~0)} assume true; {2510#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-18 21:27:41,152 INFO L273 TraceCheckUtils]: 7: Hoare triple {2510#(= (_ bv2000 32) main_~q~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {2510#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-18 21:27:41,167 INFO L273 TraceCheckUtils]: 8: Hoare triple {2510#(= (_ bv2000 32) main_~q~0)} assume true; {2510#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-18 21:27:41,176 INFO L273 TraceCheckUtils]: 9: Hoare triple {2510#(= (_ bv2000 32) main_~q~0)} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {2510#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-18 21:27:41,188 INFO L273 TraceCheckUtils]: 10: Hoare triple {2510#(= (_ bv2000 32) main_~q~0)} assume true; {2510#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-18 21:27:41,201 INFO L273 TraceCheckUtils]: 11: Hoare triple {2510#(= (_ bv2000 32) main_~q~0)} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {2529#(and (= main_~l~0 (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:27:41,214 INFO L273 TraceCheckUtils]: 12: Hoare triple {2529#(and (= main_~l~0 (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume true; {2529#(and (= main_~l~0 (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:27:41,242 INFO L273 TraceCheckUtils]: 13: Hoare triple {2529#(and (= main_~l~0 (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2536#(and (= (bvadd main_~l~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:27:41,243 INFO L273 TraceCheckUtils]: 14: Hoare triple {2536#(and (= (bvadd main_~l~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume true; {2536#(and (= (bvadd main_~l~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:27:41,244 INFO L273 TraceCheckUtils]: 15: Hoare triple {2536#(and (= (bvadd main_~l~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2543#(and (= (bvadd main_~l~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:27:41,244 INFO L273 TraceCheckUtils]: 16: Hoare triple {2543#(and (= (bvadd main_~l~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume true; {2543#(and (= (bvadd main_~l~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:27:41,270 INFO L273 TraceCheckUtils]: 17: Hoare triple {2543#(and (= (bvadd main_~l~0 (_ bv4294967294 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2550#(and (= (_ bv3 32) main_~l~0) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:27:41,271 INFO L273 TraceCheckUtils]: 18: Hoare triple {2550#(and (= (_ bv3 32) main_~l~0) (= (_ bv2000 32) main_~q~0))} assume true; {2550#(and (= (_ bv3 32) main_~l~0) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:27:41,272 INFO L273 TraceCheckUtils]: 19: Hoare triple {2550#(and (= (_ bv3 32) main_~l~0) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2557#(and (= (bvadd main_~l~0 (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:27:41,272 INFO L273 TraceCheckUtils]: 20: Hoare triple {2557#(and (= (bvadd main_~l~0 (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume true; {2557#(and (= (bvadd main_~l~0 (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:27:41,273 INFO L273 TraceCheckUtils]: 21: Hoare triple {2557#(and (= (bvadd main_~l~0 (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !~bvslt32(~l~0, ~q~0); {2491#false} is VALID [2018-11-18 21:27:41,273 INFO L273 TraceCheckUtils]: 22: Hoare triple {2491#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {2491#false} is VALID [2018-11-18 21:27:41,273 INFO L273 TraceCheckUtils]: 23: Hoare triple {2491#false} assume true; {2491#false} is VALID [2018-11-18 21:27:41,274 INFO L273 TraceCheckUtils]: 24: Hoare triple {2491#false} assume !~bvslt32(~k~0, ~p~0); {2491#false} is VALID [2018-11-18 21:27:41,274 INFO L273 TraceCheckUtils]: 25: Hoare triple {2491#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {2491#false} is VALID [2018-11-18 21:27:41,274 INFO L273 TraceCheckUtils]: 26: Hoare triple {2491#false} assume true; {2491#false} is VALID [2018-11-18 21:27:41,274 INFO L273 TraceCheckUtils]: 27: Hoare triple {2491#false} assume !~bvslt32(~j~0, ~n~0); {2491#false} is VALID [2018-11-18 21:27:41,275 INFO L273 TraceCheckUtils]: 28: Hoare triple {2491#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {2491#false} is VALID [2018-11-18 21:27:41,275 INFO L273 TraceCheckUtils]: 29: Hoare triple {2491#false} assume true; {2491#false} is VALID [2018-11-18 21:27:41,275 INFO L273 TraceCheckUtils]: 30: Hoare triple {2491#false} assume !~bvslt32(~i~0, ~m~0); {2491#false} is VALID [2018-11-18 21:27:41,276 INFO L273 TraceCheckUtils]: 31: Hoare triple {2491#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {2491#false} is VALID [2018-11-18 21:27:41,276 INFO L273 TraceCheckUtils]: 32: Hoare triple {2491#false} assume true; {2491#false} is VALID [2018-11-18 21:27:41,276 INFO L273 TraceCheckUtils]: 33: Hoare triple {2491#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {2491#false} is VALID [2018-11-18 21:27:41,277 INFO L273 TraceCheckUtils]: 34: Hoare triple {2491#false} assume true; {2491#false} is VALID [2018-11-18 21:27:41,277 INFO L273 TraceCheckUtils]: 35: Hoare triple {2491#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {2491#false} is VALID [2018-11-18 21:27:41,277 INFO L273 TraceCheckUtils]: 36: Hoare triple {2491#false} assume true; {2491#false} is VALID [2018-11-18 21:27:41,277 INFO L273 TraceCheckUtils]: 37: Hoare triple {2491#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {2491#false} is VALID [2018-11-18 21:27:41,278 INFO L273 TraceCheckUtils]: 38: Hoare triple {2491#false} assume true; {2491#false} is VALID [2018-11-18 21:27:41,278 INFO L273 TraceCheckUtils]: 39: Hoare triple {2491#false} assume !!~bvslt32(~l~0, ~q~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32); {2491#false} is VALID [2018-11-18 21:27:41,278 INFO L256 TraceCheckUtils]: 40: Hoare triple {2491#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {2491#false} is VALID [2018-11-18 21:27:41,278 INFO L273 TraceCheckUtils]: 41: Hoare triple {2491#false} ~cond := #in~cond; {2491#false} is VALID [2018-11-18 21:27:41,279 INFO L273 TraceCheckUtils]: 42: Hoare triple {2491#false} assume 0bv32 == ~cond; {2491#false} is VALID [2018-11-18 21:27:41,279 INFO L273 TraceCheckUtils]: 43: Hoare triple {2491#false} assume !false; {2491#false} is VALID [2018-11-18 21:27:41,281 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:27:41,281 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 21:27:41,711 INFO L273 TraceCheckUtils]: 43: Hoare triple {2491#false} assume !false; {2491#false} is VALID [2018-11-18 21:27:41,711 INFO L273 TraceCheckUtils]: 42: Hoare triple {2491#false} assume 0bv32 == ~cond; {2491#false} is VALID [2018-11-18 21:27:41,711 INFO L273 TraceCheckUtils]: 41: Hoare triple {2491#false} ~cond := #in~cond; {2491#false} is VALID [2018-11-18 21:27:41,712 INFO L256 TraceCheckUtils]: 40: Hoare triple {2491#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {2491#false} is VALID [2018-11-18 21:27:41,712 INFO L273 TraceCheckUtils]: 39: Hoare triple {2491#false} assume !!~bvslt32(~l~0, ~q~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32); {2491#false} is VALID [2018-11-18 21:27:41,713 INFO L273 TraceCheckUtils]: 38: Hoare triple {2491#false} assume true; {2491#false} is VALID [2018-11-18 21:27:41,713 INFO L273 TraceCheckUtils]: 37: Hoare triple {2491#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {2491#false} is VALID [2018-11-18 21:27:41,713 INFO L273 TraceCheckUtils]: 36: Hoare triple {2491#false} assume true; {2491#false} is VALID [2018-11-18 21:27:41,714 INFO L273 TraceCheckUtils]: 35: Hoare triple {2491#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {2491#false} is VALID [2018-11-18 21:27:41,714 INFO L273 TraceCheckUtils]: 34: Hoare triple {2491#false} assume true; {2491#false} is VALID [2018-11-18 21:27:41,714 INFO L273 TraceCheckUtils]: 33: Hoare triple {2491#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {2491#false} is VALID [2018-11-18 21:27:41,715 INFO L273 TraceCheckUtils]: 32: Hoare triple {2491#false} assume true; {2491#false} is VALID [2018-11-18 21:27:41,715 INFO L273 TraceCheckUtils]: 31: Hoare triple {2491#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {2491#false} is VALID [2018-11-18 21:27:41,715 INFO L273 TraceCheckUtils]: 30: Hoare triple {2491#false} assume !~bvslt32(~i~0, ~m~0); {2491#false} is VALID [2018-11-18 21:27:41,715 INFO L273 TraceCheckUtils]: 29: Hoare triple {2491#false} assume true; {2491#false} is VALID [2018-11-18 21:27:41,716 INFO L273 TraceCheckUtils]: 28: Hoare triple {2491#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {2491#false} is VALID [2018-11-18 21:27:41,716 INFO L273 TraceCheckUtils]: 27: Hoare triple {2491#false} assume !~bvslt32(~j~0, ~n~0); {2491#false} is VALID [2018-11-18 21:27:41,716 INFO L273 TraceCheckUtils]: 26: Hoare triple {2491#false} assume true; {2491#false} is VALID [2018-11-18 21:27:41,716 INFO L273 TraceCheckUtils]: 25: Hoare triple {2491#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {2491#false} is VALID [2018-11-18 21:27:41,716 INFO L273 TraceCheckUtils]: 24: Hoare triple {2491#false} assume !~bvslt32(~k~0, ~p~0); {2491#false} is VALID [2018-11-18 21:27:41,717 INFO L273 TraceCheckUtils]: 23: Hoare triple {2491#false} assume true; {2491#false} is VALID [2018-11-18 21:27:41,717 INFO L273 TraceCheckUtils]: 22: Hoare triple {2491#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {2491#false} is VALID [2018-11-18 21:27:41,717 INFO L273 TraceCheckUtils]: 21: Hoare triple {2696#(bvslt main_~l~0 main_~q~0)} assume !~bvslt32(~l~0, ~q~0); {2491#false} is VALID [2018-11-18 21:27:41,718 INFO L273 TraceCheckUtils]: 20: Hoare triple {2696#(bvslt main_~l~0 main_~q~0)} assume true; {2696#(bvslt main_~l~0 main_~q~0)} is VALID [2018-11-18 21:27:41,719 INFO L273 TraceCheckUtils]: 19: Hoare triple {2703#(bvslt (bvadd main_~l~0 (_ bv1 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2696#(bvslt main_~l~0 main_~q~0)} is VALID [2018-11-18 21:27:41,719 INFO L273 TraceCheckUtils]: 18: Hoare triple {2703#(bvslt (bvadd main_~l~0 (_ bv1 32)) main_~q~0)} assume true; {2703#(bvslt (bvadd main_~l~0 (_ bv1 32)) main_~q~0)} is VALID [2018-11-18 21:27:41,981 INFO L273 TraceCheckUtils]: 17: Hoare triple {2710#(bvslt (bvadd main_~l~0 (_ bv2 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2703#(bvslt (bvadd main_~l~0 (_ bv1 32)) main_~q~0)} is VALID [2018-11-18 21:27:41,982 INFO L273 TraceCheckUtils]: 16: Hoare triple {2710#(bvslt (bvadd main_~l~0 (_ bv2 32)) main_~q~0)} assume true; {2710#(bvslt (bvadd main_~l~0 (_ bv2 32)) main_~q~0)} is VALID [2018-11-18 21:27:42,322 INFO L273 TraceCheckUtils]: 15: Hoare triple {2717#(bvslt (bvadd main_~l~0 (_ bv3 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2710#(bvslt (bvadd main_~l~0 (_ bv2 32)) main_~q~0)} is VALID [2018-11-18 21:27:42,323 INFO L273 TraceCheckUtils]: 14: Hoare triple {2717#(bvslt (bvadd main_~l~0 (_ bv3 32)) main_~q~0)} assume true; {2717#(bvslt (bvadd main_~l~0 (_ bv3 32)) main_~q~0)} is VALID [2018-11-18 21:27:42,650 INFO L273 TraceCheckUtils]: 13: Hoare triple {2724#(bvslt (bvadd main_~l~0 (_ bv4 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {2717#(bvslt (bvadd main_~l~0 (_ bv3 32)) main_~q~0)} is VALID [2018-11-18 21:27:42,651 INFO L273 TraceCheckUtils]: 12: Hoare triple {2724#(bvslt (bvadd main_~l~0 (_ bv4 32)) main_~q~0)} assume true; {2724#(bvslt (bvadd main_~l~0 (_ bv4 32)) main_~q~0)} is VALID [2018-11-18 21:27:42,652 INFO L273 TraceCheckUtils]: 11: Hoare triple {2731#(bvslt (_ bv4 32) main_~q~0)} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {2724#(bvslt (bvadd main_~l~0 (_ bv4 32)) main_~q~0)} is VALID [2018-11-18 21:27:42,652 INFO L273 TraceCheckUtils]: 10: Hoare triple {2731#(bvslt (_ bv4 32) main_~q~0)} assume true; {2731#(bvslt (_ bv4 32) main_~q~0)} is VALID [2018-11-18 21:27:42,653 INFO L273 TraceCheckUtils]: 9: Hoare triple {2731#(bvslt (_ bv4 32) main_~q~0)} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {2731#(bvslt (_ bv4 32) main_~q~0)} is VALID [2018-11-18 21:27:42,654 INFO L273 TraceCheckUtils]: 8: Hoare triple {2731#(bvslt (_ bv4 32) main_~q~0)} assume true; {2731#(bvslt (_ bv4 32) main_~q~0)} is VALID [2018-11-18 21:27:42,655 INFO L273 TraceCheckUtils]: 7: Hoare triple {2731#(bvslt (_ bv4 32) main_~q~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {2731#(bvslt (_ bv4 32) main_~q~0)} is VALID [2018-11-18 21:27:42,655 INFO L273 TraceCheckUtils]: 6: Hoare triple {2731#(bvslt (_ bv4 32) main_~q~0)} assume true; {2731#(bvslt (_ bv4 32) main_~q~0)} is VALID [2018-11-18 21:27:42,656 INFO L273 TraceCheckUtils]: 5: Hoare triple {2490#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~p~0 := 1800bv32;~q~0 := 2000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {2731#(bvslt (_ bv4 32) main_~q~0)} is VALID [2018-11-18 21:27:42,656 INFO L256 TraceCheckUtils]: 4: Hoare triple {2490#true} call #t~ret2 := main(); {2490#true} is VALID [2018-11-18 21:27:42,657 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2490#true} {2490#true} #133#return; {2490#true} is VALID [2018-11-18 21:27:42,657 INFO L273 TraceCheckUtils]: 2: Hoare triple {2490#true} assume true; {2490#true} is VALID [2018-11-18 21:27:42,657 INFO L273 TraceCheckUtils]: 1: Hoare triple {2490#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2490#true} is VALID [2018-11-18 21:27:42,657 INFO L256 TraceCheckUtils]: 0: Hoare triple {2490#true} call ULTIMATE.init(); {2490#true} is VALID [2018-11-18 21:27:42,659 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 6 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 21:27:42,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 21:27:42,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-18 21:27:42,663 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-18 21:27:42,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:27:42,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-18 21:27:43,528 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:27:43,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-18 21:27:43,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-18 21:27:43,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-18 21:27:43,529 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand 14 states. [2018-11-18 21:27:58,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:27:58,499 INFO L93 Difference]: Finished difference Result 168 states and 206 transitions. [2018-11-18 21:27:58,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-18 21:27:58,499 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 44 [2018-11-18 21:27:58,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:27:58,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 21:27:58,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 173 transitions. [2018-11-18 21:27:58,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 21:27:58,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 173 transitions. [2018-11-18 21:27:58,511 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 173 transitions. [2018-11-18 21:27:59,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:27:59,851 INFO L225 Difference]: With dead ends: 168 [2018-11-18 21:27:59,852 INFO L226 Difference]: Without dead ends: 107 [2018-11-18 21:27:59,853 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 75 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-18 21:27:59,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-18 21:28:00,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2018-11-18 21:28:00,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:28:00,182 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 105 states. [2018-11-18 21:28:00,182 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 105 states. [2018-11-18 21:28:00,182 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 105 states. [2018-11-18 21:28:00,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:28:00,187 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2018-11-18 21:28:00,187 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 123 transitions. [2018-11-18 21:28:00,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:28:00,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:28:00,188 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 107 states. [2018-11-18 21:28:00,188 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 107 states. [2018-11-18 21:28:00,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:28:00,194 INFO L93 Difference]: Finished difference Result 107 states and 123 transitions. [2018-11-18 21:28:00,194 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 123 transitions. [2018-11-18 21:28:00,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:28:00,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:28:00,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:28:00,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:28:00,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-18 21:28:00,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 121 transitions. [2018-11-18 21:28:00,200 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 121 transitions. Word has length 44 [2018-11-18 21:28:00,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:28:00,201 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 121 transitions. [2018-11-18 21:28:00,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-18 21:28:00,201 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 121 transitions. [2018-11-18 21:28:00,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-11-18 21:28:00,202 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:28:00,202 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 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-18 21:28:00,203 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:28:00,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:28:00,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1591615007, now seen corresponding path program 3 times [2018-11-18 21:28:00,203 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:28:00,204 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-18 21:28:00,227 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-18 21:28:00,549 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 21:28:00,549 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 21:28:00,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:28:00,571 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:28:00,790 INFO L256 TraceCheckUtils]: 0: Hoare triple {3386#true} call ULTIMATE.init(); {3386#true} is VALID [2018-11-18 21:28:00,790 INFO L273 TraceCheckUtils]: 1: Hoare triple {3386#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3386#true} is VALID [2018-11-18 21:28:00,790 INFO L273 TraceCheckUtils]: 2: Hoare triple {3386#true} assume true; {3386#true} is VALID [2018-11-18 21:28:00,790 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3386#true} {3386#true} #133#return; {3386#true} is VALID [2018-11-18 21:28:00,791 INFO L256 TraceCheckUtils]: 4: Hoare triple {3386#true} call #t~ret2 := main(); {3386#true} is VALID [2018-11-18 21:28:00,800 INFO L273 TraceCheckUtils]: 5: Hoare triple {3386#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~p~0 := 1800bv32;~q~0 := 2000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,812 INFO L273 TraceCheckUtils]: 6: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume true; {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,825 INFO L273 TraceCheckUtils]: 7: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,833 INFO L273 TraceCheckUtils]: 8: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume true; {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,834 INFO L273 TraceCheckUtils]: 9: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,834 INFO L273 TraceCheckUtils]: 10: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume true; {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,835 INFO L273 TraceCheckUtils]: 11: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,836 INFO L273 TraceCheckUtils]: 12: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume true; {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,837 INFO L273 TraceCheckUtils]: 13: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,837 INFO L273 TraceCheckUtils]: 14: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume true; {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,838 INFO L273 TraceCheckUtils]: 15: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,838 INFO L273 TraceCheckUtils]: 16: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume true; {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,839 INFO L273 TraceCheckUtils]: 17: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,840 INFO L273 TraceCheckUtils]: 18: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume true; {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,841 INFO L273 TraceCheckUtils]: 19: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,842 INFO L273 TraceCheckUtils]: 20: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume true; {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,843 INFO L273 TraceCheckUtils]: 21: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,843 INFO L273 TraceCheckUtils]: 22: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume true; {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,844 INFO L273 TraceCheckUtils]: 23: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,845 INFO L273 TraceCheckUtils]: 24: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume true; {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,846 INFO L273 TraceCheckUtils]: 25: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,847 INFO L273 TraceCheckUtils]: 26: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume true; {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,848 INFO L273 TraceCheckUtils]: 27: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,848 INFO L273 TraceCheckUtils]: 28: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume true; {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,850 INFO L273 TraceCheckUtils]: 29: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,850 INFO L273 TraceCheckUtils]: 30: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume true; {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,851 INFO L273 TraceCheckUtils]: 31: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,852 INFO L273 TraceCheckUtils]: 32: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume true; {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,853 INFO L273 TraceCheckUtils]: 33: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !~bvslt32(~l~0, ~q~0); {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,853 INFO L273 TraceCheckUtils]: 34: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,854 INFO L273 TraceCheckUtils]: 35: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume true; {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,855 INFO L273 TraceCheckUtils]: 36: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !~bvslt32(~k~0, ~p~0); {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,856 INFO L273 TraceCheckUtils]: 37: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} ~j~0 := ~bvadd32(1bv32, ~j~0); {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,856 INFO L273 TraceCheckUtils]: 38: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume true; {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,857 INFO L273 TraceCheckUtils]: 39: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} assume !~bvslt32(~j~0, ~n~0); {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-18 21:28:00,858 INFO L273 TraceCheckUtils]: 40: Hoare triple {3406#(and (= (_ bv1000 32) main_~m~0) (= main_~i~0 (_ bv0 32)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3512#(and (= (_ bv1000 32) main_~m~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:28:00,859 INFO L273 TraceCheckUtils]: 41: Hoare triple {3512#(and (= (_ bv1000 32) main_~m~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {3512#(and (= (_ bv1000 32) main_~m~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-18 21:28:00,859 INFO L273 TraceCheckUtils]: 42: Hoare triple {3512#(and (= (_ bv1000 32) main_~m~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~m~0); {3387#false} is VALID [2018-11-18 21:28:00,860 INFO L273 TraceCheckUtils]: 43: Hoare triple {3387#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {3387#false} is VALID [2018-11-18 21:28:00,860 INFO L273 TraceCheckUtils]: 44: Hoare triple {3387#false} assume true; {3387#false} is VALID [2018-11-18 21:28:00,860 INFO L273 TraceCheckUtils]: 45: Hoare triple {3387#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {3387#false} is VALID [2018-11-18 21:28:00,860 INFO L273 TraceCheckUtils]: 46: Hoare triple {3387#false} assume true; {3387#false} is VALID [2018-11-18 21:28:00,861 INFO L273 TraceCheckUtils]: 47: Hoare triple {3387#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {3387#false} is VALID [2018-11-18 21:28:00,861 INFO L273 TraceCheckUtils]: 48: Hoare triple {3387#false} assume true; {3387#false} is VALID [2018-11-18 21:28:00,861 INFO L273 TraceCheckUtils]: 49: Hoare triple {3387#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {3387#false} is VALID [2018-11-18 21:28:00,861 INFO L273 TraceCheckUtils]: 50: Hoare triple {3387#false} assume true; {3387#false} is VALID [2018-11-18 21:28:00,864 INFO L273 TraceCheckUtils]: 51: Hoare triple {3387#false} assume !!~bvslt32(~l~0, ~q~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32); {3387#false} is VALID [2018-11-18 21:28:00,864 INFO L256 TraceCheckUtils]: 52: Hoare triple {3387#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {3387#false} is VALID [2018-11-18 21:28:00,864 INFO L273 TraceCheckUtils]: 53: Hoare triple {3387#false} ~cond := #in~cond; {3387#false} is VALID [2018-11-18 21:28:00,864 INFO L273 TraceCheckUtils]: 54: Hoare triple {3387#false} assume 0bv32 == ~cond; {3387#false} is VALID [2018-11-18 21:28:00,865 INFO L273 TraceCheckUtils]: 55: Hoare triple {3387#false} assume !false; {3387#false} is VALID [2018-11-18 21:28:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-18 21:28:00,870 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 21:28:00,972 INFO L273 TraceCheckUtils]: 55: Hoare triple {3387#false} assume !false; {3387#false} is VALID [2018-11-18 21:28:00,973 INFO L273 TraceCheckUtils]: 54: Hoare triple {3387#false} assume 0bv32 == ~cond; {3387#false} is VALID [2018-11-18 21:28:00,973 INFO L273 TraceCheckUtils]: 53: Hoare triple {3387#false} ~cond := #in~cond; {3387#false} is VALID [2018-11-18 21:28:00,974 INFO L256 TraceCheckUtils]: 52: Hoare triple {3387#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {3387#false} is VALID [2018-11-18 21:28:00,974 INFO L273 TraceCheckUtils]: 51: Hoare triple {3387#false} assume !!~bvslt32(~l~0, ~q~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32); {3387#false} is VALID [2018-11-18 21:28:00,974 INFO L273 TraceCheckUtils]: 50: Hoare triple {3387#false} assume true; {3387#false} is VALID [2018-11-18 21:28:00,974 INFO L273 TraceCheckUtils]: 49: Hoare triple {3387#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {3387#false} is VALID [2018-11-18 21:28:00,975 INFO L273 TraceCheckUtils]: 48: Hoare triple {3387#false} assume true; {3387#false} is VALID [2018-11-18 21:28:00,975 INFO L273 TraceCheckUtils]: 47: Hoare triple {3387#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {3387#false} is VALID [2018-11-18 21:28:00,975 INFO L273 TraceCheckUtils]: 46: Hoare triple {3387#false} assume true; {3387#false} is VALID [2018-11-18 21:28:00,975 INFO L273 TraceCheckUtils]: 45: Hoare triple {3387#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {3387#false} is VALID [2018-11-18 21:28:00,975 INFO L273 TraceCheckUtils]: 44: Hoare triple {3387#false} assume true; {3387#false} is VALID [2018-11-18 21:28:00,975 INFO L273 TraceCheckUtils]: 43: Hoare triple {3387#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {3387#false} is VALID [2018-11-18 21:28:00,976 INFO L273 TraceCheckUtils]: 42: Hoare triple {3597#(bvslt main_~i~0 main_~m~0)} assume !~bvslt32(~i~0, ~m~0); {3387#false} is VALID [2018-11-18 21:28:00,976 INFO L273 TraceCheckUtils]: 41: Hoare triple {3597#(bvslt main_~i~0 main_~m~0)} assume true; {3597#(bvslt main_~i~0 main_~m~0)} is VALID [2018-11-18 21:28:00,994 INFO L273 TraceCheckUtils]: 40: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {3597#(bvslt main_~i~0 main_~m~0)} is VALID [2018-11-18 21:28:00,997 INFO L273 TraceCheckUtils]: 39: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !~bvslt32(~j~0, ~n~0); {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:00,997 INFO L273 TraceCheckUtils]: 38: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume true; {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:00,998 INFO L273 TraceCheckUtils]: 37: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} ~j~0 := ~bvadd32(1bv32, ~j~0); {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,000 INFO L273 TraceCheckUtils]: 36: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !~bvslt32(~k~0, ~p~0); {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,000 INFO L273 TraceCheckUtils]: 35: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume true; {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,001 INFO L273 TraceCheckUtils]: 34: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,001 INFO L273 TraceCheckUtils]: 33: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !~bvslt32(~l~0, ~q~0); {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,001 INFO L273 TraceCheckUtils]: 32: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume true; {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,002 INFO L273 TraceCheckUtils]: 31: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,005 INFO L273 TraceCheckUtils]: 30: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume true; {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,006 INFO L273 TraceCheckUtils]: 29: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,006 INFO L273 TraceCheckUtils]: 28: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume true; {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,010 INFO L273 TraceCheckUtils]: 27: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,011 INFO L273 TraceCheckUtils]: 26: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume true; {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,013 INFO L273 TraceCheckUtils]: 25: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,014 INFO L273 TraceCheckUtils]: 24: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume true; {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,015 INFO L273 TraceCheckUtils]: 23: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,016 INFO L273 TraceCheckUtils]: 22: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume true; {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,017 INFO L273 TraceCheckUtils]: 21: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,017 INFO L273 TraceCheckUtils]: 20: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume true; {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,017 INFO L273 TraceCheckUtils]: 19: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,018 INFO L273 TraceCheckUtils]: 18: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume true; {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,018 INFO L273 TraceCheckUtils]: 17: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,018 INFO L273 TraceCheckUtils]: 16: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume true; {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,019 INFO L273 TraceCheckUtils]: 15: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,019 INFO L273 TraceCheckUtils]: 14: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume true; {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,019 INFO L273 TraceCheckUtils]: 13: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,020 INFO L273 TraceCheckUtils]: 12: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume true; {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,020 INFO L273 TraceCheckUtils]: 11: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,020 INFO L273 TraceCheckUtils]: 10: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume true; {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,021 INFO L273 TraceCheckUtils]: 9: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,021 INFO L273 TraceCheckUtils]: 8: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume true; {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,022 INFO L273 TraceCheckUtils]: 7: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,022 INFO L273 TraceCheckUtils]: 6: Hoare triple {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} assume true; {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,024 INFO L273 TraceCheckUtils]: 5: Hoare triple {3386#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~p~0 := 1800bv32;~q~0 := 2000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {3604#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~m~0)} is VALID [2018-11-18 21:28:01,024 INFO L256 TraceCheckUtils]: 4: Hoare triple {3386#true} call #t~ret2 := main(); {3386#true} is VALID [2018-11-18 21:28:01,024 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3386#true} {3386#true} #133#return; {3386#true} is VALID [2018-11-18 21:28:01,024 INFO L273 TraceCheckUtils]: 2: Hoare triple {3386#true} assume true; {3386#true} is VALID [2018-11-18 21:28:01,025 INFO L273 TraceCheckUtils]: 1: Hoare triple {3386#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3386#true} is VALID [2018-11-18 21:28:01,025 INFO L256 TraceCheckUtils]: 0: Hoare triple {3386#true} call ULTIMATE.init(); {3386#true} is VALID [2018-11-18 21:28:01,031 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2018-11-18 21:28:01,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 21:28:01,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-18 21:28:01,035 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-11-18 21:28:01,036 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:28:01,036 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 21:28:01,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:28:01,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 21:28:01,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 21:28:01,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-18 21:28:01,273 INFO L87 Difference]: Start difference. First operand 105 states and 121 transitions. Second operand 6 states. [2018-11-18 21:28:04,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:28:04,030 INFO L93 Difference]: Finished difference Result 272 states and 312 transitions. [2018-11-18 21:28:04,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 21:28:04,031 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-11-18 21:28:04,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:28:04,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 21:28:04,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2018-11-18 21:28:04,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 21:28:04,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 114 transitions. [2018-11-18 21:28:04,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 114 transitions. [2018-11-18 21:28:04,527 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-18 21:28:04,534 INFO L225 Difference]: With dead ends: 272 [2018-11-18 21:28:04,534 INFO L226 Difference]: Without dead ends: 210 [2018-11-18 21:28:04,535 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-18 21:28:04,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-18 21:28:05,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-11-18 21:28:05,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:28:05,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand 210 states. [2018-11-18 21:28:05,342 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 210 states. [2018-11-18 21:28:05,342 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 210 states. [2018-11-18 21:28:05,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:28:05,351 INFO L93 Difference]: Finished difference Result 210 states and 235 transitions. [2018-11-18 21:28:05,351 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 235 transitions. [2018-11-18 21:28:05,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:28:05,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:28:05,353 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 210 states. [2018-11-18 21:28:05,353 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 210 states. [2018-11-18 21:28:05,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:28:05,362 INFO L93 Difference]: Finished difference Result 210 states and 235 transitions. [2018-11-18 21:28:05,362 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 235 transitions. [2018-11-18 21:28:05,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:28:05,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:28:05,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:28:05,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:28:05,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-18 21:28:05,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 235 transitions. [2018-11-18 21:28:05,372 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 235 transitions. Word has length 56 [2018-11-18 21:28:05,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:28:05,372 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 235 transitions. [2018-11-18 21:28:05,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 21:28:05,372 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 235 transitions. [2018-11-18 21:28:05,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-11-18 21:28:05,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:28:05,375 INFO L375 BasicCegarLoop]: trace histogram [44, 40, 8, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:28:05,375 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:28:05,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:28:05,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1805293060, now seen corresponding path program 4 times [2018-11-18 21:28:05,377 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:28:05,377 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-18 21:28:05,405 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 21:28:05,711 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 21:28:05,711 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 21:28:05,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 21:28:05,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 21:28:06,559 INFO L256 TraceCheckUtils]: 0: Hoare triple {4850#true} call ULTIMATE.init(); {4850#true} is VALID [2018-11-18 21:28:06,560 INFO L273 TraceCheckUtils]: 1: Hoare triple {4850#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4850#true} is VALID [2018-11-18 21:28:06,560 INFO L273 TraceCheckUtils]: 2: Hoare triple {4850#true} assume true; {4850#true} is VALID [2018-11-18 21:28:06,561 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4850#true} {4850#true} #133#return; {4850#true} is VALID [2018-11-18 21:28:06,561 INFO L256 TraceCheckUtils]: 4: Hoare triple {4850#true} call #t~ret2 := main(); {4850#true} is VALID [2018-11-18 21:28:06,562 INFO L273 TraceCheckUtils]: 5: Hoare triple {4850#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~p~0 := 1800bv32;~q~0 := 2000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {4870#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-18 21:28:06,562 INFO L273 TraceCheckUtils]: 6: Hoare triple {4870#(= (_ bv2000 32) main_~q~0)} assume true; {4870#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-18 21:28:06,563 INFO L273 TraceCheckUtils]: 7: Hoare triple {4870#(= (_ bv2000 32) main_~q~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {4870#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-18 21:28:06,563 INFO L273 TraceCheckUtils]: 8: Hoare triple {4870#(= (_ bv2000 32) main_~q~0)} assume true; {4870#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-18 21:28:06,563 INFO L273 TraceCheckUtils]: 9: Hoare triple {4870#(= (_ bv2000 32) main_~q~0)} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {4870#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-18 21:28:06,564 INFO L273 TraceCheckUtils]: 10: Hoare triple {4870#(= (_ bv2000 32) main_~q~0)} assume true; {4870#(= (_ bv2000 32) main_~q~0)} is VALID [2018-11-18 21:28:06,564 INFO L273 TraceCheckUtils]: 11: Hoare triple {4870#(= (_ bv2000 32) main_~q~0)} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {4889#(and (= main_~l~0 (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:28:06,565 INFO L273 TraceCheckUtils]: 12: Hoare triple {4889#(and (= main_~l~0 (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume true; {4889#(and (= main_~l~0 (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:28:06,591 INFO L273 TraceCheckUtils]: 13: Hoare triple {4889#(and (= main_~l~0 (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4896#(and (= (bvadd main_~l~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:28:06,592 INFO L273 TraceCheckUtils]: 14: Hoare triple {4896#(and (= (bvadd main_~l~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume true; {4896#(and (= (bvadd main_~l~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:28:06,593 INFO L273 TraceCheckUtils]: 15: Hoare triple {4896#(and (= (bvadd main_~l~0 (_ bv4294967295 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4903#(and (= (_ bv2 32) main_~l~0) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:28:06,594 INFO L273 TraceCheckUtils]: 16: Hoare triple {4903#(and (= (_ bv2 32) main_~l~0) (= (_ bv2000 32) main_~q~0))} assume true; {4903#(and (= (_ bv2 32) main_~l~0) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:28:06,594 INFO L273 TraceCheckUtils]: 17: Hoare triple {4903#(and (= (_ bv2 32) main_~l~0) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4910#(and (= (bvadd main_~l~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:28:06,595 INFO L273 TraceCheckUtils]: 18: Hoare triple {4910#(and (= (bvadd main_~l~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume true; {4910#(and (= (bvadd main_~l~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:28:06,620 INFO L273 TraceCheckUtils]: 19: Hoare triple {4910#(and (= (bvadd main_~l~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4917#(and (= (bvadd main_~l~0 (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:28:06,621 INFO L273 TraceCheckUtils]: 20: Hoare triple {4917#(and (= (bvadd main_~l~0 (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume true; {4917#(and (= (bvadd main_~l~0 (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:28:06,622 INFO L273 TraceCheckUtils]: 21: Hoare triple {4917#(and (= (bvadd main_~l~0 (_ bv4294967292 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4924#(and (= (bvadd main_~l~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:28:06,622 INFO L273 TraceCheckUtils]: 22: Hoare triple {4924#(and (= (bvadd main_~l~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume true; {4924#(and (= (bvadd main_~l~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:28:06,623 INFO L273 TraceCheckUtils]: 23: Hoare triple {4924#(and (= (bvadd main_~l~0 (_ bv4294967291 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4931#(and (= (bvadd main_~l~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:28:06,624 INFO L273 TraceCheckUtils]: 24: Hoare triple {4931#(and (= (bvadd main_~l~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume true; {4931#(and (= (bvadd main_~l~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:28:06,650 INFO L273 TraceCheckUtils]: 25: Hoare triple {4931#(and (= (bvadd main_~l~0 (_ bv4294967290 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4938#(and (= (bvadd main_~l~0 (_ bv4294967289 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:28:06,651 INFO L273 TraceCheckUtils]: 26: Hoare triple {4938#(and (= (bvadd main_~l~0 (_ bv4294967289 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume true; {4938#(and (= (bvadd main_~l~0 (_ bv4294967289 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:28:06,701 INFO L273 TraceCheckUtils]: 27: Hoare triple {4938#(and (= (bvadd main_~l~0 (_ bv4294967289 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4945#(and (= (bvadd main_~l~0 (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:28:06,703 INFO L273 TraceCheckUtils]: 28: Hoare triple {4945#(and (= (bvadd main_~l~0 (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume true; {4945#(and (= (bvadd main_~l~0 (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:28:06,704 INFO L273 TraceCheckUtils]: 29: Hoare triple {4945#(and (= (bvadd main_~l~0 (_ bv4294967288 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4952#(and (= (_ bv9 32) main_~l~0) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:28:06,705 INFO L273 TraceCheckUtils]: 30: Hoare triple {4952#(and (= (_ bv9 32) main_~l~0) (= (_ bv2000 32) main_~q~0))} assume true; {4952#(and (= (_ bv9 32) main_~l~0) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:28:06,705 INFO L273 TraceCheckUtils]: 31: Hoare triple {4952#(and (= (_ bv9 32) main_~l~0) (= (_ bv2000 32) main_~q~0))} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4959#(and (= (bvadd main_~l~0 (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:28:06,706 INFO L273 TraceCheckUtils]: 32: Hoare triple {4959#(and (= (bvadd main_~l~0 (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume true; {4959#(and (= (bvadd main_~l~0 (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} is VALID [2018-11-18 21:28:06,706 INFO L273 TraceCheckUtils]: 33: Hoare triple {4959#(and (= (bvadd main_~l~0 (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv2000 32) main_~q~0))} assume !~bvslt32(~l~0, ~q~0); {4851#false} is VALID [2018-11-18 21:28:06,706 INFO L273 TraceCheckUtils]: 34: Hoare triple {4851#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {4851#false} is VALID [2018-11-18 21:28:06,707 INFO L273 TraceCheckUtils]: 35: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,707 INFO L273 TraceCheckUtils]: 36: Hoare triple {4851#false} assume !~bvslt32(~k~0, ~p~0); {4851#false} is VALID [2018-11-18 21:28:06,707 INFO L273 TraceCheckUtils]: 37: Hoare triple {4851#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {4851#false} is VALID [2018-11-18 21:28:06,707 INFO L273 TraceCheckUtils]: 38: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,707 INFO L273 TraceCheckUtils]: 39: Hoare triple {4851#false} assume !~bvslt32(~j~0, ~n~0); {4851#false} is VALID [2018-11-18 21:28:06,707 INFO L273 TraceCheckUtils]: 40: Hoare triple {4851#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {4851#false} is VALID [2018-11-18 21:28:06,707 INFO L273 TraceCheckUtils]: 41: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,708 INFO L273 TraceCheckUtils]: 42: Hoare triple {4851#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {4851#false} is VALID [2018-11-18 21:28:06,708 INFO L273 TraceCheckUtils]: 43: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,708 INFO L273 TraceCheckUtils]: 44: Hoare triple {4851#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {4851#false} is VALID [2018-11-18 21:28:06,708 INFO L273 TraceCheckUtils]: 45: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,708 INFO L273 TraceCheckUtils]: 46: Hoare triple {4851#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {4851#false} is VALID [2018-11-18 21:28:06,709 INFO L273 TraceCheckUtils]: 47: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,709 INFO L273 TraceCheckUtils]: 48: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,709 INFO L273 TraceCheckUtils]: 49: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,709 INFO L273 TraceCheckUtils]: 50: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,709 INFO L273 TraceCheckUtils]: 51: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,710 INFO L273 TraceCheckUtils]: 52: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,710 INFO L273 TraceCheckUtils]: 53: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,710 INFO L273 TraceCheckUtils]: 54: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,710 INFO L273 TraceCheckUtils]: 55: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,710 INFO L273 TraceCheckUtils]: 56: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,710 INFO L273 TraceCheckUtils]: 57: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,711 INFO L273 TraceCheckUtils]: 58: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,711 INFO L273 TraceCheckUtils]: 59: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,711 INFO L273 TraceCheckUtils]: 60: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,711 INFO L273 TraceCheckUtils]: 61: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,711 INFO L273 TraceCheckUtils]: 62: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,711 INFO L273 TraceCheckUtils]: 63: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,711 INFO L273 TraceCheckUtils]: 64: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,711 INFO L273 TraceCheckUtils]: 65: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,712 INFO L273 TraceCheckUtils]: 66: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,712 INFO L273 TraceCheckUtils]: 67: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,712 INFO L273 TraceCheckUtils]: 68: Hoare triple {4851#false} assume !~bvslt32(~l~0, ~q~0); {4851#false} is VALID [2018-11-18 21:28:06,712 INFO L273 TraceCheckUtils]: 69: Hoare triple {4851#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {4851#false} is VALID [2018-11-18 21:28:06,712 INFO L273 TraceCheckUtils]: 70: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,712 INFO L273 TraceCheckUtils]: 71: Hoare triple {4851#false} assume !~bvslt32(~k~0, ~p~0); {4851#false} is VALID [2018-11-18 21:28:06,712 INFO L273 TraceCheckUtils]: 72: Hoare triple {4851#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {4851#false} is VALID [2018-11-18 21:28:06,712 INFO L273 TraceCheckUtils]: 73: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,713 INFO L273 TraceCheckUtils]: 74: Hoare triple {4851#false} assume !~bvslt32(~j~0, ~n~0); {4851#false} is VALID [2018-11-18 21:28:06,713 INFO L273 TraceCheckUtils]: 75: Hoare triple {4851#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {4851#false} is VALID [2018-11-18 21:28:06,713 INFO L273 TraceCheckUtils]: 76: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,713 INFO L273 TraceCheckUtils]: 77: Hoare triple {4851#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {4851#false} is VALID [2018-11-18 21:28:06,713 INFO L273 TraceCheckUtils]: 78: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,713 INFO L273 TraceCheckUtils]: 79: Hoare triple {4851#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {4851#false} is VALID [2018-11-18 21:28:06,713 INFO L273 TraceCheckUtils]: 80: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,714 INFO L273 TraceCheckUtils]: 81: Hoare triple {4851#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {4851#false} is VALID [2018-11-18 21:28:06,714 INFO L273 TraceCheckUtils]: 82: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,714 INFO L273 TraceCheckUtils]: 83: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,714 INFO L273 TraceCheckUtils]: 84: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,714 INFO L273 TraceCheckUtils]: 85: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,714 INFO L273 TraceCheckUtils]: 86: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,714 INFO L273 TraceCheckUtils]: 87: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,715 INFO L273 TraceCheckUtils]: 88: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,715 INFO L273 TraceCheckUtils]: 89: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,715 INFO L273 TraceCheckUtils]: 90: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,715 INFO L273 TraceCheckUtils]: 91: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,715 INFO L273 TraceCheckUtils]: 92: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,716 INFO L273 TraceCheckUtils]: 93: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,716 INFO L273 TraceCheckUtils]: 94: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,716 INFO L273 TraceCheckUtils]: 95: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,716 INFO L273 TraceCheckUtils]: 96: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,716 INFO L273 TraceCheckUtils]: 97: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,716 INFO L273 TraceCheckUtils]: 98: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,717 INFO L273 TraceCheckUtils]: 99: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,717 INFO L273 TraceCheckUtils]: 100: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,717 INFO L273 TraceCheckUtils]: 101: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,717 INFO L273 TraceCheckUtils]: 102: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,718 INFO L273 TraceCheckUtils]: 103: Hoare triple {4851#false} assume !~bvslt32(~l~0, ~q~0); {4851#false} is VALID [2018-11-18 21:28:06,718 INFO L273 TraceCheckUtils]: 104: Hoare triple {4851#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {4851#false} is VALID [2018-11-18 21:28:06,718 INFO L273 TraceCheckUtils]: 105: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,718 INFO L273 TraceCheckUtils]: 106: Hoare triple {4851#false} assume !~bvslt32(~k~0, ~p~0); {4851#false} is VALID [2018-11-18 21:28:06,718 INFO L273 TraceCheckUtils]: 107: Hoare triple {4851#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {4851#false} is VALID [2018-11-18 21:28:06,718 INFO L273 TraceCheckUtils]: 108: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,719 INFO L273 TraceCheckUtils]: 109: Hoare triple {4851#false} assume !~bvslt32(~j~0, ~n~0); {4851#false} is VALID [2018-11-18 21:28:06,719 INFO L273 TraceCheckUtils]: 110: Hoare triple {4851#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {4851#false} is VALID [2018-11-18 21:28:06,719 INFO L273 TraceCheckUtils]: 111: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,719 INFO L273 TraceCheckUtils]: 112: Hoare triple {4851#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {4851#false} is VALID [2018-11-18 21:28:06,719 INFO L273 TraceCheckUtils]: 113: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,720 INFO L273 TraceCheckUtils]: 114: Hoare triple {4851#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {4851#false} is VALID [2018-11-18 21:28:06,720 INFO L273 TraceCheckUtils]: 115: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,720 INFO L273 TraceCheckUtils]: 116: Hoare triple {4851#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {4851#false} is VALID [2018-11-18 21:28:06,720 INFO L273 TraceCheckUtils]: 117: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,720 INFO L273 TraceCheckUtils]: 118: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,721 INFO L273 TraceCheckUtils]: 119: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,721 INFO L273 TraceCheckUtils]: 120: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,721 INFO L273 TraceCheckUtils]: 121: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,721 INFO L273 TraceCheckUtils]: 122: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,721 INFO L273 TraceCheckUtils]: 123: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,722 INFO L273 TraceCheckUtils]: 124: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,722 INFO L273 TraceCheckUtils]: 125: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,722 INFO L273 TraceCheckUtils]: 126: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,722 INFO L273 TraceCheckUtils]: 127: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,722 INFO L273 TraceCheckUtils]: 128: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,722 INFO L273 TraceCheckUtils]: 129: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,723 INFO L273 TraceCheckUtils]: 130: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,723 INFO L273 TraceCheckUtils]: 131: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,723 INFO L273 TraceCheckUtils]: 132: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,723 INFO L273 TraceCheckUtils]: 133: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,723 INFO L273 TraceCheckUtils]: 134: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,724 INFO L273 TraceCheckUtils]: 135: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,724 INFO L273 TraceCheckUtils]: 136: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:06,724 INFO L273 TraceCheckUtils]: 137: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,724 INFO L273 TraceCheckUtils]: 138: Hoare triple {4851#false} assume !~bvslt32(~l~0, ~q~0); {4851#false} is VALID [2018-11-18 21:28:06,724 INFO L273 TraceCheckUtils]: 139: Hoare triple {4851#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {4851#false} is VALID [2018-11-18 21:28:06,724 INFO L273 TraceCheckUtils]: 140: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,725 INFO L273 TraceCheckUtils]: 141: Hoare triple {4851#false} assume !~bvslt32(~k~0, ~p~0); {4851#false} is VALID [2018-11-18 21:28:06,725 INFO L273 TraceCheckUtils]: 142: Hoare triple {4851#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {4851#false} is VALID [2018-11-18 21:28:06,725 INFO L273 TraceCheckUtils]: 143: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,725 INFO L273 TraceCheckUtils]: 144: Hoare triple {4851#false} assume !~bvslt32(~j~0, ~n~0); {4851#false} is VALID [2018-11-18 21:28:06,725 INFO L273 TraceCheckUtils]: 145: Hoare triple {4851#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {4851#false} is VALID [2018-11-18 21:28:06,726 INFO L273 TraceCheckUtils]: 146: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,726 INFO L273 TraceCheckUtils]: 147: Hoare triple {4851#false} assume !~bvslt32(~i~0, ~m~0); {4851#false} is VALID [2018-11-18 21:28:06,726 INFO L273 TraceCheckUtils]: 148: Hoare triple {4851#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {4851#false} is VALID [2018-11-18 21:28:06,726 INFO L273 TraceCheckUtils]: 149: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,726 INFO L273 TraceCheckUtils]: 150: Hoare triple {4851#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {4851#false} is VALID [2018-11-18 21:28:06,726 INFO L273 TraceCheckUtils]: 151: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,727 INFO L273 TraceCheckUtils]: 152: Hoare triple {4851#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {4851#false} is VALID [2018-11-18 21:28:06,727 INFO L273 TraceCheckUtils]: 153: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,727 INFO L273 TraceCheckUtils]: 154: Hoare triple {4851#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {4851#false} is VALID [2018-11-18 21:28:06,727 INFO L273 TraceCheckUtils]: 155: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:06,727 INFO L273 TraceCheckUtils]: 156: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32); {4851#false} is VALID [2018-11-18 21:28:06,728 INFO L256 TraceCheckUtils]: 157: Hoare triple {4851#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {4851#false} is VALID [2018-11-18 21:28:06,728 INFO L273 TraceCheckUtils]: 158: Hoare triple {4851#false} ~cond := #in~cond; {4851#false} is VALID [2018-11-18 21:28:06,728 INFO L273 TraceCheckUtils]: 159: Hoare triple {4851#false} assume 0bv32 == ~cond; {4851#false} is VALID [2018-11-18 21:28:06,728 INFO L273 TraceCheckUtils]: 160: Hoare triple {4851#false} assume !false; {4851#false} is VALID [2018-11-18 21:28:06,751 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 762 proven. 110 refuted. 0 times theorem prover too weak. 1170 trivial. 0 not checked. [2018-11-18 21:28:06,752 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-18 21:28:07,629 INFO L273 TraceCheckUtils]: 160: Hoare triple {4851#false} assume !false; {4851#false} is VALID [2018-11-18 21:28:07,630 INFO L273 TraceCheckUtils]: 159: Hoare triple {4851#false} assume 0bv32 == ~cond; {4851#false} is VALID [2018-11-18 21:28:07,630 INFO L273 TraceCheckUtils]: 158: Hoare triple {4851#false} ~cond := #in~cond; {4851#false} is VALID [2018-11-18 21:28:07,630 INFO L256 TraceCheckUtils]: 157: Hoare triple {4851#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1bv32 else 0bv32)); {4851#false} is VALID [2018-11-18 21:28:07,631 INFO L273 TraceCheckUtils]: 156: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32); {4851#false} is VALID [2018-11-18 21:28:07,631 INFO L273 TraceCheckUtils]: 155: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,631 INFO L273 TraceCheckUtils]: 154: Hoare triple {4851#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {4851#false} is VALID [2018-11-18 21:28:07,631 INFO L273 TraceCheckUtils]: 153: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,631 INFO L273 TraceCheckUtils]: 152: Hoare triple {4851#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {4851#false} is VALID [2018-11-18 21:28:07,632 INFO L273 TraceCheckUtils]: 151: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,632 INFO L273 TraceCheckUtils]: 150: Hoare triple {4851#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {4851#false} is VALID [2018-11-18 21:28:07,632 INFO L273 TraceCheckUtils]: 149: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,632 INFO L273 TraceCheckUtils]: 148: Hoare triple {4851#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {4851#false} is VALID [2018-11-18 21:28:07,632 INFO L273 TraceCheckUtils]: 147: Hoare triple {4851#false} assume !~bvslt32(~i~0, ~m~0); {4851#false} is VALID [2018-11-18 21:28:07,632 INFO L273 TraceCheckUtils]: 146: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,632 INFO L273 TraceCheckUtils]: 145: Hoare triple {4851#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {4851#false} is VALID [2018-11-18 21:28:07,632 INFO L273 TraceCheckUtils]: 144: Hoare triple {4851#false} assume !~bvslt32(~j~0, ~n~0); {4851#false} is VALID [2018-11-18 21:28:07,633 INFO L273 TraceCheckUtils]: 143: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,633 INFO L273 TraceCheckUtils]: 142: Hoare triple {4851#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {4851#false} is VALID [2018-11-18 21:28:07,633 INFO L273 TraceCheckUtils]: 141: Hoare triple {4851#false} assume !~bvslt32(~k~0, ~p~0); {4851#false} is VALID [2018-11-18 21:28:07,633 INFO L273 TraceCheckUtils]: 140: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,633 INFO L273 TraceCheckUtils]: 139: Hoare triple {4851#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {4851#false} is VALID [2018-11-18 21:28:07,633 INFO L273 TraceCheckUtils]: 138: Hoare triple {4851#false} assume !~bvslt32(~l~0, ~q~0); {4851#false} is VALID [2018-11-18 21:28:07,633 INFO L273 TraceCheckUtils]: 137: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,633 INFO L273 TraceCheckUtils]: 136: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,634 INFO L273 TraceCheckUtils]: 135: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,634 INFO L273 TraceCheckUtils]: 134: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,634 INFO L273 TraceCheckUtils]: 133: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,634 INFO L273 TraceCheckUtils]: 132: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,634 INFO L273 TraceCheckUtils]: 131: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,634 INFO L273 TraceCheckUtils]: 130: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,634 INFO L273 TraceCheckUtils]: 129: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,634 INFO L273 TraceCheckUtils]: 128: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,635 INFO L273 TraceCheckUtils]: 127: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,635 INFO L273 TraceCheckUtils]: 126: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,635 INFO L273 TraceCheckUtils]: 125: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,635 INFO L273 TraceCheckUtils]: 124: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,635 INFO L273 TraceCheckUtils]: 123: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,635 INFO L273 TraceCheckUtils]: 122: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,635 INFO L273 TraceCheckUtils]: 121: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,635 INFO L273 TraceCheckUtils]: 120: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,636 INFO L273 TraceCheckUtils]: 119: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,636 INFO L273 TraceCheckUtils]: 118: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,636 INFO L273 TraceCheckUtils]: 117: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,636 INFO L273 TraceCheckUtils]: 116: Hoare triple {4851#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {4851#false} is VALID [2018-11-18 21:28:07,636 INFO L273 TraceCheckUtils]: 115: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,636 INFO L273 TraceCheckUtils]: 114: Hoare triple {4851#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {4851#false} is VALID [2018-11-18 21:28:07,636 INFO L273 TraceCheckUtils]: 113: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,636 INFO L273 TraceCheckUtils]: 112: Hoare triple {4851#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {4851#false} is VALID [2018-11-18 21:28:07,637 INFO L273 TraceCheckUtils]: 111: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,637 INFO L273 TraceCheckUtils]: 110: Hoare triple {4851#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {4851#false} is VALID [2018-11-18 21:28:07,637 INFO L273 TraceCheckUtils]: 109: Hoare triple {4851#false} assume !~bvslt32(~j~0, ~n~0); {4851#false} is VALID [2018-11-18 21:28:07,637 INFO L273 TraceCheckUtils]: 108: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,637 INFO L273 TraceCheckUtils]: 107: Hoare triple {4851#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {4851#false} is VALID [2018-11-18 21:28:07,637 INFO L273 TraceCheckUtils]: 106: Hoare triple {4851#false} assume !~bvslt32(~k~0, ~p~0); {4851#false} is VALID [2018-11-18 21:28:07,637 INFO L273 TraceCheckUtils]: 105: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,637 INFO L273 TraceCheckUtils]: 104: Hoare triple {4851#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {4851#false} is VALID [2018-11-18 21:28:07,638 INFO L273 TraceCheckUtils]: 103: Hoare triple {4851#false} assume !~bvslt32(~l~0, ~q~0); {4851#false} is VALID [2018-11-18 21:28:07,638 INFO L273 TraceCheckUtils]: 102: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,638 INFO L273 TraceCheckUtils]: 101: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,638 INFO L273 TraceCheckUtils]: 100: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,638 INFO L273 TraceCheckUtils]: 99: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,638 INFO L273 TraceCheckUtils]: 98: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,638 INFO L273 TraceCheckUtils]: 97: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,638 INFO L273 TraceCheckUtils]: 96: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,639 INFO L273 TraceCheckUtils]: 95: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,639 INFO L273 TraceCheckUtils]: 94: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,639 INFO L273 TraceCheckUtils]: 93: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,639 INFO L273 TraceCheckUtils]: 92: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,639 INFO L273 TraceCheckUtils]: 91: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,639 INFO L273 TraceCheckUtils]: 90: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,639 INFO L273 TraceCheckUtils]: 89: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,639 INFO L273 TraceCheckUtils]: 88: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,640 INFO L273 TraceCheckUtils]: 87: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,640 INFO L273 TraceCheckUtils]: 86: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,640 INFO L273 TraceCheckUtils]: 85: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,640 INFO L273 TraceCheckUtils]: 84: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,640 INFO L273 TraceCheckUtils]: 83: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,640 INFO L273 TraceCheckUtils]: 82: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,640 INFO L273 TraceCheckUtils]: 81: Hoare triple {4851#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {4851#false} is VALID [2018-11-18 21:28:07,640 INFO L273 TraceCheckUtils]: 80: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,641 INFO L273 TraceCheckUtils]: 79: Hoare triple {4851#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {4851#false} is VALID [2018-11-18 21:28:07,641 INFO L273 TraceCheckUtils]: 78: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,641 INFO L273 TraceCheckUtils]: 77: Hoare triple {4851#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {4851#false} is VALID [2018-11-18 21:28:07,641 INFO L273 TraceCheckUtils]: 76: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,641 INFO L273 TraceCheckUtils]: 75: Hoare triple {4851#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {4851#false} is VALID [2018-11-18 21:28:07,641 INFO L273 TraceCheckUtils]: 74: Hoare triple {4851#false} assume !~bvslt32(~j~0, ~n~0); {4851#false} is VALID [2018-11-18 21:28:07,641 INFO L273 TraceCheckUtils]: 73: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,641 INFO L273 TraceCheckUtils]: 72: Hoare triple {4851#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {4851#false} is VALID [2018-11-18 21:28:07,641 INFO L273 TraceCheckUtils]: 71: Hoare triple {4851#false} assume !~bvslt32(~k~0, ~p~0); {4851#false} is VALID [2018-11-18 21:28:07,642 INFO L273 TraceCheckUtils]: 70: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,642 INFO L273 TraceCheckUtils]: 69: Hoare triple {4851#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {4851#false} is VALID [2018-11-18 21:28:07,642 INFO L273 TraceCheckUtils]: 68: Hoare triple {4851#false} assume !~bvslt32(~l~0, ~q~0); {4851#false} is VALID [2018-11-18 21:28:07,642 INFO L273 TraceCheckUtils]: 67: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,642 INFO L273 TraceCheckUtils]: 66: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,642 INFO L273 TraceCheckUtils]: 65: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,643 INFO L273 TraceCheckUtils]: 64: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,643 INFO L273 TraceCheckUtils]: 63: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,643 INFO L273 TraceCheckUtils]: 62: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,643 INFO L273 TraceCheckUtils]: 61: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,643 INFO L273 TraceCheckUtils]: 60: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,644 INFO L273 TraceCheckUtils]: 59: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,644 INFO L273 TraceCheckUtils]: 58: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,644 INFO L273 TraceCheckUtils]: 57: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,644 INFO L273 TraceCheckUtils]: 56: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,644 INFO L273 TraceCheckUtils]: 55: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,644 INFO L273 TraceCheckUtils]: 54: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,645 INFO L273 TraceCheckUtils]: 53: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,645 INFO L273 TraceCheckUtils]: 52: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,645 INFO L273 TraceCheckUtils]: 51: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,645 INFO L273 TraceCheckUtils]: 50: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,645 INFO L273 TraceCheckUtils]: 49: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,645 INFO L273 TraceCheckUtils]: 48: Hoare triple {4851#false} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {4851#false} is VALID [2018-11-18 21:28:07,646 INFO L273 TraceCheckUtils]: 47: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,646 INFO L273 TraceCheckUtils]: 46: Hoare triple {4851#false} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {4851#false} is VALID [2018-11-18 21:28:07,646 INFO L273 TraceCheckUtils]: 45: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,646 INFO L273 TraceCheckUtils]: 44: Hoare triple {4851#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {4851#false} is VALID [2018-11-18 21:28:07,646 INFO L273 TraceCheckUtils]: 43: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,647 INFO L273 TraceCheckUtils]: 42: Hoare triple {4851#false} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {4851#false} is VALID [2018-11-18 21:28:07,647 INFO L273 TraceCheckUtils]: 41: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,647 INFO L273 TraceCheckUtils]: 40: Hoare triple {4851#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {4851#false} is VALID [2018-11-18 21:28:07,647 INFO L273 TraceCheckUtils]: 39: Hoare triple {4851#false} assume !~bvslt32(~j~0, ~n~0); {4851#false} is VALID [2018-11-18 21:28:07,647 INFO L273 TraceCheckUtils]: 38: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,647 INFO L273 TraceCheckUtils]: 37: Hoare triple {4851#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {4851#false} is VALID [2018-11-18 21:28:07,648 INFO L273 TraceCheckUtils]: 36: Hoare triple {4851#false} assume !~bvslt32(~k~0, ~p~0); {4851#false} is VALID [2018-11-18 21:28:07,648 INFO L273 TraceCheckUtils]: 35: Hoare triple {4851#false} assume true; {4851#false} is VALID [2018-11-18 21:28:07,648 INFO L273 TraceCheckUtils]: 34: Hoare triple {4851#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {4851#false} is VALID [2018-11-18 21:28:07,662 INFO L273 TraceCheckUtils]: 33: Hoare triple {5728#(bvslt main_~l~0 main_~q~0)} assume !~bvslt32(~l~0, ~q~0); {4851#false} is VALID [2018-11-18 21:28:07,665 INFO L273 TraceCheckUtils]: 32: Hoare triple {5728#(bvslt main_~l~0 main_~q~0)} assume true; {5728#(bvslt main_~l~0 main_~q~0)} is VALID [2018-11-18 21:28:07,666 INFO L273 TraceCheckUtils]: 31: Hoare triple {5735#(bvslt (bvadd main_~l~0 (_ bv1 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {5728#(bvslt main_~l~0 main_~q~0)} is VALID [2018-11-18 21:28:07,666 INFO L273 TraceCheckUtils]: 30: Hoare triple {5735#(bvslt (bvadd main_~l~0 (_ bv1 32)) main_~q~0)} assume true; {5735#(bvslt (bvadd main_~l~0 (_ bv1 32)) main_~q~0)} is VALID [2018-11-18 21:28:07,861 INFO L273 TraceCheckUtils]: 29: Hoare triple {5742#(bvslt (bvadd main_~l~0 (_ bv2 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {5735#(bvslt (bvadd main_~l~0 (_ bv1 32)) main_~q~0)} is VALID [2018-11-18 21:28:07,861 INFO L273 TraceCheckUtils]: 28: Hoare triple {5742#(bvslt (bvadd main_~l~0 (_ bv2 32)) main_~q~0)} assume true; {5742#(bvslt (bvadd main_~l~0 (_ bv2 32)) main_~q~0)} is VALID [2018-11-18 21:28:08,093 INFO L273 TraceCheckUtils]: 27: Hoare triple {5749#(bvslt (bvadd main_~l~0 (_ bv3 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {5742#(bvslt (bvadd main_~l~0 (_ bv2 32)) main_~q~0)} is VALID [2018-11-18 21:28:08,094 INFO L273 TraceCheckUtils]: 26: Hoare triple {5749#(bvslt (bvadd main_~l~0 (_ bv3 32)) main_~q~0)} assume true; {5749#(bvslt (bvadd main_~l~0 (_ bv3 32)) main_~q~0)} is VALID [2018-11-18 21:28:08,404 INFO L273 TraceCheckUtils]: 25: Hoare triple {5756#(bvslt (bvadd main_~l~0 (_ bv4 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {5749#(bvslt (bvadd main_~l~0 (_ bv3 32)) main_~q~0)} is VALID [2018-11-18 21:28:08,405 INFO L273 TraceCheckUtils]: 24: Hoare triple {5756#(bvslt (bvadd main_~l~0 (_ bv4 32)) main_~q~0)} assume true; {5756#(bvslt (bvadd main_~l~0 (_ bv4 32)) main_~q~0)} is VALID [2018-11-18 21:28:08,682 INFO L273 TraceCheckUtils]: 23: Hoare triple {5763#(bvslt (bvadd main_~l~0 (_ bv5 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {5756#(bvslt (bvadd main_~l~0 (_ bv4 32)) main_~q~0)} is VALID [2018-11-18 21:28:08,683 INFO L273 TraceCheckUtils]: 22: Hoare triple {5763#(bvslt (bvadd main_~l~0 (_ bv5 32)) main_~q~0)} assume true; {5763#(bvslt (bvadd main_~l~0 (_ bv5 32)) main_~q~0)} is VALID [2018-11-18 21:28:08,897 INFO L273 TraceCheckUtils]: 21: Hoare triple {5770#(bvslt (bvadd main_~l~0 (_ bv6 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {5763#(bvslt (bvadd main_~l~0 (_ bv5 32)) main_~q~0)} is VALID [2018-11-18 21:28:08,898 INFO L273 TraceCheckUtils]: 20: Hoare triple {5770#(bvslt (bvadd main_~l~0 (_ bv6 32)) main_~q~0)} assume true; {5770#(bvslt (bvadd main_~l~0 (_ bv6 32)) main_~q~0)} is VALID [2018-11-18 21:28:09,249 INFO L273 TraceCheckUtils]: 19: Hoare triple {5777#(bvslt (bvadd main_~l~0 (_ bv7 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {5770#(bvslt (bvadd main_~l~0 (_ bv6 32)) main_~q~0)} is VALID [2018-11-18 21:28:09,250 INFO L273 TraceCheckUtils]: 18: Hoare triple {5777#(bvslt (bvadd main_~l~0 (_ bv7 32)) main_~q~0)} assume true; {5777#(bvslt (bvadd main_~l~0 (_ bv7 32)) main_~q~0)} is VALID [2018-11-18 21:28:09,430 INFO L273 TraceCheckUtils]: 17: Hoare triple {5784#(bvslt (bvadd main_~l~0 (_ bv8 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {5777#(bvslt (bvadd main_~l~0 (_ bv7 32)) main_~q~0)} is VALID [2018-11-18 21:28:09,430 INFO L273 TraceCheckUtils]: 16: Hoare triple {5784#(bvslt (bvadd main_~l~0 (_ bv8 32)) main_~q~0)} assume true; {5784#(bvslt (bvadd main_~l~0 (_ bv8 32)) main_~q~0)} is VALID [2018-11-18 21:28:09,598 INFO L273 TraceCheckUtils]: 15: Hoare triple {5791#(bvslt (bvadd main_~l~0 (_ bv9 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {5784#(bvslt (bvadd main_~l~0 (_ bv8 32)) main_~q~0)} is VALID [2018-11-18 21:28:09,598 INFO L273 TraceCheckUtils]: 14: Hoare triple {5791#(bvslt (bvadd main_~l~0 (_ bv9 32)) main_~q~0)} assume true; {5791#(bvslt (bvadd main_~l~0 (_ bv9 32)) main_~q~0)} is VALID [2018-11-18 21:28:09,914 INFO L273 TraceCheckUtils]: 13: Hoare triple {5798#(bvslt (bvadd main_~l~0 (_ bv10 32)) main_~q~0)} assume !!~bvslt32(~l~0, ~q~0);call write~intINTTYPE4(~C~0, ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0))), ~bvmul32(~k~0, ~bvmul32(4bv32, ~q~0))), ~bvmul32(4bv32, ~l~0)), 4bv32);~l~0 := ~bvadd32(1bv32, ~l~0); {5791#(bvslt (bvadd main_~l~0 (_ bv9 32)) main_~q~0)} is VALID [2018-11-18 21:28:09,915 INFO L273 TraceCheckUtils]: 12: Hoare triple {5798#(bvslt (bvadd main_~l~0 (_ bv10 32)) main_~q~0)} assume true; {5798#(bvslt (bvadd main_~l~0 (_ bv10 32)) main_~q~0)} is VALID [2018-11-18 21:28:09,915 INFO L273 TraceCheckUtils]: 11: Hoare triple {5805#(bvslt (_ bv10 32) main_~q~0)} assume !!~bvslt32(~k~0, ~p~0);~l~0 := 0bv32; {5798#(bvslt (bvadd main_~l~0 (_ bv10 32)) main_~q~0)} is VALID [2018-11-18 21:28:09,916 INFO L273 TraceCheckUtils]: 10: Hoare triple {5805#(bvslt (_ bv10 32) main_~q~0)} assume true; {5805#(bvslt (_ bv10 32) main_~q~0)} is VALID [2018-11-18 21:28:09,916 INFO L273 TraceCheckUtils]: 9: Hoare triple {5805#(bvslt (_ bv10 32) main_~q~0)} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32;~l~0 := 0bv32; {5805#(bvslt (_ bv10 32) main_~q~0)} is VALID [2018-11-18 21:28:09,933 INFO L273 TraceCheckUtils]: 8: Hoare triple {5805#(bvslt (_ bv10 32) main_~q~0)} assume true; {5805#(bvslt (_ bv10 32) main_~q~0)} is VALID [2018-11-18 21:28:09,933 INFO L273 TraceCheckUtils]: 7: Hoare triple {5805#(bvslt (_ bv10 32) main_~q~0)} assume !!~bvslt32(~i~0, ~m~0);~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {5805#(bvslt (_ bv10 32) main_~q~0)} is VALID [2018-11-18 21:28:09,934 INFO L273 TraceCheckUtils]: 6: Hoare triple {5805#(bvslt (_ bv10 32) main_~q~0)} assume true; {5805#(bvslt (_ bv10 32) main_~q~0)} is VALID [2018-11-18 21:28:09,934 INFO L273 TraceCheckUtils]: 5: Hoare triple {4850#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;havoc ~l~0;~m~0 := 1000bv32;~n~0 := 1500bv32;~p~0 := 1800bv32;~q~0 := 2000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(~bvmul32(4bv32, ~q~0), ~p~0), ~n~0), ~m~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32;~l~0 := 0bv32; {5805#(bvslt (_ bv10 32) main_~q~0)} is VALID [2018-11-18 21:28:09,934 INFO L256 TraceCheckUtils]: 4: Hoare triple {4850#true} call #t~ret2 := main(); {4850#true} is VALID [2018-11-18 21:28:09,935 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4850#true} {4850#true} #133#return; {4850#true} is VALID [2018-11-18 21:28:09,935 INFO L273 TraceCheckUtils]: 2: Hoare triple {4850#true} assume true; {4850#true} is VALID [2018-11-18 21:28:09,935 INFO L273 TraceCheckUtils]: 1: Hoare triple {4850#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4850#true} is VALID [2018-11-18 21:28:09,935 INFO L256 TraceCheckUtils]: 0: Hoare triple {4850#true} call ULTIMATE.init(); {4850#true} is VALID [2018-11-18 21:28:09,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2042 backedges. 762 proven. 110 refuted. 0 times theorem prover too weak. 1170 trivial. 0 not checked. [2018-11-18 21:28:09,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 21:28:09,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-11-18 21:28:09,953 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 161 [2018-11-18 21:28:09,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 21:28:09,954 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-18 21:28:12,392 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:28:12,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-18 21:28:12,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-18 21:28:12,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-18 21:28:12,393 INFO L87 Difference]: Start difference. First operand 210 states and 235 transitions. Second operand 26 states. [2018-11-18 21:29:15,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:29:15,566 INFO L93 Difference]: Finished difference Result 556 states and 678 transitions. [2018-11-18 21:29:15,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-18 21:29:15,566 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 161 [2018-11-18 21:29:15,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 21:29:15,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 21:29:15,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 269 transitions. [2018-11-18 21:29:15,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-18 21:29:15,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 269 transitions. [2018-11-18 21:29:15,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 269 transitions. [2018-11-18 21:29:18,508 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 269 edges. 269 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 21:29:18,517 INFO L225 Difference]: With dead ends: 556 [2018-11-18 21:29:18,517 INFO L226 Difference]: Without dead ends: 356 [2018-11-18 21:29:18,519 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 297 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-18 21:29:18,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-18 21:29:19,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 354. [2018-11-18 21:29:19,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 21:29:19,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 356 states. Second operand 354 states. [2018-11-18 21:29:19,640 INFO L74 IsIncluded]: Start isIncluded. First operand 356 states. Second operand 354 states. [2018-11-18 21:29:19,640 INFO L87 Difference]: Start difference. First operand 356 states. Second operand 354 states. [2018-11-18 21:29:19,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:29:19,657 INFO L93 Difference]: Finished difference Result 356 states and 393 transitions. [2018-11-18 21:29:19,657 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 393 transitions. [2018-11-18 21:29:19,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:29:19,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:29:19,659 INFO L74 IsIncluded]: Start isIncluded. First operand 354 states. Second operand 356 states. [2018-11-18 21:29:19,659 INFO L87 Difference]: Start difference. First operand 354 states. Second operand 356 states. [2018-11-18 21:29:19,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 21:29:19,672 INFO L93 Difference]: Finished difference Result 356 states and 393 transitions. [2018-11-18 21:29:19,673 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 393 transitions. [2018-11-18 21:29:19,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 21:29:19,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 21:29:19,674 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 21:29:19,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 21:29:19,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-11-18 21:29:19,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 391 transitions. [2018-11-18 21:29:19,687 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 391 transitions. Word has length 161 [2018-11-18 21:29:19,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 21:29:19,688 INFO L480 AbstractCegarLoop]: Abstraction has 354 states and 391 transitions. [2018-11-18 21:29:19,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-18 21:29:19,688 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 391 transitions. [2018-11-18 21:29:19,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-11-18 21:29:19,692 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 21:29:19,692 INFO L375 BasicCegarLoop]: trace histogram [92, 88, 8, 8, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 21:29:19,692 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 21:29:19,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 21:29:19,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1255647748, now seen corresponding path program 5 times [2018-11-18 21:29:19,694 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-18 21:29:19,694 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-18 21:29:19,724 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1