java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf -i ../../../trunk/examples/svcomp/array-multidimensional/max-2-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 18:59:40,660 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 18:59:40,661 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 18:59:40,673 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 18:59:40,674 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 18:59:40,675 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 18:59:40,676 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 18:59:40,678 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 18:59:40,680 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 18:59:40,681 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 18:59:40,682 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 18:59:40,682 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 18:59:40,683 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 18:59:40,686 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 18:59:40,687 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 18:59:40,688 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 18:59:40,689 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 18:59:40,690 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 18:59:40,692 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 18:59:40,694 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 18:59:40,695 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 18:59:40,697 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 18:59:40,699 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 18:59:40,699 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 18:59:40,699 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 18:59:40,700 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 18:59:40,701 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 18:59:40,702 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 18:59:40,703 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 18:59:40,704 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 18:59:40,704 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 18:59:40,705 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 18:59:40,705 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 18:59:40,705 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 18:59:40,707 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 18:59:40,707 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 18:59:40,708 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default-Const.epf [2018-11-14 18:59:40,738 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 18:59:40,738 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 18:59:40,739 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 18:59:40,739 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 18:59:40,741 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 18:59:40,741 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 18:59:40,741 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 18:59:40,742 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 18:59:40,742 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 18:59:40,742 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 18:59:40,742 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 18:59:40,742 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 18:59:40,742 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 18:59:40,743 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 18:59:40,743 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 18:59:40,743 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 18:59:40,743 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 18:59:40,744 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 18:59:40,744 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 18:59:40,744 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 18:59:40,744 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 18:59:40,744 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 18:59:40,745 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 18:59:40,746 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:59:40,746 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 18:59:40,746 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 18:59:40,747 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 18:59:40,747 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 18:59:40,747 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 18:59:40,747 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 18:59:40,747 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 18:59:40,815 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 18:59:40,827 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 18:59:40,831 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 18:59:40,832 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 18:59:40,833 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 18:59:40,834 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/max-2-u_true-unreach-call.i [2018-11-14 18:59:40,895 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921288032/615cf395d1524e1faf0b6df87e80d9d9/FLAGe8834e7e7 [2018-11-14 18:59:41,392 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 18:59:41,395 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/max-2-u_true-unreach-call.i [2018-11-14 18:59:41,403 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921288032/615cf395d1524e1faf0b6df87e80d9d9/FLAGe8834e7e7 [2018-11-14 18:59:41,423 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921288032/615cf395d1524e1faf0b6df87e80d9d9 [2018-11-14 18:59:41,433 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 18:59:41,435 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 18:59:41,436 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 18:59:41,436 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 18:59:41,440 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 18:59:41,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:59:41" (1/1) ... [2018-11-14 18:59:41,445 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d2b0430 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:41, skipping insertion in model container [2018-11-14 18:59:41,445 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 06:59:41" (1/1) ... [2018-11-14 18:59:41,456 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 18:59:41,480 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 18:59:41,736 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:59:41,741 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 18:59:41,785 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 18:59:41,817 INFO L195 MainTranslator]: Completed translation [2018-11-14 18:59:41,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:41 WrapperNode [2018-11-14 18:59:41,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 18:59:41,819 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 18:59:41,819 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 18:59:41,819 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 18:59:41,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:41" (1/1) ... [2018-11-14 18:59:41,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:41" (1/1) ... [2018-11-14 18:59:41,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:41" (1/1) ... [2018-11-14 18:59:41,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:41" (1/1) ... [2018-11-14 18:59:41,859 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:41" (1/1) ... [2018-11-14 18:59:41,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:41" (1/1) ... [2018-11-14 18:59:41,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:41" (1/1) ... [2018-11-14 18:59:41,872 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 18:59:41,873 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 18:59:41,873 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 18:59:41,873 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 18:59:41,875 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 18:59:42,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 18:59:42,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 18:59:42,046 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 18:59:42,046 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 18:59:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 18:59:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 18:59:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 18:59:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 18:59:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 18:59:42,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 18:59:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 18:59:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 18:59:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 18:59:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 18:59:42,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 18:59:42,873 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 18:59:42,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:59:42 BoogieIcfgContainer [2018-11-14 18:59:42,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 18:59:42,875 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 18:59:42,875 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 18:59:42,878 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 18:59:42,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 06:59:41" (1/3) ... [2018-11-14 18:59:42,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b4ff0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:59:42, skipping insertion in model container [2018-11-14 18:59:42,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 06:59:41" (2/3) ... [2018-11-14 18:59:42,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b4ff0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 06:59:42, skipping insertion in model container [2018-11-14 18:59:42,880 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 06:59:42" (3/3) ... [2018-11-14 18:59:42,881 INFO L112 eAbstractionObserver]: Analyzing ICFG max-2-u_true-unreach-call.i [2018-11-14 18:59:42,892 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 18:59:42,901 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 18:59:42,918 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 18:59:42,951 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 18:59:42,952 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 18:59:42,953 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 18:59:42,953 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 18:59:42,953 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 18:59:42,953 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 18:59:42,954 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 18:59:42,954 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 18:59:42,954 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 18:59:42,975 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-14 18:59:42,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 18:59:42,982 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:42,984 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:42,986 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:42,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:42,992 INFO L82 PathProgramCache]: Analyzing trace with hash -108950120, now seen corresponding path program 1 times [2018-11-14 18:59:42,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:42,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:43,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:43,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:43,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:43,084 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:43,084 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:43,084 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:59:43,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:43,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:43,184 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:43,331 INFO L256 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {41#true} is VALID [2018-11-14 18:59:43,335 INFO L273 TraceCheckUtils]: 1: Hoare triple {41#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {41#true} is VALID [2018-11-14 18:59:43,335 INFO L273 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2018-11-14 18:59:43,335 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #112#return; {41#true} is VALID [2018-11-14 18:59:43,336 INFO L256 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret5 := main(); {41#true} is VALID [2018-11-14 18:59:43,336 INFO L273 TraceCheckUtils]: 5: Hoare triple {41#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {41#true} is VALID [2018-11-14 18:59:43,338 INFO L273 TraceCheckUtils]: 6: Hoare triple {41#true} assume !true; {42#false} is VALID [2018-11-14 18:59:43,339 INFO L273 TraceCheckUtils]: 7: Hoare triple {42#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 0 * (~n~0 * 4) + 0, 4);~max~0 := #t~mem1;havoc #t~mem1; {42#false} is VALID [2018-11-14 18:59:43,339 INFO L273 TraceCheckUtils]: 8: Hoare triple {42#false} assume !true; {42#false} is VALID [2018-11-14 18:59:43,340 INFO L273 TraceCheckUtils]: 9: Hoare triple {42#false} ~i~0 := 0;~j~0 := 0; {42#false} is VALID [2018-11-14 18:59:43,340 INFO L273 TraceCheckUtils]: 10: Hoare triple {42#false} assume true; {42#false} is VALID [2018-11-14 18:59:43,340 INFO L273 TraceCheckUtils]: 11: Hoare triple {42#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {42#false} is VALID [2018-11-14 18:59:43,341 INFO L273 TraceCheckUtils]: 12: Hoare triple {42#false} assume true; {42#false} is VALID [2018-11-14 18:59:43,341 INFO L273 TraceCheckUtils]: 13: Hoare triple {42#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {42#false} is VALID [2018-11-14 18:59:43,342 INFO L256 TraceCheckUtils]: 14: Hoare triple {42#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {42#false} is VALID [2018-11-14 18:59:43,342 INFO L273 TraceCheckUtils]: 15: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2018-11-14 18:59:43,342 INFO L273 TraceCheckUtils]: 16: Hoare triple {42#false} assume ~cond == 0; {42#false} is VALID [2018-11-14 18:59:43,343 INFO L273 TraceCheckUtils]: 17: Hoare triple {42#false} assume !false; {42#false} is VALID [2018-11-14 18:59:43,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:59:43,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:59:43,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 18:59:43,384 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 18:59:43,388 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:43,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 18:59:43,519 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-14 18:59:43,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 18:59:43,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 18:59:43,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:59:43,532 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-11-14 18:59:43,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:43,760 INFO L93 Difference]: Finished difference Result 70 states and 97 transitions. [2018-11-14 18:59:43,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 18:59:43,761 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 18:59:43,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:43,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:59:43,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2018-11-14 18:59:43,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 18:59:43,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 97 transitions. [2018-11-14 18:59:43,781 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 97 transitions. [2018-11-14 18:59:44,181 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:44,206 INFO L225 Difference]: With dead ends: 70 [2018-11-14 18:59:44,206 INFO L226 Difference]: Without dead ends: 33 [2018-11-14 18:59:44,211 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 18:59:44,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-14 18:59:44,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-14 18:59:44,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:44,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-14 18:59:44,413 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 18:59:44,414 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 18:59:44,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:44,424 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-14 18:59:44,424 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-14 18:59:44,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:44,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:44,425 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 18:59:44,426 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 18:59:44,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:44,437 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-11-14 18:59:44,437 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-14 18:59:44,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:44,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:44,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:44,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:44,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 18:59:44,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-11-14 18:59:44,448 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 18 [2018-11-14 18:59:44,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:44,448 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-11-14 18:59:44,450 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 18:59:44,450 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-11-14 18:59:44,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 18:59:44,452 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:44,452 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:44,453 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:44,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:44,453 INFO L82 PathProgramCache]: Analyzing trace with hash -702412489, now seen corresponding path program 1 times [2018-11-14 18:59:44,454 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:44,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:44,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:44,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:44,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:44,470 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:44,471 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:44,471 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:59:44,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:44,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:44,550 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:44,725 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-14 18:59:44,726 INFO L273 TraceCheckUtils]: 1: Hoare triple {297#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {297#true} is VALID [2018-11-14 18:59:44,727 INFO L273 TraceCheckUtils]: 2: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-14 18:59:44,727 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {297#true} {297#true} #112#return; {297#true} is VALID [2018-11-14 18:59:44,727 INFO L256 TraceCheckUtils]: 4: Hoare triple {297#true} call #t~ret5 := main(); {297#true} is VALID [2018-11-14 18:59:44,728 INFO L273 TraceCheckUtils]: 5: Hoare triple {297#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {317#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:44,730 INFO L273 TraceCheckUtils]: 6: Hoare triple {317#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {317#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:44,731 INFO L273 TraceCheckUtils]: 7: Hoare triple {317#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {298#false} is VALID [2018-11-14 18:59:44,731 INFO L273 TraceCheckUtils]: 8: Hoare triple {298#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 0 * (~n~0 * 4) + 0, 4);~max~0 := #t~mem1;havoc #t~mem1; {298#false} is VALID [2018-11-14 18:59:44,731 INFO L273 TraceCheckUtils]: 9: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 18:59:44,732 INFO L273 TraceCheckUtils]: 10: Hoare triple {298#false} assume !(~i~0 < ~n~0); {298#false} is VALID [2018-11-14 18:59:44,732 INFO L273 TraceCheckUtils]: 11: Hoare triple {298#false} ~i~0 := 0;~j~0 := 0; {298#false} is VALID [2018-11-14 18:59:44,733 INFO L273 TraceCheckUtils]: 12: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 18:59:44,733 INFO L273 TraceCheckUtils]: 13: Hoare triple {298#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {298#false} is VALID [2018-11-14 18:59:44,733 INFO L273 TraceCheckUtils]: 14: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 18:59:44,734 INFO L273 TraceCheckUtils]: 15: Hoare triple {298#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {298#false} is VALID [2018-11-14 18:59:44,734 INFO L256 TraceCheckUtils]: 16: Hoare triple {298#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {298#false} is VALID [2018-11-14 18:59:44,734 INFO L273 TraceCheckUtils]: 17: Hoare triple {298#false} ~cond := #in~cond; {298#false} is VALID [2018-11-14 18:59:44,734 INFO L273 TraceCheckUtils]: 18: Hoare triple {298#false} assume ~cond == 0; {298#false} is VALID [2018-11-14 18:59:44,735 INFO L273 TraceCheckUtils]: 19: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-14 18:59:44,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:59:44,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:59:44,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 18:59:44,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 18:59:44,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:44,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 18:59:44,859 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:44,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 18:59:44,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 18:59:44,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:59:44,860 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 3 states. [2018-11-14 18:59:45,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:45,248 INFO L93 Difference]: Finished difference Result 60 states and 72 transitions. [2018-11-14 18:59:45,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 18:59:45,249 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 18:59:45,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:45,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:59:45,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2018-11-14 18:59:45,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 18:59:45,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 72 transitions. [2018-11-14 18:59:45,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 72 transitions. [2018-11-14 18:59:45,369 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:45,372 INFO L225 Difference]: With dead ends: 60 [2018-11-14 18:59:45,373 INFO L226 Difference]: Without dead ends: 38 [2018-11-14 18:59:45,374 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 18:59:45,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-14 18:59:45,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2018-11-14 18:59:45,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:45,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 35 states. [2018-11-14 18:59:45,396 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 35 states. [2018-11-14 18:59:45,396 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 35 states. [2018-11-14 18:59:45,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:45,400 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-11-14 18:59:45,400 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-14 18:59:45,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:45,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:45,401 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 38 states. [2018-11-14 18:59:45,402 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 38 states. [2018-11-14 18:59:45,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:45,405 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-11-14 18:59:45,405 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2018-11-14 18:59:45,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:45,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:45,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:45,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:45,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 18:59:45,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-11-14 18:59:45,409 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 20 [2018-11-14 18:59:45,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:45,410 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-11-14 18:59:45,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 18:59:45,410 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-11-14 18:59:45,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 18:59:45,411 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:45,411 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:45,411 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:45,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:45,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1273708416, now seen corresponding path program 1 times [2018-11-14 18:59:45,412 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:45,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:45,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:45,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:45,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:45,421 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:45,421 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:45,421 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:59:45,435 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:45,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:45,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:45,658 INFO L256 TraceCheckUtils]: 0: Hoare triple {563#true} call ULTIMATE.init(); {563#true} is VALID [2018-11-14 18:59:45,659 INFO L273 TraceCheckUtils]: 1: Hoare triple {563#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {563#true} is VALID [2018-11-14 18:59:45,659 INFO L273 TraceCheckUtils]: 2: Hoare triple {563#true} assume true; {563#true} is VALID [2018-11-14 18:59:45,660 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {563#true} {563#true} #112#return; {563#true} is VALID [2018-11-14 18:59:45,660 INFO L256 TraceCheckUtils]: 4: Hoare triple {563#true} call #t~ret5 := main(); {563#true} is VALID [2018-11-14 18:59:45,661 INFO L273 TraceCheckUtils]: 5: Hoare triple {563#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {583#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:45,662 INFO L273 TraceCheckUtils]: 6: Hoare triple {583#(<= 1500 main_~n~0)} assume true; {583#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:45,663 INFO L273 TraceCheckUtils]: 7: Hoare triple {583#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {590#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:45,669 INFO L273 TraceCheckUtils]: 8: Hoare triple {590#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {590#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:45,670 INFO L273 TraceCheckUtils]: 9: Hoare triple {590#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !(~j~0 < ~n~0); {564#false} is VALID [2018-11-14 18:59:45,671 INFO L273 TraceCheckUtils]: 10: Hoare triple {564#false} ~i~0 := ~i~0 + 1; {564#false} is VALID [2018-11-14 18:59:45,671 INFO L273 TraceCheckUtils]: 11: Hoare triple {564#false} assume true; {564#false} is VALID [2018-11-14 18:59:45,671 INFO L273 TraceCheckUtils]: 12: Hoare triple {564#false} assume !(~i~0 < ~m~0); {564#false} is VALID [2018-11-14 18:59:45,671 INFO L273 TraceCheckUtils]: 13: Hoare triple {564#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 0 * (~n~0 * 4) + 0, 4);~max~0 := #t~mem1;havoc #t~mem1; {564#false} is VALID [2018-11-14 18:59:45,672 INFO L273 TraceCheckUtils]: 14: Hoare triple {564#false} assume true; {564#false} is VALID [2018-11-14 18:59:45,672 INFO L273 TraceCheckUtils]: 15: Hoare triple {564#false} assume !(~i~0 < ~n~0); {564#false} is VALID [2018-11-14 18:59:45,673 INFO L273 TraceCheckUtils]: 16: Hoare triple {564#false} ~i~0 := 0;~j~0 := 0; {564#false} is VALID [2018-11-14 18:59:45,673 INFO L273 TraceCheckUtils]: 17: Hoare triple {564#false} assume true; {564#false} is VALID [2018-11-14 18:59:45,673 INFO L273 TraceCheckUtils]: 18: Hoare triple {564#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {564#false} is VALID [2018-11-14 18:59:45,674 INFO L273 TraceCheckUtils]: 19: Hoare triple {564#false} assume true; {564#false} is VALID [2018-11-14 18:59:45,674 INFO L273 TraceCheckUtils]: 20: Hoare triple {564#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {564#false} is VALID [2018-11-14 18:59:45,675 INFO L256 TraceCheckUtils]: 21: Hoare triple {564#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {564#false} is VALID [2018-11-14 18:59:45,675 INFO L273 TraceCheckUtils]: 22: Hoare triple {564#false} ~cond := #in~cond; {564#false} is VALID [2018-11-14 18:59:45,675 INFO L273 TraceCheckUtils]: 23: Hoare triple {564#false} assume ~cond == 0; {564#false} is VALID [2018-11-14 18:59:45,675 INFO L273 TraceCheckUtils]: 24: Hoare triple {564#false} assume !false; {564#false} is VALID [2018-11-14 18:59:45,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:59:45,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:59:45,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:59:45,704 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-14 18:59:45,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:45,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:59:45,748 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:45,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:59:45,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:59:45,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:59:45,749 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 4 states. [2018-11-14 18:59:46,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:46,067 INFO L93 Difference]: Finished difference Result 77 states and 95 transitions. [2018-11-14 18:59:46,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:59:46,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-14 18:59:46,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:46,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:59:46,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2018-11-14 18:59:46,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:59:46,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 95 transitions. [2018-11-14 18:59:46,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 95 transitions. [2018-11-14 18:59:46,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:46,224 INFO L225 Difference]: With dead ends: 77 [2018-11-14 18:59:46,224 INFO L226 Difference]: Without dead ends: 50 [2018-11-14 18:59:46,225 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 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-14 18:59:46,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-14 18:59:46,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2018-11-14 18:59:46,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:46,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 41 states. [2018-11-14 18:59:46,296 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 41 states. [2018-11-14 18:59:46,296 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 41 states. [2018-11-14 18:59:46,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:46,302 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2018-11-14 18:59:46,302 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2018-11-14 18:59:46,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:46,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:46,303 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 50 states. [2018-11-14 18:59:46,303 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 50 states. [2018-11-14 18:59:46,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:46,307 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2018-11-14 18:59:46,307 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 59 transitions. [2018-11-14 18:59:46,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:46,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:46,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:46,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:46,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 18:59:46,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-14 18:59:46,311 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 25 [2018-11-14 18:59:46,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:46,312 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-14 18:59:46,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:59:46,312 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-14 18:59:46,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 18:59:46,313 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:46,314 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:46,314 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:46,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:46,314 INFO L82 PathProgramCache]: Analyzing trace with hash -780699238, now seen corresponding path program 1 times [2018-11-14 18:59:46,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:46,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:46,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:46,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:46,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:46,325 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:46,325 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:46,325 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:59:46,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:46,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:46,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:46,513 INFO L256 TraceCheckUtils]: 0: Hoare triple {902#true} call ULTIMATE.init(); {902#true} is VALID [2018-11-14 18:59:46,514 INFO L273 TraceCheckUtils]: 1: Hoare triple {902#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {902#true} is VALID [2018-11-14 18:59:46,515 INFO L273 TraceCheckUtils]: 2: Hoare triple {902#true} assume true; {902#true} is VALID [2018-11-14 18:59:46,515 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {902#true} {902#true} #112#return; {902#true} is VALID [2018-11-14 18:59:46,515 INFO L256 TraceCheckUtils]: 4: Hoare triple {902#true} call #t~ret5 := main(); {902#true} is VALID [2018-11-14 18:59:46,517 INFO L273 TraceCheckUtils]: 5: Hoare triple {902#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {922#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:46,517 INFO L273 TraceCheckUtils]: 6: Hoare triple {922#(<= 1500 main_~n~0)} assume true; {922#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:46,518 INFO L273 TraceCheckUtils]: 7: Hoare triple {922#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {929#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:46,518 INFO L273 TraceCheckUtils]: 8: Hoare triple {929#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {929#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:46,519 INFO L273 TraceCheckUtils]: 9: Hoare triple {929#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {936#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 18:59:46,520 INFO L273 TraceCheckUtils]: 10: Hoare triple {936#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {936#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 18:59:46,520 INFO L273 TraceCheckUtils]: 11: Hoare triple {936#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !(~j~0 < ~n~0); {903#false} is VALID [2018-11-14 18:59:46,521 INFO L273 TraceCheckUtils]: 12: Hoare triple {903#false} ~i~0 := ~i~0 + 1; {903#false} is VALID [2018-11-14 18:59:46,521 INFO L273 TraceCheckUtils]: 13: Hoare triple {903#false} assume true; {903#false} is VALID [2018-11-14 18:59:46,521 INFO L273 TraceCheckUtils]: 14: Hoare triple {903#false} assume !(~i~0 < ~m~0); {903#false} is VALID [2018-11-14 18:59:46,522 INFO L273 TraceCheckUtils]: 15: Hoare triple {903#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 0 * (~n~0 * 4) + 0, 4);~max~0 := #t~mem1;havoc #t~mem1; {903#false} is VALID [2018-11-14 18:59:46,522 INFO L273 TraceCheckUtils]: 16: Hoare triple {903#false} assume true; {903#false} is VALID [2018-11-14 18:59:46,523 INFO L273 TraceCheckUtils]: 17: Hoare triple {903#false} assume !(~i~0 < ~n~0); {903#false} is VALID [2018-11-14 18:59:46,523 INFO L273 TraceCheckUtils]: 18: Hoare triple {903#false} ~i~0 := 0;~j~0 := 0; {903#false} is VALID [2018-11-14 18:59:46,523 INFO L273 TraceCheckUtils]: 19: Hoare triple {903#false} assume true; {903#false} is VALID [2018-11-14 18:59:46,523 INFO L273 TraceCheckUtils]: 20: Hoare triple {903#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {903#false} is VALID [2018-11-14 18:59:46,524 INFO L273 TraceCheckUtils]: 21: Hoare triple {903#false} assume true; {903#false} is VALID [2018-11-14 18:59:46,524 INFO L273 TraceCheckUtils]: 22: Hoare triple {903#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {903#false} is VALID [2018-11-14 18:59:46,524 INFO L256 TraceCheckUtils]: 23: Hoare triple {903#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {903#false} is VALID [2018-11-14 18:59:46,524 INFO L273 TraceCheckUtils]: 24: Hoare triple {903#false} ~cond := #in~cond; {903#false} is VALID [2018-11-14 18:59:46,525 INFO L273 TraceCheckUtils]: 25: Hoare triple {903#false} assume ~cond == 0; {903#false} is VALID [2018-11-14 18:59:46,525 INFO L273 TraceCheckUtils]: 26: Hoare triple {903#false} assume !false; {903#false} is VALID [2018-11-14 18:59:46,527 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 18:59:46,548 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:59:46,548 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-14 18:59:46,548 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 18:59:46,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:46,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 18:59:46,592 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:46,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 18:59:46,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 18:59:46,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:59:46,594 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 5 states. [2018-11-14 18:59:47,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:47,186 INFO L93 Difference]: Finished difference Result 93 states and 113 transitions. [2018-11-14 18:59:47,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 18:59:47,186 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2018-11-14 18:59:47,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:47,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:59:47,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2018-11-14 18:59:47,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 18:59:47,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 107 transitions. [2018-11-14 18:59:47,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 107 transitions. [2018-11-14 18:59:47,320 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:47,323 INFO L225 Difference]: With dead ends: 93 [2018-11-14 18:59:47,323 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 18:59:47,324 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 18:59:47,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 18:59:47,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2018-11-14 18:59:47,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:47,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 51 states. [2018-11-14 18:59:47,391 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 51 states. [2018-11-14 18:59:47,391 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 51 states. [2018-11-14 18:59:47,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:47,397 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-11-14 18:59:47,397 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-11-14 18:59:47,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:47,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:47,398 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 60 states. [2018-11-14 18:59:47,398 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 60 states. [2018-11-14 18:59:47,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:47,403 INFO L93 Difference]: Finished difference Result 60 states and 71 transitions. [2018-11-14 18:59:47,403 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2018-11-14 18:59:47,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:47,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:47,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:47,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:47,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-14 18:59:47,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2018-11-14 18:59:47,408 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 27 [2018-11-14 18:59:47,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:47,408 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2018-11-14 18:59:47,408 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 18:59:47,408 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2018-11-14 18:59:47,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-14 18:59:47,409 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:47,410 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:47,410 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:47,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:47,410 INFO L82 PathProgramCache]: Analyzing trace with hash 554718260, now seen corresponding path program 2 times [2018-11-14 18:59:47,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:47,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:47,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:47,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:47,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:47,418 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:47,419 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:47,419 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:59:47,449 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:59:47,469 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 18:59:47,469 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:59:47,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:47,479 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:47,616 INFO L256 TraceCheckUtils]: 0: Hoare triple {1305#true} call ULTIMATE.init(); {1305#true} is VALID [2018-11-14 18:59:47,617 INFO L273 TraceCheckUtils]: 1: Hoare triple {1305#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1305#true} is VALID [2018-11-14 18:59:47,617 INFO L273 TraceCheckUtils]: 2: Hoare triple {1305#true} assume true; {1305#true} is VALID [2018-11-14 18:59:47,617 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1305#true} {1305#true} #112#return; {1305#true} is VALID [2018-11-14 18:59:47,618 INFO L256 TraceCheckUtils]: 4: Hoare triple {1305#true} call #t~ret5 := main(); {1305#true} is VALID [2018-11-14 18:59:47,620 INFO L273 TraceCheckUtils]: 5: Hoare triple {1305#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {1325#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:47,621 INFO L273 TraceCheckUtils]: 6: Hoare triple {1325#(<= 1500 main_~n~0)} assume true; {1325#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:47,622 INFO L273 TraceCheckUtils]: 7: Hoare triple {1325#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {1325#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:47,622 INFO L273 TraceCheckUtils]: 8: Hoare triple {1325#(<= 1500 main_~n~0)} assume true; {1325#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:47,623 INFO L273 TraceCheckUtils]: 9: Hoare triple {1325#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1325#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:47,624 INFO L273 TraceCheckUtils]: 10: Hoare triple {1325#(<= 1500 main_~n~0)} assume true; {1325#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:47,625 INFO L273 TraceCheckUtils]: 11: Hoare triple {1325#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1325#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:47,626 INFO L273 TraceCheckUtils]: 12: Hoare triple {1325#(<= 1500 main_~n~0)} assume true; {1325#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:47,627 INFO L273 TraceCheckUtils]: 13: Hoare triple {1325#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {1325#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:47,627 INFO L273 TraceCheckUtils]: 14: Hoare triple {1325#(<= 1500 main_~n~0)} ~i~0 := ~i~0 + 1; {1325#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:47,629 INFO L273 TraceCheckUtils]: 15: Hoare triple {1325#(<= 1500 main_~n~0)} assume true; {1325#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:47,636 INFO L273 TraceCheckUtils]: 16: Hoare triple {1325#(<= 1500 main_~n~0)} assume !(~i~0 < ~m~0); {1325#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:47,638 INFO L273 TraceCheckUtils]: 17: Hoare triple {1325#(<= 1500 main_~n~0)} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 0 * (~n~0 * 4) + 0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1362#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:47,638 INFO L273 TraceCheckUtils]: 18: Hoare triple {1362#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume true; {1362#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:47,640 INFO L273 TraceCheckUtils]: 19: Hoare triple {1362#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume !(~i~0 < ~n~0); {1306#false} is VALID [2018-11-14 18:59:47,641 INFO L273 TraceCheckUtils]: 20: Hoare triple {1306#false} ~i~0 := 0;~j~0 := 0; {1306#false} is VALID [2018-11-14 18:59:47,641 INFO L273 TraceCheckUtils]: 21: Hoare triple {1306#false} assume true; {1306#false} is VALID [2018-11-14 18:59:47,641 INFO L273 TraceCheckUtils]: 22: Hoare triple {1306#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {1306#false} is VALID [2018-11-14 18:59:47,642 INFO L273 TraceCheckUtils]: 23: Hoare triple {1306#false} assume true; {1306#false} is VALID [2018-11-14 18:59:47,642 INFO L273 TraceCheckUtils]: 24: Hoare triple {1306#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {1306#false} is VALID [2018-11-14 18:59:47,642 INFO L256 TraceCheckUtils]: 25: Hoare triple {1306#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {1306#false} is VALID [2018-11-14 18:59:47,643 INFO L273 TraceCheckUtils]: 26: Hoare triple {1306#false} ~cond := #in~cond; {1306#false} is VALID [2018-11-14 18:59:47,643 INFO L273 TraceCheckUtils]: 27: Hoare triple {1306#false} assume ~cond == 0; {1306#false} is VALID [2018-11-14 18:59:47,644 INFO L273 TraceCheckUtils]: 28: Hoare triple {1306#false} assume !false; {1306#false} is VALID [2018-11-14 18:59:47,646 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 18:59:47,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 18:59:47,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 18:59:47,668 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-14 18:59:47,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:47,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:59:47,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:47,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:59:47,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:59:47,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:59:47,717 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 4 states. [2018-11-14 18:59:48,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:48,152 INFO L93 Difference]: Finished difference Result 104 states and 122 transitions. [2018-11-14 18:59:48,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:59:48,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-11-14 18:59:48,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:48,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:59:48,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2018-11-14 18:59:48,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:59:48,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 79 transitions. [2018-11-14 18:59:48,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 79 transitions. [2018-11-14 18:59:48,311 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-14 18:59:48,314 INFO L225 Difference]: With dead ends: 104 [2018-11-14 18:59:48,314 INFO L226 Difference]: Without dead ends: 84 [2018-11-14 18:59:48,315 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 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-14 18:59:48,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-14 18:59:48,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 53. [2018-11-14 18:59:48,385 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:48,386 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 53 states. [2018-11-14 18:59:48,386 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 53 states. [2018-11-14 18:59:48,386 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 53 states. [2018-11-14 18:59:48,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:48,391 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2018-11-14 18:59:48,391 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2018-11-14 18:59:48,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:48,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:48,393 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 84 states. [2018-11-14 18:59:48,393 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 84 states. [2018-11-14 18:59:48,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:48,398 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2018-11-14 18:59:48,398 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2018-11-14 18:59:48,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:48,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:48,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:48,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:48,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-14 18:59:48,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2018-11-14 18:59:48,402 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 29 [2018-11-14 18:59:48,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:48,403 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2018-11-14 18:59:48,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:59:48,403 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2018-11-14 18:59:48,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-14 18:59:48,404 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:48,404 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:48,405 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:48,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:48,405 INFO L82 PathProgramCache]: Analyzing trace with hash 401823304, now seen corresponding path program 1 times [2018-11-14 18:59:48,405 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:48,405 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:48,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:48,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:59:48,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:48,413 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:48,413 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:48,414 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:59:48,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:48,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:48,504 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:48,644 INFO L256 TraceCheckUtils]: 0: Hoare triple {1781#true} call ULTIMATE.init(); {1781#true} is VALID [2018-11-14 18:59:48,645 INFO L273 TraceCheckUtils]: 1: Hoare triple {1781#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1781#true} is VALID [2018-11-14 18:59:48,645 INFO L273 TraceCheckUtils]: 2: Hoare triple {1781#true} assume true; {1781#true} is VALID [2018-11-14 18:59:48,646 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1781#true} {1781#true} #112#return; {1781#true} is VALID [2018-11-14 18:59:48,646 INFO L256 TraceCheckUtils]: 4: Hoare triple {1781#true} call #t~ret5 := main(); {1781#true} is VALID [2018-11-14 18:59:48,663 INFO L273 TraceCheckUtils]: 5: Hoare triple {1781#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {1801#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:48,665 INFO L273 TraceCheckUtils]: 6: Hoare triple {1801#(<= 1500 main_~n~0)} assume true; {1801#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:48,666 INFO L273 TraceCheckUtils]: 7: Hoare triple {1801#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {1808#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:48,666 INFO L273 TraceCheckUtils]: 8: Hoare triple {1808#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {1808#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:48,670 INFO L273 TraceCheckUtils]: 9: Hoare triple {1808#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1815#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 18:59:48,671 INFO L273 TraceCheckUtils]: 10: Hoare triple {1815#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {1815#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 18:59:48,672 INFO L273 TraceCheckUtils]: 11: Hoare triple {1815#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {1822#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 18:59:48,672 INFO L273 TraceCheckUtils]: 12: Hoare triple {1822#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {1822#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 18:59:48,674 INFO L273 TraceCheckUtils]: 13: Hoare triple {1822#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !(~j~0 < ~n~0); {1782#false} is VALID [2018-11-14 18:59:48,674 INFO L273 TraceCheckUtils]: 14: Hoare triple {1782#false} ~i~0 := ~i~0 + 1; {1782#false} is VALID [2018-11-14 18:59:48,674 INFO L273 TraceCheckUtils]: 15: Hoare triple {1782#false} assume true; {1782#false} is VALID [2018-11-14 18:59:48,674 INFO L273 TraceCheckUtils]: 16: Hoare triple {1782#false} assume !(~i~0 < ~m~0); {1782#false} is VALID [2018-11-14 18:59:48,675 INFO L273 TraceCheckUtils]: 17: Hoare triple {1782#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 0 * (~n~0 * 4) + 0, 4);~max~0 := #t~mem1;havoc #t~mem1; {1782#false} is VALID [2018-11-14 18:59:48,675 INFO L273 TraceCheckUtils]: 18: Hoare triple {1782#false} assume true; {1782#false} is VALID [2018-11-14 18:59:48,675 INFO L273 TraceCheckUtils]: 19: Hoare triple {1782#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {1782#false} is VALID [2018-11-14 18:59:48,676 INFO L273 TraceCheckUtils]: 20: Hoare triple {1782#false} assume true; {1782#false} is VALID [2018-11-14 18:59:48,676 INFO L273 TraceCheckUtils]: 21: Hoare triple {1782#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {1782#false} is VALID [2018-11-14 18:59:48,676 INFO L273 TraceCheckUtils]: 22: Hoare triple {1782#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {1782#false} is VALID [2018-11-14 18:59:48,676 INFO L273 TraceCheckUtils]: 23: Hoare triple {1782#false} ~j~0 := ~j~0 + 1; {1782#false} is VALID [2018-11-14 18:59:48,677 INFO L273 TraceCheckUtils]: 24: Hoare triple {1782#false} assume true; {1782#false} is VALID [2018-11-14 18:59:48,677 INFO L273 TraceCheckUtils]: 25: Hoare triple {1782#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {1782#false} is VALID [2018-11-14 18:59:48,677 INFO L273 TraceCheckUtils]: 26: Hoare triple {1782#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {1782#false} is VALID [2018-11-14 18:59:48,678 INFO L273 TraceCheckUtils]: 27: Hoare triple {1782#false} ~j~0 := ~j~0 + 1; {1782#false} is VALID [2018-11-14 18:59:48,678 INFO L273 TraceCheckUtils]: 28: Hoare triple {1782#false} assume true; {1782#false} is VALID [2018-11-14 18:59:48,678 INFO L273 TraceCheckUtils]: 29: Hoare triple {1782#false} assume !(~j~0 < ~n~0); {1782#false} is VALID [2018-11-14 18:59:48,678 INFO L273 TraceCheckUtils]: 30: Hoare triple {1782#false} ~i~0 := ~i~0 + 1; {1782#false} is VALID [2018-11-14 18:59:48,679 INFO L273 TraceCheckUtils]: 31: Hoare triple {1782#false} assume true; {1782#false} is VALID [2018-11-14 18:59:48,679 INFO L273 TraceCheckUtils]: 32: Hoare triple {1782#false} assume !(~i~0 < ~n~0); {1782#false} is VALID [2018-11-14 18:59:48,679 INFO L273 TraceCheckUtils]: 33: Hoare triple {1782#false} ~i~0 := 0;~j~0 := 0; {1782#false} is VALID [2018-11-14 18:59:48,680 INFO L273 TraceCheckUtils]: 34: Hoare triple {1782#false} assume true; {1782#false} is VALID [2018-11-14 18:59:48,680 INFO L273 TraceCheckUtils]: 35: Hoare triple {1782#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {1782#false} is VALID [2018-11-14 18:59:48,680 INFO L273 TraceCheckUtils]: 36: Hoare triple {1782#false} assume true; {1782#false} is VALID [2018-11-14 18:59:48,680 INFO L273 TraceCheckUtils]: 37: Hoare triple {1782#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {1782#false} is VALID [2018-11-14 18:59:48,681 INFO L256 TraceCheckUtils]: 38: Hoare triple {1782#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {1782#false} is VALID [2018-11-14 18:59:48,681 INFO L273 TraceCheckUtils]: 39: Hoare triple {1782#false} ~cond := #in~cond; {1782#false} is VALID [2018-11-14 18:59:48,681 INFO L273 TraceCheckUtils]: 40: Hoare triple {1782#false} assume ~cond == 0; {1782#false} is VALID [2018-11-14 18:59:48,682 INFO L273 TraceCheckUtils]: 41: Hoare triple {1782#false} assume !false; {1782#false} is VALID [2018-11-14 18:59:48,685 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-14 18:59:48,714 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:59:48,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-14 18:59:48,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-11-14 18:59:48,715 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:48,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 18:59:48,786 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:48,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 18:59:48,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 18:59:48,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:59:48,787 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand 6 states. [2018-11-14 18:59:49,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:49,277 INFO L93 Difference]: Finished difference Result 114 states and 137 transitions. [2018-11-14 18:59:49,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 18:59:49,278 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2018-11-14 18:59:49,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:49,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:59:49,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2018-11-14 18:59:49,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 18:59:49,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 117 transitions. [2018-11-14 18:59:49,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 117 transitions. [2018-11-14 18:59:49,489 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-14 18:59:49,491 INFO L225 Difference]: With dead ends: 114 [2018-11-14 18:59:49,491 INFO L226 Difference]: Without dead ends: 69 [2018-11-14 18:59:49,492 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 18:59:49,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-14 18:59:49,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2018-11-14 18:59:49,612 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:49,613 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 63 states. [2018-11-14 18:59:49,613 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 63 states. [2018-11-14 18:59:49,613 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 63 states. [2018-11-14 18:59:49,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:49,617 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2018-11-14 18:59:49,617 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2018-11-14 18:59:49,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:49,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:49,618 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 69 states. [2018-11-14 18:59:49,618 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 69 states. [2018-11-14 18:59:49,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:49,621 INFO L93 Difference]: Finished difference Result 69 states and 81 transitions. [2018-11-14 18:59:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2018-11-14 18:59:49,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:49,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:49,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:49,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:49,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-14 18:59:49,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 73 transitions. [2018-11-14 18:59:49,626 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 73 transitions. Word has length 42 [2018-11-14 18:59:49,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:49,626 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 73 transitions. [2018-11-14 18:59:49,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 18:59:49,626 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2018-11-14 18:59:49,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-14 18:59:49,628 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:49,628 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:49,628 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:49,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:49,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1792757544, now seen corresponding path program 2 times [2018-11-14 18:59:49,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:49,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:49,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:49,630 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 18:59:49,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:49,637 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:49,637 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:49,637 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:59:49,654 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 18:59:49,682 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 18:59:49,682 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:59:49,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:49,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:49,939 INFO L256 TraceCheckUtils]: 0: Hoare triple {2295#true} call ULTIMATE.init(); {2295#true} is VALID [2018-11-14 18:59:49,940 INFO L273 TraceCheckUtils]: 1: Hoare triple {2295#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2295#true} is VALID [2018-11-14 18:59:49,940 INFO L273 TraceCheckUtils]: 2: Hoare triple {2295#true} assume true; {2295#true} is VALID [2018-11-14 18:59:49,940 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2295#true} {2295#true} #112#return; {2295#true} is VALID [2018-11-14 18:59:49,941 INFO L256 TraceCheckUtils]: 4: Hoare triple {2295#true} call #t~ret5 := main(); {2295#true} is VALID [2018-11-14 18:59:49,941 INFO L273 TraceCheckUtils]: 5: Hoare triple {2295#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {2315#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:49,942 INFO L273 TraceCheckUtils]: 6: Hoare triple {2315#(<= 1500 main_~n~0)} assume true; {2315#(<= 1500 main_~n~0)} is VALID [2018-11-14 18:59:49,942 INFO L273 TraceCheckUtils]: 7: Hoare triple {2315#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {2322#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:49,943 INFO L273 TraceCheckUtils]: 8: Hoare triple {2322#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {2322#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 18:59:49,945 INFO L273 TraceCheckUtils]: 9: Hoare triple {2322#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2329#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 18:59:49,946 INFO L273 TraceCheckUtils]: 10: Hoare triple {2329#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {2329#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 18:59:49,947 INFO L273 TraceCheckUtils]: 11: Hoare triple {2329#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2336#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 18:59:49,948 INFO L273 TraceCheckUtils]: 12: Hoare triple {2336#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {2336#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 18:59:49,949 INFO L273 TraceCheckUtils]: 13: Hoare triple {2336#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2343#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-14 18:59:49,950 INFO L273 TraceCheckUtils]: 14: Hoare triple {2343#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume true; {2343#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-14 18:59:49,951 INFO L273 TraceCheckUtils]: 15: Hoare triple {2343#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !(~j~0 < ~n~0); {2296#false} is VALID [2018-11-14 18:59:49,952 INFO L273 TraceCheckUtils]: 16: Hoare triple {2296#false} ~i~0 := ~i~0 + 1; {2296#false} is VALID [2018-11-14 18:59:49,952 INFO L273 TraceCheckUtils]: 17: Hoare triple {2296#false} assume true; {2296#false} is VALID [2018-11-14 18:59:49,952 INFO L273 TraceCheckUtils]: 18: Hoare triple {2296#false} assume !(~i~0 < ~m~0); {2296#false} is VALID [2018-11-14 18:59:49,953 INFO L273 TraceCheckUtils]: 19: Hoare triple {2296#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 0 * (~n~0 * 4) + 0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2296#false} is VALID [2018-11-14 18:59:49,953 INFO L273 TraceCheckUtils]: 20: Hoare triple {2296#false} assume true; {2296#false} is VALID [2018-11-14 18:59:49,954 INFO L273 TraceCheckUtils]: 21: Hoare triple {2296#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {2296#false} is VALID [2018-11-14 18:59:49,954 INFO L273 TraceCheckUtils]: 22: Hoare triple {2296#false} assume true; {2296#false} is VALID [2018-11-14 18:59:49,954 INFO L273 TraceCheckUtils]: 23: Hoare triple {2296#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {2296#false} is VALID [2018-11-14 18:59:49,954 INFO L273 TraceCheckUtils]: 24: Hoare triple {2296#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {2296#false} is VALID [2018-11-14 18:59:49,954 INFO L273 TraceCheckUtils]: 25: Hoare triple {2296#false} ~j~0 := ~j~0 + 1; {2296#false} is VALID [2018-11-14 18:59:49,955 INFO L273 TraceCheckUtils]: 26: Hoare triple {2296#false} assume true; {2296#false} is VALID [2018-11-14 18:59:49,955 INFO L273 TraceCheckUtils]: 27: Hoare triple {2296#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {2296#false} is VALID [2018-11-14 18:59:49,955 INFO L273 TraceCheckUtils]: 28: Hoare triple {2296#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {2296#false} is VALID [2018-11-14 18:59:49,955 INFO L273 TraceCheckUtils]: 29: Hoare triple {2296#false} ~j~0 := ~j~0 + 1; {2296#false} is VALID [2018-11-14 18:59:49,956 INFO L273 TraceCheckUtils]: 30: Hoare triple {2296#false} assume true; {2296#false} is VALID [2018-11-14 18:59:49,956 INFO L273 TraceCheckUtils]: 31: Hoare triple {2296#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {2296#false} is VALID [2018-11-14 18:59:49,956 INFO L273 TraceCheckUtils]: 32: Hoare triple {2296#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {2296#false} is VALID [2018-11-14 18:59:49,956 INFO L273 TraceCheckUtils]: 33: Hoare triple {2296#false} ~j~0 := ~j~0 + 1; {2296#false} is VALID [2018-11-14 18:59:49,957 INFO L273 TraceCheckUtils]: 34: Hoare triple {2296#false} assume true; {2296#false} is VALID [2018-11-14 18:59:49,957 INFO L273 TraceCheckUtils]: 35: Hoare triple {2296#false} assume !(~j~0 < ~n~0); {2296#false} is VALID [2018-11-14 18:59:49,957 INFO L273 TraceCheckUtils]: 36: Hoare triple {2296#false} ~i~0 := ~i~0 + 1; {2296#false} is VALID [2018-11-14 18:59:49,957 INFO L273 TraceCheckUtils]: 37: Hoare triple {2296#false} assume true; {2296#false} is VALID [2018-11-14 18:59:49,957 INFO L273 TraceCheckUtils]: 38: Hoare triple {2296#false} assume !(~i~0 < ~n~0); {2296#false} is VALID [2018-11-14 18:59:49,957 INFO L273 TraceCheckUtils]: 39: Hoare triple {2296#false} ~i~0 := 0;~j~0 := 0; {2296#false} is VALID [2018-11-14 18:59:49,958 INFO L273 TraceCheckUtils]: 40: Hoare triple {2296#false} assume true; {2296#false} is VALID [2018-11-14 18:59:49,958 INFO L273 TraceCheckUtils]: 41: Hoare triple {2296#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {2296#false} is VALID [2018-11-14 18:59:49,958 INFO L273 TraceCheckUtils]: 42: Hoare triple {2296#false} assume true; {2296#false} is VALID [2018-11-14 18:59:49,958 INFO L273 TraceCheckUtils]: 43: Hoare triple {2296#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {2296#false} is VALID [2018-11-14 18:59:49,959 INFO L256 TraceCheckUtils]: 44: Hoare triple {2296#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {2296#false} is VALID [2018-11-14 18:59:49,959 INFO L273 TraceCheckUtils]: 45: Hoare triple {2296#false} ~cond := #in~cond; {2296#false} is VALID [2018-11-14 18:59:49,959 INFO L273 TraceCheckUtils]: 46: Hoare triple {2296#false} assume ~cond == 0; {2296#false} is VALID [2018-11-14 18:59:49,959 INFO L273 TraceCheckUtils]: 47: Hoare triple {2296#false} assume !false; {2296#false} is VALID [2018-11-14 18:59:49,963 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-11-14 18:59:49,993 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:59:49,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-14 18:59:49,994 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-14 18:59:49,995 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:49,995 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 18:59:50,091 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:50,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 18:59:50,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 18:59:50,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:59:50,092 INFO L87 Difference]: Start difference. First operand 63 states and 73 transitions. Second operand 7 states. [2018-11-14 18:59:50,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:50,881 INFO L93 Difference]: Finished difference Result 134 states and 161 transitions. [2018-11-14 18:59:50,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 18:59:50,882 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2018-11-14 18:59:50,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:50,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:59:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2018-11-14 18:59:50,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 18:59:50,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 129 transitions. [2018-11-14 18:59:50,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 129 transitions. [2018-11-14 18:59:51,019 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:51,022 INFO L225 Difference]: With dead ends: 134 [2018-11-14 18:59:51,022 INFO L226 Difference]: Without dead ends: 79 [2018-11-14 18:59:51,023 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 18:59:51,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-11-14 18:59:51,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 73. [2018-11-14 18:59:51,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:51,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand 73 states. [2018-11-14 18:59:51,131 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand 73 states. [2018-11-14 18:59:51,131 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 73 states. [2018-11-14 18:59:51,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:51,134 INFO L93 Difference]: Finished difference Result 79 states and 93 transitions. [2018-11-14 18:59:51,135 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2018-11-14 18:59:51,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:51,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:51,135 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 79 states. [2018-11-14 18:59:51,135 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 79 states. [2018-11-14 18:59:51,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:51,139 INFO L93 Difference]: Finished difference Result 79 states and 93 transitions. [2018-11-14 18:59:51,139 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 93 transitions. [2018-11-14 18:59:51,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:51,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:51,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:51,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:51,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-14 18:59:51,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2018-11-14 18:59:51,142 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 48 [2018-11-14 18:59:51,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:51,142 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2018-11-14 18:59:51,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 18:59:51,143 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2018-11-14 18:59:51,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-14 18:59:51,143 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:51,143 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:51,144 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:51,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:51,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1705168616, now seen corresponding path program 3 times [2018-11-14 18:59:51,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:51,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:51,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:51,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:59:51,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:51,151 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:51,151 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:51,151 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:59:51,169 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 18:59:51,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 18:59:51,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:59:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:51,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:51,508 INFO L256 TraceCheckUtils]: 0: Hoare triple {2890#true} call ULTIMATE.init(); {2890#true} is VALID [2018-11-14 18:59:51,509 INFO L273 TraceCheckUtils]: 1: Hoare triple {2890#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2890#true} is VALID [2018-11-14 18:59:51,509 INFO L273 TraceCheckUtils]: 2: Hoare triple {2890#true} assume true; {2890#true} is VALID [2018-11-14 18:59:51,510 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2890#true} {2890#true} #112#return; {2890#true} is VALID [2018-11-14 18:59:51,510 INFO L256 TraceCheckUtils]: 4: Hoare triple {2890#true} call #t~ret5 := main(); {2890#true} is VALID [2018-11-14 18:59:51,511 INFO L273 TraceCheckUtils]: 5: Hoare triple {2890#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {2910#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:51,512 INFO L273 TraceCheckUtils]: 6: Hoare triple {2910#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2910#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:51,513 INFO L273 TraceCheckUtils]: 7: Hoare triple {2910#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0; {2910#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:51,514 INFO L273 TraceCheckUtils]: 8: Hoare triple {2910#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2910#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:51,514 INFO L273 TraceCheckUtils]: 9: Hoare triple {2910#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2910#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:51,515 INFO L273 TraceCheckUtils]: 10: Hoare triple {2910#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2910#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:51,515 INFO L273 TraceCheckUtils]: 11: Hoare triple {2910#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2910#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:51,516 INFO L273 TraceCheckUtils]: 12: Hoare triple {2910#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2910#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:51,520 INFO L273 TraceCheckUtils]: 13: Hoare triple {2910#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2910#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:51,521 INFO L273 TraceCheckUtils]: 14: Hoare triple {2910#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2910#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:51,522 INFO L273 TraceCheckUtils]: 15: Hoare triple {2910#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {2910#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:51,522 INFO L273 TraceCheckUtils]: 16: Hoare triple {2910#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2910#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:51,523 INFO L273 TraceCheckUtils]: 17: Hoare triple {2910#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {2910#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:51,523 INFO L273 TraceCheckUtils]: 18: Hoare triple {2910#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~i~0 := ~i~0 + 1; {2950#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:51,524 INFO L273 TraceCheckUtils]: 19: Hoare triple {2950#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {2950#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 18:59:51,524 INFO L273 TraceCheckUtils]: 20: Hoare triple {2950#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {2891#false} is VALID [2018-11-14 18:59:51,524 INFO L273 TraceCheckUtils]: 21: Hoare triple {2891#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 0 * (~n~0 * 4) + 0, 4);~max~0 := #t~mem1;havoc #t~mem1; {2891#false} is VALID [2018-11-14 18:59:51,525 INFO L273 TraceCheckUtils]: 22: Hoare triple {2891#false} assume true; {2891#false} is VALID [2018-11-14 18:59:51,525 INFO L273 TraceCheckUtils]: 23: Hoare triple {2891#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {2891#false} is VALID [2018-11-14 18:59:51,525 INFO L273 TraceCheckUtils]: 24: Hoare triple {2891#false} assume true; {2891#false} is VALID [2018-11-14 18:59:51,526 INFO L273 TraceCheckUtils]: 25: Hoare triple {2891#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {2891#false} is VALID [2018-11-14 18:59:51,526 INFO L273 TraceCheckUtils]: 26: Hoare triple {2891#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {2891#false} is VALID [2018-11-14 18:59:51,526 INFO L273 TraceCheckUtils]: 27: Hoare triple {2891#false} ~j~0 := ~j~0 + 1; {2891#false} is VALID [2018-11-14 18:59:51,526 INFO L273 TraceCheckUtils]: 28: Hoare triple {2891#false} assume true; {2891#false} is VALID [2018-11-14 18:59:51,527 INFO L273 TraceCheckUtils]: 29: Hoare triple {2891#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {2891#false} is VALID [2018-11-14 18:59:51,527 INFO L273 TraceCheckUtils]: 30: Hoare triple {2891#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {2891#false} is VALID [2018-11-14 18:59:51,528 INFO L273 TraceCheckUtils]: 31: Hoare triple {2891#false} ~j~0 := ~j~0 + 1; {2891#false} is VALID [2018-11-14 18:59:51,528 INFO L273 TraceCheckUtils]: 32: Hoare triple {2891#false} assume true; {2891#false} is VALID [2018-11-14 18:59:51,528 INFO L273 TraceCheckUtils]: 33: Hoare triple {2891#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {2891#false} is VALID [2018-11-14 18:59:51,529 INFO L273 TraceCheckUtils]: 34: Hoare triple {2891#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {2891#false} is VALID [2018-11-14 18:59:51,529 INFO L273 TraceCheckUtils]: 35: Hoare triple {2891#false} ~j~0 := ~j~0 + 1; {2891#false} is VALID [2018-11-14 18:59:51,529 INFO L273 TraceCheckUtils]: 36: Hoare triple {2891#false} assume true; {2891#false} is VALID [2018-11-14 18:59:51,529 INFO L273 TraceCheckUtils]: 37: Hoare triple {2891#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {2891#false} is VALID [2018-11-14 18:59:51,529 INFO L273 TraceCheckUtils]: 38: Hoare triple {2891#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {2891#false} is VALID [2018-11-14 18:59:51,530 INFO L273 TraceCheckUtils]: 39: Hoare triple {2891#false} ~j~0 := ~j~0 + 1; {2891#false} is VALID [2018-11-14 18:59:51,530 INFO L273 TraceCheckUtils]: 40: Hoare triple {2891#false} assume true; {2891#false} is VALID [2018-11-14 18:59:51,530 INFO L273 TraceCheckUtils]: 41: Hoare triple {2891#false} assume !(~j~0 < ~n~0); {2891#false} is VALID [2018-11-14 18:59:51,530 INFO L273 TraceCheckUtils]: 42: Hoare triple {2891#false} ~i~0 := ~i~0 + 1; {2891#false} is VALID [2018-11-14 18:59:51,530 INFO L273 TraceCheckUtils]: 43: Hoare triple {2891#false} assume true; {2891#false} is VALID [2018-11-14 18:59:51,531 INFO L273 TraceCheckUtils]: 44: Hoare triple {2891#false} assume !(~i~0 < ~n~0); {2891#false} is VALID [2018-11-14 18:59:51,531 INFO L273 TraceCheckUtils]: 45: Hoare triple {2891#false} ~i~0 := 0;~j~0 := 0; {2891#false} is VALID [2018-11-14 18:59:51,531 INFO L273 TraceCheckUtils]: 46: Hoare triple {2891#false} assume true; {2891#false} is VALID [2018-11-14 18:59:51,531 INFO L273 TraceCheckUtils]: 47: Hoare triple {2891#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {2891#false} is VALID [2018-11-14 18:59:51,532 INFO L273 TraceCheckUtils]: 48: Hoare triple {2891#false} assume true; {2891#false} is VALID [2018-11-14 18:59:51,532 INFO L273 TraceCheckUtils]: 49: Hoare triple {2891#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {2891#false} is VALID [2018-11-14 18:59:51,532 INFO L256 TraceCheckUtils]: 50: Hoare triple {2891#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {2891#false} is VALID [2018-11-14 18:59:51,532 INFO L273 TraceCheckUtils]: 51: Hoare triple {2891#false} ~cond := #in~cond; {2891#false} is VALID [2018-11-14 18:59:51,533 INFO L273 TraceCheckUtils]: 52: Hoare triple {2891#false} assume ~cond == 0; {2891#false} is VALID [2018-11-14 18:59:51,533 INFO L273 TraceCheckUtils]: 53: Hoare triple {2891#false} assume !false; {2891#false} is VALID [2018-11-14 18:59:51,536 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-14 18:59:51,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:59:51,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-14 18:59:51,557 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-11-14 18:59:51,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:51,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 18:59:51,594 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-14 18:59:51,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 18:59:51,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 18:59:51,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 18:59:51,596 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand 4 states. [2018-11-14 18:59:51,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:51,809 INFO L93 Difference]: Finished difference Result 149 states and 174 transitions. [2018-11-14 18:59:51,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 18:59:51,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-11-14 18:59:51,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:51,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:59:51,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2018-11-14 18:59:51,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 18:59:51,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2018-11-14 18:59:51,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2018-11-14 18:59:51,963 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:51,967 INFO L225 Difference]: With dead ends: 149 [2018-11-14 18:59:51,967 INFO L226 Difference]: Without dead ends: 97 [2018-11-14 18:59:51,968 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 51 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-14 18:59:51,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-14 18:59:52,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 86. [2018-11-14 18:59:52,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:52,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 86 states. [2018-11-14 18:59:52,096 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 86 states. [2018-11-14 18:59:52,096 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 86 states. [2018-11-14 18:59:52,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:52,101 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2018-11-14 18:59:52,102 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2018-11-14 18:59:52,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:52,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:52,103 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 97 states. [2018-11-14 18:59:52,103 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 97 states. [2018-11-14 18:59:52,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:52,106 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2018-11-14 18:59:52,106 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2018-11-14 18:59:52,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:52,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:52,107 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:52,107 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:52,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-14 18:59:52,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 99 transitions. [2018-11-14 18:59:52,110 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 99 transitions. Word has length 54 [2018-11-14 18:59:52,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:52,110 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 99 transitions. [2018-11-14 18:59:52,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 18:59:52,110 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 99 transitions. [2018-11-14 18:59:52,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-14 18:59:52,111 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:52,111 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 5, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:52,111 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:52,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:52,112 INFO L82 PathProgramCache]: Analyzing trace with hash 2081900377, now seen corresponding path program 4 times [2018-11-14 18:59:52,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:52,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:52,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:52,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:59:52,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:52,118 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:52,119 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:52,119 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:59:52,138 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 18:59:52,165 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 18:59:52,165 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 18:59:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 18:59:52,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 18:59:52,455 INFO L256 TraceCheckUtils]: 0: Hoare triple {3577#true} call ULTIMATE.init(); {3577#true} is VALID [2018-11-14 18:59:52,455 INFO L273 TraceCheckUtils]: 1: Hoare triple {3577#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3577#true} is VALID [2018-11-14 18:59:52,456 INFO L273 TraceCheckUtils]: 2: Hoare triple {3577#true} assume true; {3577#true} is VALID [2018-11-14 18:59:52,456 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3577#true} {3577#true} #112#return; {3577#true} is VALID [2018-11-14 18:59:52,456 INFO L256 TraceCheckUtils]: 4: Hoare triple {3577#true} call #t~ret5 := main(); {3577#true} is VALID [2018-11-14 18:59:52,456 INFO L273 TraceCheckUtils]: 5: Hoare triple {3577#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {3577#true} is VALID [2018-11-14 18:59:52,457 INFO L273 TraceCheckUtils]: 6: Hoare triple {3577#true} assume true; {3577#true} is VALID [2018-11-14 18:59:52,457 INFO L273 TraceCheckUtils]: 7: Hoare triple {3577#true} assume !!(~i~0 < ~m~0);~j~0 := 0; {3577#true} is VALID [2018-11-14 18:59:52,457 INFO L273 TraceCheckUtils]: 8: Hoare triple {3577#true} assume true; {3577#true} is VALID [2018-11-14 18:59:52,457 INFO L273 TraceCheckUtils]: 9: Hoare triple {3577#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3577#true} is VALID [2018-11-14 18:59:52,458 INFO L273 TraceCheckUtils]: 10: Hoare triple {3577#true} assume true; {3577#true} is VALID [2018-11-14 18:59:52,458 INFO L273 TraceCheckUtils]: 11: Hoare triple {3577#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3577#true} is VALID [2018-11-14 18:59:52,458 INFO L273 TraceCheckUtils]: 12: Hoare triple {3577#true} assume true; {3577#true} is VALID [2018-11-14 18:59:52,458 INFO L273 TraceCheckUtils]: 13: Hoare triple {3577#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3577#true} is VALID [2018-11-14 18:59:52,458 INFO L273 TraceCheckUtils]: 14: Hoare triple {3577#true} assume true; {3577#true} is VALID [2018-11-14 18:59:52,459 INFO L273 TraceCheckUtils]: 15: Hoare triple {3577#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3577#true} is VALID [2018-11-14 18:59:52,459 INFO L273 TraceCheckUtils]: 16: Hoare triple {3577#true} assume true; {3577#true} is VALID [2018-11-14 18:59:52,459 INFO L273 TraceCheckUtils]: 17: Hoare triple {3577#true} assume !(~j~0 < ~n~0); {3577#true} is VALID [2018-11-14 18:59:52,459 INFO L273 TraceCheckUtils]: 18: Hoare triple {3577#true} ~i~0 := ~i~0 + 1; {3577#true} is VALID [2018-11-14 18:59:52,459 INFO L273 TraceCheckUtils]: 19: Hoare triple {3577#true} assume true; {3577#true} is VALID [2018-11-14 18:59:52,460 INFO L273 TraceCheckUtils]: 20: Hoare triple {3577#true} assume !!(~i~0 < ~m~0);~j~0 := 0; {3577#true} is VALID [2018-11-14 18:59:52,460 INFO L273 TraceCheckUtils]: 21: Hoare triple {3577#true} assume true; {3577#true} is VALID [2018-11-14 18:59:52,460 INFO L273 TraceCheckUtils]: 22: Hoare triple {3577#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3577#true} is VALID [2018-11-14 18:59:52,460 INFO L273 TraceCheckUtils]: 23: Hoare triple {3577#true} assume true; {3577#true} is VALID [2018-11-14 18:59:52,460 INFO L273 TraceCheckUtils]: 24: Hoare triple {3577#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3577#true} is VALID [2018-11-14 18:59:52,461 INFO L273 TraceCheckUtils]: 25: Hoare triple {3577#true} assume true; {3577#true} is VALID [2018-11-14 18:59:52,461 INFO L273 TraceCheckUtils]: 26: Hoare triple {3577#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3577#true} is VALID [2018-11-14 18:59:52,461 INFO L273 TraceCheckUtils]: 27: Hoare triple {3577#true} assume true; {3577#true} is VALID [2018-11-14 18:59:52,461 INFO L273 TraceCheckUtils]: 28: Hoare triple {3577#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {3577#true} is VALID [2018-11-14 18:59:52,461 INFO L273 TraceCheckUtils]: 29: Hoare triple {3577#true} assume true; {3577#true} is VALID [2018-11-14 18:59:52,462 INFO L273 TraceCheckUtils]: 30: Hoare triple {3577#true} assume !(~j~0 < ~n~0); {3577#true} is VALID [2018-11-14 18:59:52,462 INFO L273 TraceCheckUtils]: 31: Hoare triple {3577#true} ~i~0 := ~i~0 + 1; {3577#true} is VALID [2018-11-14 18:59:52,462 INFO L273 TraceCheckUtils]: 32: Hoare triple {3577#true} assume true; {3577#true} is VALID [2018-11-14 18:59:52,462 INFO L273 TraceCheckUtils]: 33: Hoare triple {3577#true} assume !(~i~0 < ~m~0); {3577#true} is VALID [2018-11-14 18:59:52,463 INFO L273 TraceCheckUtils]: 34: Hoare triple {3577#true} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 0 * (~n~0 * 4) + 0, 4);~max~0 := #t~mem1;havoc #t~mem1; {3684#(<= main_~i~0 0)} is VALID [2018-11-14 18:59:52,463 INFO L273 TraceCheckUtils]: 35: Hoare triple {3684#(<= main_~i~0 0)} assume true; {3684#(<= main_~i~0 0)} is VALID [2018-11-14 18:59:52,464 INFO L273 TraceCheckUtils]: 36: Hoare triple {3684#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 0; {3691#(and (<= 0 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:52,464 INFO L273 TraceCheckUtils]: 37: Hoare triple {3691#(and (<= 0 main_~j~0) (<= main_~i~0 0))} assume true; {3691#(and (<= 0 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:52,465 INFO L273 TraceCheckUtils]: 38: Hoare triple {3691#(and (<= 0 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {3691#(and (<= 0 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:52,465 INFO L273 TraceCheckUtils]: 39: Hoare triple {3691#(and (<= 0 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {3691#(and (<= 0 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:52,466 INFO L273 TraceCheckUtils]: 40: Hoare triple {3691#(and (<= 0 main_~j~0) (<= main_~i~0 0))} ~j~0 := ~j~0 + 1; {3704#(and (<= 1 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:52,466 INFO L273 TraceCheckUtils]: 41: Hoare triple {3704#(and (<= 1 main_~j~0) (<= main_~i~0 0))} assume true; {3704#(and (<= 1 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:52,467 INFO L273 TraceCheckUtils]: 42: Hoare triple {3704#(and (<= 1 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {3704#(and (<= 1 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:52,467 INFO L273 TraceCheckUtils]: 43: Hoare triple {3704#(and (<= 1 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {3704#(and (<= 1 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:52,468 INFO L273 TraceCheckUtils]: 44: Hoare triple {3704#(and (<= 1 main_~j~0) (<= main_~i~0 0))} ~j~0 := ~j~0 + 1; {3717#(and (<= 2 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:52,469 INFO L273 TraceCheckUtils]: 45: Hoare triple {3717#(and (<= 2 main_~j~0) (<= main_~i~0 0))} assume true; {3717#(and (<= 2 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:52,470 INFO L273 TraceCheckUtils]: 46: Hoare triple {3717#(and (<= 2 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {3717#(and (<= 2 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:52,472 INFO L273 TraceCheckUtils]: 47: Hoare triple {3717#(and (<= 2 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {3717#(and (<= 2 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:52,473 INFO L273 TraceCheckUtils]: 48: Hoare triple {3717#(and (<= 2 main_~j~0) (<= main_~i~0 0))} ~j~0 := ~j~0 + 1; {3730#(and (<= 3 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:52,474 INFO L273 TraceCheckUtils]: 49: Hoare triple {3730#(and (<= 3 main_~j~0) (<= main_~i~0 0))} assume true; {3730#(and (<= 3 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:52,475 INFO L273 TraceCheckUtils]: 50: Hoare triple {3730#(and (<= 3 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {3737#(and (<= 4 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:52,476 INFO L273 TraceCheckUtils]: 51: Hoare triple {3737#(and (<= 4 main_~n~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {3737#(and (<= 4 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:52,477 INFO L273 TraceCheckUtils]: 52: Hoare triple {3737#(and (<= 4 main_~n~0) (<= main_~i~0 0))} ~j~0 := ~j~0 + 1; {3737#(and (<= 4 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:52,478 INFO L273 TraceCheckUtils]: 53: Hoare triple {3737#(and (<= 4 main_~n~0) (<= main_~i~0 0))} assume true; {3737#(and (<= 4 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:52,479 INFO L273 TraceCheckUtils]: 54: Hoare triple {3737#(and (<= 4 main_~n~0) (<= main_~i~0 0))} assume !(~j~0 < ~n~0); {3737#(and (<= 4 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 18:59:52,480 INFO L273 TraceCheckUtils]: 55: Hoare triple {3737#(and (<= 4 main_~n~0) (<= main_~i~0 0))} ~i~0 := ~i~0 + 1; {3753#(and (<= main_~i~0 1) (<= 4 main_~n~0))} is VALID [2018-11-14 18:59:52,480 INFO L273 TraceCheckUtils]: 56: Hoare triple {3753#(and (<= main_~i~0 1) (<= 4 main_~n~0))} assume true; {3753#(and (<= main_~i~0 1) (<= 4 main_~n~0))} is VALID [2018-11-14 18:59:52,481 INFO L273 TraceCheckUtils]: 57: Hoare triple {3753#(and (<= main_~i~0 1) (<= 4 main_~n~0))} assume !(~i~0 < ~n~0); {3578#false} is VALID [2018-11-14 18:59:52,481 INFO L273 TraceCheckUtils]: 58: Hoare triple {3578#false} ~i~0 := 0;~j~0 := 0; {3578#false} is VALID [2018-11-14 18:59:52,482 INFO L273 TraceCheckUtils]: 59: Hoare triple {3578#false} assume true; {3578#false} is VALID [2018-11-14 18:59:52,482 INFO L273 TraceCheckUtils]: 60: Hoare triple {3578#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {3578#false} is VALID [2018-11-14 18:59:52,482 INFO L273 TraceCheckUtils]: 61: Hoare triple {3578#false} assume true; {3578#false} is VALID [2018-11-14 18:59:52,482 INFO L273 TraceCheckUtils]: 62: Hoare triple {3578#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {3578#false} is VALID [2018-11-14 18:59:52,483 INFO L256 TraceCheckUtils]: 63: Hoare triple {3578#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {3578#false} is VALID [2018-11-14 18:59:52,483 INFO L273 TraceCheckUtils]: 64: Hoare triple {3578#false} ~cond := #in~cond; {3578#false} is VALID [2018-11-14 18:59:52,483 INFO L273 TraceCheckUtils]: 65: Hoare triple {3578#false} assume ~cond == 0; {3578#false} is VALID [2018-11-14 18:59:52,483 INFO L273 TraceCheckUtils]: 66: Hoare triple {3578#false} assume !false; {3578#false} is VALID [2018-11-14 18:59:52,490 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2018-11-14 18:59:52,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 18:59:52,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-14 18:59:52,518 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-11-14 18:59:52,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 18:59:52,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 18:59:52,585 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:52,585 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 18:59:52,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 18:59:52,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-14 18:59:52,586 INFO L87 Difference]: Start difference. First operand 86 states and 99 transitions. Second operand 9 states. [2018-11-14 18:59:53,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:53,877 INFO L93 Difference]: Finished difference Result 207 states and 246 transitions. [2018-11-14 18:59:53,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 18:59:53,877 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-11-14 18:59:53,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 18:59:53,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:59:53,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2018-11-14 18:59:53,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 18:59:53,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 143 transitions. [2018-11-14 18:59:53,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 143 transitions. [2018-11-14 18:59:54,164 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 18:59:54,168 INFO L225 Difference]: With dead ends: 207 [2018-11-14 18:59:54,168 INFO L226 Difference]: Without dead ends: 179 [2018-11-14 18:59:54,168 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-11-14 18:59:54,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-14 18:59:54,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 107. [2018-11-14 18:59:54,354 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 18:59:54,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand 107 states. [2018-11-14 18:59:54,354 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand 107 states. [2018-11-14 18:59:54,354 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 107 states. [2018-11-14 18:59:54,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:54,361 INFO L93 Difference]: Finished difference Result 179 states and 213 transitions. [2018-11-14 18:59:54,362 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 213 transitions. [2018-11-14 18:59:54,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:54,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:54,363 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 179 states. [2018-11-14 18:59:54,363 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 179 states. [2018-11-14 18:59:54,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 18:59:54,369 INFO L93 Difference]: Finished difference Result 179 states and 213 transitions. [2018-11-14 18:59:54,369 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 213 transitions. [2018-11-14 18:59:54,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 18:59:54,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 18:59:54,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 18:59:54,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 18:59:54,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-11-14 18:59:54,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 125 transitions. [2018-11-14 18:59:54,373 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 125 transitions. Word has length 67 [2018-11-14 18:59:54,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 18:59:54,373 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 125 transitions. [2018-11-14 18:59:54,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 18:59:54,374 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 125 transitions. [2018-11-14 18:59:54,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-11-14 18:59:54,375 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 18:59:54,375 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 8, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 18:59:54,375 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 18:59:54,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 18:59:54,375 INFO L82 PathProgramCache]: Analyzing trace with hash 15169047, now seen corresponding path program 5 times [2018-11-14 18:59:54,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 18:59:54,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 18:59:54,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:54,377 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 18:59:54,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 18:59:54,382 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 18:59:54,382 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 18:59:54,383 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 18:59:54,402 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-14 19:00:00,779 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-14 19:00:00,779 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:00:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:00:00,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:00:01,053 INFO L256 TraceCheckUtils]: 0: Hoare triple {4590#true} call ULTIMATE.init(); {4590#true} is VALID [2018-11-14 19:00:01,054 INFO L273 TraceCheckUtils]: 1: Hoare triple {4590#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4590#true} is VALID [2018-11-14 19:00:01,054 INFO L273 TraceCheckUtils]: 2: Hoare triple {4590#true} assume true; {4590#true} is VALID [2018-11-14 19:00:01,054 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4590#true} {4590#true} #112#return; {4590#true} is VALID [2018-11-14 19:00:01,054 INFO L256 TraceCheckUtils]: 4: Hoare triple {4590#true} call #t~ret5 := main(); {4590#true} is VALID [2018-11-14 19:00:01,061 INFO L273 TraceCheckUtils]: 5: Hoare triple {4590#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {4610#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:01,061 INFO L273 TraceCheckUtils]: 6: Hoare triple {4610#(<= 1500 main_~n~0)} assume true; {4610#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:01,069 INFO L273 TraceCheckUtils]: 7: Hoare triple {4610#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {4617#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:00:01,070 INFO L273 TraceCheckUtils]: 8: Hoare triple {4617#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {4617#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:00:01,074 INFO L273 TraceCheckUtils]: 9: Hoare triple {4617#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4624#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 19:00:01,074 INFO L273 TraceCheckUtils]: 10: Hoare triple {4624#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {4624#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 19:00:01,075 INFO L273 TraceCheckUtils]: 11: Hoare triple {4624#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4631#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 19:00:01,076 INFO L273 TraceCheckUtils]: 12: Hoare triple {4631#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {4631#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 19:00:01,076 INFO L273 TraceCheckUtils]: 13: Hoare triple {4631#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4638#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-14 19:00:01,077 INFO L273 TraceCheckUtils]: 14: Hoare triple {4638#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume true; {4638#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-14 19:00:01,077 INFO L273 TraceCheckUtils]: 15: Hoare triple {4638#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4645#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-14 19:00:01,078 INFO L273 TraceCheckUtils]: 16: Hoare triple {4645#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume true; {4645#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-14 19:00:01,079 INFO L273 TraceCheckUtils]: 17: Hoare triple {4645#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !(~j~0 < ~n~0); {4591#false} is VALID [2018-11-14 19:00:01,079 INFO L273 TraceCheckUtils]: 18: Hoare triple {4591#false} ~i~0 := ~i~0 + 1; {4591#false} is VALID [2018-11-14 19:00:01,080 INFO L273 TraceCheckUtils]: 19: Hoare triple {4591#false} assume true; {4591#false} is VALID [2018-11-14 19:00:01,080 INFO L273 TraceCheckUtils]: 20: Hoare triple {4591#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {4591#false} is VALID [2018-11-14 19:00:01,080 INFO L273 TraceCheckUtils]: 21: Hoare triple {4591#false} assume true; {4591#false} is VALID [2018-11-14 19:00:01,080 INFO L273 TraceCheckUtils]: 22: Hoare triple {4591#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4591#false} is VALID [2018-11-14 19:00:01,081 INFO L273 TraceCheckUtils]: 23: Hoare triple {4591#false} assume true; {4591#false} is VALID [2018-11-14 19:00:01,081 INFO L273 TraceCheckUtils]: 24: Hoare triple {4591#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4591#false} is VALID [2018-11-14 19:00:01,081 INFO L273 TraceCheckUtils]: 25: Hoare triple {4591#false} assume true; {4591#false} is VALID [2018-11-14 19:00:01,082 INFO L273 TraceCheckUtils]: 26: Hoare triple {4591#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4591#false} is VALID [2018-11-14 19:00:01,082 INFO L273 TraceCheckUtils]: 27: Hoare triple {4591#false} assume true; {4591#false} is VALID [2018-11-14 19:00:01,082 INFO L273 TraceCheckUtils]: 28: Hoare triple {4591#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {4591#false} is VALID [2018-11-14 19:00:01,082 INFO L273 TraceCheckUtils]: 29: Hoare triple {4591#false} assume true; {4591#false} is VALID [2018-11-14 19:00:01,082 INFO L273 TraceCheckUtils]: 30: Hoare triple {4591#false} assume !(~j~0 < ~n~0); {4591#false} is VALID [2018-11-14 19:00:01,083 INFO L273 TraceCheckUtils]: 31: Hoare triple {4591#false} ~i~0 := ~i~0 + 1; {4591#false} is VALID [2018-11-14 19:00:01,083 INFO L273 TraceCheckUtils]: 32: Hoare triple {4591#false} assume true; {4591#false} is VALID [2018-11-14 19:00:01,083 INFO L273 TraceCheckUtils]: 33: Hoare triple {4591#false} assume !(~i~0 < ~m~0); {4591#false} is VALID [2018-11-14 19:00:01,083 INFO L273 TraceCheckUtils]: 34: Hoare triple {4591#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 0 * (~n~0 * 4) + 0, 4);~max~0 := #t~mem1;havoc #t~mem1; {4591#false} is VALID [2018-11-14 19:00:01,083 INFO L273 TraceCheckUtils]: 35: Hoare triple {4591#false} assume true; {4591#false} is VALID [2018-11-14 19:00:01,084 INFO L273 TraceCheckUtils]: 36: Hoare triple {4591#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {4591#false} is VALID [2018-11-14 19:00:01,084 INFO L273 TraceCheckUtils]: 37: Hoare triple {4591#false} assume true; {4591#false} is VALID [2018-11-14 19:00:01,084 INFO L273 TraceCheckUtils]: 38: Hoare triple {4591#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {4591#false} is VALID [2018-11-14 19:00:01,084 INFO L273 TraceCheckUtils]: 39: Hoare triple {4591#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {4591#false} is VALID [2018-11-14 19:00:01,084 INFO L273 TraceCheckUtils]: 40: Hoare triple {4591#false} ~j~0 := ~j~0 + 1; {4591#false} is VALID [2018-11-14 19:00:01,085 INFO L273 TraceCheckUtils]: 41: Hoare triple {4591#false} assume true; {4591#false} is VALID [2018-11-14 19:00:01,085 INFO L273 TraceCheckUtils]: 42: Hoare triple {4591#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {4591#false} is VALID [2018-11-14 19:00:01,085 INFO L273 TraceCheckUtils]: 43: Hoare triple {4591#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {4591#false} is VALID [2018-11-14 19:00:01,085 INFO L273 TraceCheckUtils]: 44: Hoare triple {4591#false} ~j~0 := ~j~0 + 1; {4591#false} is VALID [2018-11-14 19:00:01,085 INFO L273 TraceCheckUtils]: 45: Hoare triple {4591#false} assume true; {4591#false} is VALID [2018-11-14 19:00:01,086 INFO L273 TraceCheckUtils]: 46: Hoare triple {4591#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {4591#false} is VALID [2018-11-14 19:00:01,086 INFO L273 TraceCheckUtils]: 47: Hoare triple {4591#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {4591#false} is VALID [2018-11-14 19:00:01,086 INFO L273 TraceCheckUtils]: 48: Hoare triple {4591#false} ~j~0 := ~j~0 + 1; {4591#false} is VALID [2018-11-14 19:00:01,086 INFO L273 TraceCheckUtils]: 49: Hoare triple {4591#false} assume true; {4591#false} is VALID [2018-11-14 19:00:01,086 INFO L273 TraceCheckUtils]: 50: Hoare triple {4591#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {4591#false} is VALID [2018-11-14 19:00:01,087 INFO L273 TraceCheckUtils]: 51: Hoare triple {4591#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {4591#false} is VALID [2018-11-14 19:00:01,087 INFO L273 TraceCheckUtils]: 52: Hoare triple {4591#false} ~j~0 := ~j~0 + 1; {4591#false} is VALID [2018-11-14 19:00:01,087 INFO L273 TraceCheckUtils]: 53: Hoare triple {4591#false} assume true; {4591#false} is VALID [2018-11-14 19:00:01,087 INFO L273 TraceCheckUtils]: 54: Hoare triple {4591#false} assume !(~j~0 < ~n~0); {4591#false} is VALID [2018-11-14 19:00:01,087 INFO L273 TraceCheckUtils]: 55: Hoare triple {4591#false} ~i~0 := ~i~0 + 1; {4591#false} is VALID [2018-11-14 19:00:01,088 INFO L273 TraceCheckUtils]: 56: Hoare triple {4591#false} assume true; {4591#false} is VALID [2018-11-14 19:00:01,088 INFO L273 TraceCheckUtils]: 57: Hoare triple {4591#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {4591#false} is VALID [2018-11-14 19:00:01,088 INFO L273 TraceCheckUtils]: 58: Hoare triple {4591#false} assume true; {4591#false} is VALID [2018-11-14 19:00:01,088 INFO L273 TraceCheckUtils]: 59: Hoare triple {4591#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {4591#false} is VALID [2018-11-14 19:00:01,088 INFO L273 TraceCheckUtils]: 60: Hoare triple {4591#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {4591#false} is VALID [2018-11-14 19:00:01,089 INFO L273 TraceCheckUtils]: 61: Hoare triple {4591#false} ~j~0 := ~j~0 + 1; {4591#false} is VALID [2018-11-14 19:00:01,089 INFO L273 TraceCheckUtils]: 62: Hoare triple {4591#false} assume true; {4591#false} is VALID [2018-11-14 19:00:01,089 INFO L273 TraceCheckUtils]: 63: Hoare triple {4591#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {4591#false} is VALID [2018-11-14 19:00:01,089 INFO L273 TraceCheckUtils]: 64: Hoare triple {4591#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {4591#false} is VALID [2018-11-14 19:00:01,089 INFO L273 TraceCheckUtils]: 65: Hoare triple {4591#false} ~j~0 := ~j~0 + 1; {4591#false} is VALID [2018-11-14 19:00:01,090 INFO L273 TraceCheckUtils]: 66: Hoare triple {4591#false} assume true; {4591#false} is VALID [2018-11-14 19:00:01,090 INFO L273 TraceCheckUtils]: 67: Hoare triple {4591#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {4591#false} is VALID [2018-11-14 19:00:01,090 INFO L273 TraceCheckUtils]: 68: Hoare triple {4591#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {4591#false} is VALID [2018-11-14 19:00:01,090 INFO L273 TraceCheckUtils]: 69: Hoare triple {4591#false} ~j~0 := ~j~0 + 1; {4591#false} is VALID [2018-11-14 19:00:01,090 INFO L273 TraceCheckUtils]: 70: Hoare triple {4591#false} assume true; {4591#false} is VALID [2018-11-14 19:00:01,091 INFO L273 TraceCheckUtils]: 71: Hoare triple {4591#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {4591#false} is VALID [2018-11-14 19:00:01,091 INFO L273 TraceCheckUtils]: 72: Hoare triple {4591#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {4591#false} is VALID [2018-11-14 19:00:01,091 INFO L273 TraceCheckUtils]: 73: Hoare triple {4591#false} ~j~0 := ~j~0 + 1; {4591#false} is VALID [2018-11-14 19:00:01,091 INFO L273 TraceCheckUtils]: 74: Hoare triple {4591#false} assume true; {4591#false} is VALID [2018-11-14 19:00:01,091 INFO L273 TraceCheckUtils]: 75: Hoare triple {4591#false} assume !(~j~0 < ~n~0); {4591#false} is VALID [2018-11-14 19:00:01,092 INFO L273 TraceCheckUtils]: 76: Hoare triple {4591#false} ~i~0 := ~i~0 + 1; {4591#false} is VALID [2018-11-14 19:00:01,092 INFO L273 TraceCheckUtils]: 77: Hoare triple {4591#false} assume true; {4591#false} is VALID [2018-11-14 19:00:01,092 INFO L273 TraceCheckUtils]: 78: Hoare triple {4591#false} assume !(~i~0 < ~n~0); {4591#false} is VALID [2018-11-14 19:00:01,092 INFO L273 TraceCheckUtils]: 79: Hoare triple {4591#false} ~i~0 := 0;~j~0 := 0; {4591#false} is VALID [2018-11-14 19:00:01,092 INFO L273 TraceCheckUtils]: 80: Hoare triple {4591#false} assume true; {4591#false} is VALID [2018-11-14 19:00:01,092 INFO L273 TraceCheckUtils]: 81: Hoare triple {4591#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {4591#false} is VALID [2018-11-14 19:00:01,093 INFO L273 TraceCheckUtils]: 82: Hoare triple {4591#false} assume true; {4591#false} is VALID [2018-11-14 19:00:01,093 INFO L273 TraceCheckUtils]: 83: Hoare triple {4591#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {4591#false} is VALID [2018-11-14 19:00:01,093 INFO L256 TraceCheckUtils]: 84: Hoare triple {4591#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {4591#false} is VALID [2018-11-14 19:00:01,093 INFO L273 TraceCheckUtils]: 85: Hoare triple {4591#false} ~cond := #in~cond; {4591#false} is VALID [2018-11-14 19:00:01,093 INFO L273 TraceCheckUtils]: 86: Hoare triple {4591#false} assume ~cond == 0; {4591#false} is VALID [2018-11-14 19:00:01,094 INFO L273 TraceCheckUtils]: 87: Hoare triple {4591#false} assume !false; {4591#false} is VALID [2018-11-14 19:00:01,098 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 54 proven. 20 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2018-11-14 19:00:01,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:00:01,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-14 19:00:01,120 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2018-11-14 19:00:01,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:00:01,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 19:00:01,168 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:00:01,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 19:00:01,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 19:00:01,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:00:01,170 INFO L87 Difference]: Start difference. First operand 107 states and 125 transitions. Second operand 8 states. [2018-11-14 19:00:01,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:00:01,810 INFO L93 Difference]: Finished difference Result 220 states and 266 transitions. [2018-11-14 19:00:01,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-14 19:00:01,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 88 [2018-11-14 19:00:01,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:00:01,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:00:01,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2018-11-14 19:00:01,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 19:00:01,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 141 transitions. [2018-11-14 19:00:01,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 141 transitions. [2018-11-14 19:00:01,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:00:01,965 INFO L225 Difference]: With dead ends: 220 [2018-11-14 19:00:01,966 INFO L226 Difference]: Without dead ends: 131 [2018-11-14 19:00:01,967 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-14 19:00:01,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-11-14 19:00:02,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 123. [2018-11-14 19:00:02,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:00:02,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand 123 states. [2018-11-14 19:00:02,229 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 123 states. [2018-11-14 19:00:02,229 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 123 states. [2018-11-14 19:00:02,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:00:02,233 INFO L93 Difference]: Finished difference Result 131 states and 155 transitions. [2018-11-14 19:00:02,234 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 155 transitions. [2018-11-14 19:00:02,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:00:02,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:00:02,235 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 131 states. [2018-11-14 19:00:02,235 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 131 states. [2018-11-14 19:00:02,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:00:02,239 INFO L93 Difference]: Finished difference Result 131 states and 155 transitions. [2018-11-14 19:00:02,239 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 155 transitions. [2018-11-14 19:00:02,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:00:02,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:00:02,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:00:02,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:00:02,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-11-14 19:00:02,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 144 transitions. [2018-11-14 19:00:02,244 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 144 transitions. Word has length 88 [2018-11-14 19:00:02,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:00:02,245 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 144 transitions. [2018-11-14 19:00:02,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 19:00:02,245 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 144 transitions. [2018-11-14 19:00:02,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-11-14 19:00:02,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:00:02,246 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 10, 10, 10, 10, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:00:02,247 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:00:02,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:00:02,247 INFO L82 PathProgramCache]: Analyzing trace with hash -661058729, now seen corresponding path program 6 times [2018-11-14 19:00:02,247 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:00:02,247 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:00:02,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:00:02,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:00:02,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:00:02,255 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:00:02,255 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:00:02,255 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 19:00:02,278 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-14 19:00:02,321 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-14 19:00:02,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:00:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:00:02,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:00:02,547 INFO L256 TraceCheckUtils]: 0: Hoare triple {5593#true} call ULTIMATE.init(); {5593#true} is VALID [2018-11-14 19:00:02,548 INFO L273 TraceCheckUtils]: 1: Hoare triple {5593#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5593#true} is VALID [2018-11-14 19:00:02,548 INFO L273 TraceCheckUtils]: 2: Hoare triple {5593#true} assume true; {5593#true} is VALID [2018-11-14 19:00:02,548 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5593#true} {5593#true} #112#return; {5593#true} is VALID [2018-11-14 19:00:02,549 INFO L256 TraceCheckUtils]: 4: Hoare triple {5593#true} call #t~ret5 := main(); {5593#true} is VALID [2018-11-14 19:00:02,550 INFO L273 TraceCheckUtils]: 5: Hoare triple {5593#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,550 INFO L273 TraceCheckUtils]: 6: Hoare triple {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,551 INFO L273 TraceCheckUtils]: 7: Hoare triple {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0; {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,574 INFO L273 TraceCheckUtils]: 8: Hoare triple {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,588 INFO L273 TraceCheckUtils]: 9: Hoare triple {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,597 INFO L273 TraceCheckUtils]: 10: Hoare triple {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,598 INFO L273 TraceCheckUtils]: 11: Hoare triple {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,602 INFO L273 TraceCheckUtils]: 12: Hoare triple {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,603 INFO L273 TraceCheckUtils]: 13: Hoare triple {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,604 INFO L273 TraceCheckUtils]: 14: Hoare triple {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,604 INFO L273 TraceCheckUtils]: 15: Hoare triple {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,605 INFO L273 TraceCheckUtils]: 16: Hoare triple {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,606 INFO L273 TraceCheckUtils]: 17: Hoare triple {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,606 INFO L273 TraceCheckUtils]: 18: Hoare triple {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,607 INFO L273 TraceCheckUtils]: 19: Hoare triple {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,608 INFO L273 TraceCheckUtils]: 20: Hoare triple {5613#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~i~0 := ~i~0 + 1; {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,609 INFO L273 TraceCheckUtils]: 21: Hoare triple {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,610 INFO L273 TraceCheckUtils]: 22: Hoare triple {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0; {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,611 INFO L273 TraceCheckUtils]: 23: Hoare triple {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,612 INFO L273 TraceCheckUtils]: 24: Hoare triple {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,613 INFO L273 TraceCheckUtils]: 25: Hoare triple {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,614 INFO L273 TraceCheckUtils]: 26: Hoare triple {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,615 INFO L273 TraceCheckUtils]: 27: Hoare triple {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,616 INFO L273 TraceCheckUtils]: 28: Hoare triple {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,616 INFO L273 TraceCheckUtils]: 29: Hoare triple {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,618 INFO L273 TraceCheckUtils]: 30: Hoare triple {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,618 INFO L273 TraceCheckUtils]: 31: Hoare triple {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,619 INFO L273 TraceCheckUtils]: 32: Hoare triple {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,620 INFO L273 TraceCheckUtils]: 33: Hoare triple {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,621 INFO L273 TraceCheckUtils]: 34: Hoare triple {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,622 INFO L273 TraceCheckUtils]: 35: Hoare triple {5659#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} ~i~0 := ~i~0 + 1; {5705#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,623 INFO L273 TraceCheckUtils]: 36: Hoare triple {5705#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} assume true; {5705#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} is VALID [2018-11-14 19:00:02,624 INFO L273 TraceCheckUtils]: 37: Hoare triple {5705#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {5594#false} is VALID [2018-11-14 19:00:02,624 INFO L273 TraceCheckUtils]: 38: Hoare triple {5594#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 0 * (~n~0 * 4) + 0, 4);~max~0 := #t~mem1;havoc #t~mem1; {5594#false} is VALID [2018-11-14 19:00:02,625 INFO L273 TraceCheckUtils]: 39: Hoare triple {5594#false} assume true; {5594#false} is VALID [2018-11-14 19:00:02,625 INFO L273 TraceCheckUtils]: 40: Hoare triple {5594#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {5594#false} is VALID [2018-11-14 19:00:02,625 INFO L273 TraceCheckUtils]: 41: Hoare triple {5594#false} assume true; {5594#false} is VALID [2018-11-14 19:00:02,625 INFO L273 TraceCheckUtils]: 42: Hoare triple {5594#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {5594#false} is VALID [2018-11-14 19:00:02,626 INFO L273 TraceCheckUtils]: 43: Hoare triple {5594#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {5594#false} is VALID [2018-11-14 19:00:02,626 INFO L273 TraceCheckUtils]: 44: Hoare triple {5594#false} ~j~0 := ~j~0 + 1; {5594#false} is VALID [2018-11-14 19:00:02,626 INFO L273 TraceCheckUtils]: 45: Hoare triple {5594#false} assume true; {5594#false} is VALID [2018-11-14 19:00:02,627 INFO L273 TraceCheckUtils]: 46: Hoare triple {5594#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {5594#false} is VALID [2018-11-14 19:00:02,627 INFO L273 TraceCheckUtils]: 47: Hoare triple {5594#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {5594#false} is VALID [2018-11-14 19:00:02,627 INFO L273 TraceCheckUtils]: 48: Hoare triple {5594#false} ~j~0 := ~j~0 + 1; {5594#false} is VALID [2018-11-14 19:00:02,627 INFO L273 TraceCheckUtils]: 49: Hoare triple {5594#false} assume true; {5594#false} is VALID [2018-11-14 19:00:02,627 INFO L273 TraceCheckUtils]: 50: Hoare triple {5594#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {5594#false} is VALID [2018-11-14 19:00:02,627 INFO L273 TraceCheckUtils]: 51: Hoare triple {5594#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {5594#false} is VALID [2018-11-14 19:00:02,628 INFO L273 TraceCheckUtils]: 52: Hoare triple {5594#false} ~j~0 := ~j~0 + 1; {5594#false} is VALID [2018-11-14 19:00:02,628 INFO L273 TraceCheckUtils]: 53: Hoare triple {5594#false} assume true; {5594#false} is VALID [2018-11-14 19:00:02,628 INFO L273 TraceCheckUtils]: 54: Hoare triple {5594#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {5594#false} is VALID [2018-11-14 19:00:02,628 INFO L273 TraceCheckUtils]: 55: Hoare triple {5594#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {5594#false} is VALID [2018-11-14 19:00:02,628 INFO L273 TraceCheckUtils]: 56: Hoare triple {5594#false} ~j~0 := ~j~0 + 1; {5594#false} is VALID [2018-11-14 19:00:02,628 INFO L273 TraceCheckUtils]: 57: Hoare triple {5594#false} assume true; {5594#false} is VALID [2018-11-14 19:00:02,629 INFO L273 TraceCheckUtils]: 58: Hoare triple {5594#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {5594#false} is VALID [2018-11-14 19:00:02,629 INFO L273 TraceCheckUtils]: 59: Hoare triple {5594#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {5594#false} is VALID [2018-11-14 19:00:02,629 INFO L273 TraceCheckUtils]: 60: Hoare triple {5594#false} ~j~0 := ~j~0 + 1; {5594#false} is VALID [2018-11-14 19:00:02,629 INFO L273 TraceCheckUtils]: 61: Hoare triple {5594#false} assume true; {5594#false} is VALID [2018-11-14 19:00:02,629 INFO L273 TraceCheckUtils]: 62: Hoare triple {5594#false} assume !(~j~0 < ~n~0); {5594#false} is VALID [2018-11-14 19:00:02,629 INFO L273 TraceCheckUtils]: 63: Hoare triple {5594#false} ~i~0 := ~i~0 + 1; {5594#false} is VALID [2018-11-14 19:00:02,630 INFO L273 TraceCheckUtils]: 64: Hoare triple {5594#false} assume true; {5594#false} is VALID [2018-11-14 19:00:02,630 INFO L273 TraceCheckUtils]: 65: Hoare triple {5594#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {5594#false} is VALID [2018-11-14 19:00:02,630 INFO L273 TraceCheckUtils]: 66: Hoare triple {5594#false} assume true; {5594#false} is VALID [2018-11-14 19:00:02,630 INFO L273 TraceCheckUtils]: 67: Hoare triple {5594#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {5594#false} is VALID [2018-11-14 19:00:02,630 INFO L273 TraceCheckUtils]: 68: Hoare triple {5594#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {5594#false} is VALID [2018-11-14 19:00:02,630 INFO L273 TraceCheckUtils]: 69: Hoare triple {5594#false} ~j~0 := ~j~0 + 1; {5594#false} is VALID [2018-11-14 19:00:02,631 INFO L273 TraceCheckUtils]: 70: Hoare triple {5594#false} assume true; {5594#false} is VALID [2018-11-14 19:00:02,631 INFO L273 TraceCheckUtils]: 71: Hoare triple {5594#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {5594#false} is VALID [2018-11-14 19:00:02,631 INFO L273 TraceCheckUtils]: 72: Hoare triple {5594#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {5594#false} is VALID [2018-11-14 19:00:02,631 INFO L273 TraceCheckUtils]: 73: Hoare triple {5594#false} ~j~0 := ~j~0 + 1; {5594#false} is VALID [2018-11-14 19:00:02,631 INFO L273 TraceCheckUtils]: 74: Hoare triple {5594#false} assume true; {5594#false} is VALID [2018-11-14 19:00:02,632 INFO L273 TraceCheckUtils]: 75: Hoare triple {5594#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {5594#false} is VALID [2018-11-14 19:00:02,632 INFO L273 TraceCheckUtils]: 76: Hoare triple {5594#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {5594#false} is VALID [2018-11-14 19:00:02,632 INFO L273 TraceCheckUtils]: 77: Hoare triple {5594#false} ~j~0 := ~j~0 + 1; {5594#false} is VALID [2018-11-14 19:00:02,632 INFO L273 TraceCheckUtils]: 78: Hoare triple {5594#false} assume true; {5594#false} is VALID [2018-11-14 19:00:02,632 INFO L273 TraceCheckUtils]: 79: Hoare triple {5594#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {5594#false} is VALID [2018-11-14 19:00:02,632 INFO L273 TraceCheckUtils]: 80: Hoare triple {5594#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {5594#false} is VALID [2018-11-14 19:00:02,633 INFO L273 TraceCheckUtils]: 81: Hoare triple {5594#false} ~j~0 := ~j~0 + 1; {5594#false} is VALID [2018-11-14 19:00:02,633 INFO L273 TraceCheckUtils]: 82: Hoare triple {5594#false} assume true; {5594#false} is VALID [2018-11-14 19:00:02,633 INFO L273 TraceCheckUtils]: 83: Hoare triple {5594#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {5594#false} is VALID [2018-11-14 19:00:02,633 INFO L273 TraceCheckUtils]: 84: Hoare triple {5594#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {5594#false} is VALID [2018-11-14 19:00:02,633 INFO L273 TraceCheckUtils]: 85: Hoare triple {5594#false} ~j~0 := ~j~0 + 1; {5594#false} is VALID [2018-11-14 19:00:02,633 INFO L273 TraceCheckUtils]: 86: Hoare triple {5594#false} assume true; {5594#false} is VALID [2018-11-14 19:00:02,634 INFO L273 TraceCheckUtils]: 87: Hoare triple {5594#false} assume !(~j~0 < ~n~0); {5594#false} is VALID [2018-11-14 19:00:02,634 INFO L273 TraceCheckUtils]: 88: Hoare triple {5594#false} ~i~0 := ~i~0 + 1; {5594#false} is VALID [2018-11-14 19:00:02,634 INFO L273 TraceCheckUtils]: 89: Hoare triple {5594#false} assume true; {5594#false} is VALID [2018-11-14 19:00:02,634 INFO L273 TraceCheckUtils]: 90: Hoare triple {5594#false} assume !(~i~0 < ~n~0); {5594#false} is VALID [2018-11-14 19:00:02,634 INFO L273 TraceCheckUtils]: 91: Hoare triple {5594#false} ~i~0 := 0;~j~0 := 0; {5594#false} is VALID [2018-11-14 19:00:02,634 INFO L273 TraceCheckUtils]: 92: Hoare triple {5594#false} assume true; {5594#false} is VALID [2018-11-14 19:00:02,635 INFO L273 TraceCheckUtils]: 93: Hoare triple {5594#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {5594#false} is VALID [2018-11-14 19:00:02,635 INFO L273 TraceCheckUtils]: 94: Hoare triple {5594#false} assume true; {5594#false} is VALID [2018-11-14 19:00:02,635 INFO L273 TraceCheckUtils]: 95: Hoare triple {5594#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {5594#false} is VALID [2018-11-14 19:00:02,636 INFO L256 TraceCheckUtils]: 96: Hoare triple {5594#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {5594#false} is VALID [2018-11-14 19:00:02,636 INFO L273 TraceCheckUtils]: 97: Hoare triple {5594#false} ~cond := #in~cond; {5594#false} is VALID [2018-11-14 19:00:02,636 INFO L273 TraceCheckUtils]: 98: Hoare triple {5594#false} assume ~cond == 0; {5594#false} is VALID [2018-11-14 19:00:02,636 INFO L273 TraceCheckUtils]: 99: Hoare triple {5594#false} assume !false; {5594#false} is VALID [2018-11-14 19:00:02,649 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2018-11-14 19:00:02,669 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:00:02,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-14 19:00:02,670 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-11-14 19:00:02,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:00:02,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 19:00:02,709 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:00:02,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 19:00:02,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 19:00:02,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:00:02,711 INFO L87 Difference]: Start difference. First operand 123 states and 144 transitions. Second operand 5 states. [2018-11-14 19:00:03,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:00:03,178 INFO L93 Difference]: Finished difference Result 236 states and 278 transitions. [2018-11-14 19:00:03,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 19:00:03,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-11-14 19:00:03,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:00:03,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:00:03,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2018-11-14 19:00:03,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 19:00:03,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 84 transitions. [2018-11-14 19:00:03,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 84 transitions. [2018-11-14 19:00:04,217 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:00:04,222 INFO L225 Difference]: With dead ends: 236 [2018-11-14 19:00:04,222 INFO L226 Difference]: Without dead ends: 151 [2018-11-14 19:00:04,223 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 19:00:04,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-14 19:00:04,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 138. [2018-11-14 19:00:04,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:00:04,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand 138 states. [2018-11-14 19:00:04,909 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 138 states. [2018-11-14 19:00:04,909 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 138 states. [2018-11-14 19:00:04,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:00:04,913 INFO L93 Difference]: Finished difference Result 151 states and 174 transitions. [2018-11-14 19:00:04,913 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 174 transitions. [2018-11-14 19:00:04,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:00:04,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:00:04,914 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 151 states. [2018-11-14 19:00:04,914 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 151 states. [2018-11-14 19:00:04,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:00:04,918 INFO L93 Difference]: Finished difference Result 151 states and 174 transitions. [2018-11-14 19:00:04,918 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 174 transitions. [2018-11-14 19:00:04,919 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:00:04,919 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:00:04,919 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:00:04,919 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:00:04,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-14 19:00:04,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 160 transitions. [2018-11-14 19:00:04,923 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 160 transitions. Word has length 100 [2018-11-14 19:00:04,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:00:04,923 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 160 transitions. [2018-11-14 19:00:04,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 19:00:04,923 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 160 transitions. [2018-11-14 19:00:04,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-11-14 19:00:04,924 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:00:04,925 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 12, 10, 10, 10, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:00:04,925 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:00:04,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:00:04,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1334828766, now seen corresponding path program 7 times [2018-11-14 19:00:04,925 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:00:04,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:00:04,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:00:04,926 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:00:04,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:00:04,932 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:00:04,933 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:00:04,933 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 19:00:04,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:00:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:00:05,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:00:05,035 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:00:05,584 INFO L256 TraceCheckUtils]: 0: Hoare triple {6715#true} call ULTIMATE.init(); {6715#true} is VALID [2018-11-14 19:00:05,585 INFO L273 TraceCheckUtils]: 1: Hoare triple {6715#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6715#true} is VALID [2018-11-14 19:00:05,585 INFO L273 TraceCheckUtils]: 2: Hoare triple {6715#true} assume true; {6715#true} is VALID [2018-11-14 19:00:05,586 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6715#true} {6715#true} #112#return; {6715#true} is VALID [2018-11-14 19:00:05,586 INFO L256 TraceCheckUtils]: 4: Hoare triple {6715#true} call #t~ret5 := main(); {6715#true} is VALID [2018-11-14 19:00:05,587 INFO L273 TraceCheckUtils]: 5: Hoare triple {6715#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {6735#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:05,587 INFO L273 TraceCheckUtils]: 6: Hoare triple {6735#(<= 1500 main_~n~0)} assume true; {6735#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:05,588 INFO L273 TraceCheckUtils]: 7: Hoare triple {6735#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {6742#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:00:05,589 INFO L273 TraceCheckUtils]: 8: Hoare triple {6742#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {6742#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:00:05,603 INFO L273 TraceCheckUtils]: 9: Hoare triple {6742#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {6749#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 19:00:05,604 INFO L273 TraceCheckUtils]: 10: Hoare triple {6749#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {6749#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 19:00:05,605 INFO L273 TraceCheckUtils]: 11: Hoare triple {6749#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {6756#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 19:00:05,605 INFO L273 TraceCheckUtils]: 12: Hoare triple {6756#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {6756#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 19:00:05,606 INFO L273 TraceCheckUtils]: 13: Hoare triple {6756#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {6763#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-14 19:00:05,606 INFO L273 TraceCheckUtils]: 14: Hoare triple {6763#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume true; {6763#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-14 19:00:05,607 INFO L273 TraceCheckUtils]: 15: Hoare triple {6763#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {6770#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-14 19:00:05,608 INFO L273 TraceCheckUtils]: 16: Hoare triple {6770#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume true; {6770#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-14 19:00:05,609 INFO L273 TraceCheckUtils]: 17: Hoare triple {6770#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {6777#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-14 19:00:05,610 INFO L273 TraceCheckUtils]: 18: Hoare triple {6777#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume true; {6777#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-14 19:00:05,610 INFO L273 TraceCheckUtils]: 19: Hoare triple {6777#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume !(~j~0 < ~n~0); {6716#false} is VALID [2018-11-14 19:00:05,611 INFO L273 TraceCheckUtils]: 20: Hoare triple {6716#false} ~i~0 := ~i~0 + 1; {6716#false} is VALID [2018-11-14 19:00:05,611 INFO L273 TraceCheckUtils]: 21: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,611 INFO L273 TraceCheckUtils]: 22: Hoare triple {6716#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {6716#false} is VALID [2018-11-14 19:00:05,611 INFO L273 TraceCheckUtils]: 23: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,612 INFO L273 TraceCheckUtils]: 24: Hoare triple {6716#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {6716#false} is VALID [2018-11-14 19:00:05,612 INFO L273 TraceCheckUtils]: 25: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,612 INFO L273 TraceCheckUtils]: 26: Hoare triple {6716#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {6716#false} is VALID [2018-11-14 19:00:05,612 INFO L273 TraceCheckUtils]: 27: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,612 INFO L273 TraceCheckUtils]: 28: Hoare triple {6716#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {6716#false} is VALID [2018-11-14 19:00:05,612 INFO L273 TraceCheckUtils]: 29: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,613 INFO L273 TraceCheckUtils]: 30: Hoare triple {6716#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {6716#false} is VALID [2018-11-14 19:00:05,613 INFO L273 TraceCheckUtils]: 31: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,613 INFO L273 TraceCheckUtils]: 32: Hoare triple {6716#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {6716#false} is VALID [2018-11-14 19:00:05,613 INFO L273 TraceCheckUtils]: 33: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,613 INFO L273 TraceCheckUtils]: 34: Hoare triple {6716#false} assume !(~j~0 < ~n~0); {6716#false} is VALID [2018-11-14 19:00:05,613 INFO L273 TraceCheckUtils]: 35: Hoare triple {6716#false} ~i~0 := ~i~0 + 1; {6716#false} is VALID [2018-11-14 19:00:05,613 INFO L273 TraceCheckUtils]: 36: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,613 INFO L273 TraceCheckUtils]: 37: Hoare triple {6716#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {6716#false} is VALID [2018-11-14 19:00:05,614 INFO L273 TraceCheckUtils]: 38: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,614 INFO L273 TraceCheckUtils]: 39: Hoare triple {6716#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {6716#false} is VALID [2018-11-14 19:00:05,614 INFO L273 TraceCheckUtils]: 40: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,614 INFO L273 TraceCheckUtils]: 41: Hoare triple {6716#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {6716#false} is VALID [2018-11-14 19:00:05,614 INFO L273 TraceCheckUtils]: 42: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,614 INFO L273 TraceCheckUtils]: 43: Hoare triple {6716#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {6716#false} is VALID [2018-11-14 19:00:05,614 INFO L273 TraceCheckUtils]: 44: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,614 INFO L273 TraceCheckUtils]: 45: Hoare triple {6716#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {6716#false} is VALID [2018-11-14 19:00:05,615 INFO L273 TraceCheckUtils]: 46: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,615 INFO L273 TraceCheckUtils]: 47: Hoare triple {6716#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {6716#false} is VALID [2018-11-14 19:00:05,615 INFO L273 TraceCheckUtils]: 48: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,615 INFO L273 TraceCheckUtils]: 49: Hoare triple {6716#false} assume !(~j~0 < ~n~0); {6716#false} is VALID [2018-11-14 19:00:05,615 INFO L273 TraceCheckUtils]: 50: Hoare triple {6716#false} ~i~0 := ~i~0 + 1; {6716#false} is VALID [2018-11-14 19:00:05,615 INFO L273 TraceCheckUtils]: 51: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,615 INFO L273 TraceCheckUtils]: 52: Hoare triple {6716#false} assume !(~i~0 < ~m~0); {6716#false} is VALID [2018-11-14 19:00:05,615 INFO L273 TraceCheckUtils]: 53: Hoare triple {6716#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 0 * (~n~0 * 4) + 0, 4);~max~0 := #t~mem1;havoc #t~mem1; {6716#false} is VALID [2018-11-14 19:00:05,616 INFO L273 TraceCheckUtils]: 54: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,616 INFO L273 TraceCheckUtils]: 55: Hoare triple {6716#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {6716#false} is VALID [2018-11-14 19:00:05,616 INFO L273 TraceCheckUtils]: 56: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,616 INFO L273 TraceCheckUtils]: 57: Hoare triple {6716#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {6716#false} is VALID [2018-11-14 19:00:05,616 INFO L273 TraceCheckUtils]: 58: Hoare triple {6716#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {6716#false} is VALID [2018-11-14 19:00:05,616 INFO L273 TraceCheckUtils]: 59: Hoare triple {6716#false} ~j~0 := ~j~0 + 1; {6716#false} is VALID [2018-11-14 19:00:05,616 INFO L273 TraceCheckUtils]: 60: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,616 INFO L273 TraceCheckUtils]: 61: Hoare triple {6716#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {6716#false} is VALID [2018-11-14 19:00:05,617 INFO L273 TraceCheckUtils]: 62: Hoare triple {6716#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {6716#false} is VALID [2018-11-14 19:00:05,617 INFO L273 TraceCheckUtils]: 63: Hoare triple {6716#false} ~j~0 := ~j~0 + 1; {6716#false} is VALID [2018-11-14 19:00:05,617 INFO L273 TraceCheckUtils]: 64: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,617 INFO L273 TraceCheckUtils]: 65: Hoare triple {6716#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {6716#false} is VALID [2018-11-14 19:00:05,617 INFO L273 TraceCheckUtils]: 66: Hoare triple {6716#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {6716#false} is VALID [2018-11-14 19:00:05,617 INFO L273 TraceCheckUtils]: 67: Hoare triple {6716#false} ~j~0 := ~j~0 + 1; {6716#false} is VALID [2018-11-14 19:00:05,617 INFO L273 TraceCheckUtils]: 68: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,617 INFO L273 TraceCheckUtils]: 69: Hoare triple {6716#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {6716#false} is VALID [2018-11-14 19:00:05,618 INFO L273 TraceCheckUtils]: 70: Hoare triple {6716#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {6716#false} is VALID [2018-11-14 19:00:05,618 INFO L273 TraceCheckUtils]: 71: Hoare triple {6716#false} ~j~0 := ~j~0 + 1; {6716#false} is VALID [2018-11-14 19:00:05,618 INFO L273 TraceCheckUtils]: 72: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,618 INFO L273 TraceCheckUtils]: 73: Hoare triple {6716#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {6716#false} is VALID [2018-11-14 19:00:05,618 INFO L273 TraceCheckUtils]: 74: Hoare triple {6716#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {6716#false} is VALID [2018-11-14 19:00:05,618 INFO L273 TraceCheckUtils]: 75: Hoare triple {6716#false} ~j~0 := ~j~0 + 1; {6716#false} is VALID [2018-11-14 19:00:05,618 INFO L273 TraceCheckUtils]: 76: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,618 INFO L273 TraceCheckUtils]: 77: Hoare triple {6716#false} assume !(~j~0 < ~n~0); {6716#false} is VALID [2018-11-14 19:00:05,619 INFO L273 TraceCheckUtils]: 78: Hoare triple {6716#false} ~i~0 := ~i~0 + 1; {6716#false} is VALID [2018-11-14 19:00:05,619 INFO L273 TraceCheckUtils]: 79: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,619 INFO L273 TraceCheckUtils]: 80: Hoare triple {6716#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {6716#false} is VALID [2018-11-14 19:00:05,619 INFO L273 TraceCheckUtils]: 81: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,619 INFO L273 TraceCheckUtils]: 82: Hoare triple {6716#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {6716#false} is VALID [2018-11-14 19:00:05,619 INFO L273 TraceCheckUtils]: 83: Hoare triple {6716#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {6716#false} is VALID [2018-11-14 19:00:05,619 INFO L273 TraceCheckUtils]: 84: Hoare triple {6716#false} ~j~0 := ~j~0 + 1; {6716#false} is VALID [2018-11-14 19:00:05,619 INFO L273 TraceCheckUtils]: 85: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,620 INFO L273 TraceCheckUtils]: 86: Hoare triple {6716#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {6716#false} is VALID [2018-11-14 19:00:05,620 INFO L273 TraceCheckUtils]: 87: Hoare triple {6716#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {6716#false} is VALID [2018-11-14 19:00:05,620 INFO L273 TraceCheckUtils]: 88: Hoare triple {6716#false} ~j~0 := ~j~0 + 1; {6716#false} is VALID [2018-11-14 19:00:05,620 INFO L273 TraceCheckUtils]: 89: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,620 INFO L273 TraceCheckUtils]: 90: Hoare triple {6716#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {6716#false} is VALID [2018-11-14 19:00:05,620 INFO L273 TraceCheckUtils]: 91: Hoare triple {6716#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {6716#false} is VALID [2018-11-14 19:00:05,620 INFO L273 TraceCheckUtils]: 92: Hoare triple {6716#false} ~j~0 := ~j~0 + 1; {6716#false} is VALID [2018-11-14 19:00:05,620 INFO L273 TraceCheckUtils]: 93: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,621 INFO L273 TraceCheckUtils]: 94: Hoare triple {6716#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {6716#false} is VALID [2018-11-14 19:00:05,621 INFO L273 TraceCheckUtils]: 95: Hoare triple {6716#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {6716#false} is VALID [2018-11-14 19:00:05,621 INFO L273 TraceCheckUtils]: 96: Hoare triple {6716#false} ~j~0 := ~j~0 + 1; {6716#false} is VALID [2018-11-14 19:00:05,621 INFO L273 TraceCheckUtils]: 97: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,621 INFO L273 TraceCheckUtils]: 98: Hoare triple {6716#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {6716#false} is VALID [2018-11-14 19:00:05,621 INFO L273 TraceCheckUtils]: 99: Hoare triple {6716#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {6716#false} is VALID [2018-11-14 19:00:05,621 INFO L273 TraceCheckUtils]: 100: Hoare triple {6716#false} ~j~0 := ~j~0 + 1; {6716#false} is VALID [2018-11-14 19:00:05,621 INFO L273 TraceCheckUtils]: 101: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,622 INFO L273 TraceCheckUtils]: 102: Hoare triple {6716#false} assume !(~j~0 < ~n~0); {6716#false} is VALID [2018-11-14 19:00:05,622 INFO L273 TraceCheckUtils]: 103: Hoare triple {6716#false} ~i~0 := ~i~0 + 1; {6716#false} is VALID [2018-11-14 19:00:05,622 INFO L273 TraceCheckUtils]: 104: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,622 INFO L273 TraceCheckUtils]: 105: Hoare triple {6716#false} assume !(~i~0 < ~n~0); {6716#false} is VALID [2018-11-14 19:00:05,622 INFO L273 TraceCheckUtils]: 106: Hoare triple {6716#false} ~i~0 := 0;~j~0 := 0; {6716#false} is VALID [2018-11-14 19:00:05,622 INFO L273 TraceCheckUtils]: 107: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,622 INFO L273 TraceCheckUtils]: 108: Hoare triple {6716#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {6716#false} is VALID [2018-11-14 19:00:05,622 INFO L273 TraceCheckUtils]: 109: Hoare triple {6716#false} assume true; {6716#false} is VALID [2018-11-14 19:00:05,623 INFO L273 TraceCheckUtils]: 110: Hoare triple {6716#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {6716#false} is VALID [2018-11-14 19:00:05,623 INFO L256 TraceCheckUtils]: 111: Hoare triple {6716#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {6716#false} is VALID [2018-11-14 19:00:05,623 INFO L273 TraceCheckUtils]: 112: Hoare triple {6716#false} ~cond := #in~cond; {6716#false} is VALID [2018-11-14 19:00:05,623 INFO L273 TraceCheckUtils]: 113: Hoare triple {6716#false} assume ~cond == 0; {6716#false} is VALID [2018-11-14 19:00:05,623 INFO L273 TraceCheckUtils]: 114: Hoare triple {6716#false} assume !false; {6716#false} is VALID [2018-11-14 19:00:05,630 INFO L134 CoverageAnalysis]: Checked inductivity of 550 backedges. 150 proven. 30 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2018-11-14 19:00:05,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:00:05,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-14 19:00:05,651 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2018-11-14 19:00:05,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:00:05,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 19:00:05,693 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:00:05,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 19:00:05,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 19:00:05,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 19:00:05,695 INFO L87 Difference]: Start difference. First operand 138 states and 160 transitions. Second operand 9 states. [2018-11-14 19:00:06,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:00:06,920 INFO L93 Difference]: Finished difference Result 282 states and 337 transitions. [2018-11-14 19:00:06,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 19:00:06,921 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 115 [2018-11-14 19:00:06,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:00:06,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 19:00:06,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2018-11-14 19:00:06,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 19:00:06,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 153 transitions. [2018-11-14 19:00:06,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 153 transitions. [2018-11-14 19:00:07,547 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:00:07,552 INFO L225 Difference]: With dead ends: 282 [2018-11-14 19:00:07,552 INFO L226 Difference]: Without dead ends: 164 [2018-11-14 19:00:07,553 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-14 19:00:07,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-11-14 19:00:07,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 156. [2018-11-14 19:00:07,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:00:07,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand 156 states. [2018-11-14 19:00:07,743 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand 156 states. [2018-11-14 19:00:07,744 INFO L87 Difference]: Start difference. First operand 164 states. Second operand 156 states. [2018-11-14 19:00:07,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:00:07,749 INFO L93 Difference]: Finished difference Result 164 states and 192 transitions. [2018-11-14 19:00:07,750 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 192 transitions. [2018-11-14 19:00:07,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:00:07,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:00:07,751 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 164 states. [2018-11-14 19:00:07,751 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 164 states. [2018-11-14 19:00:07,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:00:07,757 INFO L93 Difference]: Finished difference Result 164 states and 192 transitions. [2018-11-14 19:00:07,757 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 192 transitions. [2018-11-14 19:00:07,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:00:07,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:00:07,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:00:07,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:00:07,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-14 19:00:07,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 181 transitions. [2018-11-14 19:00:07,764 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 181 transitions. Word has length 115 [2018-11-14 19:00:07,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:00:07,764 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 181 transitions. [2018-11-14 19:00:07,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 19:00:07,765 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 181 transitions. [2018-11-14 19:00:07,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-14 19:00:07,766 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:00:07,766 INFO L375 BasicCegarLoop]: trace histogram [21, 18, 14, 12, 12, 12, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:00:07,767 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:00:07,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:00:07,767 INFO L82 PathProgramCache]: Analyzing trace with hash 331942524, now seen corresponding path program 8 times [2018-11-14 19:00:07,767 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:00:07,767 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:00:07,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:00:07,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 19:00:07,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:00:07,775 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:00:07,775 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:00:07,775 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 19:00:07,798 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 19:00:07,854 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 19:00:07,855 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:00:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:00:07,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:00:08,490 INFO L256 TraceCheckUtils]: 0: Hoare triple {8001#true} call ULTIMATE.init(); {8001#true} is VALID [2018-11-14 19:00:08,490 INFO L273 TraceCheckUtils]: 1: Hoare triple {8001#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8001#true} is VALID [2018-11-14 19:00:08,490 INFO L273 TraceCheckUtils]: 2: Hoare triple {8001#true} assume true; {8001#true} is VALID [2018-11-14 19:00:08,491 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8001#true} {8001#true} #112#return; {8001#true} is VALID [2018-11-14 19:00:08,491 INFO L256 TraceCheckUtils]: 4: Hoare triple {8001#true} call #t~ret5 := main(); {8001#true} is VALID [2018-11-14 19:00:08,492 INFO L273 TraceCheckUtils]: 5: Hoare triple {8001#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {8021#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:08,492 INFO L273 TraceCheckUtils]: 6: Hoare triple {8021#(<= 1500 main_~n~0)} assume true; {8021#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:08,493 INFO L273 TraceCheckUtils]: 7: Hoare triple {8021#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {8028#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:00:08,493 INFO L273 TraceCheckUtils]: 8: Hoare triple {8028#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {8028#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 19:00:08,495 INFO L273 TraceCheckUtils]: 9: Hoare triple {8028#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {8035#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 19:00:08,495 INFO L273 TraceCheckUtils]: 10: Hoare triple {8035#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {8035#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-14 19:00:08,497 INFO L273 TraceCheckUtils]: 11: Hoare triple {8035#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {8042#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 19:00:08,497 INFO L273 TraceCheckUtils]: 12: Hoare triple {8042#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {8042#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 19:00:08,498 INFO L273 TraceCheckUtils]: 13: Hoare triple {8042#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {8049#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-14 19:00:08,499 INFO L273 TraceCheckUtils]: 14: Hoare triple {8049#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume true; {8049#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-14 19:00:08,500 INFO L273 TraceCheckUtils]: 15: Hoare triple {8049#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {8056#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-14 19:00:08,501 INFO L273 TraceCheckUtils]: 16: Hoare triple {8056#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume true; {8056#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-14 19:00:08,502 INFO L273 TraceCheckUtils]: 17: Hoare triple {8056#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {8063#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-14 19:00:08,503 INFO L273 TraceCheckUtils]: 18: Hoare triple {8063#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume true; {8063#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-14 19:00:08,504 INFO L273 TraceCheckUtils]: 19: Hoare triple {8063#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {8070#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-14 19:00:08,505 INFO L273 TraceCheckUtils]: 20: Hoare triple {8070#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume true; {8070#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-14 19:00:08,516 INFO L273 TraceCheckUtils]: 21: Hoare triple {8070#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume !(~j~0 < ~n~0); {8002#false} is VALID [2018-11-14 19:00:08,516 INFO L273 TraceCheckUtils]: 22: Hoare triple {8002#false} ~i~0 := ~i~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,516 INFO L273 TraceCheckUtils]: 23: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,517 INFO L273 TraceCheckUtils]: 24: Hoare triple {8002#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {8002#false} is VALID [2018-11-14 19:00:08,517 INFO L273 TraceCheckUtils]: 25: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,517 INFO L273 TraceCheckUtils]: 26: Hoare triple {8002#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,517 INFO L273 TraceCheckUtils]: 27: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,517 INFO L273 TraceCheckUtils]: 28: Hoare triple {8002#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,517 INFO L273 TraceCheckUtils]: 29: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,517 INFO L273 TraceCheckUtils]: 30: Hoare triple {8002#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,517 INFO L273 TraceCheckUtils]: 31: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,518 INFO L273 TraceCheckUtils]: 32: Hoare triple {8002#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,518 INFO L273 TraceCheckUtils]: 33: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,518 INFO L273 TraceCheckUtils]: 34: Hoare triple {8002#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,518 INFO L273 TraceCheckUtils]: 35: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,518 INFO L273 TraceCheckUtils]: 36: Hoare triple {8002#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,519 INFO L273 TraceCheckUtils]: 37: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,519 INFO L273 TraceCheckUtils]: 38: Hoare triple {8002#false} assume !(~j~0 < ~n~0); {8002#false} is VALID [2018-11-14 19:00:08,519 INFO L273 TraceCheckUtils]: 39: Hoare triple {8002#false} ~i~0 := ~i~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,519 INFO L273 TraceCheckUtils]: 40: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,519 INFO L273 TraceCheckUtils]: 41: Hoare triple {8002#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {8002#false} is VALID [2018-11-14 19:00:08,519 INFO L273 TraceCheckUtils]: 42: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,520 INFO L273 TraceCheckUtils]: 43: Hoare triple {8002#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,520 INFO L273 TraceCheckUtils]: 44: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,520 INFO L273 TraceCheckUtils]: 45: Hoare triple {8002#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,520 INFO L273 TraceCheckUtils]: 46: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,520 INFO L273 TraceCheckUtils]: 47: Hoare triple {8002#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,521 INFO L273 TraceCheckUtils]: 48: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,521 INFO L273 TraceCheckUtils]: 49: Hoare triple {8002#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,521 INFO L273 TraceCheckUtils]: 50: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,521 INFO L273 TraceCheckUtils]: 51: Hoare triple {8002#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,521 INFO L273 TraceCheckUtils]: 52: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,521 INFO L273 TraceCheckUtils]: 53: Hoare triple {8002#false} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,522 INFO L273 TraceCheckUtils]: 54: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,522 INFO L273 TraceCheckUtils]: 55: Hoare triple {8002#false} assume !(~j~0 < ~n~0); {8002#false} is VALID [2018-11-14 19:00:08,522 INFO L273 TraceCheckUtils]: 56: Hoare triple {8002#false} ~i~0 := ~i~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,522 INFO L273 TraceCheckUtils]: 57: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,522 INFO L273 TraceCheckUtils]: 58: Hoare triple {8002#false} assume !(~i~0 < ~m~0); {8002#false} is VALID [2018-11-14 19:00:08,522 INFO L273 TraceCheckUtils]: 59: Hoare triple {8002#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 0 * (~n~0 * 4) + 0, 4);~max~0 := #t~mem1;havoc #t~mem1; {8002#false} is VALID [2018-11-14 19:00:08,523 INFO L273 TraceCheckUtils]: 60: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,523 INFO L273 TraceCheckUtils]: 61: Hoare triple {8002#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {8002#false} is VALID [2018-11-14 19:00:08,523 INFO L273 TraceCheckUtils]: 62: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,523 INFO L273 TraceCheckUtils]: 63: Hoare triple {8002#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {8002#false} is VALID [2018-11-14 19:00:08,523 INFO L273 TraceCheckUtils]: 64: Hoare triple {8002#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {8002#false} is VALID [2018-11-14 19:00:08,523 INFO L273 TraceCheckUtils]: 65: Hoare triple {8002#false} ~j~0 := ~j~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,524 INFO L273 TraceCheckUtils]: 66: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,524 INFO L273 TraceCheckUtils]: 67: Hoare triple {8002#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {8002#false} is VALID [2018-11-14 19:00:08,524 INFO L273 TraceCheckUtils]: 68: Hoare triple {8002#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {8002#false} is VALID [2018-11-14 19:00:08,524 INFO L273 TraceCheckUtils]: 69: Hoare triple {8002#false} ~j~0 := ~j~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,524 INFO L273 TraceCheckUtils]: 70: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,525 INFO L273 TraceCheckUtils]: 71: Hoare triple {8002#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {8002#false} is VALID [2018-11-14 19:00:08,525 INFO L273 TraceCheckUtils]: 72: Hoare triple {8002#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {8002#false} is VALID [2018-11-14 19:00:08,525 INFO L273 TraceCheckUtils]: 73: Hoare triple {8002#false} ~j~0 := ~j~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,525 INFO L273 TraceCheckUtils]: 74: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,525 INFO L273 TraceCheckUtils]: 75: Hoare triple {8002#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {8002#false} is VALID [2018-11-14 19:00:08,525 INFO L273 TraceCheckUtils]: 76: Hoare triple {8002#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {8002#false} is VALID [2018-11-14 19:00:08,526 INFO L273 TraceCheckUtils]: 77: Hoare triple {8002#false} ~j~0 := ~j~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,526 INFO L273 TraceCheckUtils]: 78: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,526 INFO L273 TraceCheckUtils]: 79: Hoare triple {8002#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {8002#false} is VALID [2018-11-14 19:00:08,526 INFO L273 TraceCheckUtils]: 80: Hoare triple {8002#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {8002#false} is VALID [2018-11-14 19:00:08,526 INFO L273 TraceCheckUtils]: 81: Hoare triple {8002#false} ~j~0 := ~j~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,526 INFO L273 TraceCheckUtils]: 82: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,527 INFO L273 TraceCheckUtils]: 83: Hoare triple {8002#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {8002#false} is VALID [2018-11-14 19:00:08,527 INFO L273 TraceCheckUtils]: 84: Hoare triple {8002#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {8002#false} is VALID [2018-11-14 19:00:08,527 INFO L273 TraceCheckUtils]: 85: Hoare triple {8002#false} ~j~0 := ~j~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,527 INFO L273 TraceCheckUtils]: 86: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,527 INFO L273 TraceCheckUtils]: 87: Hoare triple {8002#false} assume !(~j~0 < ~n~0); {8002#false} is VALID [2018-11-14 19:00:08,527 INFO L273 TraceCheckUtils]: 88: Hoare triple {8002#false} ~i~0 := ~i~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,528 INFO L273 TraceCheckUtils]: 89: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,528 INFO L273 TraceCheckUtils]: 90: Hoare triple {8002#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {8002#false} is VALID [2018-11-14 19:00:08,528 INFO L273 TraceCheckUtils]: 91: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,528 INFO L273 TraceCheckUtils]: 92: Hoare triple {8002#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {8002#false} is VALID [2018-11-14 19:00:08,528 INFO L273 TraceCheckUtils]: 93: Hoare triple {8002#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {8002#false} is VALID [2018-11-14 19:00:08,528 INFO L273 TraceCheckUtils]: 94: Hoare triple {8002#false} ~j~0 := ~j~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,529 INFO L273 TraceCheckUtils]: 95: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,529 INFO L273 TraceCheckUtils]: 96: Hoare triple {8002#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {8002#false} is VALID [2018-11-14 19:00:08,529 INFO L273 TraceCheckUtils]: 97: Hoare triple {8002#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {8002#false} is VALID [2018-11-14 19:00:08,529 INFO L273 TraceCheckUtils]: 98: Hoare triple {8002#false} ~j~0 := ~j~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,529 INFO L273 TraceCheckUtils]: 99: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,530 INFO L273 TraceCheckUtils]: 100: Hoare triple {8002#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {8002#false} is VALID [2018-11-14 19:00:08,530 INFO L273 TraceCheckUtils]: 101: Hoare triple {8002#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {8002#false} is VALID [2018-11-14 19:00:08,530 INFO L273 TraceCheckUtils]: 102: Hoare triple {8002#false} ~j~0 := ~j~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,530 INFO L273 TraceCheckUtils]: 103: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,530 INFO L273 TraceCheckUtils]: 104: Hoare triple {8002#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {8002#false} is VALID [2018-11-14 19:00:08,530 INFO L273 TraceCheckUtils]: 105: Hoare triple {8002#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {8002#false} is VALID [2018-11-14 19:00:08,531 INFO L273 TraceCheckUtils]: 106: Hoare triple {8002#false} ~j~0 := ~j~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,531 INFO L273 TraceCheckUtils]: 107: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,531 INFO L273 TraceCheckUtils]: 108: Hoare triple {8002#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {8002#false} is VALID [2018-11-14 19:00:08,531 INFO L273 TraceCheckUtils]: 109: Hoare triple {8002#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {8002#false} is VALID [2018-11-14 19:00:08,531 INFO L273 TraceCheckUtils]: 110: Hoare triple {8002#false} ~j~0 := ~j~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,531 INFO L273 TraceCheckUtils]: 111: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,532 INFO L273 TraceCheckUtils]: 112: Hoare triple {8002#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {8002#false} is VALID [2018-11-14 19:00:08,532 INFO L273 TraceCheckUtils]: 113: Hoare triple {8002#false} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {8002#false} is VALID [2018-11-14 19:00:08,532 INFO L273 TraceCheckUtils]: 114: Hoare triple {8002#false} ~j~0 := ~j~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,532 INFO L273 TraceCheckUtils]: 115: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,532 INFO L273 TraceCheckUtils]: 116: Hoare triple {8002#false} assume !(~j~0 < ~n~0); {8002#false} is VALID [2018-11-14 19:00:08,532 INFO L273 TraceCheckUtils]: 117: Hoare triple {8002#false} ~i~0 := ~i~0 + 1; {8002#false} is VALID [2018-11-14 19:00:08,533 INFO L273 TraceCheckUtils]: 118: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,533 INFO L273 TraceCheckUtils]: 119: Hoare triple {8002#false} assume !(~i~0 < ~n~0); {8002#false} is VALID [2018-11-14 19:00:08,533 INFO L273 TraceCheckUtils]: 120: Hoare triple {8002#false} ~i~0 := 0;~j~0 := 0; {8002#false} is VALID [2018-11-14 19:00:08,533 INFO L273 TraceCheckUtils]: 121: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,533 INFO L273 TraceCheckUtils]: 122: Hoare triple {8002#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {8002#false} is VALID [2018-11-14 19:00:08,533 INFO L273 TraceCheckUtils]: 123: Hoare triple {8002#false} assume true; {8002#false} is VALID [2018-11-14 19:00:08,534 INFO L273 TraceCheckUtils]: 124: Hoare triple {8002#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {8002#false} is VALID [2018-11-14 19:00:08,534 INFO L256 TraceCheckUtils]: 125: Hoare triple {8002#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {8002#false} is VALID [2018-11-14 19:00:08,534 INFO L273 TraceCheckUtils]: 126: Hoare triple {8002#false} ~cond := #in~cond; {8002#false} is VALID [2018-11-14 19:00:08,534 INFO L273 TraceCheckUtils]: 127: Hoare triple {8002#false} assume ~cond == 0; {8002#false} is VALID [2018-11-14 19:00:08,534 INFO L273 TraceCheckUtils]: 128: Hoare triple {8002#false} assume !false; {8002#false} is VALID [2018-11-14 19:00:08,545 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 202 proven. 42 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2018-11-14 19:00:08,565 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:00:08,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-14 19:00:08,565 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 129 [2018-11-14 19:00:08,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:00:08,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 19:00:08,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:00:08,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 19:00:08,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 19:00:08,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:00:08,617 INFO L87 Difference]: Start difference. First operand 156 states and 181 transitions. Second operand 10 states. [2018-11-14 19:00:09,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:00:09,759 INFO L93 Difference]: Finished difference Result 316 states and 377 transitions. [2018-11-14 19:00:09,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-14 19:00:09,759 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 129 [2018-11-14 19:00:09,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:00:09,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 19:00:09,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2018-11-14 19:00:09,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 19:00:09,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 165 transitions. [2018-11-14 19:00:09,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 165 transitions. [2018-11-14 19:00:10,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:00:10,806 INFO L225 Difference]: With dead ends: 316 [2018-11-14 19:00:10,806 INFO L226 Difference]: Without dead ends: 182 [2018-11-14 19:00:10,806 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-14 19:00:10,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-11-14 19:00:11,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 174. [2018-11-14 19:00:11,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:00:11,197 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand 174 states. [2018-11-14 19:00:11,197 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 174 states. [2018-11-14 19:00:11,197 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 174 states. [2018-11-14 19:00:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:00:11,203 INFO L93 Difference]: Finished difference Result 182 states and 213 transitions. [2018-11-14 19:00:11,203 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 213 transitions. [2018-11-14 19:00:11,204 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:00:11,204 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:00:11,204 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 182 states. [2018-11-14 19:00:11,204 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 182 states. [2018-11-14 19:00:11,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:00:11,211 INFO L93 Difference]: Finished difference Result 182 states and 213 transitions. [2018-11-14 19:00:11,211 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 213 transitions. [2018-11-14 19:00:11,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:00:11,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:00:11,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:00:11,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:00:11,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-14 19:00:11,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 202 transitions. [2018-11-14 19:00:11,218 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 202 transitions. Word has length 129 [2018-11-14 19:00:11,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:00:11,218 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 202 transitions. [2018-11-14 19:00:11,218 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 19:00:11,218 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 202 transitions. [2018-11-14 19:00:11,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-11-14 19:00:11,220 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:00:11,220 INFO L375 BasicCegarLoop]: trace histogram [24, 21, 16, 14, 14, 14, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:00:11,220 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:00:11,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:00:11,221 INFO L82 PathProgramCache]: Analyzing trace with hash 801631830, now seen corresponding path program 9 times [2018-11-14 19:00:11,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:00:11,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:00:11,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:00:11,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:00:11,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:00:11,228 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:00:11,228 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:00:11,228 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 19:00:11,245 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 19:00:11,276 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-14 19:00:11,276 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:00:11,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:00:11,315 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:00:12,188 INFO L256 TraceCheckUtils]: 0: Hoare triple {9438#true} call ULTIMATE.init(); {9438#true} is VALID [2018-11-14 19:00:12,188 INFO L273 TraceCheckUtils]: 1: Hoare triple {9438#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9438#true} is VALID [2018-11-14 19:00:12,189 INFO L273 TraceCheckUtils]: 2: Hoare triple {9438#true} assume true; {9438#true} is VALID [2018-11-14 19:00:12,189 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9438#true} {9438#true} #112#return; {9438#true} is VALID [2018-11-14 19:00:12,189 INFO L256 TraceCheckUtils]: 4: Hoare triple {9438#true} call #t~ret5 := main(); {9438#true} is VALID [2018-11-14 19:00:12,190 INFO L273 TraceCheckUtils]: 5: Hoare triple {9438#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,190 INFO L273 TraceCheckUtils]: 6: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,190 INFO L273 TraceCheckUtils]: 7: Hoare triple {9458#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,191 INFO L273 TraceCheckUtils]: 8: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,191 INFO L273 TraceCheckUtils]: 9: Hoare triple {9458#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,191 INFO L273 TraceCheckUtils]: 10: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,192 INFO L273 TraceCheckUtils]: 11: Hoare triple {9458#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,192 INFO L273 TraceCheckUtils]: 12: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,192 INFO L273 TraceCheckUtils]: 13: Hoare triple {9458#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,193 INFO L273 TraceCheckUtils]: 14: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,214 INFO L273 TraceCheckUtils]: 15: Hoare triple {9458#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,229 INFO L273 TraceCheckUtils]: 16: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,238 INFO L273 TraceCheckUtils]: 17: Hoare triple {9458#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,243 INFO L273 TraceCheckUtils]: 18: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,252 INFO L273 TraceCheckUtils]: 19: Hoare triple {9458#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,265 INFO L273 TraceCheckUtils]: 20: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,268 INFO L273 TraceCheckUtils]: 21: Hoare triple {9458#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,268 INFO L273 TraceCheckUtils]: 22: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,270 INFO L273 TraceCheckUtils]: 23: Hoare triple {9458#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,270 INFO L273 TraceCheckUtils]: 24: Hoare triple {9458#(<= 1500 main_~n~0)} ~i~0 := ~i~0 + 1; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,290 INFO L273 TraceCheckUtils]: 25: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,299 INFO L273 TraceCheckUtils]: 26: Hoare triple {9458#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,306 INFO L273 TraceCheckUtils]: 27: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,306 INFO L273 TraceCheckUtils]: 28: Hoare triple {9458#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,308 INFO L273 TraceCheckUtils]: 29: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,308 INFO L273 TraceCheckUtils]: 30: Hoare triple {9458#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,308 INFO L273 TraceCheckUtils]: 31: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,310 INFO L273 TraceCheckUtils]: 32: Hoare triple {9458#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,310 INFO L273 TraceCheckUtils]: 33: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,313 INFO L273 TraceCheckUtils]: 34: Hoare triple {9458#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,313 INFO L273 TraceCheckUtils]: 35: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,313 INFO L273 TraceCheckUtils]: 36: Hoare triple {9458#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,314 INFO L273 TraceCheckUtils]: 37: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,314 INFO L273 TraceCheckUtils]: 38: Hoare triple {9458#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,314 INFO L273 TraceCheckUtils]: 39: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,315 INFO L273 TraceCheckUtils]: 40: Hoare triple {9458#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,315 INFO L273 TraceCheckUtils]: 41: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,315 INFO L273 TraceCheckUtils]: 42: Hoare triple {9458#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,316 INFO L273 TraceCheckUtils]: 43: Hoare triple {9458#(<= 1500 main_~n~0)} ~i~0 := ~i~0 + 1; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,316 INFO L273 TraceCheckUtils]: 44: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,317 INFO L273 TraceCheckUtils]: 45: Hoare triple {9458#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,317 INFO L273 TraceCheckUtils]: 46: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,318 INFO L273 TraceCheckUtils]: 47: Hoare triple {9458#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,318 INFO L273 TraceCheckUtils]: 48: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,319 INFO L273 TraceCheckUtils]: 49: Hoare triple {9458#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,319 INFO L273 TraceCheckUtils]: 50: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,320 INFO L273 TraceCheckUtils]: 51: Hoare triple {9458#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,320 INFO L273 TraceCheckUtils]: 52: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,321 INFO L273 TraceCheckUtils]: 53: Hoare triple {9458#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,321 INFO L273 TraceCheckUtils]: 54: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,322 INFO L273 TraceCheckUtils]: 55: Hoare triple {9458#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,322 INFO L273 TraceCheckUtils]: 56: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,323 INFO L273 TraceCheckUtils]: 57: Hoare triple {9458#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,323 INFO L273 TraceCheckUtils]: 58: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,324 INFO L273 TraceCheckUtils]: 59: Hoare triple {9458#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,324 INFO L273 TraceCheckUtils]: 60: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,325 INFO L273 TraceCheckUtils]: 61: Hoare triple {9458#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,325 INFO L273 TraceCheckUtils]: 62: Hoare triple {9458#(<= 1500 main_~n~0)} ~i~0 := ~i~0 + 1; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,326 INFO L273 TraceCheckUtils]: 63: Hoare triple {9458#(<= 1500 main_~n~0)} assume true; {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,327 INFO L273 TraceCheckUtils]: 64: Hoare triple {9458#(<= 1500 main_~n~0)} assume !(~i~0 < ~m~0); {9458#(<= 1500 main_~n~0)} is VALID [2018-11-14 19:00:12,328 INFO L273 TraceCheckUtils]: 65: Hoare triple {9458#(<= 1500 main_~n~0)} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 0 * (~n~0 * 4) + 0, 4);~max~0 := #t~mem1;havoc #t~mem1; {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,328 INFO L273 TraceCheckUtils]: 66: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume true; {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,329 INFO L273 TraceCheckUtils]: 67: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume !!(~i~0 < ~n~0);~j~0 := 0; {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,330 INFO L273 TraceCheckUtils]: 68: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume true; {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,330 INFO L273 TraceCheckUtils]: 69: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,331 INFO L273 TraceCheckUtils]: 70: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,332 INFO L273 TraceCheckUtils]: 71: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} ~j~0 := ~j~0 + 1; {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,333 INFO L273 TraceCheckUtils]: 72: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume true; {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,333 INFO L273 TraceCheckUtils]: 73: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,334 INFO L273 TraceCheckUtils]: 74: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,335 INFO L273 TraceCheckUtils]: 75: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} ~j~0 := ~j~0 + 1; {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,335 INFO L273 TraceCheckUtils]: 76: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume true; {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,336 INFO L273 TraceCheckUtils]: 77: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,337 INFO L273 TraceCheckUtils]: 78: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,338 INFO L273 TraceCheckUtils]: 79: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} ~j~0 := ~j~0 + 1; {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,338 INFO L273 TraceCheckUtils]: 80: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume true; {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,339 INFO L273 TraceCheckUtils]: 81: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,340 INFO L273 TraceCheckUtils]: 82: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,341 INFO L273 TraceCheckUtils]: 83: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} ~j~0 := ~j~0 + 1; {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,341 INFO L273 TraceCheckUtils]: 84: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume true; {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,342 INFO L273 TraceCheckUtils]: 85: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,343 INFO L273 TraceCheckUtils]: 86: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,344 INFO L273 TraceCheckUtils]: 87: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} ~j~0 := ~j~0 + 1; {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,344 INFO L273 TraceCheckUtils]: 88: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume true; {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,345 INFO L273 TraceCheckUtils]: 89: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,346 INFO L273 TraceCheckUtils]: 90: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,346 INFO L273 TraceCheckUtils]: 91: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} ~j~0 := ~j~0 + 1; {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,347 INFO L273 TraceCheckUtils]: 92: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume true; {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,348 INFO L273 TraceCheckUtils]: 93: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,349 INFO L273 TraceCheckUtils]: 94: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,349 INFO L273 TraceCheckUtils]: 95: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} ~j~0 := ~j~0 + 1; {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,350 INFO L273 TraceCheckUtils]: 96: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume true; {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,351 INFO L273 TraceCheckUtils]: 97: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume !(~j~0 < ~n~0); {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:12,352 INFO L273 TraceCheckUtils]: 98: Hoare triple {9639#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} ~i~0 := ~i~0 + 1; {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,352 INFO L273 TraceCheckUtils]: 99: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume true; {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,353 INFO L273 TraceCheckUtils]: 100: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume !!(~i~0 < ~n~0);~j~0 := 0; {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,354 INFO L273 TraceCheckUtils]: 101: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume true; {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,354 INFO L273 TraceCheckUtils]: 102: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,355 INFO L273 TraceCheckUtils]: 103: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,356 INFO L273 TraceCheckUtils]: 104: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} ~j~0 := ~j~0 + 1; {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,357 INFO L273 TraceCheckUtils]: 105: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume true; {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,357 INFO L273 TraceCheckUtils]: 106: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,358 INFO L273 TraceCheckUtils]: 107: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,359 INFO L273 TraceCheckUtils]: 108: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} ~j~0 := ~j~0 + 1; {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,359 INFO L273 TraceCheckUtils]: 109: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume true; {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,360 INFO L273 TraceCheckUtils]: 110: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,361 INFO L273 TraceCheckUtils]: 111: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,362 INFO L273 TraceCheckUtils]: 112: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} ~j~0 := ~j~0 + 1; {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,362 INFO L273 TraceCheckUtils]: 113: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume true; {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,363 INFO L273 TraceCheckUtils]: 114: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,364 INFO L273 TraceCheckUtils]: 115: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,365 INFO L273 TraceCheckUtils]: 116: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} ~j~0 := ~j~0 + 1; {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,365 INFO L273 TraceCheckUtils]: 117: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume true; {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,366 INFO L273 TraceCheckUtils]: 118: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,367 INFO L273 TraceCheckUtils]: 119: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,368 INFO L273 TraceCheckUtils]: 120: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} ~j~0 := ~j~0 + 1; {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,368 INFO L273 TraceCheckUtils]: 121: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume true; {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,369 INFO L273 TraceCheckUtils]: 122: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,370 INFO L273 TraceCheckUtils]: 123: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,370 INFO L273 TraceCheckUtils]: 124: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} ~j~0 := ~j~0 + 1; {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,371 INFO L273 TraceCheckUtils]: 125: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume true; {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,372 INFO L273 TraceCheckUtils]: 126: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,373 INFO L273 TraceCheckUtils]: 127: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,373 INFO L273 TraceCheckUtils]: 128: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} ~j~0 := ~j~0 + 1; {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,374 INFO L273 TraceCheckUtils]: 129: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume true; {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,375 INFO L273 TraceCheckUtils]: 130: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume !(~j~0 < ~n~0); {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 19:00:12,376 INFO L273 TraceCheckUtils]: 131: Hoare triple {9739#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} ~i~0 := ~i~0 + 1; {9839#(and (<= 1500 main_~n~0) (<= main_~i~0 2))} is VALID [2018-11-14 19:00:12,376 INFO L273 TraceCheckUtils]: 132: Hoare triple {9839#(and (<= 1500 main_~n~0) (<= main_~i~0 2))} assume true; {9839#(and (<= 1500 main_~n~0) (<= main_~i~0 2))} is VALID [2018-11-14 19:00:12,377 INFO L273 TraceCheckUtils]: 133: Hoare triple {9839#(and (<= 1500 main_~n~0) (<= main_~i~0 2))} assume !(~i~0 < ~n~0); {9439#false} is VALID [2018-11-14 19:00:12,377 INFO L273 TraceCheckUtils]: 134: Hoare triple {9439#false} ~i~0 := 0;~j~0 := 0; {9439#false} is VALID [2018-11-14 19:00:12,377 INFO L273 TraceCheckUtils]: 135: Hoare triple {9439#false} assume true; {9439#false} is VALID [2018-11-14 19:00:12,378 INFO L273 TraceCheckUtils]: 136: Hoare triple {9439#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {9439#false} is VALID [2018-11-14 19:00:12,378 INFO L273 TraceCheckUtils]: 137: Hoare triple {9439#false} assume true; {9439#false} is VALID [2018-11-14 19:00:12,378 INFO L273 TraceCheckUtils]: 138: Hoare triple {9439#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {9439#false} is VALID [2018-11-14 19:00:12,378 INFO L256 TraceCheckUtils]: 139: Hoare triple {9439#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {9439#false} is VALID [2018-11-14 19:00:12,378 INFO L273 TraceCheckUtils]: 140: Hoare triple {9439#false} ~cond := #in~cond; {9439#false} is VALID [2018-11-14 19:00:12,379 INFO L273 TraceCheckUtils]: 141: Hoare triple {9439#false} assume ~cond == 0; {9439#false} is VALID [2018-11-14 19:00:12,379 INFO L273 TraceCheckUtils]: 142: Hoare triple {9439#false} assume !false; {9439#false} is VALID [2018-11-14 19:00:12,408 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 0 proven. 233 refuted. 0 times theorem prover too weak. 763 trivial. 0 not checked. [2018-11-14 19:00:12,428 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:00:12,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-14 19:00:12,429 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2018-11-14 19:00:12,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:00:12,429 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 19:00:12,474 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:00:12,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 19:00:12,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 19:00:12,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:00:12,475 INFO L87 Difference]: Start difference. First operand 174 states and 202 transitions. Second operand 6 states. [2018-11-14 19:00:13,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:00:13,762 INFO L93 Difference]: Finished difference Result 394 states and 471 transitions. [2018-11-14 19:00:13,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 19:00:13,762 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2018-11-14 19:00:13,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:00:13,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:00:13,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2018-11-14 19:00:13,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 19:00:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 127 transitions. [2018-11-14 19:00:13,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 127 transitions. [2018-11-14 19:00:13,894 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:00:13,906 INFO L225 Difference]: With dead ends: 394 [2018-11-14 19:00:13,906 INFO L226 Difference]: Without dead ends: 354 [2018-11-14 19:00:13,906 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 19:00:13,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-11-14 19:00:14,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 207. [2018-11-14 19:00:14,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:00:14,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 354 states. Second operand 207 states. [2018-11-14 19:00:14,495 INFO L74 IsIncluded]: Start isIncluded. First operand 354 states. Second operand 207 states. [2018-11-14 19:00:14,495 INFO L87 Difference]: Start difference. First operand 354 states. Second operand 207 states. [2018-11-14 19:00:14,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:00:14,506 INFO L93 Difference]: Finished difference Result 354 states and 423 transitions. [2018-11-14 19:00:14,506 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 423 transitions. [2018-11-14 19:00:14,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:00:14,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:00:14,508 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand 354 states. [2018-11-14 19:00:14,508 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 354 states. [2018-11-14 19:00:14,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:00:14,519 INFO L93 Difference]: Finished difference Result 354 states and 423 transitions. [2018-11-14 19:00:14,519 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 423 transitions. [2018-11-14 19:00:14,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:00:14,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:00:14,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:00:14,521 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:00:14,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-14 19:00:14,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 243 transitions. [2018-11-14 19:00:14,526 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 243 transitions. Word has length 143 [2018-11-14 19:00:14,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:00:14,526 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 243 transitions. [2018-11-14 19:00:14,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 19:00:14,527 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 243 transitions. [2018-11-14 19:00:14,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-11-14 19:00:14,528 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:00:14,529 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 21, 21, 21, 21, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:00:14,529 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:00:14,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:00:14,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1248996488, now seen corresponding path program 10 times [2018-11-14 19:00:14,529 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:00:14,529 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:00:14,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:00:14,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:00:14,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:00:14,537 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:00:14,538 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:00:14,538 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 19:00:14,560 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 19:00:14,606 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 19:00:14,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 19:00:14,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 19:00:14,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 19:00:15,128 INFO L256 TraceCheckUtils]: 0: Hoare triple {11416#true} call ULTIMATE.init(); {11416#true} is VALID [2018-11-14 19:00:15,128 INFO L273 TraceCheckUtils]: 1: Hoare triple {11416#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11416#true} is VALID [2018-11-14 19:00:15,128 INFO L273 TraceCheckUtils]: 2: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,129 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11416#true} {11416#true} #112#return; {11416#true} is VALID [2018-11-14 19:00:15,129 INFO L256 TraceCheckUtils]: 4: Hoare triple {11416#true} call #t~ret5 := main(); {11416#true} is VALID [2018-11-14 19:00:15,129 INFO L273 TraceCheckUtils]: 5: Hoare triple {11416#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);havoc ~max~0;~i~0 := 0;~j~0 := 0; {11416#true} is VALID [2018-11-14 19:00:15,129 INFO L273 TraceCheckUtils]: 6: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,129 INFO L273 TraceCheckUtils]: 7: Hoare triple {11416#true} assume !!(~i~0 < ~m~0);~j~0 := 0; {11416#true} is VALID [2018-11-14 19:00:15,129 INFO L273 TraceCheckUtils]: 8: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,130 INFO L273 TraceCheckUtils]: 9: Hoare triple {11416#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {11416#true} is VALID [2018-11-14 19:00:15,130 INFO L273 TraceCheckUtils]: 10: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,130 INFO L273 TraceCheckUtils]: 11: Hoare triple {11416#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {11416#true} is VALID [2018-11-14 19:00:15,130 INFO L273 TraceCheckUtils]: 12: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,130 INFO L273 TraceCheckUtils]: 13: Hoare triple {11416#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {11416#true} is VALID [2018-11-14 19:00:15,130 INFO L273 TraceCheckUtils]: 14: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,130 INFO L273 TraceCheckUtils]: 15: Hoare triple {11416#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {11416#true} is VALID [2018-11-14 19:00:15,130 INFO L273 TraceCheckUtils]: 16: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,130 INFO L273 TraceCheckUtils]: 17: Hoare triple {11416#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {11416#true} is VALID [2018-11-14 19:00:15,131 INFO L273 TraceCheckUtils]: 18: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,131 INFO L273 TraceCheckUtils]: 19: Hoare triple {11416#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {11416#true} is VALID [2018-11-14 19:00:15,131 INFO L273 TraceCheckUtils]: 20: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,131 INFO L273 TraceCheckUtils]: 21: Hoare triple {11416#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {11416#true} is VALID [2018-11-14 19:00:15,131 INFO L273 TraceCheckUtils]: 22: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,131 INFO L273 TraceCheckUtils]: 23: Hoare triple {11416#true} assume !(~j~0 < ~n~0); {11416#true} is VALID [2018-11-14 19:00:15,131 INFO L273 TraceCheckUtils]: 24: Hoare triple {11416#true} ~i~0 := ~i~0 + 1; {11416#true} is VALID [2018-11-14 19:00:15,131 INFO L273 TraceCheckUtils]: 25: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,132 INFO L273 TraceCheckUtils]: 26: Hoare triple {11416#true} assume !!(~i~0 < ~m~0);~j~0 := 0; {11416#true} is VALID [2018-11-14 19:00:15,132 INFO L273 TraceCheckUtils]: 27: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,132 INFO L273 TraceCheckUtils]: 28: Hoare triple {11416#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {11416#true} is VALID [2018-11-14 19:00:15,132 INFO L273 TraceCheckUtils]: 29: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,132 INFO L273 TraceCheckUtils]: 30: Hoare triple {11416#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {11416#true} is VALID [2018-11-14 19:00:15,132 INFO L273 TraceCheckUtils]: 31: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,132 INFO L273 TraceCheckUtils]: 32: Hoare triple {11416#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {11416#true} is VALID [2018-11-14 19:00:15,132 INFO L273 TraceCheckUtils]: 33: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,133 INFO L273 TraceCheckUtils]: 34: Hoare triple {11416#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {11416#true} is VALID [2018-11-14 19:00:15,133 INFO L273 TraceCheckUtils]: 35: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,133 INFO L273 TraceCheckUtils]: 36: Hoare triple {11416#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {11416#true} is VALID [2018-11-14 19:00:15,133 INFO L273 TraceCheckUtils]: 37: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,133 INFO L273 TraceCheckUtils]: 38: Hoare triple {11416#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {11416#true} is VALID [2018-11-14 19:00:15,133 INFO L273 TraceCheckUtils]: 39: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,134 INFO L273 TraceCheckUtils]: 40: Hoare triple {11416#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {11416#true} is VALID [2018-11-14 19:00:15,134 INFO L273 TraceCheckUtils]: 41: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,134 INFO L273 TraceCheckUtils]: 42: Hoare triple {11416#true} assume !(~j~0 < ~n~0); {11416#true} is VALID [2018-11-14 19:00:15,134 INFO L273 TraceCheckUtils]: 43: Hoare triple {11416#true} ~i~0 := ~i~0 + 1; {11416#true} is VALID [2018-11-14 19:00:15,134 INFO L273 TraceCheckUtils]: 44: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,134 INFO L273 TraceCheckUtils]: 45: Hoare triple {11416#true} assume !!(~i~0 < ~m~0);~j~0 := 0; {11416#true} is VALID [2018-11-14 19:00:15,134 INFO L273 TraceCheckUtils]: 46: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,134 INFO L273 TraceCheckUtils]: 47: Hoare triple {11416#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {11416#true} is VALID [2018-11-14 19:00:15,134 INFO L273 TraceCheckUtils]: 48: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,135 INFO L273 TraceCheckUtils]: 49: Hoare triple {11416#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {11416#true} is VALID [2018-11-14 19:00:15,135 INFO L273 TraceCheckUtils]: 50: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,135 INFO L273 TraceCheckUtils]: 51: Hoare triple {11416#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {11416#true} is VALID [2018-11-14 19:00:15,135 INFO L273 TraceCheckUtils]: 52: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,135 INFO L273 TraceCheckUtils]: 53: Hoare triple {11416#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {11416#true} is VALID [2018-11-14 19:00:15,135 INFO L273 TraceCheckUtils]: 54: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,135 INFO L273 TraceCheckUtils]: 55: Hoare triple {11416#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {11416#true} is VALID [2018-11-14 19:00:15,135 INFO L273 TraceCheckUtils]: 56: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,136 INFO L273 TraceCheckUtils]: 57: Hoare triple {11416#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {11416#true} is VALID [2018-11-14 19:00:15,136 INFO L273 TraceCheckUtils]: 58: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,136 INFO L273 TraceCheckUtils]: 59: Hoare triple {11416#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet0;~j~0 := ~j~0 + 1; {11416#true} is VALID [2018-11-14 19:00:15,136 INFO L273 TraceCheckUtils]: 60: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,136 INFO L273 TraceCheckUtils]: 61: Hoare triple {11416#true} assume !(~j~0 < ~n~0); {11416#true} is VALID [2018-11-14 19:00:15,136 INFO L273 TraceCheckUtils]: 62: Hoare triple {11416#true} ~i~0 := ~i~0 + 1; {11416#true} is VALID [2018-11-14 19:00:15,136 INFO L273 TraceCheckUtils]: 63: Hoare triple {11416#true} assume true; {11416#true} is VALID [2018-11-14 19:00:15,136 INFO L273 TraceCheckUtils]: 64: Hoare triple {11416#true} assume !(~i~0 < ~m~0); {11416#true} is VALID [2018-11-14 19:00:15,137 INFO L273 TraceCheckUtils]: 65: Hoare triple {11416#true} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + 0 * (~n~0 * 4) + 0, 4);~max~0 := #t~mem1;havoc #t~mem1; {11616#(<= main_~i~0 0)} is VALID [2018-11-14 19:00:15,137 INFO L273 TraceCheckUtils]: 66: Hoare triple {11616#(<= main_~i~0 0)} assume true; {11616#(<= main_~i~0 0)} is VALID [2018-11-14 19:00:15,138 INFO L273 TraceCheckUtils]: 67: Hoare triple {11616#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 0; {11623#(and (<= 0 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:15,138 INFO L273 TraceCheckUtils]: 68: Hoare triple {11623#(and (<= 0 main_~j~0) (<= main_~i~0 0))} assume true; {11623#(and (<= 0 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:15,139 INFO L273 TraceCheckUtils]: 69: Hoare triple {11623#(and (<= 0 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {11623#(and (<= 0 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:15,139 INFO L273 TraceCheckUtils]: 70: Hoare triple {11623#(and (<= 0 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {11623#(and (<= 0 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:15,140 INFO L273 TraceCheckUtils]: 71: Hoare triple {11623#(and (<= 0 main_~j~0) (<= main_~i~0 0))} ~j~0 := ~j~0 + 1; {11636#(and (<= 1 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:15,140 INFO L273 TraceCheckUtils]: 72: Hoare triple {11636#(and (<= 1 main_~j~0) (<= main_~i~0 0))} assume true; {11636#(and (<= 1 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:15,141 INFO L273 TraceCheckUtils]: 73: Hoare triple {11636#(and (<= 1 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {11636#(and (<= 1 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:15,142 INFO L273 TraceCheckUtils]: 74: Hoare triple {11636#(and (<= 1 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {11636#(and (<= 1 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:15,143 INFO L273 TraceCheckUtils]: 75: Hoare triple {11636#(and (<= 1 main_~j~0) (<= main_~i~0 0))} ~j~0 := ~j~0 + 1; {11649#(and (<= 2 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:15,143 INFO L273 TraceCheckUtils]: 76: Hoare triple {11649#(and (<= 2 main_~j~0) (<= main_~i~0 0))} assume true; {11649#(and (<= 2 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:15,144 INFO L273 TraceCheckUtils]: 77: Hoare triple {11649#(and (<= 2 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {11649#(and (<= 2 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:15,145 INFO L273 TraceCheckUtils]: 78: Hoare triple {11649#(and (<= 2 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {11649#(and (<= 2 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:15,146 INFO L273 TraceCheckUtils]: 79: Hoare triple {11649#(and (<= 2 main_~j~0) (<= main_~i~0 0))} ~j~0 := ~j~0 + 1; {11662#(and (<= 3 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:15,146 INFO L273 TraceCheckUtils]: 80: Hoare triple {11662#(and (<= 3 main_~j~0) (<= main_~i~0 0))} assume true; {11662#(and (<= 3 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:15,147 INFO L273 TraceCheckUtils]: 81: Hoare triple {11662#(and (<= 3 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {11662#(and (<= 3 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:15,148 INFO L273 TraceCheckUtils]: 82: Hoare triple {11662#(and (<= 3 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {11662#(and (<= 3 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:15,149 INFO L273 TraceCheckUtils]: 83: Hoare triple {11662#(and (<= 3 main_~j~0) (<= main_~i~0 0))} ~j~0 := ~j~0 + 1; {11675#(and (<= 4 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:15,150 INFO L273 TraceCheckUtils]: 84: Hoare triple {11675#(and (<= 4 main_~j~0) (<= main_~i~0 0))} assume true; {11675#(and (<= 4 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:15,150 INFO L273 TraceCheckUtils]: 85: Hoare triple {11675#(and (<= 4 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {11675#(and (<= 4 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:15,151 INFO L273 TraceCheckUtils]: 86: Hoare triple {11675#(and (<= 4 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {11675#(and (<= 4 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:15,152 INFO L273 TraceCheckUtils]: 87: Hoare triple {11675#(and (<= 4 main_~j~0) (<= main_~i~0 0))} ~j~0 := ~j~0 + 1; {11688#(and (<= 5 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:15,153 INFO L273 TraceCheckUtils]: 88: Hoare triple {11688#(and (<= 5 main_~j~0) (<= main_~i~0 0))} assume true; {11688#(and (<= 5 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:15,154 INFO L273 TraceCheckUtils]: 89: Hoare triple {11688#(and (<= 5 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {11688#(and (<= 5 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:15,154 INFO L273 TraceCheckUtils]: 90: Hoare triple {11688#(and (<= 5 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {11688#(and (<= 5 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:15,155 INFO L273 TraceCheckUtils]: 91: Hoare triple {11688#(and (<= 5 main_~j~0) (<= main_~i~0 0))} ~j~0 := ~j~0 + 1; {11701#(and (<= 6 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:15,156 INFO L273 TraceCheckUtils]: 92: Hoare triple {11701#(and (<= 6 main_~j~0) (<= main_~i~0 0))} assume true; {11701#(and (<= 6 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 19:00:15,157 INFO L273 TraceCheckUtils]: 93: Hoare triple {11701#(and (<= 6 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {11708#(and (<= main_~i~0 0) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,158 INFO L273 TraceCheckUtils]: 94: Hoare triple {11708#(and (<= main_~i~0 0) (<= 7 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {11708#(and (<= main_~i~0 0) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,158 INFO L273 TraceCheckUtils]: 95: Hoare triple {11708#(and (<= main_~i~0 0) (<= 7 main_~n~0))} ~j~0 := ~j~0 + 1; {11708#(and (<= main_~i~0 0) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,159 INFO L273 TraceCheckUtils]: 96: Hoare triple {11708#(and (<= main_~i~0 0) (<= 7 main_~n~0))} assume true; {11708#(and (<= main_~i~0 0) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,160 INFO L273 TraceCheckUtils]: 97: Hoare triple {11708#(and (<= main_~i~0 0) (<= 7 main_~n~0))} assume !(~j~0 < ~n~0); {11708#(and (<= main_~i~0 0) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,161 INFO L273 TraceCheckUtils]: 98: Hoare triple {11708#(and (<= main_~i~0 0) (<= 7 main_~n~0))} ~i~0 := ~i~0 + 1; {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,161 INFO L273 TraceCheckUtils]: 99: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} assume true; {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,162 INFO L273 TraceCheckUtils]: 100: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} assume !!(~i~0 < ~n~0);~j~0 := 0; {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,163 INFO L273 TraceCheckUtils]: 101: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} assume true; {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,163 INFO L273 TraceCheckUtils]: 102: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,164 INFO L273 TraceCheckUtils]: 103: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,165 INFO L273 TraceCheckUtils]: 104: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} ~j~0 := ~j~0 + 1; {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,166 INFO L273 TraceCheckUtils]: 105: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} assume true; {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,166 INFO L273 TraceCheckUtils]: 106: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,167 INFO L273 TraceCheckUtils]: 107: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,168 INFO L273 TraceCheckUtils]: 108: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} ~j~0 := ~j~0 + 1; {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,169 INFO L273 TraceCheckUtils]: 109: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} assume true; {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,169 INFO L273 TraceCheckUtils]: 110: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,170 INFO L273 TraceCheckUtils]: 111: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,171 INFO L273 TraceCheckUtils]: 112: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} ~j~0 := ~j~0 + 1; {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,172 INFO L273 TraceCheckUtils]: 113: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} assume true; {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,172 INFO L273 TraceCheckUtils]: 114: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,173 INFO L273 TraceCheckUtils]: 115: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,174 INFO L273 TraceCheckUtils]: 116: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} ~j~0 := ~j~0 + 1; {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,174 INFO L273 TraceCheckUtils]: 117: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} assume true; {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,175 INFO L273 TraceCheckUtils]: 118: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,176 INFO L273 TraceCheckUtils]: 119: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,177 INFO L273 TraceCheckUtils]: 120: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} ~j~0 := ~j~0 + 1; {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,177 INFO L273 TraceCheckUtils]: 121: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} assume true; {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,178 INFO L273 TraceCheckUtils]: 122: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,179 INFO L273 TraceCheckUtils]: 123: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,180 INFO L273 TraceCheckUtils]: 124: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} ~j~0 := ~j~0 + 1; {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,180 INFO L273 TraceCheckUtils]: 125: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} assume true; {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,181 INFO L273 TraceCheckUtils]: 126: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,182 INFO L273 TraceCheckUtils]: 127: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,183 INFO L273 TraceCheckUtils]: 128: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} ~j~0 := ~j~0 + 1; {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,183 INFO L273 TraceCheckUtils]: 129: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} assume true; {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,184 INFO L273 TraceCheckUtils]: 130: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} assume !(~j~0 < ~n~0); {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,185 INFO L273 TraceCheckUtils]: 131: Hoare triple {11724#(and (<= main_~i~0 1) (<= 7 main_~n~0))} ~i~0 := ~i~0 + 1; {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,185 INFO L273 TraceCheckUtils]: 132: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} assume true; {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,186 INFO L273 TraceCheckUtils]: 133: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} assume !!(~i~0 < ~n~0);~j~0 := 0; {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,187 INFO L273 TraceCheckUtils]: 134: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} assume true; {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,188 INFO L273 TraceCheckUtils]: 135: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,188 INFO L273 TraceCheckUtils]: 136: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,189 INFO L273 TraceCheckUtils]: 137: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} ~j~0 := ~j~0 + 1; {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,190 INFO L273 TraceCheckUtils]: 138: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} assume true; {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,191 INFO L273 TraceCheckUtils]: 139: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,191 INFO L273 TraceCheckUtils]: 140: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,192 INFO L273 TraceCheckUtils]: 141: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} ~j~0 := ~j~0 + 1; {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,193 INFO L273 TraceCheckUtils]: 142: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} assume true; {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,193 INFO L273 TraceCheckUtils]: 143: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,194 INFO L273 TraceCheckUtils]: 144: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,195 INFO L273 TraceCheckUtils]: 145: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} ~j~0 := ~j~0 + 1; {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,196 INFO L273 TraceCheckUtils]: 146: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} assume true; {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,196 INFO L273 TraceCheckUtils]: 147: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,197 INFO L273 TraceCheckUtils]: 148: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,198 INFO L273 TraceCheckUtils]: 149: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} ~j~0 := ~j~0 + 1; {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,199 INFO L273 TraceCheckUtils]: 150: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} assume true; {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,199 INFO L273 TraceCheckUtils]: 151: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,200 INFO L273 TraceCheckUtils]: 152: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,201 INFO L273 TraceCheckUtils]: 153: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} ~j~0 := ~j~0 + 1; {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,201 INFO L273 TraceCheckUtils]: 154: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} assume true; {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,202 INFO L273 TraceCheckUtils]: 155: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,203 INFO L273 TraceCheckUtils]: 156: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,204 INFO L273 TraceCheckUtils]: 157: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} ~j~0 := ~j~0 + 1; {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,204 INFO L273 TraceCheckUtils]: 158: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} assume true; {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,205 INFO L273 TraceCheckUtils]: 159: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,206 INFO L273 TraceCheckUtils]: 160: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} assume #t~mem2 > ~max~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);~max~0 := #t~mem3;havoc #t~mem3; {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,207 INFO L273 TraceCheckUtils]: 161: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} ~j~0 := ~j~0 + 1; {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,207 INFO L273 TraceCheckUtils]: 162: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} assume true; {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,208 INFO L273 TraceCheckUtils]: 163: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} assume !(~j~0 < ~n~0); {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,209 INFO L273 TraceCheckUtils]: 164: Hoare triple {11824#(and (<= main_~i~0 2) (<= 7 main_~n~0))} ~i~0 := ~i~0 + 1; {11924#(and (<= main_~i~0 3) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,210 INFO L273 TraceCheckUtils]: 165: Hoare triple {11924#(and (<= main_~i~0 3) (<= 7 main_~n~0))} assume true; {11924#(and (<= main_~i~0 3) (<= 7 main_~n~0))} is VALID [2018-11-14 19:00:15,210 INFO L273 TraceCheckUtils]: 166: Hoare triple {11924#(and (<= main_~i~0 3) (<= 7 main_~n~0))} assume !(~i~0 < ~n~0); {11417#false} is VALID [2018-11-14 19:00:15,211 INFO L273 TraceCheckUtils]: 167: Hoare triple {11417#false} ~i~0 := 0;~j~0 := 0; {11417#false} is VALID [2018-11-14 19:00:15,211 INFO L273 TraceCheckUtils]: 168: Hoare triple {11417#false} assume true; {11417#false} is VALID [2018-11-14 19:00:15,211 INFO L273 TraceCheckUtils]: 169: Hoare triple {11417#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {11417#false} is VALID [2018-11-14 19:00:15,211 INFO L273 TraceCheckUtils]: 170: Hoare triple {11417#false} assume true; {11417#false} is VALID [2018-11-14 19:00:15,211 INFO L273 TraceCheckUtils]: 171: Hoare triple {11417#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {11417#false} is VALID [2018-11-14 19:00:15,212 INFO L256 TraceCheckUtils]: 172: Hoare triple {11417#false} call __VERIFIER_assert((if #t~mem4 <= ~max~0 then 1 else 0)); {11417#false} is VALID [2018-11-14 19:00:15,212 INFO L273 TraceCheckUtils]: 173: Hoare triple {11417#false} ~cond := #in~cond; {11417#false} is VALID [2018-11-14 19:00:15,212 INFO L273 TraceCheckUtils]: 174: Hoare triple {11417#false} assume ~cond == 0; {11417#false} is VALID [2018-11-14 19:00:15,212 INFO L273 TraceCheckUtils]: 175: Hoare triple {11417#false} assume !false; {11417#false} is VALID [2018-11-14 19:00:15,241 INFO L134 CoverageAnalysis]: Checked inductivity of 1554 backedges. 72 proven. 719 refuted. 0 times theorem prover too weak. 763 trivial. 0 not checked. [2018-11-14 19:00:15,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 19:00:15,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-11-14 19:00:15,262 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 176 [2018-11-14 19:00:15,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 19:00:15,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 19:00:15,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:00:15,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 19:00:15,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 19:00:15,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-11-14 19:00:15,342 INFO L87 Difference]: Start difference. First operand 207 states and 243 transitions. Second operand 14 states. [2018-11-14 19:00:18,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:00:18,517 INFO L93 Difference]: Finished difference Result 508 states and 609 transitions. [2018-11-14 19:00:18,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-14 19:00:18,518 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 176 [2018-11-14 19:00:18,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 19:00:18,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 19:00:18,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 261 transitions. [2018-11-14 19:00:18,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 19:00:18,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 261 transitions. [2018-11-14 19:00:18,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 261 transitions. [2018-11-14 19:00:18,803 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 19:00:18,822 INFO L225 Difference]: With dead ends: 508 [2018-11-14 19:00:18,822 INFO L226 Difference]: Without dead ends: 468 [2018-11-14 19:00:18,823 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=158, Invalid=262, Unknown=0, NotChecked=0, Total=420 [2018-11-14 19:00:18,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-11-14 19:00:19,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 240. [2018-11-14 19:00:19,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 19:00:19,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 468 states. Second operand 240 states. [2018-11-14 19:00:19,404 INFO L74 IsIncluded]: Start isIncluded. First operand 468 states. Second operand 240 states. [2018-11-14 19:00:19,404 INFO L87 Difference]: Start difference. First operand 468 states. Second operand 240 states. [2018-11-14 19:00:19,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:00:19,420 INFO L93 Difference]: Finished difference Result 468 states and 561 transitions. [2018-11-14 19:00:19,421 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 561 transitions. [2018-11-14 19:00:19,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:00:19,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:00:19,423 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand 468 states. [2018-11-14 19:00:19,423 INFO L87 Difference]: Start difference. First operand 240 states. Second operand 468 states. [2018-11-14 19:00:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 19:00:19,439 INFO L93 Difference]: Finished difference Result 468 states and 561 transitions. [2018-11-14 19:00:19,440 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 561 transitions. [2018-11-14 19:00:19,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 19:00:19,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 19:00:19,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 19:00:19,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 19:00:19,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-11-14 19:00:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 284 transitions. [2018-11-14 19:00:19,448 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 284 transitions. Word has length 176 [2018-11-14 19:00:19,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 19:00:19,448 INFO L480 AbstractCegarLoop]: Abstraction has 240 states and 284 transitions. [2018-11-14 19:00:19,448 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 19:00:19,448 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 284 transitions. [2018-11-14 19:00:19,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-11-14 19:00:19,450 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 19:00:19,451 INFO L375 BasicCegarLoop]: trace histogram [32, 28, 28, 28, 24, 21, 5, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 19:00:19,451 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 19:00:19,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 19:00:19,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1158716054, now seen corresponding path program 11 times [2018-11-14 19:00:19,451 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 19:00:19,452 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 19:00:19,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:00:19,453 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 19:00:19,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 19:00:19,460 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 19:00:19,460 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 19:00:19,460 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 19:00:19,476 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1