java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-multidimensional/init-non-constant-3-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:47:30,306 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:47:30,308 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:47:30,320 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:47:30,320 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:47:30,321 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:47:30,323 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:47:30,324 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:47:30,326 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:47:30,327 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:47:30,328 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:47:30,328 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:47:30,329 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:47:30,330 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:47:30,331 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:47:30,332 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:47:30,333 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:47:30,335 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:47:30,337 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:47:30,339 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:47:30,340 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:47:30,341 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:47:30,344 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:47:30,344 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:47:30,345 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:47:30,346 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:47:30,347 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:47:30,348 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:47:30,349 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:47:30,350 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:47:30,350 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:47:30,351 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:47:30,351 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:47:30,351 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:47:30,353 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:47:30,353 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:47:30,354 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 10:47:30,369 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:47:30,370 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:47:30,371 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:47:30,371 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:47:30,372 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:47:30,372 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:47:30,372 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:47:30,372 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:47:30,372 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:47:30,373 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:47:30,373 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:47:30,373 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:47:30,373 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:47:30,373 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:47:30,374 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:47:30,374 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:47:30,374 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:47:30,374 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:47:30,374 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:47:30,375 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:47:30,375 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:47:30,375 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:47:30,375 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:47:30,376 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:47:30,376 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:47:30,376 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:47:30,376 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:47:30,376 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:47:30,377 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:47:30,377 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:47:30,377 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:47:30,377 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:47:30,377 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:47:30,422 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:47:30,435 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:47:30,440 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:47:30,442 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:47:30,442 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:47:30,444 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/init-non-constant-3-u_true-unreach-call.i [2018-11-23 10:47:30,514 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb4f0ba9c/976a928dede647489efabc13a8c00f8d/FLAGeed4944f1 [2018-11-23 10:47:30,996 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:47:30,997 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/init-non-constant-3-u_true-unreach-call.i [2018-11-23 10:47:31,002 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb4f0ba9c/976a928dede647489efabc13a8c00f8d/FLAGeed4944f1 [2018-11-23 10:47:31,336 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb4f0ba9c/976a928dede647489efabc13a8c00f8d [2018-11-23 10:47:31,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:47:31,349 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:47:31,350 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:47:31,351 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:47:31,355 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:47:31,357 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:47:31" (1/1) ... [2018-11-23 10:47:31,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@522616a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:31, skipping insertion in model container [2018-11-23 10:47:31,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:47:31" (1/1) ... [2018-11-23 10:47:31,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:47:31,402 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:47:31,715 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:47:31,723 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:47:31,762 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:47:31,789 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:47:31,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:31 WrapperNode [2018-11-23 10:47:31,790 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:47:31,791 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:47:31,791 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:47:31,791 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:47:31,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:31" (1/1) ... [2018-11-23 10:47:31,814 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:31" (1/1) ... [2018-11-23 10:47:31,825 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:47:31,826 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:47:31,826 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:47:31,826 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:47:31,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:31" (1/1) ... [2018-11-23 10:47:31,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:31" (1/1) ... [2018-11-23 10:47:31,842 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:31" (1/1) ... [2018-11-23 10:47:31,843 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:31" (1/1) ... [2018-11-23 10:47:31,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:31" (1/1) ... [2018-11-23 10:47:31,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:31" (1/1) ... [2018-11-23 10:47:31,892 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:31" (1/1) ... [2018-11-23 10:47:31,899 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:47:31,899 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:47:31,899 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:47:31,902 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:47:31,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:47:32,078 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:47:32,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:47:32,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:47:32,079 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:47:32,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:47:32,079 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:47:32,080 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:47:32,080 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:47:32,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:47:32,080 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:47:32,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:47:32,080 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:47:32,846 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:47:32,847 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 10:47:32,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:47:32 BoogieIcfgContainer [2018-11-23 10:47:32,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:47:32,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:47:32,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:47:32,852 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:47:32,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:47:31" (1/3) ... [2018-11-23 10:47:32,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68b069d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:47:32, skipping insertion in model container [2018-11-23 10:47:32,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:47:31" (2/3) ... [2018-11-23 10:47:32,854 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68b069d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:47:32, skipping insertion in model container [2018-11-23 10:47:32,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:47:32" (3/3) ... [2018-11-23 10:47:32,856 INFO L112 eAbstractionObserver]: Analyzing ICFG init-non-constant-3-u_true-unreach-call.i [2018-11-23 10:47:32,866 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:47:32,874 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:47:32,892 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:47:32,927 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:47:32,928 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:47:32,928 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:47:32,928 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:47:32,929 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:47:32,929 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:47:32,929 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:47:32,930 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:47:32,930 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:47:32,948 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-23 10:47:32,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:47:32,955 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:47:32,956 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:47:32,959 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:47:32,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:47:32,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1375180307, now seen corresponding path program 1 times [2018-11-23 10:47:32,969 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:47:32,970 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:47:32,988 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:47:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:33,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:33,095 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:47:33,168 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-23 10:47:33,172 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {33#true} is VALID [2018-11-23 10:47:33,172 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-23 10:47:33,173 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #99#return; {33#true} is VALID [2018-11-23 10:47:33,173 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret2 := main(); {33#true} is VALID [2018-11-23 10:47:33,173 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0), ~n~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {33#true} is VALID [2018-11-23 10:47:33,177 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume !true; {34#false} is VALID [2018-11-23 10:47:33,177 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {34#false} is VALID [2018-11-23 10:47:33,177 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#false} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {34#false} is VALID [2018-11-23 10:47:33,178 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {34#false} is VALID [2018-11-23 10:47:33,178 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} assume !!~bvslt32(~k~0, ~n~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32); {34#false} is VALID [2018-11-23 10:47:33,178 INFO L256 TraceCheckUtils]: 11: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem1 == ~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0) then 1bv32 else 0bv32)); {34#false} is VALID [2018-11-23 10:47:33,179 INFO L273 TraceCheckUtils]: 12: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-23 10:47:33,179 INFO L273 TraceCheckUtils]: 13: Hoare triple {34#false} assume 0bv32 == ~cond; {34#false} is VALID [2018-11-23 10:47:33,179 INFO L273 TraceCheckUtils]: 14: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-23 10:47:33,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:47:33,183 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:47:33,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:47:33,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:47:33,193 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 10:47:33,196 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:47:33,200 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:47:33,406 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:33,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:47:33,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:47:33,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:47:33,429 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-23 10:47:33,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:33,712 INFO L93 Difference]: Finished difference Result 54 states and 79 transitions. [2018-11-23 10:47:33,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:47:33,713 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 10:47:33,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:47:33,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:47:33,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2018-11-23 10:47:33,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:47:33,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2018-11-23 10:47:33,735 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 79 transitions. [2018-11-23 10:47:34,149 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:34,161 INFO L225 Difference]: With dead ends: 54 [2018-11-23 10:47:34,161 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 10:47:34,167 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:47:34,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 10:47:34,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-23 10:47:34,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:47:34,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-23 10:47:34,241 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 10:47:34,241 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 10:47:34,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:34,246 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2018-11-23 10:47:34,246 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2018-11-23 10:47:34,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:34,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:34,247 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-23 10:47:34,247 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-23 10:47:34,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:34,253 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2018-11-23 10:47:34,253 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2018-11-23 10:47:34,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:34,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:34,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:47:34,255 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:47:34,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 10:47:34,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2018-11-23 10:47:34,261 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 15 [2018-11-23 10:47:34,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:47:34,262 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2018-11-23 10:47:34,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:47:34,263 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2018-11-23 10:47:34,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:47:34,264 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:47:34,264 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:47:34,264 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:47:34,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:47:34,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1308846031, now seen corresponding path program 1 times [2018-11-23 10:47:34,267 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:47:34,267 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:47:34,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:47:34,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:34,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:34,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:47:34,439 INFO L256 TraceCheckUtils]: 0: Hoare triple {240#true} call ULTIMATE.init(); {240#true} is VALID [2018-11-23 10:47:34,440 INFO L273 TraceCheckUtils]: 1: Hoare triple {240#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {240#true} is VALID [2018-11-23 10:47:34,440 INFO L273 TraceCheckUtils]: 2: Hoare triple {240#true} assume true; {240#true} is VALID [2018-11-23 10:47:34,440 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {240#true} {240#true} #99#return; {240#true} is VALID [2018-11-23 10:47:34,441 INFO L256 TraceCheckUtils]: 4: Hoare triple {240#true} call #t~ret2 := main(); {240#true} is VALID [2018-11-23 10:47:34,442 INFO L273 TraceCheckUtils]: 5: Hoare triple {240#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0), ~n~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {260#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:34,442 INFO L273 TraceCheckUtils]: 6: Hoare triple {260#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} assume !~bvslt32(~i~0, ~n~0); {241#false} is VALID [2018-11-23 10:47:34,443 INFO L273 TraceCheckUtils]: 7: Hoare triple {241#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {241#false} is VALID [2018-11-23 10:47:34,443 INFO L273 TraceCheckUtils]: 8: Hoare triple {241#false} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {241#false} is VALID [2018-11-23 10:47:34,443 INFO L273 TraceCheckUtils]: 9: Hoare triple {241#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {241#false} is VALID [2018-11-23 10:47:34,444 INFO L273 TraceCheckUtils]: 10: Hoare triple {241#false} assume !!~bvslt32(~k~0, ~n~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32); {241#false} is VALID [2018-11-23 10:47:34,444 INFO L256 TraceCheckUtils]: 11: Hoare triple {241#false} call __VERIFIER_assert((if #t~mem1 == ~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0) then 1bv32 else 0bv32)); {241#false} is VALID [2018-11-23 10:47:34,444 INFO L273 TraceCheckUtils]: 12: Hoare triple {241#false} ~cond := #in~cond; {241#false} is VALID [2018-11-23 10:47:34,445 INFO L273 TraceCheckUtils]: 13: Hoare triple {241#false} assume 0bv32 == ~cond; {241#false} is VALID [2018-11-23 10:47:34,445 INFO L273 TraceCheckUtils]: 14: Hoare triple {241#false} assume !false; {241#false} is VALID [2018-11-23 10:47:34,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:47:34,447 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:47:34,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:47:34,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:47:34,456 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 10:47:34,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:47:34,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:47:34,538 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:34,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:47:34,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:47:34,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:47:34,540 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand 3 states. [2018-11-23 10:47:35,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:35,403 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-23 10:47:35,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:47:35,404 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 10:47:35,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:47:35,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:47:35,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 10:47:35,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:47:35,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 10:47:35,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2018-11-23 10:47:35,950 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:35,952 INFO L225 Difference]: With dead ends: 44 [2018-11-23 10:47:35,953 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 10:47:35,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:47:35,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 10:47:35,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-11-23 10:47:35,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:47:35,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 26 states. [2018-11-23 10:47:35,984 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 26 states. [2018-11-23 10:47:35,984 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 26 states. [2018-11-23 10:47:35,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:35,987 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 10:47:35,988 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 10:47:35,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:35,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:35,989 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 30 states. [2018-11-23 10:47:35,989 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 30 states. [2018-11-23 10:47:35,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:35,992 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 10:47:35,992 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 10:47:35,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:35,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:35,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:47:35,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:47:35,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 10:47:35,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-11-23 10:47:35,996 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 15 [2018-11-23 10:47:35,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:47:35,996 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-23 10:47:35,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:47:35,997 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-11-23 10:47:35,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 10:47:35,998 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:47:35,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:47:35,998 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:47:35,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:47:35,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1886649102, now seen corresponding path program 1 times [2018-11-23 10:47:35,999 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:47:36,000 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:47:36,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:47:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:36,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:47:36,146 INFO L256 TraceCheckUtils]: 0: Hoare triple {450#true} call ULTIMATE.init(); {450#true} is VALID [2018-11-23 10:47:36,147 INFO L273 TraceCheckUtils]: 1: Hoare triple {450#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {450#true} is VALID [2018-11-23 10:47:36,147 INFO L273 TraceCheckUtils]: 2: Hoare triple {450#true} assume true; {450#true} is VALID [2018-11-23 10:47:36,147 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {450#true} {450#true} #99#return; {450#true} is VALID [2018-11-23 10:47:36,148 INFO L256 TraceCheckUtils]: 4: Hoare triple {450#true} call #t~ret2 := main(); {450#true} is VALID [2018-11-23 10:47:36,158 INFO L273 TraceCheckUtils]: 5: Hoare triple {450#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0), ~n~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {470#(= (_ bv1000 32) main_~n~0)} is VALID [2018-11-23 10:47:36,159 INFO L273 TraceCheckUtils]: 6: Hoare triple {470#(= (_ bv1000 32) main_~n~0)} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {474#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1000 32) main_~n~0))} is VALID [2018-11-23 10:47:36,160 INFO L273 TraceCheckUtils]: 7: Hoare triple {474#(and (= main_~j~0 (_ bv0 32)) (= (_ bv1000 32) main_~n~0))} assume !~bvslt32(~j~0, ~n~0); {451#false} is VALID [2018-11-23 10:47:36,160 INFO L273 TraceCheckUtils]: 8: Hoare triple {451#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {451#false} is VALID [2018-11-23 10:47:36,160 INFO L273 TraceCheckUtils]: 9: Hoare triple {451#false} assume !~bvslt32(~i~0, ~n~0); {451#false} is VALID [2018-11-23 10:47:36,160 INFO L273 TraceCheckUtils]: 10: Hoare triple {451#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {451#false} is VALID [2018-11-23 10:47:36,161 INFO L273 TraceCheckUtils]: 11: Hoare triple {451#false} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {451#false} is VALID [2018-11-23 10:47:36,161 INFO L273 TraceCheckUtils]: 12: Hoare triple {451#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {451#false} is VALID [2018-11-23 10:47:36,161 INFO L273 TraceCheckUtils]: 13: Hoare triple {451#false} assume !!~bvslt32(~k~0, ~n~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32); {451#false} is VALID [2018-11-23 10:47:36,162 INFO L256 TraceCheckUtils]: 14: Hoare triple {451#false} call __VERIFIER_assert((if #t~mem1 == ~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0) then 1bv32 else 0bv32)); {451#false} is VALID [2018-11-23 10:47:36,162 INFO L273 TraceCheckUtils]: 15: Hoare triple {451#false} ~cond := #in~cond; {451#false} is VALID [2018-11-23 10:47:36,162 INFO L273 TraceCheckUtils]: 16: Hoare triple {451#false} assume 0bv32 == ~cond; {451#false} is VALID [2018-11-23 10:47:36,162 INFO L273 TraceCheckUtils]: 17: Hoare triple {451#false} assume !false; {451#false} is VALID [2018-11-23 10:47:36,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:47:36,164 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:47:36,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:47:36,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 10:47:36,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 10:47:36,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:47:36,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 10:47:36,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:36,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 10:47:36,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 10:47:36,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:47:36,218 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 4 states. [2018-11-23 10:47:36,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:36,806 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2018-11-23 10:47:36,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 10:47:36,806 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 10:47:36,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:47:36,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:47:36,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2018-11-23 10:47:36,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:47:36,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2018-11-23 10:47:36,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 69 transitions. [2018-11-23 10:47:37,093 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:37,095 INFO L225 Difference]: With dead ends: 54 [2018-11-23 10:47:37,097 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 10:47:37,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:47:37,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 10:47:37,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2018-11-23 10:47:37,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:47:37,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 28 states. [2018-11-23 10:47:37,129 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 28 states. [2018-11-23 10:47:37,130 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 28 states. [2018-11-23 10:47:37,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:37,135 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2018-11-23 10:47:37,135 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2018-11-23 10:47:37,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:37,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:37,137 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 35 states. [2018-11-23 10:47:37,137 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 35 states. [2018-11-23 10:47:37,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:37,140 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2018-11-23 10:47:37,141 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2018-11-23 10:47:37,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:37,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:37,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:47:37,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:47:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 10:47:37,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2018-11-23 10:47:37,144 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2018-11-23 10:47:37,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:47:37,145 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2018-11-23 10:47:37,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 10:47:37,145 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2018-11-23 10:47:37,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 10:47:37,146 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:47:37,146 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:47:37,147 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:47:37,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:47:37,147 INFO L82 PathProgramCache]: Analyzing trace with hash -464275123, now seen corresponding path program 1 times [2018-11-23 10:47:37,148 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:47:37,148 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:47:37,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:47:37,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:37,231 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:47:37,307 INFO L256 TraceCheckUtils]: 0: Hoare triple {701#true} call ULTIMATE.init(); {701#true} is VALID [2018-11-23 10:47:37,307 INFO L273 TraceCheckUtils]: 1: Hoare triple {701#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {701#true} is VALID [2018-11-23 10:47:37,308 INFO L273 TraceCheckUtils]: 2: Hoare triple {701#true} assume true; {701#true} is VALID [2018-11-23 10:47:37,308 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {701#true} {701#true} #99#return; {701#true} is VALID [2018-11-23 10:47:37,308 INFO L256 TraceCheckUtils]: 4: Hoare triple {701#true} call #t~ret2 := main(); {701#true} is VALID [2018-11-23 10:47:37,312 INFO L273 TraceCheckUtils]: 5: Hoare triple {701#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0), ~n~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {721#(= (_ bv1000 32) main_~n~0)} is VALID [2018-11-23 10:47:37,312 INFO L273 TraceCheckUtils]: 6: Hoare triple {721#(= (_ bv1000 32) main_~n~0)} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {721#(= (_ bv1000 32) main_~n~0)} is VALID [2018-11-23 10:47:37,319 INFO L273 TraceCheckUtils]: 7: Hoare triple {721#(= (_ bv1000 32) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {728#(and (= (_ bv1000 32) main_~n~0) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:37,322 INFO L273 TraceCheckUtils]: 8: Hoare triple {728#(and (= (_ bv1000 32) main_~n~0) (= main_~k~0 (_ bv0 32)))} assume !~bvslt32(~k~0, ~n~0); {702#false} is VALID [2018-11-23 10:47:37,322 INFO L273 TraceCheckUtils]: 9: Hoare triple {702#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {702#false} is VALID [2018-11-23 10:47:37,323 INFO L273 TraceCheckUtils]: 10: Hoare triple {702#false} assume !~bvslt32(~j~0, ~n~0); {702#false} is VALID [2018-11-23 10:47:37,323 INFO L273 TraceCheckUtils]: 11: Hoare triple {702#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {702#false} is VALID [2018-11-23 10:47:37,323 INFO L273 TraceCheckUtils]: 12: Hoare triple {702#false} assume !~bvslt32(~i~0, ~n~0); {702#false} is VALID [2018-11-23 10:47:37,323 INFO L273 TraceCheckUtils]: 13: Hoare triple {702#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {702#false} is VALID [2018-11-23 10:47:37,324 INFO L273 TraceCheckUtils]: 14: Hoare triple {702#false} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {702#false} is VALID [2018-11-23 10:47:37,324 INFO L273 TraceCheckUtils]: 15: Hoare triple {702#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {702#false} is VALID [2018-11-23 10:47:37,324 INFO L273 TraceCheckUtils]: 16: Hoare triple {702#false} assume !!~bvslt32(~k~0, ~n~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32); {702#false} is VALID [2018-11-23 10:47:37,325 INFO L256 TraceCheckUtils]: 17: Hoare triple {702#false} call __VERIFIER_assert((if #t~mem1 == ~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0) then 1bv32 else 0bv32)); {702#false} is VALID [2018-11-23 10:47:37,325 INFO L273 TraceCheckUtils]: 18: Hoare triple {702#false} ~cond := #in~cond; {702#false} is VALID [2018-11-23 10:47:37,325 INFO L273 TraceCheckUtils]: 19: Hoare triple {702#false} assume 0bv32 == ~cond; {702#false} is VALID [2018-11-23 10:47:37,326 INFO L273 TraceCheckUtils]: 20: Hoare triple {702#false} assume !false; {702#false} is VALID [2018-11-23 10:47:37,327 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-23 10:47:37,327 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:47:37,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:47:37,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 10:47:37,330 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-23 10:47:37,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:47:37,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 10:47:37,391 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-23 10:47:37,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 10:47:37,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 10:47:37,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:47:37,392 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 4 states. [2018-11-23 10:47:37,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:37,853 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2018-11-23 10:47:37,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 10:47:37,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-23 10:47:37,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:47:37,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:47:37,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2018-11-23 10:47:37,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 10:47:37,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2018-11-23 10:47:37,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 65 transitions. [2018-11-23 10:47:38,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:38,135 INFO L225 Difference]: With dead ends: 54 [2018-11-23 10:47:38,135 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 10:47:38,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 10:47:38,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 10:47:38,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-11-23 10:47:38,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:47:38,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 30 states. [2018-11-23 10:47:38,268 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 30 states. [2018-11-23 10:47:38,268 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 30 states. [2018-11-23 10:47:38,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:38,271 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-23 10:47:38,272 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 10:47:38,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:38,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:38,273 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 33 states. [2018-11-23 10:47:38,273 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 33 states. [2018-11-23 10:47:38,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:38,276 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-23 10:47:38,276 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-23 10:47:38,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:38,277 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:38,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:47:38,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:47:38,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 10:47:38,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 10:47:38,279 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 21 [2018-11-23 10:47:38,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:47:38,280 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 10:47:38,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 10:47:38,280 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 10:47:38,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 10:47:38,281 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:47:38,281 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:47:38,282 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:47:38,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:47:38,282 INFO L82 PathProgramCache]: Analyzing trace with hash -727027933, now seen corresponding path program 1 times [2018-11-23 10:47:38,283 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:47:38,283 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:47:38,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:47:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:38,360 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:47:38,432 INFO L256 TraceCheckUtils]: 0: Hoare triple {963#true} call ULTIMATE.init(); {963#true} is VALID [2018-11-23 10:47:38,432 INFO L273 TraceCheckUtils]: 1: Hoare triple {963#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {963#true} is VALID [2018-11-23 10:47:38,432 INFO L273 TraceCheckUtils]: 2: Hoare triple {963#true} assume true; {963#true} is VALID [2018-11-23 10:47:38,433 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {963#true} {963#true} #99#return; {963#true} is VALID [2018-11-23 10:47:38,433 INFO L256 TraceCheckUtils]: 4: Hoare triple {963#true} call #t~ret2 := main(); {963#true} is VALID [2018-11-23 10:47:38,434 INFO L273 TraceCheckUtils]: 5: Hoare triple {963#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0), ~n~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {983#(= (_ bv1000 32) main_~n~0)} is VALID [2018-11-23 10:47:38,438 INFO L273 TraceCheckUtils]: 6: Hoare triple {983#(= (_ bv1000 32) main_~n~0)} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {983#(= (_ bv1000 32) main_~n~0)} is VALID [2018-11-23 10:47:38,438 INFO L273 TraceCheckUtils]: 7: Hoare triple {983#(= (_ bv1000 32) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {990#(and (= (_ bv1000 32) main_~n~0) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:38,439 INFO L273 TraceCheckUtils]: 8: Hoare triple {990#(and (= (_ bv1000 32) main_~n~0) (= main_~k~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {994#(and (= (_ bv1000 32) main_~n~0) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:47:38,440 INFO L273 TraceCheckUtils]: 9: Hoare triple {994#(and (= (_ bv1000 32) main_~n~0) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~k~0, ~n~0); {964#false} is VALID [2018-11-23 10:47:38,440 INFO L273 TraceCheckUtils]: 10: Hoare triple {964#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {964#false} is VALID [2018-11-23 10:47:38,440 INFO L273 TraceCheckUtils]: 11: Hoare triple {964#false} assume !~bvslt32(~j~0, ~n~0); {964#false} is VALID [2018-11-23 10:47:38,441 INFO L273 TraceCheckUtils]: 12: Hoare triple {964#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {964#false} is VALID [2018-11-23 10:47:38,441 INFO L273 TraceCheckUtils]: 13: Hoare triple {964#false} assume !~bvslt32(~i~0, ~n~0); {964#false} is VALID [2018-11-23 10:47:38,441 INFO L273 TraceCheckUtils]: 14: Hoare triple {964#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {964#false} is VALID [2018-11-23 10:47:38,441 INFO L273 TraceCheckUtils]: 15: Hoare triple {964#false} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {964#false} is VALID [2018-11-23 10:47:38,442 INFO L273 TraceCheckUtils]: 16: Hoare triple {964#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {964#false} is VALID [2018-11-23 10:47:38,442 INFO L273 TraceCheckUtils]: 17: Hoare triple {964#false} assume !!~bvslt32(~k~0, ~n~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32); {964#false} is VALID [2018-11-23 10:47:38,443 INFO L256 TraceCheckUtils]: 18: Hoare triple {964#false} call __VERIFIER_assert((if #t~mem1 == ~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0) then 1bv32 else 0bv32)); {964#false} is VALID [2018-11-23 10:47:38,443 INFO L273 TraceCheckUtils]: 19: Hoare triple {964#false} ~cond := #in~cond; {964#false} is VALID [2018-11-23 10:47:38,444 INFO L273 TraceCheckUtils]: 20: Hoare triple {964#false} assume 0bv32 == ~cond; {964#false} is VALID [2018-11-23 10:47:38,444 INFO L273 TraceCheckUtils]: 21: Hoare triple {964#false} assume !false; {964#false} is VALID [2018-11-23 10:47:38,445 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:47:38,446 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:47:38,530 INFO L273 TraceCheckUtils]: 21: Hoare triple {964#false} assume !false; {964#false} is VALID [2018-11-23 10:47:38,530 INFO L273 TraceCheckUtils]: 20: Hoare triple {964#false} assume 0bv32 == ~cond; {964#false} is VALID [2018-11-23 10:47:38,530 INFO L273 TraceCheckUtils]: 19: Hoare triple {964#false} ~cond := #in~cond; {964#false} is VALID [2018-11-23 10:47:38,531 INFO L256 TraceCheckUtils]: 18: Hoare triple {964#false} call __VERIFIER_assert((if #t~mem1 == ~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0) then 1bv32 else 0bv32)); {964#false} is VALID [2018-11-23 10:47:38,531 INFO L273 TraceCheckUtils]: 17: Hoare triple {964#false} assume !!~bvslt32(~k~0, ~n~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32); {964#false} is VALID [2018-11-23 10:47:38,531 INFO L273 TraceCheckUtils]: 16: Hoare triple {964#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {964#false} is VALID [2018-11-23 10:47:38,531 INFO L273 TraceCheckUtils]: 15: Hoare triple {964#false} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {964#false} is VALID [2018-11-23 10:47:38,531 INFO L273 TraceCheckUtils]: 14: Hoare triple {964#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {964#false} is VALID [2018-11-23 10:47:38,532 INFO L273 TraceCheckUtils]: 13: Hoare triple {964#false} assume !~bvslt32(~i~0, ~n~0); {964#false} is VALID [2018-11-23 10:47:38,532 INFO L273 TraceCheckUtils]: 12: Hoare triple {964#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {964#false} is VALID [2018-11-23 10:47:38,532 INFO L273 TraceCheckUtils]: 11: Hoare triple {964#false} assume !~bvslt32(~j~0, ~n~0); {964#false} is VALID [2018-11-23 10:47:38,532 INFO L273 TraceCheckUtils]: 10: Hoare triple {964#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {964#false} is VALID [2018-11-23 10:47:38,533 INFO L273 TraceCheckUtils]: 9: Hoare triple {1070#(bvslt main_~k~0 main_~n~0)} assume !~bvslt32(~k~0, ~n~0); {964#false} is VALID [2018-11-23 10:47:38,534 INFO L273 TraceCheckUtils]: 8: Hoare triple {1074#(bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0)} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {1070#(bvslt main_~k~0 main_~n~0)} is VALID [2018-11-23 10:47:38,535 INFO L273 TraceCheckUtils]: 7: Hoare triple {1078#(bvslt (_ bv1 32) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {1074#(bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:47:38,540 INFO L273 TraceCheckUtils]: 6: Hoare triple {1078#(bvslt (_ bv1 32) main_~n~0)} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {1078#(bvslt (_ bv1 32) main_~n~0)} is VALID [2018-11-23 10:47:38,541 INFO L273 TraceCheckUtils]: 5: Hoare triple {963#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0), ~n~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {1078#(bvslt (_ bv1 32) main_~n~0)} is VALID [2018-11-23 10:47:38,542 INFO L256 TraceCheckUtils]: 4: Hoare triple {963#true} call #t~ret2 := main(); {963#true} is VALID [2018-11-23 10:47:38,542 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {963#true} {963#true} #99#return; {963#true} is VALID [2018-11-23 10:47:38,542 INFO L273 TraceCheckUtils]: 2: Hoare triple {963#true} assume true; {963#true} is VALID [2018-11-23 10:47:38,543 INFO L273 TraceCheckUtils]: 1: Hoare triple {963#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {963#true} is VALID [2018-11-23 10:47:38,543 INFO L256 TraceCheckUtils]: 0: Hoare triple {963#true} call ULTIMATE.init(); {963#true} is VALID [2018-11-23 10:47:38,544 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:47:38,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:47:38,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 10:47:38,546 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-11-23 10:47:38,547 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:47:38,547 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 10:47:38,712 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:38,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 10:47:38,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 10:47:38,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 10:47:38,713 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 8 states. [2018-11-23 10:47:40,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:40,247 INFO L93 Difference]: Finished difference Result 66 states and 85 transitions. [2018-11-23 10:47:40,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 10:47:40,248 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2018-11-23 10:47:40,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:47:40,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 10:47:40,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2018-11-23 10:47:40,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 10:47:40,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 81 transitions. [2018-11-23 10:47:40,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 81 transitions. [2018-11-23 10:47:40,698 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:40,700 INFO L225 Difference]: With dead ends: 66 [2018-11-23 10:47:40,700 INFO L226 Difference]: Without dead ends: 43 [2018-11-23 10:47:40,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-23 10:47:40,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-11-23 10:47:40,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-11-23 10:47:40,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:47:40,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2018-11-23 10:47:40,779 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2018-11-23 10:47:40,779 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2018-11-23 10:47:40,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:40,784 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-23 10:47:40,784 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-23 10:47:40,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:40,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:40,785 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2018-11-23 10:47:40,785 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2018-11-23 10:47:40,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:40,788 INFO L93 Difference]: Finished difference Result 43 states and 51 transitions. [2018-11-23 10:47:40,788 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2018-11-23 10:47:40,789 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:40,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:40,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:47:40,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:47:40,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 10:47:40,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-11-23 10:47:40,793 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 22 [2018-11-23 10:47:40,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:47:40,793 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-11-23 10:47:40,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 10:47:40,793 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-23 10:47:40,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 10:47:40,795 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:47:40,795 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:47:40,795 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:47:40,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:47:40,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1623359795, now seen corresponding path program 2 times [2018-11-23 10:47:40,796 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:47:40,796 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:47:40,815 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:47:40,988 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:47:40,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:47:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:41,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:47:41,196 INFO L256 TraceCheckUtils]: 0: Hoare triple {1365#true} call ULTIMATE.init(); {1365#true} is VALID [2018-11-23 10:47:41,197 INFO L273 TraceCheckUtils]: 1: Hoare triple {1365#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1365#true} is VALID [2018-11-23 10:47:41,197 INFO L273 TraceCheckUtils]: 2: Hoare triple {1365#true} assume true; {1365#true} is VALID [2018-11-23 10:47:41,198 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1365#true} {1365#true} #99#return; {1365#true} is VALID [2018-11-23 10:47:41,198 INFO L256 TraceCheckUtils]: 4: Hoare triple {1365#true} call #t~ret2 := main(); {1365#true} is VALID [2018-11-23 10:47:41,199 INFO L273 TraceCheckUtils]: 5: Hoare triple {1365#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0), ~n~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {1385#(= (_ bv1000 32) main_~n~0)} is VALID [2018-11-23 10:47:41,200 INFO L273 TraceCheckUtils]: 6: Hoare triple {1385#(= (_ bv1000 32) main_~n~0)} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {1385#(= (_ bv1000 32) main_~n~0)} is VALID [2018-11-23 10:47:41,201 INFO L273 TraceCheckUtils]: 7: Hoare triple {1385#(= (_ bv1000 32) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {1392#(and (= (_ bv1000 32) main_~n~0) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:41,216 INFO L273 TraceCheckUtils]: 8: Hoare triple {1392#(and (= (_ bv1000 32) main_~n~0) (= main_~k~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {1396#(and (= (_ bv1000 32) main_~n~0) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:47:41,218 INFO L273 TraceCheckUtils]: 9: Hoare triple {1396#(and (= (_ bv1000 32) main_~n~0) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {1400#(and (= (_ bv1000 32) main_~n~0) (= (_ bv2 32) main_~k~0))} is VALID [2018-11-23 10:47:41,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {1400#(and (= (_ bv1000 32) main_~n~0) (= (_ bv2 32) main_~k~0))} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {1404#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv1000 32) main_~n~0))} is VALID [2018-11-23 10:47:41,220 INFO L273 TraceCheckUtils]: 11: Hoare triple {1404#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv1000 32) main_~n~0))} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {1408#(and (= (_ bv1000 32) main_~n~0) (= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-23 10:47:41,221 INFO L273 TraceCheckUtils]: 12: Hoare triple {1408#(and (= (_ bv1000 32) main_~n~0) (= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32)))} assume !~bvslt32(~k~0, ~n~0); {1366#false} is VALID [2018-11-23 10:47:41,222 INFO L273 TraceCheckUtils]: 13: Hoare triple {1366#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {1366#false} is VALID [2018-11-23 10:47:41,222 INFO L273 TraceCheckUtils]: 14: Hoare triple {1366#false} assume !~bvslt32(~j~0, ~n~0); {1366#false} is VALID [2018-11-23 10:47:41,223 INFO L273 TraceCheckUtils]: 15: Hoare triple {1366#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {1366#false} is VALID [2018-11-23 10:47:41,223 INFO L273 TraceCheckUtils]: 16: Hoare triple {1366#false} assume !~bvslt32(~i~0, ~n~0); {1366#false} is VALID [2018-11-23 10:47:41,224 INFO L273 TraceCheckUtils]: 17: Hoare triple {1366#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {1366#false} is VALID [2018-11-23 10:47:41,224 INFO L273 TraceCheckUtils]: 18: Hoare triple {1366#false} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {1366#false} is VALID [2018-11-23 10:47:41,224 INFO L273 TraceCheckUtils]: 19: Hoare triple {1366#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {1366#false} is VALID [2018-11-23 10:47:41,225 INFO L273 TraceCheckUtils]: 20: Hoare triple {1366#false} assume !!~bvslt32(~k~0, ~n~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32); {1366#false} is VALID [2018-11-23 10:47:41,225 INFO L256 TraceCheckUtils]: 21: Hoare triple {1366#false} call __VERIFIER_assert((if #t~mem1 == ~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0) then 1bv32 else 0bv32)); {1366#false} is VALID [2018-11-23 10:47:41,225 INFO L273 TraceCheckUtils]: 22: Hoare triple {1366#false} ~cond := #in~cond; {1366#false} is VALID [2018-11-23 10:47:41,226 INFO L273 TraceCheckUtils]: 23: Hoare triple {1366#false} assume 0bv32 == ~cond; {1366#false} is VALID [2018-11-23 10:47:41,226 INFO L273 TraceCheckUtils]: 24: Hoare triple {1366#false} assume !false; {1366#false} is VALID [2018-11-23 10:47:41,228 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:47:41,228 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:47:41,456 INFO L273 TraceCheckUtils]: 24: Hoare triple {1366#false} assume !false; {1366#false} is VALID [2018-11-23 10:47:41,457 INFO L273 TraceCheckUtils]: 23: Hoare triple {1366#false} assume 0bv32 == ~cond; {1366#false} is VALID [2018-11-23 10:47:41,457 INFO L273 TraceCheckUtils]: 22: Hoare triple {1366#false} ~cond := #in~cond; {1366#false} is VALID [2018-11-23 10:47:41,457 INFO L256 TraceCheckUtils]: 21: Hoare triple {1366#false} call __VERIFIER_assert((if #t~mem1 == ~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0) then 1bv32 else 0bv32)); {1366#false} is VALID [2018-11-23 10:47:41,457 INFO L273 TraceCheckUtils]: 20: Hoare triple {1366#false} assume !!~bvslt32(~k~0, ~n~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32); {1366#false} is VALID [2018-11-23 10:47:41,458 INFO L273 TraceCheckUtils]: 19: Hoare triple {1366#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {1366#false} is VALID [2018-11-23 10:47:41,458 INFO L273 TraceCheckUtils]: 18: Hoare triple {1366#false} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {1366#false} is VALID [2018-11-23 10:47:41,458 INFO L273 TraceCheckUtils]: 17: Hoare triple {1366#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {1366#false} is VALID [2018-11-23 10:47:41,458 INFO L273 TraceCheckUtils]: 16: Hoare triple {1366#false} assume !~bvslt32(~i~0, ~n~0); {1366#false} is VALID [2018-11-23 10:47:41,459 INFO L273 TraceCheckUtils]: 15: Hoare triple {1366#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {1366#false} is VALID [2018-11-23 10:47:41,459 INFO L273 TraceCheckUtils]: 14: Hoare triple {1366#false} assume !~bvslt32(~j~0, ~n~0); {1366#false} is VALID [2018-11-23 10:47:41,459 INFO L273 TraceCheckUtils]: 13: Hoare triple {1366#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {1366#false} is VALID [2018-11-23 10:47:41,460 INFO L273 TraceCheckUtils]: 12: Hoare triple {1484#(bvslt main_~k~0 main_~n~0)} assume !~bvslt32(~k~0, ~n~0); {1366#false} is VALID [2018-11-23 10:47:41,461 INFO L273 TraceCheckUtils]: 11: Hoare triple {1488#(bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0)} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {1484#(bvslt main_~k~0 main_~n~0)} is VALID [2018-11-23 10:47:41,647 INFO L273 TraceCheckUtils]: 10: Hoare triple {1492#(bvslt (bvadd main_~k~0 (_ bv2 32)) main_~n~0)} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {1488#(bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:47:41,869 INFO L273 TraceCheckUtils]: 9: Hoare triple {1496#(bvslt (bvadd main_~k~0 (_ bv3 32)) main_~n~0)} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {1492#(bvslt (bvadd main_~k~0 (_ bv2 32)) main_~n~0)} is VALID [2018-11-23 10:47:42,076 INFO L273 TraceCheckUtils]: 8: Hoare triple {1500#(bvslt (bvadd main_~k~0 (_ bv4 32)) main_~n~0)} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {1496#(bvslt (bvadd main_~k~0 (_ bv3 32)) main_~n~0)} is VALID [2018-11-23 10:47:42,078 INFO L273 TraceCheckUtils]: 7: Hoare triple {1504#(bvslt (_ bv4 32) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {1500#(bvslt (bvadd main_~k~0 (_ bv4 32)) main_~n~0)} is VALID [2018-11-23 10:47:42,078 INFO L273 TraceCheckUtils]: 6: Hoare triple {1504#(bvslt (_ bv4 32) main_~n~0)} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {1504#(bvslt (_ bv4 32) main_~n~0)} is VALID [2018-11-23 10:47:42,079 INFO L273 TraceCheckUtils]: 5: Hoare triple {1365#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0), ~n~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {1504#(bvslt (_ bv4 32) main_~n~0)} is VALID [2018-11-23 10:47:42,079 INFO L256 TraceCheckUtils]: 4: Hoare triple {1365#true} call #t~ret2 := main(); {1365#true} is VALID [2018-11-23 10:47:42,079 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1365#true} {1365#true} #99#return; {1365#true} is VALID [2018-11-23 10:47:42,080 INFO L273 TraceCheckUtils]: 2: Hoare triple {1365#true} assume true; {1365#true} is VALID [2018-11-23 10:47:42,080 INFO L273 TraceCheckUtils]: 1: Hoare triple {1365#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1365#true} is VALID [2018-11-23 10:47:42,080 INFO L256 TraceCheckUtils]: 0: Hoare triple {1365#true} call ULTIMATE.init(); {1365#true} is VALID [2018-11-23 10:47:42,081 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 10:47:42,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:47:42,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 10:47:42,086 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-11-23 10:47:42,086 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:47:42,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 10:47:42,676 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:42,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 10:47:42,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 10:47:42,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-11-23 10:47:42,677 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 14 states. [2018-11-23 10:47:48,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:48,349 INFO L93 Difference]: Finished difference Result 102 states and 136 transitions. [2018-11-23 10:47:48,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 10:47:48,349 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2018-11-23 10:47:48,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:47:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 10:47:48,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 117 transitions. [2018-11-23 10:47:48,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 10:47:48,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 117 transitions. [2018-11-23 10:47:48,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 117 transitions. [2018-11-23 10:47:49,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:49,178 INFO L225 Difference]: With dead ends: 102 [2018-11-23 10:47:49,178 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 10:47:49,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=131, Invalid=211, Unknown=0, NotChecked=0, Total=342 [2018-11-23 10:47:49,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 10:47:49,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-23 10:47:49,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:47:49,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 66 states. [2018-11-23 10:47:49,328 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 66 states. [2018-11-23 10:47:49,329 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 66 states. [2018-11-23 10:47:49,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:49,333 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2018-11-23 10:47:49,334 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2018-11-23 10:47:49,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:49,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:49,335 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 67 states. [2018-11-23 10:47:49,335 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 67 states. [2018-11-23 10:47:49,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:49,339 INFO L93 Difference]: Finished difference Result 67 states and 81 transitions. [2018-11-23 10:47:49,339 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 81 transitions. [2018-11-23 10:47:49,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:49,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:49,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:47:49,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:47:49,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 10:47:49,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 80 transitions. [2018-11-23 10:47:49,344 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 80 transitions. Word has length 25 [2018-11-23 10:47:49,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:47:49,345 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 80 transitions. [2018-11-23 10:47:49,345 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 10:47:49,345 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2018-11-23 10:47:49,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 10:47:49,346 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:47:49,346 INFO L402 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:47:49,346 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:47:49,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:47:49,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1570275085, now seen corresponding path program 3 times [2018-11-23 10:47:49,347 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:47:49,347 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:47:49,367 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:47:49,517 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 10:47:49,517 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:47:49,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:49,551 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:47:49,619 INFO L256 TraceCheckUtils]: 0: Hoare triple {1950#true} call ULTIMATE.init(); {1950#true} is VALID [2018-11-23 10:47:49,619 INFO L273 TraceCheckUtils]: 1: Hoare triple {1950#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1950#true} is VALID [2018-11-23 10:47:49,620 INFO L273 TraceCheckUtils]: 2: Hoare triple {1950#true} assume true; {1950#true} is VALID [2018-11-23 10:47:49,620 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1950#true} {1950#true} #99#return; {1950#true} is VALID [2018-11-23 10:47:49,620 INFO L256 TraceCheckUtils]: 4: Hoare triple {1950#true} call #t~ret2 := main(); {1950#true} is VALID [2018-11-23 10:47:49,621 INFO L273 TraceCheckUtils]: 5: Hoare triple {1950#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0), ~n~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:49,622 INFO L273 TraceCheckUtils]: 6: Hoare triple {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:49,623 INFO L273 TraceCheckUtils]: 7: Hoare triple {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:49,623 INFO L273 TraceCheckUtils]: 8: Hoare triple {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:49,624 INFO L273 TraceCheckUtils]: 9: Hoare triple {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:49,625 INFO L273 TraceCheckUtils]: 10: Hoare triple {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:49,626 INFO L273 TraceCheckUtils]: 11: Hoare triple {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:49,627 INFO L273 TraceCheckUtils]: 12: Hoare triple {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:49,628 INFO L273 TraceCheckUtils]: 13: Hoare triple {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:49,629 INFO L273 TraceCheckUtils]: 14: Hoare triple {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:49,631 INFO L273 TraceCheckUtils]: 15: Hoare triple {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:49,632 INFO L273 TraceCheckUtils]: 16: Hoare triple {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:49,633 INFO L273 TraceCheckUtils]: 17: Hoare triple {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:49,634 INFO L273 TraceCheckUtils]: 18: Hoare triple {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} assume !~bvslt32(~k~0, ~n~0); {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:49,634 INFO L273 TraceCheckUtils]: 19: Hoare triple {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} ~j~0 := ~bvadd32(1bv32, ~j~0); {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:49,635 INFO L273 TraceCheckUtils]: 20: Hoare triple {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} assume !~bvslt32(~j~0, ~n~0); {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:49,636 INFO L273 TraceCheckUtils]: 21: Hoare triple {1970#(and (= (_ bv1000 32) main_~n~0) (= main_~i~0 (_ bv0 32)))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2019#(and (= (_ bv1000 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:47:49,637 INFO L273 TraceCheckUtils]: 22: Hoare triple {2019#(and (= (_ bv1000 32) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~n~0); {1951#false} is VALID [2018-11-23 10:47:49,637 INFO L273 TraceCheckUtils]: 23: Hoare triple {1951#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {1951#false} is VALID [2018-11-23 10:47:49,637 INFO L273 TraceCheckUtils]: 24: Hoare triple {1951#false} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {1951#false} is VALID [2018-11-23 10:47:49,638 INFO L273 TraceCheckUtils]: 25: Hoare triple {1951#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {1951#false} is VALID [2018-11-23 10:47:49,638 INFO L273 TraceCheckUtils]: 26: Hoare triple {1951#false} assume !!~bvslt32(~k~0, ~n~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32); {1951#false} is VALID [2018-11-23 10:47:49,638 INFO L256 TraceCheckUtils]: 27: Hoare triple {1951#false} call __VERIFIER_assert((if #t~mem1 == ~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0) then 1bv32 else 0bv32)); {1951#false} is VALID [2018-11-23 10:47:49,639 INFO L273 TraceCheckUtils]: 28: Hoare triple {1951#false} ~cond := #in~cond; {1951#false} is VALID [2018-11-23 10:47:49,639 INFO L273 TraceCheckUtils]: 29: Hoare triple {1951#false} assume 0bv32 == ~cond; {1951#false} is VALID [2018-11-23 10:47:49,639 INFO L273 TraceCheckUtils]: 30: Hoare triple {1951#false} assume !false; {1951#false} is VALID [2018-11-23 10:47:49,642 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-23 10:47:49,642 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:47:49,777 INFO L273 TraceCheckUtils]: 30: Hoare triple {1951#false} assume !false; {1951#false} is VALID [2018-11-23 10:47:49,777 INFO L273 TraceCheckUtils]: 29: Hoare triple {1951#false} assume 0bv32 == ~cond; {1951#false} is VALID [2018-11-23 10:47:49,777 INFO L273 TraceCheckUtils]: 28: Hoare triple {1951#false} ~cond := #in~cond; {1951#false} is VALID [2018-11-23 10:47:49,778 INFO L256 TraceCheckUtils]: 27: Hoare triple {1951#false} call __VERIFIER_assert((if #t~mem1 == ~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0) then 1bv32 else 0bv32)); {1951#false} is VALID [2018-11-23 10:47:49,778 INFO L273 TraceCheckUtils]: 26: Hoare triple {1951#false} assume !!~bvslt32(~k~0, ~n~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32); {1951#false} is VALID [2018-11-23 10:47:49,778 INFO L273 TraceCheckUtils]: 25: Hoare triple {1951#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {1951#false} is VALID [2018-11-23 10:47:49,778 INFO L273 TraceCheckUtils]: 24: Hoare triple {1951#false} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {1951#false} is VALID [2018-11-23 10:47:49,778 INFO L273 TraceCheckUtils]: 23: Hoare triple {1951#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {1951#false} is VALID [2018-11-23 10:47:49,779 INFO L273 TraceCheckUtils]: 22: Hoare triple {2071#(bvslt main_~i~0 main_~n~0)} assume !~bvslt32(~i~0, ~n~0); {1951#false} is VALID [2018-11-23 10:47:49,784 INFO L273 TraceCheckUtils]: 21: Hoare triple {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {2071#(bvslt main_~i~0 main_~n~0)} is VALID [2018-11-23 10:47:49,785 INFO L273 TraceCheckUtils]: 20: Hoare triple {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} assume !~bvslt32(~j~0, ~n~0); {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:47:49,785 INFO L273 TraceCheckUtils]: 19: Hoare triple {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} ~j~0 := ~bvadd32(1bv32, ~j~0); {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:47:49,786 INFO L273 TraceCheckUtils]: 18: Hoare triple {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} assume !~bvslt32(~k~0, ~n~0); {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:47:49,786 INFO L273 TraceCheckUtils]: 17: Hoare triple {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:47:49,787 INFO L273 TraceCheckUtils]: 16: Hoare triple {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:47:49,791 INFO L273 TraceCheckUtils]: 15: Hoare triple {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:47:49,791 INFO L273 TraceCheckUtils]: 14: Hoare triple {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:47:49,792 INFO L273 TraceCheckUtils]: 13: Hoare triple {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:47:49,792 INFO L273 TraceCheckUtils]: 12: Hoare triple {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:47:49,796 INFO L273 TraceCheckUtils]: 11: Hoare triple {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:47:49,796 INFO L273 TraceCheckUtils]: 10: Hoare triple {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:47:49,798 INFO L273 TraceCheckUtils]: 9: Hoare triple {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:47:49,801 INFO L273 TraceCheckUtils]: 8: Hoare triple {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:47:49,801 INFO L273 TraceCheckUtils]: 7: Hoare triple {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:47:49,802 INFO L273 TraceCheckUtils]: 6: Hoare triple {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:47:49,803 INFO L273 TraceCheckUtils]: 5: Hoare triple {1950#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0), ~n~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {2075#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:47:49,803 INFO L256 TraceCheckUtils]: 4: Hoare triple {1950#true} call #t~ret2 := main(); {1950#true} is VALID [2018-11-23 10:47:49,803 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1950#true} {1950#true} #99#return; {1950#true} is VALID [2018-11-23 10:47:49,803 INFO L273 TraceCheckUtils]: 2: Hoare triple {1950#true} assume true; {1950#true} is VALID [2018-11-23 10:47:49,804 INFO L273 TraceCheckUtils]: 1: Hoare triple {1950#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1950#true} is VALID [2018-11-23 10:47:49,804 INFO L256 TraceCheckUtils]: 0: Hoare triple {1950#true} call ULTIMATE.init(); {1950#true} is VALID [2018-11-23 10:47:49,806 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2018-11-23 10:47:49,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:47:49,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:47:49,809 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-23 10:47:49,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:47:49,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:47:49,965 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-23 10:47:49,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:47:49,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:47:49,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:47:49,966 INFO L87 Difference]: Start difference. First operand 66 states and 80 transitions. Second operand 6 states. [2018-11-23 10:47:51,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:51,159 INFO L93 Difference]: Finished difference Result 157 states and 191 transitions. [2018-11-23 10:47:51,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:47:51,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2018-11-23 10:47:51,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:47:51,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:47:51,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2018-11-23 10:47:51,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:47:51,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 71 transitions. [2018-11-23 10:47:51,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 71 transitions. [2018-11-23 10:47:51,390 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:47:51,393 INFO L225 Difference]: With dead ends: 157 [2018-11-23 10:47:51,393 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 10:47:51,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:47:51,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 10:47:51,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-11-23 10:47:51,768 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:47:51,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 114 states. [2018-11-23 10:47:51,769 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 114 states. [2018-11-23 10:47:51,769 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 114 states. [2018-11-23 10:47:51,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:51,775 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2018-11-23 10:47:51,775 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2018-11-23 10:47:51,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:51,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:51,776 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 114 states. [2018-11-23 10:47:51,777 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 114 states. [2018-11-23 10:47:51,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:47:51,782 INFO L93 Difference]: Finished difference Result 114 states and 134 transitions. [2018-11-23 10:47:51,782 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2018-11-23 10:47:51,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:47:51,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:47:51,783 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:47:51,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:47:51,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 10:47:51,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 134 transitions. [2018-11-23 10:47:51,788 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 134 transitions. Word has length 31 [2018-11-23 10:47:51,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:47:51,789 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 134 transitions. [2018-11-23 10:47:51,789 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:47:51,789 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 134 transitions. [2018-11-23 10:47:51,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 10:47:51,791 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:47:51,791 INFO L402 BasicCegarLoop]: trace histogram [40, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:47:51,791 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:47:51,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:47:51,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1195746105, now seen corresponding path program 4 times [2018-11-23 10:47:51,792 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:47:51,793 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:47:51,816 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:47:52,005 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:47:52,006 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:47:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:47:52,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:47:52,842 INFO L256 TraceCheckUtils]: 0: Hoare triple {2839#true} call ULTIMATE.init(); {2839#true} is VALID [2018-11-23 10:47:52,842 INFO L273 TraceCheckUtils]: 1: Hoare triple {2839#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2839#true} is VALID [2018-11-23 10:47:52,842 INFO L273 TraceCheckUtils]: 2: Hoare triple {2839#true} assume true; {2839#true} is VALID [2018-11-23 10:47:52,843 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2839#true} {2839#true} #99#return; {2839#true} is VALID [2018-11-23 10:47:52,843 INFO L256 TraceCheckUtils]: 4: Hoare triple {2839#true} call #t~ret2 := main(); {2839#true} is VALID [2018-11-23 10:47:52,844 INFO L273 TraceCheckUtils]: 5: Hoare triple {2839#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0), ~n~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {2859#(= (_ bv1000 32) main_~n~0)} is VALID [2018-11-23 10:47:52,846 INFO L273 TraceCheckUtils]: 6: Hoare triple {2859#(= (_ bv1000 32) main_~n~0)} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {2859#(= (_ bv1000 32) main_~n~0)} is VALID [2018-11-23 10:47:52,847 INFO L273 TraceCheckUtils]: 7: Hoare triple {2859#(= (_ bv1000 32) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {2866#(and (= (_ bv1000 32) main_~n~0) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 10:47:52,848 INFO L273 TraceCheckUtils]: 8: Hoare triple {2866#(and (= (_ bv1000 32) main_~n~0) (= main_~k~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2870#(and (= (_ bv1000 32) main_~n~0) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 10:47:52,848 INFO L273 TraceCheckUtils]: 9: Hoare triple {2870#(and (= (_ bv1000 32) main_~n~0) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2874#(and (= (_ bv1000 32) main_~n~0) (= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)))} is VALID [2018-11-23 10:47:52,850 INFO L273 TraceCheckUtils]: 10: Hoare triple {2874#(and (= (_ bv1000 32) main_~n~0) (= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32)))} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2878#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv1000 32) main_~n~0))} is VALID [2018-11-23 10:47:52,851 INFO L273 TraceCheckUtils]: 11: Hoare triple {2878#(and (= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv1000 32) main_~n~0))} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2882#(and (= (_ bv1000 32) main_~n~0) (= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32)))} is VALID [2018-11-23 10:47:52,853 INFO L273 TraceCheckUtils]: 12: Hoare triple {2882#(and (= (_ bv1000 32) main_~n~0) (= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32)))} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2886#(and (= (_ bv1000 32) main_~n~0) (= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-23 10:47:52,859 INFO L273 TraceCheckUtils]: 13: Hoare triple {2886#(and (= (_ bv1000 32) main_~n~0) (= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32)))} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2890#(and (= (_ bv1000 32) main_~n~0) (= (_ bv6 32) main_~k~0))} is VALID [2018-11-23 10:47:52,864 INFO L273 TraceCheckUtils]: 14: Hoare triple {2890#(and (= (_ bv1000 32) main_~n~0) (= (_ bv6 32) main_~k~0))} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2894#(and (= (_ bv1000 32) main_~n~0) (= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32)))} is VALID [2018-11-23 10:47:52,865 INFO L273 TraceCheckUtils]: 15: Hoare triple {2894#(and (= (_ bv1000 32) main_~n~0) (= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32)))} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2898#(and (= (_ bv1000 32) main_~n~0) (= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32)))} is VALID [2018-11-23 10:47:52,869 INFO L273 TraceCheckUtils]: 16: Hoare triple {2898#(and (= (_ bv1000 32) main_~n~0) (= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32)))} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2902#(and (= (_ bv9 32) main_~k~0) (= (_ bv1000 32) main_~n~0))} is VALID [2018-11-23 10:47:52,869 INFO L273 TraceCheckUtils]: 17: Hoare triple {2902#(and (= (_ bv9 32) main_~k~0) (= (_ bv1000 32) main_~n~0))} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2906#(and (= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv1000 32) main_~n~0))} is VALID [2018-11-23 10:47:52,886 INFO L273 TraceCheckUtils]: 18: Hoare triple {2906#(and (= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32)) (= (_ bv1000 32) main_~n~0))} assume !~bvslt32(~k~0, ~n~0); {2840#false} is VALID [2018-11-23 10:47:52,886 INFO L273 TraceCheckUtils]: 19: Hoare triple {2840#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {2840#false} is VALID [2018-11-23 10:47:52,886 INFO L273 TraceCheckUtils]: 20: Hoare triple {2840#false} assume !~bvslt32(~j~0, ~n~0); {2840#false} is VALID [2018-11-23 10:47:52,887 INFO L273 TraceCheckUtils]: 21: Hoare triple {2840#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {2840#false} is VALID [2018-11-23 10:47:52,887 INFO L273 TraceCheckUtils]: 22: Hoare triple {2840#false} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {2840#false} is VALID [2018-11-23 10:47:52,887 INFO L273 TraceCheckUtils]: 23: Hoare triple {2840#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {2840#false} is VALID [2018-11-23 10:47:52,887 INFO L273 TraceCheckUtils]: 24: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,887 INFO L273 TraceCheckUtils]: 25: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,887 INFO L273 TraceCheckUtils]: 26: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,888 INFO L273 TraceCheckUtils]: 27: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,888 INFO L273 TraceCheckUtils]: 28: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,888 INFO L273 TraceCheckUtils]: 29: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,888 INFO L273 TraceCheckUtils]: 30: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,889 INFO L273 TraceCheckUtils]: 31: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,889 INFO L273 TraceCheckUtils]: 32: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,889 INFO L273 TraceCheckUtils]: 33: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,889 INFO L273 TraceCheckUtils]: 34: Hoare triple {2840#false} assume !~bvslt32(~k~0, ~n~0); {2840#false} is VALID [2018-11-23 10:47:52,889 INFO L273 TraceCheckUtils]: 35: Hoare triple {2840#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {2840#false} is VALID [2018-11-23 10:47:52,890 INFO L273 TraceCheckUtils]: 36: Hoare triple {2840#false} assume !~bvslt32(~j~0, ~n~0); {2840#false} is VALID [2018-11-23 10:47:52,890 INFO L273 TraceCheckUtils]: 37: Hoare triple {2840#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {2840#false} is VALID [2018-11-23 10:47:52,890 INFO L273 TraceCheckUtils]: 38: Hoare triple {2840#false} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {2840#false} is VALID [2018-11-23 10:47:52,890 INFO L273 TraceCheckUtils]: 39: Hoare triple {2840#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {2840#false} is VALID [2018-11-23 10:47:52,890 INFO L273 TraceCheckUtils]: 40: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,890 INFO L273 TraceCheckUtils]: 41: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,891 INFO L273 TraceCheckUtils]: 42: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,891 INFO L273 TraceCheckUtils]: 43: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,891 INFO L273 TraceCheckUtils]: 44: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,891 INFO L273 TraceCheckUtils]: 45: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,891 INFO L273 TraceCheckUtils]: 46: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,891 INFO L273 TraceCheckUtils]: 47: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,891 INFO L273 TraceCheckUtils]: 48: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,892 INFO L273 TraceCheckUtils]: 49: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,892 INFO L273 TraceCheckUtils]: 50: Hoare triple {2840#false} assume !~bvslt32(~k~0, ~n~0); {2840#false} is VALID [2018-11-23 10:47:52,892 INFO L273 TraceCheckUtils]: 51: Hoare triple {2840#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {2840#false} is VALID [2018-11-23 10:47:52,892 INFO L273 TraceCheckUtils]: 52: Hoare triple {2840#false} assume !~bvslt32(~j~0, ~n~0); {2840#false} is VALID [2018-11-23 10:47:52,892 INFO L273 TraceCheckUtils]: 53: Hoare triple {2840#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {2840#false} is VALID [2018-11-23 10:47:52,892 INFO L273 TraceCheckUtils]: 54: Hoare triple {2840#false} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {2840#false} is VALID [2018-11-23 10:47:52,893 INFO L273 TraceCheckUtils]: 55: Hoare triple {2840#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {2840#false} is VALID [2018-11-23 10:47:52,893 INFO L273 TraceCheckUtils]: 56: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,893 INFO L273 TraceCheckUtils]: 57: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,893 INFO L273 TraceCheckUtils]: 58: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,893 INFO L273 TraceCheckUtils]: 59: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,893 INFO L273 TraceCheckUtils]: 60: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,894 INFO L273 TraceCheckUtils]: 61: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,894 INFO L273 TraceCheckUtils]: 62: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,894 INFO L273 TraceCheckUtils]: 63: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,894 INFO L273 TraceCheckUtils]: 64: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,894 INFO L273 TraceCheckUtils]: 65: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:52,894 INFO L273 TraceCheckUtils]: 66: Hoare triple {2840#false} assume !~bvslt32(~k~0, ~n~0); {2840#false} is VALID [2018-11-23 10:47:52,895 INFO L273 TraceCheckUtils]: 67: Hoare triple {2840#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {2840#false} is VALID [2018-11-23 10:47:52,895 INFO L273 TraceCheckUtils]: 68: Hoare triple {2840#false} assume !~bvslt32(~j~0, ~n~0); {2840#false} is VALID [2018-11-23 10:47:52,895 INFO L273 TraceCheckUtils]: 69: Hoare triple {2840#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {2840#false} is VALID [2018-11-23 10:47:52,895 INFO L273 TraceCheckUtils]: 70: Hoare triple {2840#false} assume !~bvslt32(~i~0, ~n~0); {2840#false} is VALID [2018-11-23 10:47:52,895 INFO L273 TraceCheckUtils]: 71: Hoare triple {2840#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {2840#false} is VALID [2018-11-23 10:47:52,895 INFO L273 TraceCheckUtils]: 72: Hoare triple {2840#false} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {2840#false} is VALID [2018-11-23 10:47:52,895 INFO L273 TraceCheckUtils]: 73: Hoare triple {2840#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {2840#false} is VALID [2018-11-23 10:47:52,896 INFO L273 TraceCheckUtils]: 74: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32); {2840#false} is VALID [2018-11-23 10:47:52,896 INFO L256 TraceCheckUtils]: 75: Hoare triple {2840#false} call __VERIFIER_assert((if #t~mem1 == ~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0) then 1bv32 else 0bv32)); {2840#false} is VALID [2018-11-23 10:47:52,896 INFO L273 TraceCheckUtils]: 76: Hoare triple {2840#false} ~cond := #in~cond; {2840#false} is VALID [2018-11-23 10:47:52,897 INFO L273 TraceCheckUtils]: 77: Hoare triple {2840#false} assume 0bv32 == ~cond; {2840#false} is VALID [2018-11-23 10:47:52,897 INFO L273 TraceCheckUtils]: 78: Hoare triple {2840#false} assume !false; {2840#false} is VALID [2018-11-23 10:47:52,904 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 374 proven. 55 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2018-11-23 10:47:52,904 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:47:53,581 INFO L273 TraceCheckUtils]: 78: Hoare triple {2840#false} assume !false; {2840#false} is VALID [2018-11-23 10:47:53,582 INFO L273 TraceCheckUtils]: 77: Hoare triple {2840#false} assume 0bv32 == ~cond; {2840#false} is VALID [2018-11-23 10:47:53,582 INFO L273 TraceCheckUtils]: 76: Hoare triple {2840#false} ~cond := #in~cond; {2840#false} is VALID [2018-11-23 10:47:53,582 INFO L256 TraceCheckUtils]: 75: Hoare triple {2840#false} call __VERIFIER_assert((if #t~mem1 == ~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0) then 1bv32 else 0bv32)); {2840#false} is VALID [2018-11-23 10:47:53,582 INFO L273 TraceCheckUtils]: 74: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call #t~mem1 := read~intINTTYPE4(~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32); {2840#false} is VALID [2018-11-23 10:47:53,583 INFO L273 TraceCheckUtils]: 73: Hoare triple {2840#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {2840#false} is VALID [2018-11-23 10:47:53,583 INFO L273 TraceCheckUtils]: 72: Hoare triple {2840#false} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {2840#false} is VALID [2018-11-23 10:47:53,583 INFO L273 TraceCheckUtils]: 71: Hoare triple {2840#false} ~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {2840#false} is VALID [2018-11-23 10:47:53,584 INFO L273 TraceCheckUtils]: 70: Hoare triple {2840#false} assume !~bvslt32(~i~0, ~n~0); {2840#false} is VALID [2018-11-23 10:47:53,584 INFO L273 TraceCheckUtils]: 69: Hoare triple {2840#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {2840#false} is VALID [2018-11-23 10:47:53,585 INFO L273 TraceCheckUtils]: 68: Hoare triple {2840#false} assume !~bvslt32(~j~0, ~n~0); {2840#false} is VALID [2018-11-23 10:47:53,585 INFO L273 TraceCheckUtils]: 67: Hoare triple {2840#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {2840#false} is VALID [2018-11-23 10:47:53,585 INFO L273 TraceCheckUtils]: 66: Hoare triple {2840#false} assume !~bvslt32(~k~0, ~n~0); {2840#false} is VALID [2018-11-23 10:47:53,585 INFO L273 TraceCheckUtils]: 65: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,585 INFO L273 TraceCheckUtils]: 64: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,585 INFO L273 TraceCheckUtils]: 63: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,586 INFO L273 TraceCheckUtils]: 62: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,586 INFO L273 TraceCheckUtils]: 61: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,586 INFO L273 TraceCheckUtils]: 60: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,586 INFO L273 TraceCheckUtils]: 59: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,586 INFO L273 TraceCheckUtils]: 58: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,586 INFO L273 TraceCheckUtils]: 57: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,586 INFO L273 TraceCheckUtils]: 56: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,587 INFO L273 TraceCheckUtils]: 55: Hoare triple {2840#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {2840#false} is VALID [2018-11-23 10:47:53,587 INFO L273 TraceCheckUtils]: 54: Hoare triple {2840#false} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {2840#false} is VALID [2018-11-23 10:47:53,587 INFO L273 TraceCheckUtils]: 53: Hoare triple {2840#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {2840#false} is VALID [2018-11-23 10:47:53,587 INFO L273 TraceCheckUtils]: 52: Hoare triple {2840#false} assume !~bvslt32(~j~0, ~n~0); {2840#false} is VALID [2018-11-23 10:47:53,587 INFO L273 TraceCheckUtils]: 51: Hoare triple {2840#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {2840#false} is VALID [2018-11-23 10:47:53,587 INFO L273 TraceCheckUtils]: 50: Hoare triple {2840#false} assume !~bvslt32(~k~0, ~n~0); {2840#false} is VALID [2018-11-23 10:47:53,588 INFO L273 TraceCheckUtils]: 49: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,588 INFO L273 TraceCheckUtils]: 48: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,588 INFO L273 TraceCheckUtils]: 47: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,588 INFO L273 TraceCheckUtils]: 46: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,588 INFO L273 TraceCheckUtils]: 45: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,588 INFO L273 TraceCheckUtils]: 44: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,588 INFO L273 TraceCheckUtils]: 43: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,589 INFO L273 TraceCheckUtils]: 42: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,589 INFO L273 TraceCheckUtils]: 41: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,589 INFO L273 TraceCheckUtils]: 40: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,589 INFO L273 TraceCheckUtils]: 39: Hoare triple {2840#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {2840#false} is VALID [2018-11-23 10:47:53,589 INFO L273 TraceCheckUtils]: 38: Hoare triple {2840#false} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {2840#false} is VALID [2018-11-23 10:47:53,589 INFO L273 TraceCheckUtils]: 37: Hoare triple {2840#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {2840#false} is VALID [2018-11-23 10:47:53,590 INFO L273 TraceCheckUtils]: 36: Hoare triple {2840#false} assume !~bvslt32(~j~0, ~n~0); {2840#false} is VALID [2018-11-23 10:47:53,590 INFO L273 TraceCheckUtils]: 35: Hoare triple {2840#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {2840#false} is VALID [2018-11-23 10:47:53,590 INFO L273 TraceCheckUtils]: 34: Hoare triple {2840#false} assume !~bvslt32(~k~0, ~n~0); {2840#false} is VALID [2018-11-23 10:47:53,590 INFO L273 TraceCheckUtils]: 33: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,591 INFO L273 TraceCheckUtils]: 32: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,591 INFO L273 TraceCheckUtils]: 31: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,591 INFO L273 TraceCheckUtils]: 30: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,591 INFO L273 TraceCheckUtils]: 29: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,591 INFO L273 TraceCheckUtils]: 28: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,592 INFO L273 TraceCheckUtils]: 27: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,592 INFO L273 TraceCheckUtils]: 26: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,592 INFO L273 TraceCheckUtils]: 25: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,592 INFO L273 TraceCheckUtils]: 24: Hoare triple {2840#false} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {2840#false} is VALID [2018-11-23 10:47:53,592 INFO L273 TraceCheckUtils]: 23: Hoare triple {2840#false} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {2840#false} is VALID [2018-11-23 10:47:53,593 INFO L273 TraceCheckUtils]: 22: Hoare triple {2840#false} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {2840#false} is VALID [2018-11-23 10:47:53,593 INFO L273 TraceCheckUtils]: 21: Hoare triple {2840#false} ~i~0 := ~bvadd32(1bv32, ~i~0); {2840#false} is VALID [2018-11-23 10:47:53,593 INFO L273 TraceCheckUtils]: 20: Hoare triple {2840#false} assume !~bvslt32(~j~0, ~n~0); {2840#false} is VALID [2018-11-23 10:47:53,593 INFO L273 TraceCheckUtils]: 19: Hoare triple {2840#false} ~j~0 := ~bvadd32(1bv32, ~j~0); {2840#false} is VALID [2018-11-23 10:47:53,598 INFO L273 TraceCheckUtils]: 18: Hoare triple {3270#(bvslt main_~k~0 main_~n~0)} assume !~bvslt32(~k~0, ~n~0); {2840#false} is VALID [2018-11-23 10:47:53,599 INFO L273 TraceCheckUtils]: 17: Hoare triple {3274#(bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0)} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {3270#(bvslt main_~k~0 main_~n~0)} is VALID [2018-11-23 10:47:53,754 INFO L273 TraceCheckUtils]: 16: Hoare triple {3278#(bvslt (bvadd main_~k~0 (_ bv2 32)) main_~n~0)} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {3274#(bvslt (bvadd main_~k~0 (_ bv1 32)) main_~n~0)} is VALID [2018-11-23 10:47:53,951 INFO L273 TraceCheckUtils]: 15: Hoare triple {3282#(bvslt (bvadd main_~k~0 (_ bv3 32)) main_~n~0)} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {3278#(bvslt (bvadd main_~k~0 (_ bv2 32)) main_~n~0)} is VALID [2018-11-23 10:47:54,110 INFO L273 TraceCheckUtils]: 14: Hoare triple {3286#(bvslt (bvadd main_~k~0 (_ bv4 32)) main_~n~0)} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {3282#(bvslt (bvadd main_~k~0 (_ bv3 32)) main_~n~0)} is VALID [2018-11-23 10:47:54,303 INFO L273 TraceCheckUtils]: 13: Hoare triple {3290#(bvslt (bvadd main_~k~0 (_ bv5 32)) main_~n~0)} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {3286#(bvslt (bvadd main_~k~0 (_ bv4 32)) main_~n~0)} is VALID [2018-11-23 10:47:54,475 INFO L273 TraceCheckUtils]: 12: Hoare triple {3294#(bvslt (bvadd main_~k~0 (_ bv6 32)) main_~n~0)} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {3290#(bvslt (bvadd main_~k~0 (_ bv5 32)) main_~n~0)} is VALID [2018-11-23 10:47:54,764 INFO L273 TraceCheckUtils]: 11: Hoare triple {3298#(bvslt (bvadd main_~k~0 (_ bv7 32)) main_~n~0)} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {3294#(bvslt (bvadd main_~k~0 (_ bv6 32)) main_~n~0)} is VALID [2018-11-23 10:47:54,919 INFO L273 TraceCheckUtils]: 10: Hoare triple {3302#(bvslt (bvadd main_~k~0 (_ bv8 32)) main_~n~0)} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {3298#(bvslt (bvadd main_~k~0 (_ bv7 32)) main_~n~0)} is VALID [2018-11-23 10:47:55,078 INFO L273 TraceCheckUtils]: 9: Hoare triple {3306#(bvslt (bvadd main_~k~0 (_ bv9 32)) main_~n~0)} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {3302#(bvslt (bvadd main_~k~0 (_ bv8 32)) main_~n~0)} is VALID [2018-11-23 10:47:55,258 INFO L273 TraceCheckUtils]: 8: Hoare triple {3310#(bvslt (bvadd main_~k~0 (_ bv10 32)) main_~n~0)} assume !!~bvslt32(~k~0, ~n~0);call write~intINTTYPE4(~bvadd32(~bvadd32(~bvadd32(~i~0, ~j~0), ~k~0), ~C~0), ~#A~0.base, ~bvadd32(~bvadd32(~bvadd32(~#A~0.offset, ~bvmul32(~i~0, ~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0))), ~bvmul32(~j~0, ~bvmul32(4bv32, ~n~0))), ~bvmul32(4bv32, ~k~0)), 4bv32);~k~0 := ~bvadd32(1bv32, ~k~0); {3306#(bvslt (bvadd main_~k~0 (_ bv9 32)) main_~n~0)} is VALID [2018-11-23 10:47:55,259 INFO L273 TraceCheckUtils]: 7: Hoare triple {3314#(bvslt (_ bv10 32) main_~n~0)} assume !!~bvslt32(~j~0, ~n~0);~k~0 := 0bv32; {3310#(bvslt (bvadd main_~k~0 (_ bv10 32)) main_~n~0)} is VALID [2018-11-23 10:47:55,259 INFO L273 TraceCheckUtils]: 6: Hoare triple {3314#(bvslt (_ bv10 32) main_~n~0)} assume !!~bvslt32(~i~0, ~n~0);~j~0 := 0bv32;~k~0 := 0bv32; {3314#(bvslt (_ bv10 32) main_~n~0)} is VALID [2018-11-23 10:47:55,261 INFO L273 TraceCheckUtils]: 5: Hoare triple {2839#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000bv32;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~bvmul32(~bvmul32(~bvmul32(4bv32, ~n~0), ~n~0), ~n~0));~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0bv32;~j~0 := 0bv32;~k~0 := 0bv32; {3314#(bvslt (_ bv10 32) main_~n~0)} is VALID [2018-11-23 10:47:55,261 INFO L256 TraceCheckUtils]: 4: Hoare triple {2839#true} call #t~ret2 := main(); {2839#true} is VALID [2018-11-23 10:47:55,261 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2839#true} {2839#true} #99#return; {2839#true} is VALID [2018-11-23 10:47:55,261 INFO L273 TraceCheckUtils]: 2: Hoare triple {2839#true} assume true; {2839#true} is VALID [2018-11-23 10:47:55,261 INFO L273 TraceCheckUtils]: 1: Hoare triple {2839#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2839#true} is VALID [2018-11-23 10:47:55,262 INFO L256 TraceCheckUtils]: 0: Hoare triple {2839#true} call ULTIMATE.init(); {2839#true} is VALID [2018-11-23 10:47:55,268 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 374 proven. 55 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2018-11-23 10:47:55,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:47:55,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-11-23 10:47:55,277 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 79 [2018-11-23 10:47:55,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:47:55,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 10:47:57,080 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-23 10:47:57,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 10:47:57,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 10:47:57,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=457, Unknown=0, NotChecked=0, Total=650 [2018-11-23 10:47:57,081 INFO L87 Difference]: Start difference. First operand 114 states and 134 transitions. Second operand 26 states. [2018-11-23 10:48:03,440 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 9 [2018-11-23 10:48:17,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:48:17,606 INFO L93 Difference]: Finished difference Result 305 states and 417 transitions. [2018-11-23 10:48:17,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 10:48:17,606 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 79 [2018-11-23 10:48:17,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:48:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 10:48:17,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 189 transitions. [2018-11-23 10:48:17,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 10:48:17,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 189 transitions. [2018-11-23 10:48:17,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 189 transitions. [2018-11-23 10:48:19,184 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:48:19,189 INFO L225 Difference]: With dead ends: 305 [2018-11-23 10:48:19,189 INFO L226 Difference]: Without dead ends: 199 [2018-11-23 10:48:19,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=479, Invalid=853, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 10:48:19,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-11-23 10:48:19,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 198. [2018-11-23 10:48:19,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:48:19,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 199 states. Second operand 198 states. [2018-11-23 10:48:19,674 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 198 states. [2018-11-23 10:48:19,674 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 198 states. [2018-11-23 10:48:19,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:48:19,684 INFO L93 Difference]: Finished difference Result 199 states and 231 transitions. [2018-11-23 10:48:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 231 transitions. [2018-11-23 10:48:19,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:48:19,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:48:19,685 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand 199 states. [2018-11-23 10:48:19,685 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 199 states. [2018-11-23 10:48:19,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:48:19,694 INFO L93 Difference]: Finished difference Result 199 states and 231 transitions. [2018-11-23 10:48:19,695 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 231 transitions. [2018-11-23 10:48:19,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:48:19,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:48:19,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:48:19,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:48:19,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-11-23 10:48:19,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 230 transitions. [2018-11-23 10:48:19,703 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 230 transitions. Word has length 79 [2018-11-23 10:48:19,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:48:19,703 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 230 transitions. [2018-11-23 10:48:19,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 10:48:19,703 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 230 transitions. [2018-11-23 10:48:19,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-23 10:48:19,704 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:48:19,704 INFO L402 BasicCegarLoop]: trace histogram [88, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:48:19,705 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:48:19,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:48:19,705 INFO L82 PathProgramCache]: Analyzing trace with hash 756158663, now seen corresponding path program 5 times [2018-11-23 10:48:19,708 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:48:19,709 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:48:19,735 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1