java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-multidimensional/min-2-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:34:44,336 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:34:44,340 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:34:44,359 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:34:44,359 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:34:44,361 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:34:44,362 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:34:44,366 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:34:44,370 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:34:44,371 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:34:44,372 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:34:44,372 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:34:44,374 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:34:44,375 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:34:44,376 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:34:44,377 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:34:44,385 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:34:44,388 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:34:44,392 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:34:44,394 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:34:44,397 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:34:44,398 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:34:44,400 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:34:44,400 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:34:44,400 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:34:44,403 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:34:44,405 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:34:44,406 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:34:44,407 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:34:44,408 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:34:44,408 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:34:44,410 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:34:44,410 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:34:44,410 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:34:44,411 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:34:44,411 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:34:44,413 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 12:34:44,438 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:34:44,439 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:34:44,440 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:34:44,440 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:34:44,441 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:34:44,441 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:34:44,441 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:34:44,441 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:34:44,442 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:34:44,442 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:34:44,442 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:34:44,442 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:34:44,442 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:34:44,443 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:34:44,444 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:34:44,444 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:34:44,444 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:34:44,444 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:34:44,444 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:34:44,445 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:34:44,445 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:34:44,445 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:34:44,445 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:34:44,445 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:34:44,446 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:34:44,446 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:34:44,446 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:34:44,446 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:34:44,446 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:34:44,447 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:34:44,447 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:34:44,491 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:34:44,504 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:34:44,509 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:34:44,511 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:34:44,511 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:34:44,512 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/min-2-u_true-unreach-call.i [2018-11-23 12:34:44,588 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d41cd05c/2c409d2ac1d14b68870bbf2d590a4fe3/FLAGa912d4ecf [2018-11-23 12:34:44,988 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:34:44,989 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/min-2-u_true-unreach-call.i [2018-11-23 12:34:44,994 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d41cd05c/2c409d2ac1d14b68870bbf2d590a4fe3/FLAGa912d4ecf [2018-11-23 12:34:45,366 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d41cd05c/2c409d2ac1d14b68870bbf2d590a4fe3 [2018-11-23 12:34:45,376 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:34:45,377 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:34:45,378 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:34:45,378 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:34:45,382 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:34:45,383 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:34:45" (1/1) ... [2018-11-23 12:34:45,387 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c08b8b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:45, skipping insertion in model container [2018-11-23 12:34:45,387 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:34:45" (1/1) ... [2018-11-23 12:34:45,398 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:34:45,425 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:34:45,645 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:34:45,649 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:34:45,678 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:34:45,699 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:34:45,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:45 WrapperNode [2018-11-23 12:34:45,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:34:45,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:34:45,701 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:34:45,701 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:34:45,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:45" (1/1) ... [2018-11-23 12:34:45,720 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:45" (1/1) ... [2018-11-23 12:34:45,727 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:34:45,728 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:34:45,728 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:34:45,728 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:34:45,737 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:45" (1/1) ... [2018-11-23 12:34:45,737 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:45" (1/1) ... [2018-11-23 12:34:45,739 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:45" (1/1) ... [2018-11-23 12:34:45,739 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:45" (1/1) ... [2018-11-23 12:34:45,750 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:45" (1/1) ... [2018-11-23 12:34:45,758 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:45" (1/1) ... [2018-11-23 12:34:45,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:45" (1/1) ... [2018-11-23 12:34:45,762 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:34:45,762 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:34:45,762 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:34:45,763 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:34:45,764 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:45" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:34:45,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:34:45,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:34:45,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:34:45,896 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:34:45,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:34:45,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:34:45,896 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:34:45,896 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:34:45,896 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:34:45,897 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:34:45,897 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:34:45,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:34:46,711 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:34:46,711 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 12:34:46,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:34:46 BoogieIcfgContainer [2018-11-23 12:34:46,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:34:46,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:34:46,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:34:46,717 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:34:46,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:34:45" (1/3) ... [2018-11-23 12:34:46,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69388e0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:34:46, skipping insertion in model container [2018-11-23 12:34:46,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:34:45" (2/3) ... [2018-11-23 12:34:46,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69388e0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:34:46, skipping insertion in model container [2018-11-23 12:34:46,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:34:46" (3/3) ... [2018-11-23 12:34:46,721 INFO L112 eAbstractionObserver]: Analyzing ICFG min-2-u_true-unreach-call.i [2018-11-23 12:34:46,732 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:34:46,741 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:34:46,761 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:34:46,794 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:34:46,795 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:34:46,795 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:34:46,795 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:34:46,796 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:34:46,796 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:34:46,796 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:34:46,796 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:34:46,796 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:34:46,817 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-11-23 12:34:46,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 12:34:46,824 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:46,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:46,827 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:46,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:46,833 INFO L82 PathProgramCache]: Analyzing trace with hash 659715076, now seen corresponding path program 1 times [2018-11-23 12:34:46,836 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:46,836 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:46,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:46,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:46,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:46,952 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:46,954 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:46,954 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-23 12:34:46,976 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:47,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:47,061 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:47,400 INFO L256 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {35#true} is VALID [2018-11-23 12:34:47,404 INFO L273 TraceCheckUtils]: 1: Hoare triple {35#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {35#true} is VALID [2018-11-23 12:34:47,404 INFO L273 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2018-11-23 12:34:47,405 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #106#return; {35#true} is VALID [2018-11-23 12:34:47,405 INFO L256 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret5 := main(); {35#true} is VALID [2018-11-23 12:34:47,407 INFO L273 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~min~0;~i~0 := 0;~j~0 := 0; {55#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:47,410 INFO L273 TraceCheckUtils]: 6: Hoare triple {55#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {36#false} is VALID [2018-11-23 12:34:47,410 INFO L273 TraceCheckUtils]: 7: Hoare triple {36#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~min~0 := #t~mem1;havoc #t~mem1; {36#false} is VALID [2018-11-23 12:34:47,410 INFO L273 TraceCheckUtils]: 8: Hoare triple {36#false} assume !(~i~0 < ~n~0); {36#false} is VALID [2018-11-23 12:34:47,411 INFO L273 TraceCheckUtils]: 9: Hoare triple {36#false} ~i~0 := 0;~j~0 := 0; {36#false} is VALID [2018-11-23 12:34:47,411 INFO L273 TraceCheckUtils]: 10: Hoare triple {36#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {36#false} is VALID [2018-11-23 12:34:47,411 INFO L273 TraceCheckUtils]: 11: Hoare triple {36#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {36#false} is VALID [2018-11-23 12:34:47,411 INFO L256 TraceCheckUtils]: 12: Hoare triple {36#false} call __VERIFIER_assert((if #t~mem4 >= ~min~0 then 1 else 0)); {36#false} is VALID [2018-11-23 12:34:47,412 INFO L273 TraceCheckUtils]: 13: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2018-11-23 12:34:47,412 INFO L273 TraceCheckUtils]: 14: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2018-11-23 12:34:47,412 INFO L273 TraceCheckUtils]: 15: Hoare triple {36#false} assume !false; {36#false} is VALID [2018-11-23 12:34:47,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:34:47,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:47,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 12:34:47,441 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:34:47,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:47,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 12:34:47,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:47,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 12:34:47,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 12:34:47,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:34:47,535 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2018-11-23 12:34:47,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:47,889 INFO L93 Difference]: Finished difference Result 61 states and 92 transitions. [2018-11-23 12:34:47,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 12:34:47,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2018-11-23 12:34:47,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:34:47,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2018-11-23 12:34:47,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 12:34:47,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2018-11-23 12:34:47,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 92 transitions. [2018-11-23 12:34:48,451 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:48,463 INFO L225 Difference]: With dead ends: 61 [2018-11-23 12:34:48,464 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 12:34:48,471 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 12:34:48,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 12:34:48,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-23 12:34:48,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:48,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2018-11-23 12:34:48,525 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2018-11-23 12:34:48,526 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2018-11-23 12:34:48,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:48,531 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 12:34:48,531 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 12:34:48,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:48,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:48,532 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2018-11-23 12:34:48,532 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2018-11-23 12:34:48,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:48,537 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2018-11-23 12:34:48,537 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 12:34:48,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:48,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:48,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:48,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:48,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 12:34:48,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2018-11-23 12:34:48,544 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 16 [2018-11-23 12:34:48,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:48,544 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2018-11-23 12:34:48,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 12:34:48,549 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2018-11-23 12:34:48,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 12:34:48,550 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:48,550 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:48,550 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:48,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:48,551 INFO L82 PathProgramCache]: Analyzing trace with hash -528988062, now seen corresponding path program 1 times [2018-11-23 12:34:48,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:48,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:48,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:48,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:48,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:48,564 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:48,564 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:48,565 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-23 12:34:48,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:48,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:48,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:48,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:48,756 INFO L256 TraceCheckUtils]: 0: Hoare triple {269#true} call ULTIMATE.init(); {269#true} is VALID [2018-11-23 12:34:48,757 INFO L273 TraceCheckUtils]: 1: Hoare triple {269#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {269#true} is VALID [2018-11-23 12:34:48,757 INFO L273 TraceCheckUtils]: 2: Hoare triple {269#true} assume true; {269#true} is VALID [2018-11-23 12:34:48,758 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {269#true} {269#true} #106#return; {269#true} is VALID [2018-11-23 12:34:48,758 INFO L256 TraceCheckUtils]: 4: Hoare triple {269#true} call #t~ret5 := main(); {269#true} is VALID [2018-11-23 12:34:48,760 INFO L273 TraceCheckUtils]: 5: Hoare triple {269#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~min~0;~i~0 := 0;~j~0 := 0; {289#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:48,760 INFO L273 TraceCheckUtils]: 6: Hoare triple {289#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {293#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:48,761 INFO L273 TraceCheckUtils]: 7: Hoare triple {293#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !(~j~0 < ~n~0); {270#false} is VALID [2018-11-23 12:34:48,761 INFO L273 TraceCheckUtils]: 8: Hoare triple {270#false} ~i~0 := 1 + ~i~0; {270#false} is VALID [2018-11-23 12:34:48,762 INFO L273 TraceCheckUtils]: 9: Hoare triple {270#false} assume !(~i~0 < ~m~0); {270#false} is VALID [2018-11-23 12:34:48,762 INFO L273 TraceCheckUtils]: 10: Hoare triple {270#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~min~0 := #t~mem1;havoc #t~mem1; {270#false} is VALID [2018-11-23 12:34:48,762 INFO L273 TraceCheckUtils]: 11: Hoare triple {270#false} assume !(~i~0 < ~n~0); {270#false} is VALID [2018-11-23 12:34:48,763 INFO L273 TraceCheckUtils]: 12: Hoare triple {270#false} ~i~0 := 0;~j~0 := 0; {270#false} is VALID [2018-11-23 12:34:48,763 INFO L273 TraceCheckUtils]: 13: Hoare triple {270#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {270#false} is VALID [2018-11-23 12:34:48,763 INFO L273 TraceCheckUtils]: 14: Hoare triple {270#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {270#false} is VALID [2018-11-23 12:34:48,763 INFO L256 TraceCheckUtils]: 15: Hoare triple {270#false} call __VERIFIER_assert((if #t~mem4 >= ~min~0 then 1 else 0)); {270#false} is VALID [2018-11-23 12:34:48,764 INFO L273 TraceCheckUtils]: 16: Hoare triple {270#false} ~cond := #in~cond; {270#false} is VALID [2018-11-23 12:34:48,764 INFO L273 TraceCheckUtils]: 17: Hoare triple {270#false} assume 0 == ~cond; {270#false} is VALID [2018-11-23 12:34:48,764 INFO L273 TraceCheckUtils]: 18: Hoare triple {270#false} assume !false; {270#false} is VALID [2018-11-23 12:34:48,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:34:48,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:48,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:34:48,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-23 12:34:48,788 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:48,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:34:48,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:48,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:34:48,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:34:48,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:48,843 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand 4 states. [2018-11-23 12:34:49,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:49,189 INFO L93 Difference]: Finished difference Result 59 states and 77 transitions. [2018-11-23 12:34:49,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:34:49,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-23 12:34:49,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:49,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:49,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2018-11-23 12:34:49,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:49,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2018-11-23 12:34:49,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2018-11-23 12:34:49,351 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:49,354 INFO L225 Difference]: With dead ends: 59 [2018-11-23 12:34:49,355 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 12:34:49,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:49,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 12:34:49,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2018-11-23 12:34:49,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:49,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 31 states. [2018-11-23 12:34:49,395 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 31 states. [2018-11-23 12:34:49,396 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 31 states. [2018-11-23 12:34:49,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:49,403 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2018-11-23 12:34:49,404 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2018-11-23 12:34:49,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:49,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:49,405 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 38 states. [2018-11-23 12:34:49,405 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 38 states. [2018-11-23 12:34:49,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:49,413 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2018-11-23 12:34:49,414 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 47 transitions. [2018-11-23 12:34:49,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:49,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:49,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:49,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:49,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 12:34:49,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2018-11-23 12:34:49,419 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 37 transitions. Word has length 19 [2018-11-23 12:34:49,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:49,420 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 37 transitions. [2018-11-23 12:34:49,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:34:49,420 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 37 transitions. [2018-11-23 12:34:49,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-23 12:34:49,422 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:49,422 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:49,422 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:49,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:49,423 INFO L82 PathProgramCache]: Analyzing trace with hash -306641421, now seen corresponding path program 1 times [2018-11-23 12:34:49,423 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:49,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:49,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:49,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:49,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:49,433 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:49,434 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:49,434 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-23 12:34:49,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:49,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:49,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:49,652 INFO L256 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2018-11-23 12:34:49,653 INFO L273 TraceCheckUtils]: 1: Hoare triple {538#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {538#true} is VALID [2018-11-23 12:34:49,653 INFO L273 TraceCheckUtils]: 2: Hoare triple {538#true} assume true; {538#true} is VALID [2018-11-23 12:34:49,653 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {538#true} {538#true} #106#return; {538#true} is VALID [2018-11-23 12:34:49,653 INFO L256 TraceCheckUtils]: 4: Hoare triple {538#true} call #t~ret5 := main(); {538#true} is VALID [2018-11-23 12:34:49,654 INFO L273 TraceCheckUtils]: 5: Hoare triple {538#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~min~0;~i~0 := 0;~j~0 := 0; {558#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:49,655 INFO L273 TraceCheckUtils]: 6: Hoare triple {558#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {562#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:49,657 INFO L273 TraceCheckUtils]: 7: Hoare triple {562#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {566#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:49,662 INFO L273 TraceCheckUtils]: 8: Hoare triple {566#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !(~j~0 < ~n~0); {539#false} is VALID [2018-11-23 12:34:49,662 INFO L273 TraceCheckUtils]: 9: Hoare triple {539#false} ~i~0 := 1 + ~i~0; {539#false} is VALID [2018-11-23 12:34:49,662 INFO L273 TraceCheckUtils]: 10: Hoare triple {539#false} assume !(~i~0 < ~m~0); {539#false} is VALID [2018-11-23 12:34:49,663 INFO L273 TraceCheckUtils]: 11: Hoare triple {539#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~min~0 := #t~mem1;havoc #t~mem1; {539#false} is VALID [2018-11-23 12:34:49,663 INFO L273 TraceCheckUtils]: 12: Hoare triple {539#false} assume !(~i~0 < ~n~0); {539#false} is VALID [2018-11-23 12:34:49,663 INFO L273 TraceCheckUtils]: 13: Hoare triple {539#false} ~i~0 := 0;~j~0 := 0; {539#false} is VALID [2018-11-23 12:34:49,663 INFO L273 TraceCheckUtils]: 14: Hoare triple {539#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {539#false} is VALID [2018-11-23 12:34:49,664 INFO L273 TraceCheckUtils]: 15: Hoare triple {539#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {539#false} is VALID [2018-11-23 12:34:49,664 INFO L256 TraceCheckUtils]: 16: Hoare triple {539#false} call __VERIFIER_assert((if #t~mem4 >= ~min~0 then 1 else 0)); {539#false} is VALID [2018-11-23 12:34:49,664 INFO L273 TraceCheckUtils]: 17: Hoare triple {539#false} ~cond := #in~cond; {539#false} is VALID [2018-11-23 12:34:49,665 INFO L273 TraceCheckUtils]: 18: Hoare triple {539#false} assume 0 == ~cond; {539#false} is VALID [2018-11-23 12:34:49,665 INFO L273 TraceCheckUtils]: 19: Hoare triple {539#false} assume !false; {539#false} is VALID [2018-11-23 12:34:49,666 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:34:49,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:49,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-23 12:34:49,686 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 12:34:49,686 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:49,686 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:34:49,713 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:49,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:34:49,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:34:49,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:34:49,714 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. Second operand 5 states. [2018-11-23 12:34:50,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:50,181 INFO L93 Difference]: Finished difference Result 69 states and 89 transitions. [2018-11-23 12:34:50,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 12:34:50,181 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-11-23 12:34:50,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:50,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:50,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2018-11-23 12:34:50,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:34:50,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2018-11-23 12:34:50,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 86 transitions. [2018-11-23 12:34:50,314 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:50,317 INFO L225 Difference]: With dead ends: 69 [2018-11-23 12:34:50,317 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 12:34:50,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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-23 12:34:50,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 12:34:50,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2018-11-23 12:34:50,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:50,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 38 states. [2018-11-23 12:34:50,361 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 38 states. [2018-11-23 12:34:50,361 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 38 states. [2018-11-23 12:34:50,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:50,364 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2018-11-23 12:34:50,365 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2018-11-23 12:34:50,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:50,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:50,366 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 45 states. [2018-11-23 12:34:50,366 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 45 states. [2018-11-23 12:34:50,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:50,369 INFO L93 Difference]: Finished difference Result 45 states and 56 transitions. [2018-11-23 12:34:50,370 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2018-11-23 12:34:50,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:50,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:50,371 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:50,371 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:50,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:34:50,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-11-23 12:34:50,374 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 20 [2018-11-23 12:34:50,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:50,374 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-23 12:34:50,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:34:50,374 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-23 12:34:50,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:34:50,375 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:50,375 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:50,376 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:50,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:50,376 INFO L82 PathProgramCache]: Analyzing trace with hash -2003830142, now seen corresponding path program 2 times [2018-11-23 12:34:50,376 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:50,376 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:50,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:50,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:50,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:50,384 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:50,384 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:50,384 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-23 12:34:50,402 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:34:50,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 12:34:50,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:50,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:50,519 INFO L256 TraceCheckUtils]: 0: Hoare triple {853#true} call ULTIMATE.init(); {853#true} is VALID [2018-11-23 12:34:50,520 INFO L273 TraceCheckUtils]: 1: Hoare triple {853#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {853#true} is VALID [2018-11-23 12:34:50,520 INFO L273 TraceCheckUtils]: 2: Hoare triple {853#true} assume true; {853#true} is VALID [2018-11-23 12:34:50,520 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {853#true} {853#true} #106#return; {853#true} is VALID [2018-11-23 12:34:50,521 INFO L256 TraceCheckUtils]: 4: Hoare triple {853#true} call #t~ret5 := main(); {853#true} is VALID [2018-11-23 12:34:50,522 INFO L273 TraceCheckUtils]: 5: Hoare triple {853#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~min~0;~i~0 := 0;~j~0 := 0; {873#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:50,522 INFO L273 TraceCheckUtils]: 6: Hoare triple {873#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {873#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:50,524 INFO L273 TraceCheckUtils]: 7: Hoare triple {873#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {873#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:50,526 INFO L273 TraceCheckUtils]: 8: Hoare triple {873#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {873#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:50,526 INFO L273 TraceCheckUtils]: 9: Hoare triple {873#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {873#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:50,527 INFO L273 TraceCheckUtils]: 10: Hoare triple {873#(<= 1500 main_~n~0)} ~i~0 := 1 + ~i~0; {873#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:50,528 INFO L273 TraceCheckUtils]: 11: Hoare triple {873#(<= 1500 main_~n~0)} assume !(~i~0 < ~m~0); {873#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:50,529 INFO L273 TraceCheckUtils]: 12: Hoare triple {873#(<= 1500 main_~n~0)} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~min~0 := #t~mem1;havoc #t~mem1; {895#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:50,530 INFO L273 TraceCheckUtils]: 13: Hoare triple {895#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume !(~i~0 < ~n~0); {854#false} is VALID [2018-11-23 12:34:50,530 INFO L273 TraceCheckUtils]: 14: Hoare triple {854#false} ~i~0 := 0;~j~0 := 0; {854#false} is VALID [2018-11-23 12:34:50,531 INFO L273 TraceCheckUtils]: 15: Hoare triple {854#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {854#false} is VALID [2018-11-23 12:34:50,531 INFO L273 TraceCheckUtils]: 16: Hoare triple {854#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {854#false} is VALID [2018-11-23 12:34:50,532 INFO L256 TraceCheckUtils]: 17: Hoare triple {854#false} call __VERIFIER_assert((if #t~mem4 >= ~min~0 then 1 else 0)); {854#false} is VALID [2018-11-23 12:34:50,532 INFO L273 TraceCheckUtils]: 18: Hoare triple {854#false} ~cond := #in~cond; {854#false} is VALID [2018-11-23 12:34:50,532 INFO L273 TraceCheckUtils]: 19: Hoare triple {854#false} assume 0 == ~cond; {854#false} is VALID [2018-11-23 12:34:50,533 INFO L273 TraceCheckUtils]: 20: Hoare triple {854#false} assume !false; {854#false} is VALID [2018-11-23 12:34:50,534 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 12:34:50,552 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:34:50,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 12:34:50,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-23 12:34:50,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:50,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:34:50,574 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:50,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:34:50,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:34:50,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:50,576 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 4 states. [2018-11-23 12:34:51,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:51,054 INFO L93 Difference]: Finished difference Result 76 states and 94 transitions. [2018-11-23 12:34:51,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:34:51,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-11-23 12:34:51,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:51,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:51,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2018-11-23 12:34:51,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 65 transitions. [2018-11-23 12:34:51,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 65 transitions. [2018-11-23 12:34:51,130 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:51,133 INFO L225 Difference]: With dead ends: 76 [2018-11-23 12:34:51,133 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 12:34:51,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:51,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 12:34:51,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 39. [2018-11-23 12:34:51,206 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:51,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 39 states. [2018-11-23 12:34:51,207 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 39 states. [2018-11-23 12:34:51,207 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 39 states. [2018-11-23 12:34:51,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:51,213 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2018-11-23 12:34:51,214 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2018-11-23 12:34:51,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:51,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:51,215 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 60 states. [2018-11-23 12:34:51,215 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 60 states. [2018-11-23 12:34:51,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:51,219 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2018-11-23 12:34:51,219 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2018-11-23 12:34:51,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:51,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:51,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:51,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:51,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:34:51,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2018-11-23 12:34:51,223 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 21 [2018-11-23 12:34:51,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:51,223 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2018-11-23 12:34:51,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:34:51,223 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2018-11-23 12:34:51,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 12:34:51,224 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:51,225 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:51,225 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:51,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:51,225 INFO L82 PathProgramCache]: Analyzing trace with hash -851590433, now seen corresponding path program 1 times [2018-11-23 12:34:51,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:51,226 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:51,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:51,227 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:51,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:51,233 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:51,233 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:51,233 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-23 12:34:51,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:51,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:51,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:51,398 INFO L256 TraceCheckUtils]: 0: Hoare triple {1215#true} call ULTIMATE.init(); {1215#true} is VALID [2018-11-23 12:34:51,399 INFO L273 TraceCheckUtils]: 1: Hoare triple {1215#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1215#true} is VALID [2018-11-23 12:34:51,399 INFO L273 TraceCheckUtils]: 2: Hoare triple {1215#true} assume true; {1215#true} is VALID [2018-11-23 12:34:51,399 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1215#true} {1215#true} #106#return; {1215#true} is VALID [2018-11-23 12:34:51,400 INFO L256 TraceCheckUtils]: 4: Hoare triple {1215#true} call #t~ret5 := main(); {1215#true} is VALID [2018-11-23 12:34:51,401 INFO L273 TraceCheckUtils]: 5: Hoare triple {1215#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~min~0;~i~0 := 0;~j~0 := 0; {1235#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:51,401 INFO L273 TraceCheckUtils]: 6: Hoare triple {1235#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {1239#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:51,402 INFO L273 TraceCheckUtils]: 7: Hoare triple {1239#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1243#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:51,403 INFO L273 TraceCheckUtils]: 8: Hoare triple {1243#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1247#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:34:51,404 INFO L273 TraceCheckUtils]: 9: Hoare triple {1247#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !(~j~0 < ~n~0); {1216#false} is VALID [2018-11-23 12:34:51,404 INFO L273 TraceCheckUtils]: 10: Hoare triple {1216#false} ~i~0 := 1 + ~i~0; {1216#false} is VALID [2018-11-23 12:34:51,405 INFO L273 TraceCheckUtils]: 11: Hoare triple {1216#false} assume !(~i~0 < ~m~0); {1216#false} is VALID [2018-11-23 12:34:51,405 INFO L273 TraceCheckUtils]: 12: Hoare triple {1216#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~min~0 := #t~mem1;havoc #t~mem1; {1216#false} is VALID [2018-11-23 12:34:51,406 INFO L273 TraceCheckUtils]: 13: Hoare triple {1216#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {1216#false} is VALID [2018-11-23 12:34:51,406 INFO L273 TraceCheckUtils]: 14: Hoare triple {1216#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1216#false} is VALID [2018-11-23 12:34:51,407 INFO L273 TraceCheckUtils]: 15: Hoare triple {1216#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {1216#false} is VALID [2018-11-23 12:34:51,407 INFO L273 TraceCheckUtils]: 16: Hoare triple {1216#false} ~j~0 := 1 + ~j~0; {1216#false} is VALID [2018-11-23 12:34:51,408 INFO L273 TraceCheckUtils]: 17: Hoare triple {1216#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1216#false} is VALID [2018-11-23 12:34:51,408 INFO L273 TraceCheckUtils]: 18: Hoare triple {1216#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {1216#false} is VALID [2018-11-23 12:34:51,408 INFO L273 TraceCheckUtils]: 19: Hoare triple {1216#false} ~j~0 := 1 + ~j~0; {1216#false} is VALID [2018-11-23 12:34:51,408 INFO L273 TraceCheckUtils]: 20: Hoare triple {1216#false} assume !(~j~0 < ~n~0); {1216#false} is VALID [2018-11-23 12:34:51,409 INFO L273 TraceCheckUtils]: 21: Hoare triple {1216#false} ~i~0 := 1 + ~i~0; {1216#false} is VALID [2018-11-23 12:34:51,409 INFO L273 TraceCheckUtils]: 22: Hoare triple {1216#false} assume !(~i~0 < ~n~0); {1216#false} is VALID [2018-11-23 12:34:51,409 INFO L273 TraceCheckUtils]: 23: Hoare triple {1216#false} ~i~0 := 0;~j~0 := 0; {1216#false} is VALID [2018-11-23 12:34:51,409 INFO L273 TraceCheckUtils]: 24: Hoare triple {1216#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {1216#false} is VALID [2018-11-23 12:34:51,410 INFO L273 TraceCheckUtils]: 25: Hoare triple {1216#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1216#false} is VALID [2018-11-23 12:34:51,410 INFO L256 TraceCheckUtils]: 26: Hoare triple {1216#false} call __VERIFIER_assert((if #t~mem4 >= ~min~0 then 1 else 0)); {1216#false} is VALID [2018-11-23 12:34:51,410 INFO L273 TraceCheckUtils]: 27: Hoare triple {1216#false} ~cond := #in~cond; {1216#false} is VALID [2018-11-23 12:34:51,410 INFO L273 TraceCheckUtils]: 28: Hoare triple {1216#false} assume 0 == ~cond; {1216#false} is VALID [2018-11-23 12:34:51,411 INFO L273 TraceCheckUtils]: 29: Hoare triple {1216#false} assume !false; {1216#false} is VALID [2018-11-23 12:34:51,413 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 12:34:51,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:51,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 12:34:51,432 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-11-23 12:34:51,433 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:51,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:34:51,479 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:51,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:34:51,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:34:51,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:34:51,480 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 6 states. [2018-11-23 12:34:51,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:51,803 INFO L93 Difference]: Finished difference Result 83 states and 106 transitions. [2018-11-23 12:34:51,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:34:51,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-11-23 12:34:51,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:51,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:34:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2018-11-23 12:34:51,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:34:51,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 93 transitions. [2018-11-23 12:34:51,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 93 transitions. [2018-11-23 12:34:52,052 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:52,054 INFO L225 Difference]: With dead ends: 83 [2018-11-23 12:34:52,054 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:34:52,055 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 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-23 12:34:52,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:34:52,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2018-11-23 12:34:52,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:52,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 46 states. [2018-11-23 12:34:52,120 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 46 states. [2018-11-23 12:34:52,120 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 46 states. [2018-11-23 12:34:52,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:52,124 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2018-11-23 12:34:52,124 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2018-11-23 12:34:52,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:52,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:52,126 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 51 states. [2018-11-23 12:34:52,126 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 51 states. [2018-11-23 12:34:52,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:52,133 INFO L93 Difference]: Finished difference Result 51 states and 63 transitions. [2018-11-23 12:34:52,133 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2018-11-23 12:34:52,133 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:52,133 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:52,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:52,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:52,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:34:52,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2018-11-23 12:34:52,139 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 30 [2018-11-23 12:34:52,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:52,139 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-11-23 12:34:52,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:34:52,140 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2018-11-23 12:34:52,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 12:34:52,143 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:52,143 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:52,143 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:52,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:52,144 INFO L82 PathProgramCache]: Analyzing trace with hash -241858451, now seen corresponding path program 2 times [2018-11-23 12:34:52,144 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:52,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:52,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:52,145 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:34:52,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:52,160 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:52,160 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:52,160 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-23 12:34:52,186 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:34:52,217 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:34:52,217 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:52,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:52,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:52,446 INFO L256 TraceCheckUtils]: 0: Hoare triple {1609#true} call ULTIMATE.init(); {1609#true} is VALID [2018-11-23 12:34:52,447 INFO L273 TraceCheckUtils]: 1: Hoare triple {1609#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1609#true} is VALID [2018-11-23 12:34:52,447 INFO L273 TraceCheckUtils]: 2: Hoare triple {1609#true} assume true; {1609#true} is VALID [2018-11-23 12:34:52,448 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1609#true} {1609#true} #106#return; {1609#true} is VALID [2018-11-23 12:34:52,448 INFO L256 TraceCheckUtils]: 4: Hoare triple {1609#true} call #t~ret5 := main(); {1609#true} is VALID [2018-11-23 12:34:52,449 INFO L273 TraceCheckUtils]: 5: Hoare triple {1609#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~min~0;~i~0 := 0;~j~0 := 0; {1629#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:34:52,449 INFO L273 TraceCheckUtils]: 6: Hoare triple {1629#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {1633#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:34:52,450 INFO L273 TraceCheckUtils]: 7: Hoare triple {1633#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1637#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:34:52,451 INFO L273 TraceCheckUtils]: 8: Hoare triple {1637#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1641#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:34:52,453 INFO L273 TraceCheckUtils]: 9: Hoare triple {1641#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {1645#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:34:52,454 INFO L273 TraceCheckUtils]: 10: Hoare triple {1645#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !(~j~0 < ~n~0); {1610#false} is VALID [2018-11-23 12:34:52,454 INFO L273 TraceCheckUtils]: 11: Hoare triple {1610#false} ~i~0 := 1 + ~i~0; {1610#false} is VALID [2018-11-23 12:34:52,455 INFO L273 TraceCheckUtils]: 12: Hoare triple {1610#false} assume !(~i~0 < ~m~0); {1610#false} is VALID [2018-11-23 12:34:52,455 INFO L273 TraceCheckUtils]: 13: Hoare triple {1610#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~min~0 := #t~mem1;havoc #t~mem1; {1610#false} is VALID [2018-11-23 12:34:52,456 INFO L273 TraceCheckUtils]: 14: Hoare triple {1610#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {1610#false} is VALID [2018-11-23 12:34:52,456 INFO L273 TraceCheckUtils]: 15: Hoare triple {1610#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1610#false} is VALID [2018-11-23 12:34:52,456 INFO L273 TraceCheckUtils]: 16: Hoare triple {1610#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {1610#false} is VALID [2018-11-23 12:34:52,457 INFO L273 TraceCheckUtils]: 17: Hoare triple {1610#false} ~j~0 := 1 + ~j~0; {1610#false} is VALID [2018-11-23 12:34:52,457 INFO L273 TraceCheckUtils]: 18: Hoare triple {1610#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1610#false} is VALID [2018-11-23 12:34:52,457 INFO L273 TraceCheckUtils]: 19: Hoare triple {1610#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {1610#false} is VALID [2018-11-23 12:34:52,458 INFO L273 TraceCheckUtils]: 20: Hoare triple {1610#false} ~j~0 := 1 + ~j~0; {1610#false} is VALID [2018-11-23 12:34:52,458 INFO L273 TraceCheckUtils]: 21: Hoare triple {1610#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1610#false} is VALID [2018-11-23 12:34:52,458 INFO L273 TraceCheckUtils]: 22: Hoare triple {1610#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {1610#false} is VALID [2018-11-23 12:34:52,459 INFO L273 TraceCheckUtils]: 23: Hoare triple {1610#false} ~j~0 := 1 + ~j~0; {1610#false} is VALID [2018-11-23 12:34:52,459 INFO L273 TraceCheckUtils]: 24: Hoare triple {1610#false} assume !(~j~0 < ~n~0); {1610#false} is VALID [2018-11-23 12:34:52,459 INFO L273 TraceCheckUtils]: 25: Hoare triple {1610#false} ~i~0 := 1 + ~i~0; {1610#false} is VALID [2018-11-23 12:34:52,459 INFO L273 TraceCheckUtils]: 26: Hoare triple {1610#false} assume !(~i~0 < ~n~0); {1610#false} is VALID [2018-11-23 12:34:52,459 INFO L273 TraceCheckUtils]: 27: Hoare triple {1610#false} ~i~0 := 0;~j~0 := 0; {1610#false} is VALID [2018-11-23 12:34:52,460 INFO L273 TraceCheckUtils]: 28: Hoare triple {1610#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {1610#false} is VALID [2018-11-23 12:34:52,460 INFO L273 TraceCheckUtils]: 29: Hoare triple {1610#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1610#false} is VALID [2018-11-23 12:34:52,460 INFO L256 TraceCheckUtils]: 30: Hoare triple {1610#false} call __VERIFIER_assert((if #t~mem4 >= ~min~0 then 1 else 0)); {1610#false} is VALID [2018-11-23 12:34:52,460 INFO L273 TraceCheckUtils]: 31: Hoare triple {1610#false} ~cond := #in~cond; {1610#false} is VALID [2018-11-23 12:34:52,461 INFO L273 TraceCheckUtils]: 32: Hoare triple {1610#false} assume 0 == ~cond; {1610#false} is VALID [2018-11-23 12:34:52,461 INFO L273 TraceCheckUtils]: 33: Hoare triple {1610#false} assume !false; {1610#false} is VALID [2018-11-23 12:34:52,463 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2018-11-23 12:34:52,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:52,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-23 12:34:52,487 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-23 12:34:52,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:52,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:34:52,514 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:52,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:34:52,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:34:52,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:34:52,515 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 7 states. [2018-11-23 12:34:53,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:53,045 INFO L93 Difference]: Finished difference Result 97 states and 124 transitions. [2018-11-23 12:34:53,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 12:34:53,046 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2018-11-23 12:34:53,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:53,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:34:53,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2018-11-23 12:34:53,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:34:53,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 102 transitions. [2018-11-23 12:34:53,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 102 transitions. [2018-11-23 12:34:53,274 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:53,276 INFO L225 Difference]: With dead ends: 97 [2018-11-23 12:34:53,276 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 12:34:53,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 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-23 12:34:53,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 12:34:53,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2018-11-23 12:34:53,465 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:53,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 53 states. [2018-11-23 12:34:53,465 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 53 states. [2018-11-23 12:34:53,466 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 53 states. [2018-11-23 12:34:53,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:53,468 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2018-11-23 12:34:53,484 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2018-11-23 12:34:53,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:53,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:53,485 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 58 states. [2018-11-23 12:34:53,485 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 58 states. [2018-11-23 12:34:53,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:53,488 INFO L93 Difference]: Finished difference Result 58 states and 72 transitions. [2018-11-23 12:34:53,488 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 72 transitions. [2018-11-23 12:34:53,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:53,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:53,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:53,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:53,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:34:53,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2018-11-23 12:34:53,491 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 34 [2018-11-23 12:34:53,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:53,491 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2018-11-23 12:34:53,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:34:53,492 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2018-11-23 12:34:53,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-11-23 12:34:53,492 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:53,493 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:53,493 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:53,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:53,494 INFO L82 PathProgramCache]: Analyzing trace with hash -123740257, now seen corresponding path program 3 times [2018-11-23 12:34:53,494 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:53,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:53,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:53,495 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:53,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:53,510 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:53,510 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:53,510 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-23 12:34:53,532 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:34:53,552 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 12:34:53,552 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:53,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:53,577 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:53,687 INFO L256 TraceCheckUtils]: 0: Hoare triple {2063#true} call ULTIMATE.init(); {2063#true} is VALID [2018-11-23 12:34:53,687 INFO L273 TraceCheckUtils]: 1: Hoare triple {2063#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2063#true} is VALID [2018-11-23 12:34:53,688 INFO L273 TraceCheckUtils]: 2: Hoare triple {2063#true} assume true; {2063#true} is VALID [2018-11-23 12:34:53,688 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2063#true} {2063#true} #106#return; {2063#true} is VALID [2018-11-23 12:34:53,688 INFO L256 TraceCheckUtils]: 4: Hoare triple {2063#true} call #t~ret5 := main(); {2063#true} is VALID [2018-11-23 12:34:53,693 INFO L273 TraceCheckUtils]: 5: Hoare triple {2063#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~min~0;~i~0 := 0;~j~0 := 0; {2083#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:53,694 INFO L273 TraceCheckUtils]: 6: Hoare triple {2083#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0; {2083#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:53,695 INFO L273 TraceCheckUtils]: 7: Hoare triple {2083#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2083#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:53,695 INFO L273 TraceCheckUtils]: 8: Hoare triple {2083#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2083#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:53,697 INFO L273 TraceCheckUtils]: 9: Hoare triple {2083#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2083#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:53,698 INFO L273 TraceCheckUtils]: 10: Hoare triple {2083#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2083#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:53,699 INFO L273 TraceCheckUtils]: 11: Hoare triple {2083#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {2083#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:53,700 INFO L273 TraceCheckUtils]: 12: Hoare triple {2083#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~i~0 := 1 + ~i~0; {2105#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-23 12:34:53,701 INFO L273 TraceCheckUtils]: 13: Hoare triple {2105#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {2064#false} is VALID [2018-11-23 12:34:53,701 INFO L273 TraceCheckUtils]: 14: Hoare triple {2064#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~min~0 := #t~mem1;havoc #t~mem1; {2064#false} is VALID [2018-11-23 12:34:53,701 INFO L273 TraceCheckUtils]: 15: Hoare triple {2064#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {2064#false} is VALID [2018-11-23 12:34:53,702 INFO L273 TraceCheckUtils]: 16: Hoare triple {2064#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {2064#false} is VALID [2018-11-23 12:34:53,702 INFO L273 TraceCheckUtils]: 17: Hoare triple {2064#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {2064#false} is VALID [2018-11-23 12:34:53,702 INFO L273 TraceCheckUtils]: 18: Hoare triple {2064#false} ~j~0 := 1 + ~j~0; {2064#false} is VALID [2018-11-23 12:34:53,703 INFO L273 TraceCheckUtils]: 19: Hoare triple {2064#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {2064#false} is VALID [2018-11-23 12:34:53,703 INFO L273 TraceCheckUtils]: 20: Hoare triple {2064#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {2064#false} is VALID [2018-11-23 12:34:53,703 INFO L273 TraceCheckUtils]: 21: Hoare triple {2064#false} ~j~0 := 1 + ~j~0; {2064#false} is VALID [2018-11-23 12:34:53,704 INFO L273 TraceCheckUtils]: 22: Hoare triple {2064#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {2064#false} is VALID [2018-11-23 12:34:53,704 INFO L273 TraceCheckUtils]: 23: Hoare triple {2064#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {2064#false} is VALID [2018-11-23 12:34:53,705 INFO L273 TraceCheckUtils]: 24: Hoare triple {2064#false} ~j~0 := 1 + ~j~0; {2064#false} is VALID [2018-11-23 12:34:53,705 INFO L273 TraceCheckUtils]: 25: Hoare triple {2064#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {2064#false} is VALID [2018-11-23 12:34:53,705 INFO L273 TraceCheckUtils]: 26: Hoare triple {2064#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {2064#false} is VALID [2018-11-23 12:34:53,705 INFO L273 TraceCheckUtils]: 27: Hoare triple {2064#false} ~j~0 := 1 + ~j~0; {2064#false} is VALID [2018-11-23 12:34:53,706 INFO L273 TraceCheckUtils]: 28: Hoare triple {2064#false} assume !(~j~0 < ~n~0); {2064#false} is VALID [2018-11-23 12:34:53,706 INFO L273 TraceCheckUtils]: 29: Hoare triple {2064#false} ~i~0 := 1 + ~i~0; {2064#false} is VALID [2018-11-23 12:34:53,706 INFO L273 TraceCheckUtils]: 30: Hoare triple {2064#false} assume !(~i~0 < ~n~0); {2064#false} is VALID [2018-11-23 12:34:53,706 INFO L273 TraceCheckUtils]: 31: Hoare triple {2064#false} ~i~0 := 0;~j~0 := 0; {2064#false} is VALID [2018-11-23 12:34:53,707 INFO L273 TraceCheckUtils]: 32: Hoare triple {2064#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {2064#false} is VALID [2018-11-23 12:34:53,707 INFO L273 TraceCheckUtils]: 33: Hoare triple {2064#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {2064#false} is VALID [2018-11-23 12:34:53,707 INFO L256 TraceCheckUtils]: 34: Hoare triple {2064#false} call __VERIFIER_assert((if #t~mem4 >= ~min~0 then 1 else 0)); {2064#false} is VALID [2018-11-23 12:34:53,708 INFO L273 TraceCheckUtils]: 35: Hoare triple {2064#false} ~cond := #in~cond; {2064#false} is VALID [2018-11-23 12:34:53,708 INFO L273 TraceCheckUtils]: 36: Hoare triple {2064#false} assume 0 == ~cond; {2064#false} is VALID [2018-11-23 12:34:53,708 INFO L273 TraceCheckUtils]: 37: Hoare triple {2064#false} assume !false; {2064#false} is VALID [2018-11-23 12:34:53,710 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-23 12:34:53,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:53,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-23 12:34:53,744 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-11-23 12:34:53,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:53,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 12:34:53,765 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:53,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 12:34:53,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 12:34:53,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:53,767 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 4 states. [2018-11-23 12:34:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:54,232 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2018-11-23 12:34:54,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 12:34:54,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-11-23 12:34:54,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:54,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:54,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2018-11-23 12:34:54,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 12:34:54,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 64 transitions. [2018-11-23 12:34:54,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 64 transitions. [2018-11-23 12:34:54,306 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:54,308 INFO L225 Difference]: With dead ends: 105 [2018-11-23 12:34:54,309 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 12:34:54,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 12:34:54,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 12:34:54,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2018-11-23 12:34:54,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:54,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 60 states. [2018-11-23 12:34:54,388 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 60 states. [2018-11-23 12:34:54,388 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 60 states. [2018-11-23 12:34:54,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:54,392 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-11-23 12:34:54,392 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2018-11-23 12:34:54,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:54,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:54,393 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 66 states. [2018-11-23 12:34:54,393 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 66 states. [2018-11-23 12:34:54,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:54,395 INFO L93 Difference]: Finished difference Result 66 states and 80 transitions. [2018-11-23 12:34:54,396 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 80 transitions. [2018-11-23 12:34:54,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:54,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:54,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:54,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:54,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-23 12:34:54,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2018-11-23 12:34:54,399 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 38 [2018-11-23 12:34:54,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:54,399 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2018-11-23 12:34:54,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 12:34:54,399 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2018-11-23 12:34:54,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 12:34:54,400 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:54,400 INFO L402 BasicCegarLoop]: trace histogram [8, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:54,401 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:54,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:54,401 INFO L82 PathProgramCache]: Analyzing trace with hash 1198106045, now seen corresponding path program 4 times [2018-11-23 12:34:54,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:54,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:54,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:54,402 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:54,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:54,408 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:54,408 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:54,408 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-23 12:34:54,419 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:34:54,440 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:34:54,440 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:34:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:34:54,475 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:34:54,857 INFO L256 TraceCheckUtils]: 0: Hoare triple {2570#true} call ULTIMATE.init(); {2570#true} is VALID [2018-11-23 12:34:54,858 INFO L273 TraceCheckUtils]: 1: Hoare triple {2570#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2570#true} is VALID [2018-11-23 12:34:54,858 INFO L273 TraceCheckUtils]: 2: Hoare triple {2570#true} assume true; {2570#true} is VALID [2018-11-23 12:34:54,858 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2570#true} {2570#true} #106#return; {2570#true} is VALID [2018-11-23 12:34:54,859 INFO L256 TraceCheckUtils]: 4: Hoare triple {2570#true} call #t~ret5 := main(); {2570#true} is VALID [2018-11-23 12:34:54,859 INFO L273 TraceCheckUtils]: 5: Hoare triple {2570#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~min~0;~i~0 := 0;~j~0 := 0; {2570#true} is VALID [2018-11-23 12:34:54,859 INFO L273 TraceCheckUtils]: 6: Hoare triple {2570#true} assume !!(~i~0 < ~m~0);~j~0 := 0; {2570#true} is VALID [2018-11-23 12:34:54,860 INFO L273 TraceCheckUtils]: 7: Hoare triple {2570#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2570#true} is VALID [2018-11-23 12:34:54,860 INFO L273 TraceCheckUtils]: 8: Hoare triple {2570#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2570#true} is VALID [2018-11-23 12:34:54,860 INFO L273 TraceCheckUtils]: 9: Hoare triple {2570#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2570#true} is VALID [2018-11-23 12:34:54,860 INFO L273 TraceCheckUtils]: 10: Hoare triple {2570#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2570#true} is VALID [2018-11-23 12:34:54,861 INFO L273 TraceCheckUtils]: 11: Hoare triple {2570#true} assume !(~j~0 < ~n~0); {2570#true} is VALID [2018-11-23 12:34:54,861 INFO L273 TraceCheckUtils]: 12: Hoare triple {2570#true} ~i~0 := 1 + ~i~0; {2570#true} is VALID [2018-11-23 12:34:54,861 INFO L273 TraceCheckUtils]: 13: Hoare triple {2570#true} assume !!(~i~0 < ~m~0);~j~0 := 0; {2570#true} is VALID [2018-11-23 12:34:54,861 INFO L273 TraceCheckUtils]: 14: Hoare triple {2570#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2570#true} is VALID [2018-11-23 12:34:54,862 INFO L273 TraceCheckUtils]: 15: Hoare triple {2570#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2570#true} is VALID [2018-11-23 12:34:54,862 INFO L273 TraceCheckUtils]: 16: Hoare triple {2570#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2570#true} is VALID [2018-11-23 12:34:54,862 INFO L273 TraceCheckUtils]: 17: Hoare triple {2570#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {2570#true} is VALID [2018-11-23 12:34:54,862 INFO L273 TraceCheckUtils]: 18: Hoare triple {2570#true} assume !(~j~0 < ~n~0); {2570#true} is VALID [2018-11-23 12:34:54,863 INFO L273 TraceCheckUtils]: 19: Hoare triple {2570#true} ~i~0 := 1 + ~i~0; {2570#true} is VALID [2018-11-23 12:34:54,863 INFO L273 TraceCheckUtils]: 20: Hoare triple {2570#true} assume !(~i~0 < ~m~0); {2570#true} is VALID [2018-11-23 12:34:54,871 INFO L273 TraceCheckUtils]: 21: Hoare triple {2570#true} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~min~0 := #t~mem1;havoc #t~mem1; {2638#(<= main_~i~0 0)} is VALID [2018-11-23 12:34:54,872 INFO L273 TraceCheckUtils]: 22: Hoare triple {2638#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 0; {2642#(and (<= 0 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:54,873 INFO L273 TraceCheckUtils]: 23: Hoare triple {2642#(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 * (4 * ~n~0) + 4 * ~j~0, 4); {2642#(and (<= 0 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:54,873 INFO L273 TraceCheckUtils]: 24: Hoare triple {2642#(and (<= 0 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {2642#(and (<= 0 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:54,874 INFO L273 TraceCheckUtils]: 25: Hoare triple {2642#(and (<= 0 main_~j~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {2652#(and (<= 1 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:54,881 INFO L273 TraceCheckUtils]: 26: Hoare triple {2652#(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 * (4 * ~n~0) + 4 * ~j~0, 4); {2652#(and (<= 1 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:54,881 INFO L273 TraceCheckUtils]: 27: Hoare triple {2652#(and (<= 1 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {2652#(and (<= 1 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:54,883 INFO L273 TraceCheckUtils]: 28: Hoare triple {2652#(and (<= 1 main_~j~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {2662#(and (<= 2 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:54,883 INFO L273 TraceCheckUtils]: 29: Hoare triple {2662#(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 * (4 * ~n~0) + 4 * ~j~0, 4); {2662#(and (<= 2 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:54,886 INFO L273 TraceCheckUtils]: 30: Hoare triple {2662#(and (<= 2 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {2662#(and (<= 2 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:54,886 INFO L273 TraceCheckUtils]: 31: Hoare triple {2662#(and (<= 2 main_~j~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {2672#(and (<= 3 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:54,887 INFO L273 TraceCheckUtils]: 32: Hoare triple {2672#(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 * (4 * ~n~0) + 4 * ~j~0, 4); {2676#(and (<= 4 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:54,887 INFO L273 TraceCheckUtils]: 33: Hoare triple {2676#(and (<= 4 main_~n~0) (<= main_~i~0 0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {2676#(and (<= 4 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:54,888 INFO L273 TraceCheckUtils]: 34: Hoare triple {2676#(and (<= 4 main_~n~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {2676#(and (<= 4 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:54,888 INFO L273 TraceCheckUtils]: 35: Hoare triple {2676#(and (<= 4 main_~n~0) (<= main_~i~0 0))} assume !(~j~0 < ~n~0); {2676#(and (<= 4 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:34:54,889 INFO L273 TraceCheckUtils]: 36: Hoare triple {2676#(and (<= 4 main_~n~0) (<= main_~i~0 0))} ~i~0 := 1 + ~i~0; {2689#(and (<= main_~i~0 1) (<= 4 main_~n~0))} is VALID [2018-11-23 12:34:54,890 INFO L273 TraceCheckUtils]: 37: Hoare triple {2689#(and (<= main_~i~0 1) (<= 4 main_~n~0))} assume !(~i~0 < ~n~0); {2571#false} is VALID [2018-11-23 12:34:54,890 INFO L273 TraceCheckUtils]: 38: Hoare triple {2571#false} ~i~0 := 0;~j~0 := 0; {2571#false} is VALID [2018-11-23 12:34:54,890 INFO L273 TraceCheckUtils]: 39: Hoare triple {2571#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {2571#false} is VALID [2018-11-23 12:34:54,891 INFO L273 TraceCheckUtils]: 40: Hoare triple {2571#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {2571#false} is VALID [2018-11-23 12:34:54,891 INFO L256 TraceCheckUtils]: 41: Hoare triple {2571#false} call __VERIFIER_assert((if #t~mem4 >= ~min~0 then 1 else 0)); {2571#false} is VALID [2018-11-23 12:34:54,891 INFO L273 TraceCheckUtils]: 42: Hoare triple {2571#false} ~cond := #in~cond; {2571#false} is VALID [2018-11-23 12:34:54,892 INFO L273 TraceCheckUtils]: 43: Hoare triple {2571#false} assume 0 == ~cond; {2571#false} is VALID [2018-11-23 12:34:54,892 INFO L273 TraceCheckUtils]: 44: Hoare triple {2571#false} assume !false; {2571#false} is VALID [2018-11-23 12:34:54,896 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 11 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-23 12:34:54,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:34:54,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-23 12:34:54,917 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-11-23 12:34:54,918 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:34:54,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:34:54,954 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:54,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:34:54,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:34:54,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:34:54,955 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand 9 states. [2018-11-23 12:34:56,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:56,082 INFO L93 Difference]: Finished difference Result 147 states and 186 transitions. [2018-11-23 12:34:56,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:34:56,083 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-11-23 12:34:56,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:34:56,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:34:56,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2018-11-23 12:34:56,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:34:56,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2018-11-23 12:34:56,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 112 transitions. [2018-11-23 12:34:56,287 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:34:56,290 INFO L225 Difference]: With dead ends: 147 [2018-11-23 12:34:56,290 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 12:34:56,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 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-23 12:34:56,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 12:34:56,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 75. [2018-11-23 12:34:56,467 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:34:56,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 75 states. [2018-11-23 12:34:56,467 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 75 states. [2018-11-23 12:34:56,467 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 75 states. [2018-11-23 12:34:56,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:56,473 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2018-11-23 12:34:56,473 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 159 transitions. [2018-11-23 12:34:56,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:56,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:56,474 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand 125 states. [2018-11-23 12:34:56,474 INFO L87 Difference]: Start difference. First operand 75 states. Second operand 125 states. [2018-11-23 12:34:56,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:34:56,479 INFO L93 Difference]: Finished difference Result 125 states and 159 transitions. [2018-11-23 12:34:56,479 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 159 transitions. [2018-11-23 12:34:56,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:34:56,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:34:56,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:34:56,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:34:56,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-23 12:34:56,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 93 transitions. [2018-11-23 12:34:56,483 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 93 transitions. Word has length 45 [2018-11-23 12:34:56,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:34:56,484 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 93 transitions. [2018-11-23 12:34:56,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:34:56,484 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 93 transitions. [2018-11-23 12:34:56,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 12:34:56,485 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:34:56,485 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:34:56,485 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:34:56,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:34:56,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1312433444, now seen corresponding path program 5 times [2018-11-23 12:34:56,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:34:56,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:34:56,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:56,487 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:34:56,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:34:56,492 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:34:56,492 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:34:56,493 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-23 12:34:56,512 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:37:33,161 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2018-11-23 12:37:33,161 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:37:33,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:33,188 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:37:33,366 INFO L256 TraceCheckUtils]: 0: Hoare triple {3317#true} call ULTIMATE.init(); {3317#true} is VALID [2018-11-23 12:37:33,367 INFO L273 TraceCheckUtils]: 1: Hoare triple {3317#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3317#true} is VALID [2018-11-23 12:37:33,367 INFO L273 TraceCheckUtils]: 2: Hoare triple {3317#true} assume true; {3317#true} is VALID [2018-11-23 12:37:33,367 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3317#true} {3317#true} #106#return; {3317#true} is VALID [2018-11-23 12:37:33,367 INFO L256 TraceCheckUtils]: 4: Hoare triple {3317#true} call #t~ret5 := main(); {3317#true} is VALID [2018-11-23 12:37:33,368 INFO L273 TraceCheckUtils]: 5: Hoare triple {3317#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~min~0;~i~0 := 0;~j~0 := 0; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:33,369 INFO L273 TraceCheckUtils]: 6: Hoare triple {3337#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:33,369 INFO L273 TraceCheckUtils]: 7: Hoare triple {3337#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:33,370 INFO L273 TraceCheckUtils]: 8: Hoare triple {3337#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:33,371 INFO L273 TraceCheckUtils]: 9: Hoare triple {3337#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:33,371 INFO L273 TraceCheckUtils]: 10: Hoare triple {3337#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:33,372 INFO L273 TraceCheckUtils]: 11: Hoare triple {3337#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:33,372 INFO L273 TraceCheckUtils]: 12: Hoare triple {3337#(<= 1500 main_~n~0)} ~i~0 := 1 + ~i~0; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:33,373 INFO L273 TraceCheckUtils]: 13: Hoare triple {3337#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:33,373 INFO L273 TraceCheckUtils]: 14: Hoare triple {3337#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:33,374 INFO L273 TraceCheckUtils]: 15: Hoare triple {3337#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:33,374 INFO L273 TraceCheckUtils]: 16: Hoare triple {3337#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:33,375 INFO L273 TraceCheckUtils]: 17: Hoare triple {3337#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:33,375 INFO L273 TraceCheckUtils]: 18: Hoare triple {3337#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:33,376 INFO L273 TraceCheckUtils]: 19: Hoare triple {3337#(<= 1500 main_~n~0)} ~i~0 := 1 + ~i~0; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:33,377 INFO L273 TraceCheckUtils]: 20: Hoare triple {3337#(<= 1500 main_~n~0)} assume !(~i~0 < ~m~0); {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:33,377 INFO L273 TraceCheckUtils]: 21: Hoare triple {3337#(<= 1500 main_~n~0)} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~min~0 := #t~mem1;havoc #t~mem1; {3337#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:33,378 INFO L273 TraceCheckUtils]: 22: Hoare triple {3337#(<= 1500 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0; {3389#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:37:33,379 INFO L273 TraceCheckUtils]: 23: Hoare triple {3389#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {3389#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:37:33,379 INFO L273 TraceCheckUtils]: 24: Hoare triple {3389#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {3389#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:37:33,380 INFO L273 TraceCheckUtils]: 25: Hoare triple {3389#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} ~j~0 := 1 + ~j~0; {3399#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:37:33,381 INFO L273 TraceCheckUtils]: 26: Hoare triple {3399#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {3399#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:37:33,382 INFO L273 TraceCheckUtils]: 27: Hoare triple {3399#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {3399#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:37:33,383 INFO L273 TraceCheckUtils]: 28: Hoare triple {3399#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} ~j~0 := 1 + ~j~0; {3409#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:37:33,384 INFO L273 TraceCheckUtils]: 29: Hoare triple {3409#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {3409#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:37:33,385 INFO L273 TraceCheckUtils]: 30: Hoare triple {3409#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {3409#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:37:33,389 INFO L273 TraceCheckUtils]: 31: Hoare triple {3409#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} ~j~0 := 1 + ~j~0; {3419#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:37:33,392 INFO L273 TraceCheckUtils]: 32: Hoare triple {3419#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {3419#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:37:33,394 INFO L273 TraceCheckUtils]: 33: Hoare triple {3419#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {3419#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:37:33,394 INFO L273 TraceCheckUtils]: 34: Hoare triple {3419#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} ~j~0 := 1 + ~j~0; {3429#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-23 12:37:33,396 INFO L273 TraceCheckUtils]: 35: Hoare triple {3429#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !(~j~0 < ~n~0); {3318#false} is VALID [2018-11-23 12:37:33,396 INFO L273 TraceCheckUtils]: 36: Hoare triple {3318#false} ~i~0 := 1 + ~i~0; {3318#false} is VALID [2018-11-23 12:37:33,396 INFO L273 TraceCheckUtils]: 37: Hoare triple {3318#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {3318#false} is VALID [2018-11-23 12:37:33,396 INFO L273 TraceCheckUtils]: 38: Hoare triple {3318#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {3318#false} is VALID [2018-11-23 12:37:33,397 INFO L273 TraceCheckUtils]: 39: Hoare triple {3318#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {3318#false} is VALID [2018-11-23 12:37:33,397 INFO L273 TraceCheckUtils]: 40: Hoare triple {3318#false} ~j~0 := 1 + ~j~0; {3318#false} is VALID [2018-11-23 12:37:33,397 INFO L273 TraceCheckUtils]: 41: Hoare triple {3318#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {3318#false} is VALID [2018-11-23 12:37:33,398 INFO L273 TraceCheckUtils]: 42: Hoare triple {3318#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {3318#false} is VALID [2018-11-23 12:37:33,398 INFO L273 TraceCheckUtils]: 43: Hoare triple {3318#false} ~j~0 := 1 + ~j~0; {3318#false} is VALID [2018-11-23 12:37:33,398 INFO L273 TraceCheckUtils]: 44: Hoare triple {3318#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {3318#false} is VALID [2018-11-23 12:37:33,398 INFO L273 TraceCheckUtils]: 45: Hoare triple {3318#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {3318#false} is VALID [2018-11-23 12:37:33,398 INFO L273 TraceCheckUtils]: 46: Hoare triple {3318#false} ~j~0 := 1 + ~j~0; {3318#false} is VALID [2018-11-23 12:37:33,399 INFO L273 TraceCheckUtils]: 47: Hoare triple {3318#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {3318#false} is VALID [2018-11-23 12:37:33,399 INFO L273 TraceCheckUtils]: 48: Hoare triple {3318#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {3318#false} is VALID [2018-11-23 12:37:33,399 INFO L273 TraceCheckUtils]: 49: Hoare triple {3318#false} ~j~0 := 1 + ~j~0; {3318#false} is VALID [2018-11-23 12:37:33,399 INFO L273 TraceCheckUtils]: 50: Hoare triple {3318#false} assume !(~j~0 < ~n~0); {3318#false} is VALID [2018-11-23 12:37:33,399 INFO L273 TraceCheckUtils]: 51: Hoare triple {3318#false} ~i~0 := 1 + ~i~0; {3318#false} is VALID [2018-11-23 12:37:33,400 INFO L273 TraceCheckUtils]: 52: Hoare triple {3318#false} assume !(~i~0 < ~n~0); {3318#false} is VALID [2018-11-23 12:37:33,400 INFO L273 TraceCheckUtils]: 53: Hoare triple {3318#false} ~i~0 := 0;~j~0 := 0; {3318#false} is VALID [2018-11-23 12:37:33,400 INFO L273 TraceCheckUtils]: 54: Hoare triple {3318#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {3318#false} is VALID [2018-11-23 12:37:33,400 INFO L273 TraceCheckUtils]: 55: Hoare triple {3318#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {3318#false} is VALID [2018-11-23 12:37:33,400 INFO L256 TraceCheckUtils]: 56: Hoare triple {3318#false} call __VERIFIER_assert((if #t~mem4 >= ~min~0 then 1 else 0)); {3318#false} is VALID [2018-11-23 12:37:33,401 INFO L273 TraceCheckUtils]: 57: Hoare triple {3318#false} ~cond := #in~cond; {3318#false} is VALID [2018-11-23 12:37:33,401 INFO L273 TraceCheckUtils]: 58: Hoare triple {3318#false} assume 0 == ~cond; {3318#false} is VALID [2018-11-23 12:37:33,401 INFO L273 TraceCheckUtils]: 59: Hoare triple {3318#false} assume !false; {3318#false} is VALID [2018-11-23 12:37:33,405 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 59 proven. 22 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2018-11-23 12:37:33,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:37:33,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-23 12:37:33,434 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-11-23 12:37:33,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:37:33,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 12:37:33,493 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:37:33,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 12:37:33,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 12:37:33,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 12:37:33,494 INFO L87 Difference]: Start difference. First operand 75 states and 93 transitions. Second operand 8 states. [2018-11-23 12:37:33,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:33,971 INFO L93 Difference]: Finished difference Result 156 states and 202 transitions. [2018-11-23 12:37:33,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:37:33,971 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2018-11-23 12:37:33,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:33,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:37:33,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2018-11-23 12:37:33,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 12:37:33,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 111 transitions. [2018-11-23 12:37:33,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 111 transitions. [2018-11-23 12:37:34,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:37:34,117 INFO L225 Difference]: With dead ends: 156 [2018-11-23 12:37:34,117 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 12:37:34,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 53 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-23 12:37:34,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 12:37:34,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 86. [2018-11-23 12:37:34,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:37:34,318 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 86 states. [2018-11-23 12:37:34,319 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 86 states. [2018-11-23 12:37:34,319 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 86 states. [2018-11-23 12:37:34,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:34,323 INFO L93 Difference]: Finished difference Result 93 states and 117 transitions. [2018-11-23 12:37:34,323 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 117 transitions. [2018-11-23 12:37:34,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:37:34,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:37:34,324 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 93 states. [2018-11-23 12:37:34,324 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 93 states. [2018-11-23 12:37:34,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:34,327 INFO L93 Difference]: Finished difference Result 93 states and 117 transitions. [2018-11-23 12:37:34,327 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 117 transitions. [2018-11-23 12:37:34,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:37:34,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:37:34,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:37:34,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:37:34,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 12:37:34,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 107 transitions. [2018-11-23 12:37:34,330 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 107 transitions. Word has length 60 [2018-11-23 12:37:34,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:34,331 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 107 transitions. [2018-11-23 12:37:34,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 12:37:34,331 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 107 transitions. [2018-11-23 12:37:34,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-23 12:37:34,332 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:34,332 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:34,332 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:34,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:34,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1510466474, now seen corresponding path program 6 times [2018-11-23 12:37:34,332 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:34,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:34,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:34,333 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:37:34,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:34,339 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:37:34,339 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:37:34,339 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-23 12:37:34,359 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:37:34,382 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2018-11-23 12:37:34,382 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:37:34,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:34,402 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:37:34,590 INFO L256 TraceCheckUtils]: 0: Hoare triple {4059#true} call ULTIMATE.init(); {4059#true} is VALID [2018-11-23 12:37:34,590 INFO L273 TraceCheckUtils]: 1: Hoare triple {4059#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4059#true} is VALID [2018-11-23 12:37:34,591 INFO L273 TraceCheckUtils]: 2: Hoare triple {4059#true} assume true; {4059#true} is VALID [2018-11-23 12:37:34,591 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4059#true} {4059#true} #106#return; {4059#true} is VALID [2018-11-23 12:37:34,591 INFO L256 TraceCheckUtils]: 4: Hoare triple {4059#true} call #t~ret5 := main(); {4059#true} is VALID [2018-11-23 12:37:34,592 INFO L273 TraceCheckUtils]: 5: Hoare triple {4059#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~min~0;~i~0 := 0;~j~0 := 0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:34,592 INFO L273 TraceCheckUtils]: 6: Hoare triple {4079#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:34,593 INFO L273 TraceCheckUtils]: 7: Hoare triple {4079#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:34,593 INFO L273 TraceCheckUtils]: 8: Hoare triple {4079#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:34,593 INFO L273 TraceCheckUtils]: 9: Hoare triple {4079#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:34,594 INFO L273 TraceCheckUtils]: 10: Hoare triple {4079#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:34,594 INFO L273 TraceCheckUtils]: 11: Hoare triple {4079#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:34,596 INFO L273 TraceCheckUtils]: 12: Hoare triple {4079#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:34,596 INFO L273 TraceCheckUtils]: 13: Hoare triple {4079#(<= 1500 main_~n~0)} ~i~0 := 1 + ~i~0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:34,597 INFO L273 TraceCheckUtils]: 14: Hoare triple {4079#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:34,598 INFO L273 TraceCheckUtils]: 15: Hoare triple {4079#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:34,598 INFO L273 TraceCheckUtils]: 16: Hoare triple {4079#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:34,598 INFO L273 TraceCheckUtils]: 17: Hoare triple {4079#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:34,599 INFO L273 TraceCheckUtils]: 18: Hoare triple {4079#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:34,600 INFO L273 TraceCheckUtils]: 19: Hoare triple {4079#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:34,600 INFO L273 TraceCheckUtils]: 20: Hoare triple {4079#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:34,601 INFO L273 TraceCheckUtils]: 21: Hoare triple {4079#(<= 1500 main_~n~0)} ~i~0 := 1 + ~i~0; {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:34,602 INFO L273 TraceCheckUtils]: 22: Hoare triple {4079#(<= 1500 main_~n~0)} assume !(~i~0 < ~m~0); {4079#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:34,603 INFO L273 TraceCheckUtils]: 23: Hoare triple {4079#(<= 1500 main_~n~0)} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~min~0 := #t~mem1;havoc #t~mem1; {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:34,603 INFO L273 TraceCheckUtils]: 24: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume !!(~i~0 < ~n~0);~j~0 := 0; {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:34,604 INFO L273 TraceCheckUtils]: 25: Hoare triple {4134#(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 * (4 * ~n~0) + 4 * ~j~0, 4); {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:34,606 INFO L273 TraceCheckUtils]: 26: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:34,607 INFO L273 TraceCheckUtils]: 27: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:34,608 INFO L273 TraceCheckUtils]: 28: Hoare triple {4134#(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 * (4 * ~n~0) + 4 * ~j~0, 4); {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:34,608 INFO L273 TraceCheckUtils]: 29: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:34,609 INFO L273 TraceCheckUtils]: 30: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:34,610 INFO L273 TraceCheckUtils]: 31: Hoare triple {4134#(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 * (4 * ~n~0) + 4 * ~j~0, 4); {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:34,611 INFO L273 TraceCheckUtils]: 32: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:34,611 INFO L273 TraceCheckUtils]: 33: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:34,612 INFO L273 TraceCheckUtils]: 34: Hoare triple {4134#(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 * (4 * ~n~0) + 4 * ~j~0, 4); {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:34,613 INFO L273 TraceCheckUtils]: 35: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:34,613 INFO L273 TraceCheckUtils]: 36: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:34,614 INFO L273 TraceCheckUtils]: 37: Hoare triple {4134#(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 * (4 * ~n~0) + 4 * ~j~0, 4); {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:34,615 INFO L273 TraceCheckUtils]: 38: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:34,616 INFO L273 TraceCheckUtils]: 39: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:34,617 INFO L273 TraceCheckUtils]: 40: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} assume !(~j~0 < ~n~0); {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:34,618 INFO L273 TraceCheckUtils]: 41: Hoare triple {4134#(and (<= 1500 main_~n~0) (<= main_~i~0 0))} ~i~0 := 1 + ~i~0; {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:37:34,618 INFO L273 TraceCheckUtils]: 42: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume !!(~i~0 < ~n~0);~j~0 := 0; {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:37:34,619 INFO L273 TraceCheckUtils]: 43: Hoare triple {4189#(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 * (4 * ~n~0) + 4 * ~j~0, 4); {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:37:34,620 INFO L273 TraceCheckUtils]: 44: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:37:34,621 INFO L273 TraceCheckUtils]: 45: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} ~j~0 := 1 + ~j~0; {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:37:34,622 INFO L273 TraceCheckUtils]: 46: Hoare triple {4189#(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 * (4 * ~n~0) + 4 * ~j~0, 4); {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:37:34,623 INFO L273 TraceCheckUtils]: 47: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:37:34,623 INFO L273 TraceCheckUtils]: 48: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} ~j~0 := 1 + ~j~0; {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:37:34,624 INFO L273 TraceCheckUtils]: 49: Hoare triple {4189#(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 * (4 * ~n~0) + 4 * ~j~0, 4); {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:37:34,635 INFO L273 TraceCheckUtils]: 50: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:37:34,636 INFO L273 TraceCheckUtils]: 51: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} ~j~0 := 1 + ~j~0; {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:37:34,636 INFO L273 TraceCheckUtils]: 52: Hoare triple {4189#(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 * (4 * ~n~0) + 4 * ~j~0, 4); {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:37:34,637 INFO L273 TraceCheckUtils]: 53: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:37:34,643 INFO L273 TraceCheckUtils]: 54: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} ~j~0 := 1 + ~j~0; {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:37:34,646 INFO L273 TraceCheckUtils]: 55: Hoare triple {4189#(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 * (4 * ~n~0) + 4 * ~j~0, 4); {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:37:34,646 INFO L273 TraceCheckUtils]: 56: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:37:34,648 INFO L273 TraceCheckUtils]: 57: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} ~j~0 := 1 + ~j~0; {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:37:34,650 INFO L273 TraceCheckUtils]: 58: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} assume !(~j~0 < ~n~0); {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-23 12:37:34,652 INFO L273 TraceCheckUtils]: 59: Hoare triple {4189#(and (<= 1500 main_~n~0) (<= main_~i~0 1))} ~i~0 := 1 + ~i~0; {4244#(and (<= 1500 main_~n~0) (<= main_~i~0 2))} is VALID [2018-11-23 12:37:34,652 INFO L273 TraceCheckUtils]: 60: Hoare triple {4244#(and (<= 1500 main_~n~0) (<= main_~i~0 2))} assume !(~i~0 < ~n~0); {4060#false} is VALID [2018-11-23 12:37:34,652 INFO L273 TraceCheckUtils]: 61: Hoare triple {4060#false} ~i~0 := 0;~j~0 := 0; {4060#false} is VALID [2018-11-23 12:37:34,653 INFO L273 TraceCheckUtils]: 62: Hoare triple {4060#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {4060#false} is VALID [2018-11-23 12:37:34,653 INFO L273 TraceCheckUtils]: 63: Hoare triple {4060#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {4060#false} is VALID [2018-11-23 12:37:34,653 INFO L256 TraceCheckUtils]: 64: Hoare triple {4060#false} call __VERIFIER_assert((if #t~mem4 >= ~min~0 then 1 else 0)); {4060#false} is VALID [2018-11-23 12:37:34,653 INFO L273 TraceCheckUtils]: 65: Hoare triple {4060#false} ~cond := #in~cond; {4060#false} is VALID [2018-11-23 12:37:34,653 INFO L273 TraceCheckUtils]: 66: Hoare triple {4060#false} assume 0 == ~cond; {4060#false} is VALID [2018-11-23 12:37:34,653 INFO L273 TraceCheckUtils]: 67: Hoare triple {4060#false} assume !false; {4060#false} is VALID [2018-11-23 12:37:34,663 INFO L134 CoverageAnalysis]: Checked inductivity of 230 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2018-11-23 12:37:34,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:37:34,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-23 12:37:34,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-23 12:37:34,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:37:34,683 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:37:34,719 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:37:34,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:37:34,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:37:34,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:37:34,720 INFO L87 Difference]: Start difference. First operand 86 states and 107 transitions. Second operand 6 states. [2018-11-23 12:37:35,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:35,683 INFO L93 Difference]: Finished difference Result 216 states and 276 transitions. [2018-11-23 12:37:35,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:37:35,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-11-23 12:37:35,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:35,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:37:35,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2018-11-23 12:37:35,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:37:35,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 103 transitions. [2018-11-23 12:37:35,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 103 transitions. [2018-11-23 12:37:36,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:37:36,425 INFO L225 Difference]: With dead ends: 216 [2018-11-23 12:37:36,425 INFO L226 Difference]: Without dead ends: 191 [2018-11-23 12:37:36,426 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 63 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-23 12:37:36,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-11-23 12:37:37,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 104. [2018-11-23 12:37:37,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:37:37,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand 104 states. [2018-11-23 12:37:37,127 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand 104 states. [2018-11-23 12:37:37,127 INFO L87 Difference]: Start difference. First operand 191 states. Second operand 104 states. [2018-11-23 12:37:37,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:37,133 INFO L93 Difference]: Finished difference Result 191 states and 245 transitions. [2018-11-23 12:37:37,133 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 245 transitions. [2018-11-23 12:37:37,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:37:37,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:37:37,135 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 191 states. [2018-11-23 12:37:37,135 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 191 states. [2018-11-23 12:37:37,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:37,141 INFO L93 Difference]: Finished difference Result 191 states and 245 transitions. [2018-11-23 12:37:37,141 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 245 transitions. [2018-11-23 12:37:37,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:37:37,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:37:37,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:37:37,142 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:37:37,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 12:37:37,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 131 transitions. [2018-11-23 12:37:37,145 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 131 transitions. Word has length 68 [2018-11-23 12:37:37,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:37,145 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 131 transitions. [2018-11-23 12:37:37,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:37:37,146 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 131 transitions. [2018-11-23 12:37:37,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-23 12:37:37,147 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:37,147 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 10, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:37,147 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:37,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:37,147 INFO L82 PathProgramCache]: Analyzing trace with hash -155354480, now seen corresponding path program 7 times [2018-11-23 12:37:37,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:37,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:37,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:37,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:37:37,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:37,154 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:37:37,155 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:37:37,155 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-23 12:37:37,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:37,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:37,232 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:37:37,552 INFO L256 TraceCheckUtils]: 0: Hoare triple {5146#true} call ULTIMATE.init(); {5146#true} is VALID [2018-11-23 12:37:37,552 INFO L273 TraceCheckUtils]: 1: Hoare triple {5146#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5146#true} is VALID [2018-11-23 12:37:37,552 INFO L273 TraceCheckUtils]: 2: Hoare triple {5146#true} assume true; {5146#true} is VALID [2018-11-23 12:37:37,553 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5146#true} {5146#true} #106#return; {5146#true} is VALID [2018-11-23 12:37:37,553 INFO L256 TraceCheckUtils]: 4: Hoare triple {5146#true} call #t~ret5 := main(); {5146#true} is VALID [2018-11-23 12:37:37,554 INFO L273 TraceCheckUtils]: 5: Hoare triple {5146#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~min~0;~i~0 := 0;~j~0 := 0; {5166#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:37,554 INFO L273 TraceCheckUtils]: 6: Hoare triple {5166#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {5170#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:37:37,555 INFO L273 TraceCheckUtils]: 7: Hoare triple {5170#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5174#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:37:37,556 INFO L273 TraceCheckUtils]: 8: Hoare triple {5174#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5178#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:37:37,557 INFO L273 TraceCheckUtils]: 9: Hoare triple {5178#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5182#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:37:37,558 INFO L273 TraceCheckUtils]: 10: Hoare triple {5182#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5186#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-23 12:37:37,559 INFO L273 TraceCheckUtils]: 11: Hoare triple {5186#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5190#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-23 12:37:37,560 INFO L273 TraceCheckUtils]: 12: Hoare triple {5190#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume !(~j~0 < ~n~0); {5147#false} is VALID [2018-11-23 12:37:37,560 INFO L273 TraceCheckUtils]: 13: Hoare triple {5147#false} ~i~0 := 1 + ~i~0; {5147#false} is VALID [2018-11-23 12:37:37,560 INFO L273 TraceCheckUtils]: 14: Hoare triple {5147#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {5147#false} is VALID [2018-11-23 12:37:37,560 INFO L273 TraceCheckUtils]: 15: Hoare triple {5147#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:37:37,561 INFO L273 TraceCheckUtils]: 16: Hoare triple {5147#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:37:37,561 INFO L273 TraceCheckUtils]: 17: Hoare triple {5147#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:37:37,561 INFO L273 TraceCheckUtils]: 18: Hoare triple {5147#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:37:37,561 INFO L273 TraceCheckUtils]: 19: Hoare triple {5147#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:37:37,562 INFO L273 TraceCheckUtils]: 20: Hoare triple {5147#false} assume !(~j~0 < ~n~0); {5147#false} is VALID [2018-11-23 12:37:37,562 INFO L273 TraceCheckUtils]: 21: Hoare triple {5147#false} ~i~0 := 1 + ~i~0; {5147#false} is VALID [2018-11-23 12:37:37,562 INFO L273 TraceCheckUtils]: 22: Hoare triple {5147#false} assume !(~i~0 < ~m~0); {5147#false} is VALID [2018-11-23 12:37:37,562 INFO L273 TraceCheckUtils]: 23: Hoare triple {5147#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~min~0 := #t~mem1;havoc #t~mem1; {5147#false} is VALID [2018-11-23 12:37:37,563 INFO L273 TraceCheckUtils]: 24: Hoare triple {5147#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {5147#false} is VALID [2018-11-23 12:37:37,563 INFO L273 TraceCheckUtils]: 25: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:37:37,563 INFO L273 TraceCheckUtils]: 26: Hoare triple {5147#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:37:37,563 INFO L273 TraceCheckUtils]: 27: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:37:37,563 INFO L273 TraceCheckUtils]: 28: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:37:37,563 INFO L273 TraceCheckUtils]: 29: Hoare triple {5147#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:37:37,564 INFO L273 TraceCheckUtils]: 30: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:37:37,564 INFO L273 TraceCheckUtils]: 31: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:37:37,564 INFO L273 TraceCheckUtils]: 32: Hoare triple {5147#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:37:37,564 INFO L273 TraceCheckUtils]: 33: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:37:37,564 INFO L273 TraceCheckUtils]: 34: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:37:37,565 INFO L273 TraceCheckUtils]: 35: Hoare triple {5147#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:37:37,565 INFO L273 TraceCheckUtils]: 36: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:37:37,565 INFO L273 TraceCheckUtils]: 37: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:37:37,565 INFO L273 TraceCheckUtils]: 38: Hoare triple {5147#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:37:37,566 INFO L273 TraceCheckUtils]: 39: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:37:37,566 INFO L273 TraceCheckUtils]: 40: Hoare triple {5147#false} assume !(~j~0 < ~n~0); {5147#false} is VALID [2018-11-23 12:37:37,566 INFO L273 TraceCheckUtils]: 41: Hoare triple {5147#false} ~i~0 := 1 + ~i~0; {5147#false} is VALID [2018-11-23 12:37:37,566 INFO L273 TraceCheckUtils]: 42: Hoare triple {5147#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {5147#false} is VALID [2018-11-23 12:37:37,567 INFO L273 TraceCheckUtils]: 43: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:37:37,567 INFO L273 TraceCheckUtils]: 44: Hoare triple {5147#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:37:37,567 INFO L273 TraceCheckUtils]: 45: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:37:37,567 INFO L273 TraceCheckUtils]: 46: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:37:37,567 INFO L273 TraceCheckUtils]: 47: Hoare triple {5147#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:37:37,567 INFO L273 TraceCheckUtils]: 48: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:37:37,568 INFO L273 TraceCheckUtils]: 49: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:37:37,568 INFO L273 TraceCheckUtils]: 50: Hoare triple {5147#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:37:37,568 INFO L273 TraceCheckUtils]: 51: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:37:37,568 INFO L273 TraceCheckUtils]: 52: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:37:37,568 INFO L273 TraceCheckUtils]: 53: Hoare triple {5147#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:37:37,569 INFO L273 TraceCheckUtils]: 54: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:37:37,569 INFO L273 TraceCheckUtils]: 55: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:37:37,569 INFO L273 TraceCheckUtils]: 56: Hoare triple {5147#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:37:37,569 INFO L273 TraceCheckUtils]: 57: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:37:37,569 INFO L273 TraceCheckUtils]: 58: Hoare triple {5147#false} assume !(~j~0 < ~n~0); {5147#false} is VALID [2018-11-23 12:37:37,570 INFO L273 TraceCheckUtils]: 59: Hoare triple {5147#false} ~i~0 := 1 + ~i~0; {5147#false} is VALID [2018-11-23 12:37:37,570 INFO L273 TraceCheckUtils]: 60: Hoare triple {5147#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {5147#false} is VALID [2018-11-23 12:37:37,570 INFO L273 TraceCheckUtils]: 61: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:37:37,570 INFO L273 TraceCheckUtils]: 62: Hoare triple {5147#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:37:37,571 INFO L273 TraceCheckUtils]: 63: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:37:37,571 INFO L273 TraceCheckUtils]: 64: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:37:37,571 INFO L273 TraceCheckUtils]: 65: Hoare triple {5147#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:37:37,571 INFO L273 TraceCheckUtils]: 66: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:37:37,572 INFO L273 TraceCheckUtils]: 67: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:37:37,572 INFO L273 TraceCheckUtils]: 68: Hoare triple {5147#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:37:37,572 INFO L273 TraceCheckUtils]: 69: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:37:37,572 INFO L273 TraceCheckUtils]: 70: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:37:37,573 INFO L273 TraceCheckUtils]: 71: Hoare triple {5147#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:37:37,573 INFO L273 TraceCheckUtils]: 72: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:37:37,573 INFO L273 TraceCheckUtils]: 73: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:37:37,573 INFO L273 TraceCheckUtils]: 74: Hoare triple {5147#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {5147#false} is VALID [2018-11-23 12:37:37,573 INFO L273 TraceCheckUtils]: 75: Hoare triple {5147#false} ~j~0 := 1 + ~j~0; {5147#false} is VALID [2018-11-23 12:37:37,574 INFO L273 TraceCheckUtils]: 76: Hoare triple {5147#false} assume !(~j~0 < ~n~0); {5147#false} is VALID [2018-11-23 12:37:37,574 INFO L273 TraceCheckUtils]: 77: Hoare triple {5147#false} ~i~0 := 1 + ~i~0; {5147#false} is VALID [2018-11-23 12:37:37,574 INFO L273 TraceCheckUtils]: 78: Hoare triple {5147#false} assume !(~i~0 < ~n~0); {5147#false} is VALID [2018-11-23 12:37:37,574 INFO L273 TraceCheckUtils]: 79: Hoare triple {5147#false} ~i~0 := 0;~j~0 := 0; {5147#false} is VALID [2018-11-23 12:37:37,575 INFO L273 TraceCheckUtils]: 80: Hoare triple {5147#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {5147#false} is VALID [2018-11-23 12:37:37,575 INFO L273 TraceCheckUtils]: 81: Hoare triple {5147#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5147#false} is VALID [2018-11-23 12:37:37,575 INFO L256 TraceCheckUtils]: 82: Hoare triple {5147#false} call __VERIFIER_assert((if #t~mem4 >= ~min~0 then 1 else 0)); {5147#false} is VALID [2018-11-23 12:37:37,575 INFO L273 TraceCheckUtils]: 83: Hoare triple {5147#false} ~cond := #in~cond; {5147#false} is VALID [2018-11-23 12:37:37,576 INFO L273 TraceCheckUtils]: 84: Hoare triple {5147#false} assume 0 == ~cond; {5147#false} is VALID [2018-11-23 12:37:37,576 INFO L273 TraceCheckUtils]: 85: Hoare triple {5147#false} assume !false; {5147#false} is VALID [2018-11-23 12:37:37,580 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 38 proven. 15 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2018-11-23 12:37:37,609 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:37:37,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-23 12:37:37,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2018-11-23 12:37:37,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:37:37,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 12:37:37,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:37:37,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 12:37:37,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 12:37:37,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:37:37,659 INFO L87 Difference]: Start difference. First operand 104 states and 131 transitions. Second operand 9 states. [2018-11-23 12:37:38,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:38,323 INFO L93 Difference]: Finished difference Result 218 states and 285 transitions. [2018-11-23 12:37:38,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 12:37:38,324 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2018-11-23 12:37:38,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:38,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:37:38,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2018-11-23 12:37:38,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 12:37:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 120 transitions. [2018-11-23 12:37:38,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 120 transitions. [2018-11-23 12:37:39,058 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:37:39,061 INFO L225 Difference]: With dead ends: 218 [2018-11-23 12:37:39,061 INFO L226 Difference]: Without dead ends: 127 [2018-11-23 12:37:39,062 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 12:37:39,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-11-23 12:37:39,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 118. [2018-11-23 12:37:39,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:37:39,264 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand 118 states. [2018-11-23 12:37:39,264 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand 118 states. [2018-11-23 12:37:39,264 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 118 states. [2018-11-23 12:37:39,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:39,268 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2018-11-23 12:37:39,268 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 162 transitions. [2018-11-23 12:37:39,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:37:39,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:37:39,269 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 127 states. [2018-11-23 12:37:39,269 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 127 states. [2018-11-23 12:37:39,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:39,272 INFO L93 Difference]: Finished difference Result 127 states and 162 transitions. [2018-11-23 12:37:39,272 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 162 transitions. [2018-11-23 12:37:39,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:37:39,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:37:39,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:37:39,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:37:39,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-23 12:37:39,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 149 transitions. [2018-11-23 12:37:39,276 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 149 transitions. Word has length 86 [2018-11-23 12:37:39,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:39,277 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 149 transitions. [2018-11-23 12:37:39,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 12:37:39,277 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 149 transitions. [2018-11-23 12:37:39,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 12:37:39,278 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:39,278 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 12, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:39,278 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:39,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:39,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1646989565, now seen corresponding path program 8 times [2018-11-23 12:37:39,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:39,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:39,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:39,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:39,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:39,286 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:37:39,286 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:37:39,286 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-23 12:37:39,305 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:37:39,354 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:37:39,354 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:37:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:39,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:37:40,216 INFO L256 TraceCheckUtils]: 0: Hoare triple {6169#true} call ULTIMATE.init(); {6169#true} is VALID [2018-11-23 12:37:40,217 INFO L273 TraceCheckUtils]: 1: Hoare triple {6169#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6169#true} is VALID [2018-11-23 12:37:40,217 INFO L273 TraceCheckUtils]: 2: Hoare triple {6169#true} assume true; {6169#true} is VALID [2018-11-23 12:37:40,217 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6169#true} {6169#true} #106#return; {6169#true} is VALID [2018-11-23 12:37:40,217 INFO L256 TraceCheckUtils]: 4: Hoare triple {6169#true} call #t~ret5 := main(); {6169#true} is VALID [2018-11-23 12:37:40,218 INFO L273 TraceCheckUtils]: 5: Hoare triple {6169#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~min~0;~i~0 := 0;~j~0 := 0; {6189#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:40,218 INFO L273 TraceCheckUtils]: 6: Hoare triple {6189#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {6193#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:37:40,219 INFO L273 TraceCheckUtils]: 7: Hoare triple {6193#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6197#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:37:40,220 INFO L273 TraceCheckUtils]: 8: Hoare triple {6197#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6201#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:37:40,221 INFO L273 TraceCheckUtils]: 9: Hoare triple {6201#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6205#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:37:40,221 INFO L273 TraceCheckUtils]: 10: Hoare triple {6205#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6209#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-23 12:37:40,222 INFO L273 TraceCheckUtils]: 11: Hoare triple {6209#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6213#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-23 12:37:40,223 INFO L273 TraceCheckUtils]: 12: Hoare triple {6213#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6217#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-23 12:37:40,224 INFO L273 TraceCheckUtils]: 13: Hoare triple {6217#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume !(~j~0 < ~n~0); {6170#false} is VALID [2018-11-23 12:37:40,224 INFO L273 TraceCheckUtils]: 14: Hoare triple {6170#false} ~i~0 := 1 + ~i~0; {6170#false} is VALID [2018-11-23 12:37:40,225 INFO L273 TraceCheckUtils]: 15: Hoare triple {6170#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {6170#false} is VALID [2018-11-23 12:37:40,225 INFO L273 TraceCheckUtils]: 16: Hoare triple {6170#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:37:40,225 INFO L273 TraceCheckUtils]: 17: Hoare triple {6170#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:37:40,225 INFO L273 TraceCheckUtils]: 18: Hoare triple {6170#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:37:40,225 INFO L273 TraceCheckUtils]: 19: Hoare triple {6170#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:37:40,226 INFO L273 TraceCheckUtils]: 20: Hoare triple {6170#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:37:40,226 INFO L273 TraceCheckUtils]: 21: Hoare triple {6170#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:37:40,226 INFO L273 TraceCheckUtils]: 22: Hoare triple {6170#false} assume !(~j~0 < ~n~0); {6170#false} is VALID [2018-11-23 12:37:40,226 INFO L273 TraceCheckUtils]: 23: Hoare triple {6170#false} ~i~0 := 1 + ~i~0; {6170#false} is VALID [2018-11-23 12:37:40,226 INFO L273 TraceCheckUtils]: 24: Hoare triple {6170#false} assume !(~i~0 < ~m~0); {6170#false} is VALID [2018-11-23 12:37:40,227 INFO L273 TraceCheckUtils]: 25: Hoare triple {6170#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~min~0 := #t~mem1;havoc #t~mem1; {6170#false} is VALID [2018-11-23 12:37:40,227 INFO L273 TraceCheckUtils]: 26: Hoare triple {6170#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {6170#false} is VALID [2018-11-23 12:37:40,227 INFO L273 TraceCheckUtils]: 27: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:37:40,227 INFO L273 TraceCheckUtils]: 28: Hoare triple {6170#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:37:40,227 INFO L273 TraceCheckUtils]: 29: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:37:40,227 INFO L273 TraceCheckUtils]: 30: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:37:40,227 INFO L273 TraceCheckUtils]: 31: Hoare triple {6170#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:37:40,227 INFO L273 TraceCheckUtils]: 32: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:37:40,228 INFO L273 TraceCheckUtils]: 33: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:37:40,228 INFO L273 TraceCheckUtils]: 34: Hoare triple {6170#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:37:40,228 INFO L273 TraceCheckUtils]: 35: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:37:40,228 INFO L273 TraceCheckUtils]: 36: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:37:40,228 INFO L273 TraceCheckUtils]: 37: Hoare triple {6170#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:37:40,228 INFO L273 TraceCheckUtils]: 38: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:37:40,228 INFO L273 TraceCheckUtils]: 39: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:37:40,229 INFO L273 TraceCheckUtils]: 40: Hoare triple {6170#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:37:40,229 INFO L273 TraceCheckUtils]: 41: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:37:40,229 INFO L273 TraceCheckUtils]: 42: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:37:40,229 INFO L273 TraceCheckUtils]: 43: Hoare triple {6170#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:37:40,229 INFO L273 TraceCheckUtils]: 44: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:37:40,229 INFO L273 TraceCheckUtils]: 45: Hoare triple {6170#false} assume !(~j~0 < ~n~0); {6170#false} is VALID [2018-11-23 12:37:40,229 INFO L273 TraceCheckUtils]: 46: Hoare triple {6170#false} ~i~0 := 1 + ~i~0; {6170#false} is VALID [2018-11-23 12:37:40,229 INFO L273 TraceCheckUtils]: 47: Hoare triple {6170#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {6170#false} is VALID [2018-11-23 12:37:40,230 INFO L273 TraceCheckUtils]: 48: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:37:40,230 INFO L273 TraceCheckUtils]: 49: Hoare triple {6170#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:37:40,230 INFO L273 TraceCheckUtils]: 50: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:37:40,230 INFO L273 TraceCheckUtils]: 51: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:37:40,230 INFO L273 TraceCheckUtils]: 52: Hoare triple {6170#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:37:40,230 INFO L273 TraceCheckUtils]: 53: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:37:40,230 INFO L273 TraceCheckUtils]: 54: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:37:40,230 INFO L273 TraceCheckUtils]: 55: Hoare triple {6170#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:37:40,231 INFO L273 TraceCheckUtils]: 56: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:37:40,231 INFO L273 TraceCheckUtils]: 57: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:37:40,231 INFO L273 TraceCheckUtils]: 58: Hoare triple {6170#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:37:40,231 INFO L273 TraceCheckUtils]: 59: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:37:40,231 INFO L273 TraceCheckUtils]: 60: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:37:40,231 INFO L273 TraceCheckUtils]: 61: Hoare triple {6170#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:37:40,231 INFO L273 TraceCheckUtils]: 62: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:37:40,232 INFO L273 TraceCheckUtils]: 63: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:37:40,232 INFO L273 TraceCheckUtils]: 64: Hoare triple {6170#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:37:40,232 INFO L273 TraceCheckUtils]: 65: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:37:40,232 INFO L273 TraceCheckUtils]: 66: Hoare triple {6170#false} assume !(~j~0 < ~n~0); {6170#false} is VALID [2018-11-23 12:37:40,232 INFO L273 TraceCheckUtils]: 67: Hoare triple {6170#false} ~i~0 := 1 + ~i~0; {6170#false} is VALID [2018-11-23 12:37:40,232 INFO L273 TraceCheckUtils]: 68: Hoare triple {6170#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {6170#false} is VALID [2018-11-23 12:37:40,232 INFO L273 TraceCheckUtils]: 69: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:37:40,232 INFO L273 TraceCheckUtils]: 70: Hoare triple {6170#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:37:40,233 INFO L273 TraceCheckUtils]: 71: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:37:40,233 INFO L273 TraceCheckUtils]: 72: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:37:40,233 INFO L273 TraceCheckUtils]: 73: Hoare triple {6170#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:37:40,233 INFO L273 TraceCheckUtils]: 74: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:37:40,233 INFO L273 TraceCheckUtils]: 75: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:37:40,233 INFO L273 TraceCheckUtils]: 76: Hoare triple {6170#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:37:40,234 INFO L273 TraceCheckUtils]: 77: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:37:40,234 INFO L273 TraceCheckUtils]: 78: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:37:40,234 INFO L273 TraceCheckUtils]: 79: Hoare triple {6170#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:37:40,234 INFO L273 TraceCheckUtils]: 80: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:37:40,234 INFO L273 TraceCheckUtils]: 81: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:37:40,235 INFO L273 TraceCheckUtils]: 82: Hoare triple {6170#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:37:40,235 INFO L273 TraceCheckUtils]: 83: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:37:40,235 INFO L273 TraceCheckUtils]: 84: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:37:40,235 INFO L273 TraceCheckUtils]: 85: Hoare triple {6170#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {6170#false} is VALID [2018-11-23 12:37:40,235 INFO L273 TraceCheckUtils]: 86: Hoare triple {6170#false} ~j~0 := 1 + ~j~0; {6170#false} is VALID [2018-11-23 12:37:40,236 INFO L273 TraceCheckUtils]: 87: Hoare triple {6170#false} assume !(~j~0 < ~n~0); {6170#false} is VALID [2018-11-23 12:37:40,236 INFO L273 TraceCheckUtils]: 88: Hoare triple {6170#false} ~i~0 := 1 + ~i~0; {6170#false} is VALID [2018-11-23 12:37:40,236 INFO L273 TraceCheckUtils]: 89: Hoare triple {6170#false} assume !(~i~0 < ~n~0); {6170#false} is VALID [2018-11-23 12:37:40,236 INFO L273 TraceCheckUtils]: 90: Hoare triple {6170#false} ~i~0 := 0;~j~0 := 0; {6170#false} is VALID [2018-11-23 12:37:40,236 INFO L273 TraceCheckUtils]: 91: Hoare triple {6170#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {6170#false} is VALID [2018-11-23 12:37:40,236 INFO L273 TraceCheckUtils]: 92: Hoare triple {6170#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6170#false} is VALID [2018-11-23 12:37:40,237 INFO L256 TraceCheckUtils]: 93: Hoare triple {6170#false} call __VERIFIER_assert((if #t~mem4 >= ~min~0 then 1 else 0)); {6170#false} is VALID [2018-11-23 12:37:40,237 INFO L273 TraceCheckUtils]: 94: Hoare triple {6170#false} ~cond := #in~cond; {6170#false} is VALID [2018-11-23 12:37:40,237 INFO L273 TraceCheckUtils]: 95: Hoare triple {6170#false} assume 0 == ~cond; {6170#false} is VALID [2018-11-23 12:37:40,237 INFO L273 TraceCheckUtils]: 96: Hoare triple {6170#false} assume !false; {6170#false} is VALID [2018-11-23 12:37:40,243 INFO L134 CoverageAnalysis]: Checked inductivity of 620 backedges. 51 proven. 21 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2018-11-23 12:37:40,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:37:40,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-23 12:37:40,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2018-11-23 12:37:40,265 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:37:40,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:37:40,294 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:37:40,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:37:40,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:37:40,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:37:40,295 INFO L87 Difference]: Start difference. First operand 118 states and 149 transitions. Second operand 10 states. [2018-11-23 12:37:41,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:41,027 INFO L93 Difference]: Finished difference Result 245 states and 320 transitions. [2018-11-23 12:37:41,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:37:41,027 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2018-11-23 12:37:41,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:37:41,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2018-11-23 12:37:41,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:37:41,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2018-11-23 12:37:41,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 129 transitions. [2018-11-23 12:37:41,474 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-23 12:37:41,478 INFO L225 Difference]: With dead ends: 245 [2018-11-23 12:37:41,478 INFO L226 Difference]: Without dead ends: 141 [2018-11-23 12:37:41,479 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:37:41,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-23 12:37:41,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 132. [2018-11-23 12:37:41,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:37:41,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand 132 states. [2018-11-23 12:37:41,699 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 132 states. [2018-11-23 12:37:41,699 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 132 states. [2018-11-23 12:37:41,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:41,702 INFO L93 Difference]: Finished difference Result 141 states and 180 transitions. [2018-11-23 12:37:41,702 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 180 transitions. [2018-11-23 12:37:41,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:37:41,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:37:41,703 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 141 states. [2018-11-23 12:37:41,703 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 141 states. [2018-11-23 12:37:41,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:41,706 INFO L93 Difference]: Finished difference Result 141 states and 180 transitions. [2018-11-23 12:37:41,707 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 180 transitions. [2018-11-23 12:37:41,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:37:41,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:37:41,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:37:41,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:37:41,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-23 12:37:41,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 167 transitions. [2018-11-23 12:37:41,711 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 167 transitions. Word has length 97 [2018-11-23 12:37:41,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:41,711 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 167 transitions. [2018-11-23 12:37:41,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:37:41,711 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 167 transitions. [2018-11-23 12:37:41,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-23 12:37:41,713 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:41,713 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 14, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:41,713 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:41,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:41,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1261139824, now seen corresponding path program 9 times [2018-11-23 12:37:41,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:41,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:41,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:41,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:37:41,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:41,721 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:37:41,721 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:37:41,721 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-23 12:37:41,739 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:37:41,770 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 12:37:41,770 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:37:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:41,809 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:37:42,785 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-11-23 12:37:42,850 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-23 12:37:42,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:37:42,869 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:37:42,870 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:37:42,870 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-23 12:37:42,872 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:37:42,872 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#A~0.base|]. (let ((.cse0 (select (select |#memory_int| |main_~#A~0.base|) 0))) (and (<= main_~min~0 .cse0) (<= .cse0 |main_#t~mem2|))) [2018-11-23 12:37:42,872 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (<= main_~min~0 |main_#t~mem2|) [2018-11-23 12:37:42,939 INFO L256 TraceCheckUtils]: 0: Hoare triple {7315#true} call ULTIMATE.init(); {7315#true} is VALID [2018-11-23 12:37:42,939 INFO L273 TraceCheckUtils]: 1: Hoare triple {7315#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7315#true} is VALID [2018-11-23 12:37:42,939 INFO L273 TraceCheckUtils]: 2: Hoare triple {7315#true} assume true; {7315#true} is VALID [2018-11-23 12:37:42,940 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7315#true} {7315#true} #106#return; {7315#true} is VALID [2018-11-23 12:37:42,940 INFO L256 TraceCheckUtils]: 4: Hoare triple {7315#true} call #t~ret5 := main(); {7315#true} is VALID [2018-11-23 12:37:42,940 INFO L273 TraceCheckUtils]: 5: Hoare triple {7315#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~min~0;~i~0 := 0;~j~0 := 0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:37:42,953 INFO L273 TraceCheckUtils]: 6: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} assume !!(~i~0 < ~m~0);~j~0 := 0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:37:42,954 INFO L273 TraceCheckUtils]: 7: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:37:42,954 INFO L273 TraceCheckUtils]: 8: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:37:42,954 INFO L273 TraceCheckUtils]: 9: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:37:42,955 INFO L273 TraceCheckUtils]: 10: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:37:42,955 INFO L273 TraceCheckUtils]: 11: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:37:42,955 INFO L273 TraceCheckUtils]: 12: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:37:42,956 INFO L273 TraceCheckUtils]: 13: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:37:42,956 INFO L273 TraceCheckUtils]: 14: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} assume !(~j~0 < ~n~0); {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:37:42,956 INFO L273 TraceCheckUtils]: 15: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} ~i~0 := 1 + ~i~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:37:42,957 INFO L273 TraceCheckUtils]: 16: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} assume !!(~i~0 < ~m~0);~j~0 := 0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:37:42,957 INFO L273 TraceCheckUtils]: 17: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:37:42,957 INFO L273 TraceCheckUtils]: 18: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:37:42,958 INFO L273 TraceCheckUtils]: 19: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:37:42,958 INFO L273 TraceCheckUtils]: 20: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:37:42,958 INFO L273 TraceCheckUtils]: 21: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:37:42,959 INFO L273 TraceCheckUtils]: 22: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:37:42,959 INFO L273 TraceCheckUtils]: 23: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:37:42,960 INFO L273 TraceCheckUtils]: 24: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} assume !(~j~0 < ~n~0); {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:37:42,960 INFO L273 TraceCheckUtils]: 25: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} ~i~0 := 1 + ~i~0; {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:37:42,961 INFO L273 TraceCheckUtils]: 26: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} assume !(~i~0 < ~m~0); {7335#(= 0 |main_~#A~0.offset|)} is VALID [2018-11-23 12:37:42,961 INFO L273 TraceCheckUtils]: 27: Hoare triple {7335#(= 0 |main_~#A~0.offset|)} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~min~0 := #t~mem1;havoc #t~mem1; {7402#(and (<= main_~min~0 (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|)) (= 0 |main_~#A~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 12:37:42,962 INFO L273 TraceCheckUtils]: 28: Hoare triple {7402#(and (<= main_~min~0 (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|)) (= 0 |main_~#A~0.offset|) (= main_~i~0 0))} assume !!(~i~0 < ~n~0);~j~0 := 0; {7406#(and (= main_~j~0 0) (<= main_~min~0 (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|)) (= 0 |main_~#A~0.offset|) (= main_~i~0 0))} is VALID [2018-11-23 12:37:42,963 INFO L273 TraceCheckUtils]: 29: Hoare triple {7406#(and (= main_~j~0 0) (<= main_~min~0 (select (select |#memory_int| |main_~#A~0.base|) |main_~#A~0.offset|)) (= 0 |main_~#A~0.offset|) (= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7410#(<= main_~min~0 |main_#t~mem2|)} is VALID [2018-11-23 12:37:42,964 INFO L273 TraceCheckUtils]: 30: Hoare triple {7410#(<= main_~min~0 |main_#t~mem2|)} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:37:42,964 INFO L273 TraceCheckUtils]: 31: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:37:42,964 INFO L273 TraceCheckUtils]: 32: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:37:42,965 INFO L273 TraceCheckUtils]: 33: Hoare triple {7316#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:37:42,965 INFO L273 TraceCheckUtils]: 34: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:37:42,965 INFO L273 TraceCheckUtils]: 35: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:37:42,965 INFO L273 TraceCheckUtils]: 36: Hoare triple {7316#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:37:42,965 INFO L273 TraceCheckUtils]: 37: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:37:42,966 INFO L273 TraceCheckUtils]: 38: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:37:42,966 INFO L273 TraceCheckUtils]: 39: Hoare triple {7316#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:37:42,966 INFO L273 TraceCheckUtils]: 40: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:37:42,966 INFO L273 TraceCheckUtils]: 41: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:37:42,966 INFO L273 TraceCheckUtils]: 42: Hoare triple {7316#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:37:42,967 INFO L273 TraceCheckUtils]: 43: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:37:42,967 INFO L273 TraceCheckUtils]: 44: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:37:42,967 INFO L273 TraceCheckUtils]: 45: Hoare triple {7316#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:37:42,967 INFO L273 TraceCheckUtils]: 46: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:37:42,967 INFO L273 TraceCheckUtils]: 47: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:37:42,967 INFO L273 TraceCheckUtils]: 48: Hoare triple {7316#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:37:42,967 INFO L273 TraceCheckUtils]: 49: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:37:42,967 INFO L273 TraceCheckUtils]: 50: Hoare triple {7316#false} assume !(~j~0 < ~n~0); {7316#false} is VALID [2018-11-23 12:37:42,968 INFO L273 TraceCheckUtils]: 51: Hoare triple {7316#false} ~i~0 := 1 + ~i~0; {7316#false} is VALID [2018-11-23 12:37:42,968 INFO L273 TraceCheckUtils]: 52: Hoare triple {7316#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {7316#false} is VALID [2018-11-23 12:37:42,968 INFO L273 TraceCheckUtils]: 53: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:37:42,968 INFO L273 TraceCheckUtils]: 54: Hoare triple {7316#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:37:42,968 INFO L273 TraceCheckUtils]: 55: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:37:42,968 INFO L273 TraceCheckUtils]: 56: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:37:42,968 INFO L273 TraceCheckUtils]: 57: Hoare triple {7316#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:37:42,968 INFO L273 TraceCheckUtils]: 58: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:37:42,969 INFO L273 TraceCheckUtils]: 59: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:37:42,969 INFO L273 TraceCheckUtils]: 60: Hoare triple {7316#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:37:42,969 INFO L273 TraceCheckUtils]: 61: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:37:42,969 INFO L273 TraceCheckUtils]: 62: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:37:42,969 INFO L273 TraceCheckUtils]: 63: Hoare triple {7316#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:37:42,969 INFO L273 TraceCheckUtils]: 64: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:37:42,969 INFO L273 TraceCheckUtils]: 65: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:37:42,969 INFO L273 TraceCheckUtils]: 66: Hoare triple {7316#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:37:42,970 INFO L273 TraceCheckUtils]: 67: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:37:42,970 INFO L273 TraceCheckUtils]: 68: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:37:42,970 INFO L273 TraceCheckUtils]: 69: Hoare triple {7316#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:37:42,970 INFO L273 TraceCheckUtils]: 70: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:37:42,970 INFO L273 TraceCheckUtils]: 71: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:37:42,970 INFO L273 TraceCheckUtils]: 72: Hoare triple {7316#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:37:42,970 INFO L273 TraceCheckUtils]: 73: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:37:42,970 INFO L273 TraceCheckUtils]: 74: Hoare triple {7316#false} assume !(~j~0 < ~n~0); {7316#false} is VALID [2018-11-23 12:37:42,971 INFO L273 TraceCheckUtils]: 75: Hoare triple {7316#false} ~i~0 := 1 + ~i~0; {7316#false} is VALID [2018-11-23 12:37:42,971 INFO L273 TraceCheckUtils]: 76: Hoare triple {7316#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {7316#false} is VALID [2018-11-23 12:37:42,971 INFO L273 TraceCheckUtils]: 77: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:37:42,971 INFO L273 TraceCheckUtils]: 78: Hoare triple {7316#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:37:42,971 INFO L273 TraceCheckUtils]: 79: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:37:42,971 INFO L273 TraceCheckUtils]: 80: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:37:42,971 INFO L273 TraceCheckUtils]: 81: Hoare triple {7316#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:37:42,971 INFO L273 TraceCheckUtils]: 82: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:37:42,972 INFO L273 TraceCheckUtils]: 83: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:37:42,972 INFO L273 TraceCheckUtils]: 84: Hoare triple {7316#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:37:42,972 INFO L273 TraceCheckUtils]: 85: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:37:42,972 INFO L273 TraceCheckUtils]: 86: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:37:42,972 INFO L273 TraceCheckUtils]: 87: Hoare triple {7316#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:37:42,972 INFO L273 TraceCheckUtils]: 88: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:37:42,972 INFO L273 TraceCheckUtils]: 89: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:37:42,972 INFO L273 TraceCheckUtils]: 90: Hoare triple {7316#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:37:42,973 INFO L273 TraceCheckUtils]: 91: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:37:42,973 INFO L273 TraceCheckUtils]: 92: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:37:42,973 INFO L273 TraceCheckUtils]: 93: Hoare triple {7316#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:37:42,973 INFO L273 TraceCheckUtils]: 94: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:37:42,973 INFO L273 TraceCheckUtils]: 95: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:37:42,973 INFO L273 TraceCheckUtils]: 96: Hoare triple {7316#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {7316#false} is VALID [2018-11-23 12:37:42,973 INFO L273 TraceCheckUtils]: 97: Hoare triple {7316#false} ~j~0 := 1 + ~j~0; {7316#false} is VALID [2018-11-23 12:37:42,973 INFO L273 TraceCheckUtils]: 98: Hoare triple {7316#false} assume !(~j~0 < ~n~0); {7316#false} is VALID [2018-11-23 12:37:42,974 INFO L273 TraceCheckUtils]: 99: Hoare triple {7316#false} ~i~0 := 1 + ~i~0; {7316#false} is VALID [2018-11-23 12:37:42,974 INFO L273 TraceCheckUtils]: 100: Hoare triple {7316#false} assume !(~i~0 < ~n~0); {7316#false} is VALID [2018-11-23 12:37:42,974 INFO L273 TraceCheckUtils]: 101: Hoare triple {7316#false} ~i~0 := 0;~j~0 := 0; {7316#false} is VALID [2018-11-23 12:37:42,974 INFO L273 TraceCheckUtils]: 102: Hoare triple {7316#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {7316#false} is VALID [2018-11-23 12:37:42,974 INFO L273 TraceCheckUtils]: 103: Hoare triple {7316#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {7316#false} is VALID [2018-11-23 12:37:42,974 INFO L256 TraceCheckUtils]: 104: Hoare triple {7316#false} call __VERIFIER_assert((if #t~mem4 >= ~min~0 then 1 else 0)); {7316#false} is VALID [2018-11-23 12:37:42,974 INFO L273 TraceCheckUtils]: 105: Hoare triple {7316#false} ~cond := #in~cond; {7316#false} is VALID [2018-11-23 12:37:42,974 INFO L273 TraceCheckUtils]: 106: Hoare triple {7316#false} assume 0 == ~cond; {7316#false} is VALID [2018-11-23 12:37:42,975 INFO L273 TraceCheckUtils]: 107: Hoare triple {7316#false} assume !false; {7316#false} is VALID [2018-11-23 12:37:42,982 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 783 trivial. 0 not checked. [2018-11-23 12:37:43,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:37:43,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-23 12:37:43,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2018-11-23 12:37:43,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:37:43,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:37:43,029 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:37:43,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:37:43,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:37:43,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:37:43,030 INFO L87 Difference]: Start difference. First operand 132 states and 167 transitions. Second operand 6 states. [2018-11-23 12:37:44,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:44,594 INFO L93 Difference]: Finished difference Result 251 states and 323 transitions. [2018-11-23 12:37:44,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:37:44,594 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 108 [2018-11-23 12:37:44,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:44,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:37:44,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2018-11-23 12:37:44,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:37:44,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 65 transitions. [2018-11-23 12:37:44,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 65 transitions. [2018-11-23 12:37:44,665 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:37:44,668 INFO L225 Difference]: With dead ends: 251 [2018-11-23 12:37:44,668 INFO L226 Difference]: Without dead ends: 150 [2018-11-23 12:37:44,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:37:44,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-11-23 12:37:45,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 132. [2018-11-23 12:37:45,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:37:45,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand 132 states. [2018-11-23 12:37:45,217 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 132 states. [2018-11-23 12:37:45,217 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 132 states. [2018-11-23 12:37:45,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:45,221 INFO L93 Difference]: Finished difference Result 150 states and 190 transitions. [2018-11-23 12:37:45,221 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 190 transitions. [2018-11-23 12:37:45,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:37:45,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:37:45,221 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 150 states. [2018-11-23 12:37:45,222 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 150 states. [2018-11-23 12:37:45,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:45,225 INFO L93 Difference]: Finished difference Result 150 states and 190 transitions. [2018-11-23 12:37:45,225 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 190 transitions. [2018-11-23 12:37:45,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:37:45,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:37:45,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:37:45,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:37:45,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-23 12:37:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 166 transitions. [2018-11-23 12:37:45,229 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 166 transitions. Word has length 108 [2018-11-23 12:37:45,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:45,230 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 166 transitions. [2018-11-23 12:37:45,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:37:45,230 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 166 transitions. [2018-11-23 12:37:45,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-23 12:37:45,231 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:45,231 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 20, 14, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:45,231 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:45,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:45,232 INFO L82 PathProgramCache]: Analyzing trace with hash 2100173486, now seen corresponding path program 1 times [2018-11-23 12:37:45,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:45,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:45,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:45,233 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:37:45,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:45,239 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:37:45,239 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:37:45,240 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-23 12:37:45,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:45,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:45,349 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:37:45,938 INFO L256 TraceCheckUtils]: 0: Hoare triple {8514#true} call ULTIMATE.init(); {8514#true} is VALID [2018-11-23 12:37:45,938 INFO L273 TraceCheckUtils]: 1: Hoare triple {8514#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8514#true} is VALID [2018-11-23 12:37:45,938 INFO L273 TraceCheckUtils]: 2: Hoare triple {8514#true} assume true; {8514#true} is VALID [2018-11-23 12:37:45,939 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8514#true} {8514#true} #106#return; {8514#true} is VALID [2018-11-23 12:37:45,939 INFO L256 TraceCheckUtils]: 4: Hoare triple {8514#true} call #t~ret5 := main(); {8514#true} is VALID [2018-11-23 12:37:45,939 INFO L273 TraceCheckUtils]: 5: Hoare triple {8514#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~min~0;~i~0 := 0;~j~0 := 0; {8534#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:45,940 INFO L273 TraceCheckUtils]: 6: Hoare triple {8534#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {8538#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:37:45,940 INFO L273 TraceCheckUtils]: 7: Hoare triple {8538#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8542#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:37:45,941 INFO L273 TraceCheckUtils]: 8: Hoare triple {8542#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8546#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:37:45,942 INFO L273 TraceCheckUtils]: 9: Hoare triple {8546#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8550#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:37:45,943 INFO L273 TraceCheckUtils]: 10: Hoare triple {8550#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8554#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-23 12:37:45,944 INFO L273 TraceCheckUtils]: 11: Hoare triple {8554#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8558#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-23 12:37:45,945 INFO L273 TraceCheckUtils]: 12: Hoare triple {8558#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8562#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-23 12:37:45,946 INFO L273 TraceCheckUtils]: 13: Hoare triple {8562#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8566#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} is VALID [2018-11-23 12:37:45,947 INFO L273 TraceCheckUtils]: 14: Hoare triple {8566#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} assume !(~j~0 < ~n~0); {8515#false} is VALID [2018-11-23 12:37:45,947 INFO L273 TraceCheckUtils]: 15: Hoare triple {8515#false} ~i~0 := 1 + ~i~0; {8515#false} is VALID [2018-11-23 12:37:45,947 INFO L273 TraceCheckUtils]: 16: Hoare triple {8515#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {8515#false} is VALID [2018-11-23 12:37:45,947 INFO L273 TraceCheckUtils]: 17: Hoare triple {8515#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,948 INFO L273 TraceCheckUtils]: 18: Hoare triple {8515#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,948 INFO L273 TraceCheckUtils]: 19: Hoare triple {8515#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,948 INFO L273 TraceCheckUtils]: 20: Hoare triple {8515#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,948 INFO L273 TraceCheckUtils]: 21: Hoare triple {8515#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,948 INFO L273 TraceCheckUtils]: 22: Hoare triple {8515#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,949 INFO L273 TraceCheckUtils]: 23: Hoare triple {8515#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,949 INFO L273 TraceCheckUtils]: 24: Hoare triple {8515#false} assume !(~j~0 < ~n~0); {8515#false} is VALID [2018-11-23 12:37:45,949 INFO L273 TraceCheckUtils]: 25: Hoare triple {8515#false} ~i~0 := 1 + ~i~0; {8515#false} is VALID [2018-11-23 12:37:45,949 INFO L273 TraceCheckUtils]: 26: Hoare triple {8515#false} assume !(~i~0 < ~m~0); {8515#false} is VALID [2018-11-23 12:37:45,950 INFO L273 TraceCheckUtils]: 27: Hoare triple {8515#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~min~0 := #t~mem1;havoc #t~mem1; {8515#false} is VALID [2018-11-23 12:37:45,950 INFO L273 TraceCheckUtils]: 28: Hoare triple {8515#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {8515#false} is VALID [2018-11-23 12:37:45,950 INFO L273 TraceCheckUtils]: 29: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:37:45,950 INFO L273 TraceCheckUtils]: 30: Hoare triple {8515#false} assume !(#t~mem2 < ~min~0);havoc #t~mem2; {8515#false} is VALID [2018-11-23 12:37:45,950 INFO L273 TraceCheckUtils]: 31: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,951 INFO L273 TraceCheckUtils]: 32: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:37:45,951 INFO L273 TraceCheckUtils]: 33: Hoare triple {8515#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:37:45,951 INFO L273 TraceCheckUtils]: 34: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,951 INFO L273 TraceCheckUtils]: 35: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:37:45,951 INFO L273 TraceCheckUtils]: 36: Hoare triple {8515#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:37:45,952 INFO L273 TraceCheckUtils]: 37: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,952 INFO L273 TraceCheckUtils]: 38: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:37:45,952 INFO L273 TraceCheckUtils]: 39: Hoare triple {8515#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:37:45,952 INFO L273 TraceCheckUtils]: 40: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,952 INFO L273 TraceCheckUtils]: 41: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:37:45,952 INFO L273 TraceCheckUtils]: 42: Hoare triple {8515#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:37:45,953 INFO L273 TraceCheckUtils]: 43: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,953 INFO L273 TraceCheckUtils]: 44: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:37:45,953 INFO L273 TraceCheckUtils]: 45: Hoare triple {8515#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:37:45,953 INFO L273 TraceCheckUtils]: 46: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,953 INFO L273 TraceCheckUtils]: 47: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:37:45,953 INFO L273 TraceCheckUtils]: 48: Hoare triple {8515#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:37:45,954 INFO L273 TraceCheckUtils]: 49: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,954 INFO L273 TraceCheckUtils]: 50: Hoare triple {8515#false} assume !(~j~0 < ~n~0); {8515#false} is VALID [2018-11-23 12:37:45,954 INFO L273 TraceCheckUtils]: 51: Hoare triple {8515#false} ~i~0 := 1 + ~i~0; {8515#false} is VALID [2018-11-23 12:37:45,954 INFO L273 TraceCheckUtils]: 52: Hoare triple {8515#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {8515#false} is VALID [2018-11-23 12:37:45,954 INFO L273 TraceCheckUtils]: 53: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:37:45,954 INFO L273 TraceCheckUtils]: 54: Hoare triple {8515#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:37:45,955 INFO L273 TraceCheckUtils]: 55: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,955 INFO L273 TraceCheckUtils]: 56: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:37:45,955 INFO L273 TraceCheckUtils]: 57: Hoare triple {8515#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:37:45,955 INFO L273 TraceCheckUtils]: 58: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,955 INFO L273 TraceCheckUtils]: 59: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:37:45,955 INFO L273 TraceCheckUtils]: 60: Hoare triple {8515#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:37:45,956 INFO L273 TraceCheckUtils]: 61: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,956 INFO L273 TraceCheckUtils]: 62: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:37:45,956 INFO L273 TraceCheckUtils]: 63: Hoare triple {8515#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:37:45,956 INFO L273 TraceCheckUtils]: 64: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,956 INFO L273 TraceCheckUtils]: 65: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:37:45,956 INFO L273 TraceCheckUtils]: 66: Hoare triple {8515#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:37:45,957 INFO L273 TraceCheckUtils]: 67: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,957 INFO L273 TraceCheckUtils]: 68: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:37:45,957 INFO L273 TraceCheckUtils]: 69: Hoare triple {8515#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:37:45,957 INFO L273 TraceCheckUtils]: 70: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,957 INFO L273 TraceCheckUtils]: 71: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:37:45,958 INFO L273 TraceCheckUtils]: 72: Hoare triple {8515#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:37:45,958 INFO L273 TraceCheckUtils]: 73: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,958 INFO L273 TraceCheckUtils]: 74: Hoare triple {8515#false} assume !(~j~0 < ~n~0); {8515#false} is VALID [2018-11-23 12:37:45,958 INFO L273 TraceCheckUtils]: 75: Hoare triple {8515#false} ~i~0 := 1 + ~i~0; {8515#false} is VALID [2018-11-23 12:37:45,958 INFO L273 TraceCheckUtils]: 76: Hoare triple {8515#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {8515#false} is VALID [2018-11-23 12:37:45,958 INFO L273 TraceCheckUtils]: 77: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:37:45,959 INFO L273 TraceCheckUtils]: 78: Hoare triple {8515#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:37:45,959 INFO L273 TraceCheckUtils]: 79: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,959 INFO L273 TraceCheckUtils]: 80: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:37:45,959 INFO L273 TraceCheckUtils]: 81: Hoare triple {8515#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:37:45,959 INFO L273 TraceCheckUtils]: 82: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,959 INFO L273 TraceCheckUtils]: 83: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:37:45,960 INFO L273 TraceCheckUtils]: 84: Hoare triple {8515#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:37:45,960 INFO L273 TraceCheckUtils]: 85: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,960 INFO L273 TraceCheckUtils]: 86: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:37:45,960 INFO L273 TraceCheckUtils]: 87: Hoare triple {8515#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:37:45,960 INFO L273 TraceCheckUtils]: 88: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,960 INFO L273 TraceCheckUtils]: 89: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:37:45,961 INFO L273 TraceCheckUtils]: 90: Hoare triple {8515#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:37:45,961 INFO L273 TraceCheckUtils]: 91: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,961 INFO L273 TraceCheckUtils]: 92: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:37:45,961 INFO L273 TraceCheckUtils]: 93: Hoare triple {8515#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:37:45,961 INFO L273 TraceCheckUtils]: 94: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,961 INFO L273 TraceCheckUtils]: 95: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:37:45,962 INFO L273 TraceCheckUtils]: 96: Hoare triple {8515#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {8515#false} is VALID [2018-11-23 12:37:45,962 INFO L273 TraceCheckUtils]: 97: Hoare triple {8515#false} ~j~0 := 1 + ~j~0; {8515#false} is VALID [2018-11-23 12:37:45,962 INFO L273 TraceCheckUtils]: 98: Hoare triple {8515#false} assume !(~j~0 < ~n~0); {8515#false} is VALID [2018-11-23 12:37:45,962 INFO L273 TraceCheckUtils]: 99: Hoare triple {8515#false} ~i~0 := 1 + ~i~0; {8515#false} is VALID [2018-11-23 12:37:45,962 INFO L273 TraceCheckUtils]: 100: Hoare triple {8515#false} assume !(~i~0 < ~n~0); {8515#false} is VALID [2018-11-23 12:37:45,962 INFO L273 TraceCheckUtils]: 101: Hoare triple {8515#false} ~i~0 := 0;~j~0 := 0; {8515#false} is VALID [2018-11-23 12:37:45,963 INFO L273 TraceCheckUtils]: 102: Hoare triple {8515#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {8515#false} is VALID [2018-11-23 12:37:45,963 INFO L273 TraceCheckUtils]: 103: Hoare triple {8515#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {8515#false} is VALID [2018-11-23 12:37:45,963 INFO L256 TraceCheckUtils]: 104: Hoare triple {8515#false} call __VERIFIER_assert((if #t~mem4 >= ~min~0 then 1 else 0)); {8515#false} is VALID [2018-11-23 12:37:45,963 INFO L273 TraceCheckUtils]: 105: Hoare triple {8515#false} ~cond := #in~cond; {8515#false} is VALID [2018-11-23 12:37:45,963 INFO L273 TraceCheckUtils]: 106: Hoare triple {8515#false} assume 0 == ~cond; {8515#false} is VALID [2018-11-23 12:37:45,964 INFO L273 TraceCheckUtils]: 107: Hoare triple {8515#false} assume !false; {8515#false} is VALID [2018-11-23 12:37:45,970 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 66 proven. 28 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2018-11-23 12:37:45,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:37:45,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-23 12:37:45,991 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 108 [2018-11-23 12:37:45,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:37:45,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 12:37:46,026 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-23 12:37:46,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 12:37:46,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 12:37:46,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:37:46,028 INFO L87 Difference]: Start difference. First operand 132 states and 166 transitions. Second operand 11 states. [2018-11-23 12:37:46,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:46,945 INFO L93 Difference]: Finished difference Result 272 states and 353 transitions. [2018-11-23 12:37:46,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:37:46,945 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 108 [2018-11-23 12:37:46,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:46,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:37:46,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2018-11-23 12:37:46,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 12:37:46,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 138 transitions. [2018-11-23 12:37:46,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 138 transitions. [2018-11-23 12:37:47,166 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:37:47,169 INFO L225 Difference]: With dead ends: 272 [2018-11-23 12:37:47,169 INFO L226 Difference]: Without dead ends: 155 [2018-11-23 12:37:47,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:37:47,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-11-23 12:37:47,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 146. [2018-11-23 12:37:47,680 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:37:47,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand 146 states. [2018-11-23 12:37:47,680 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand 146 states. [2018-11-23 12:37:47,680 INFO L87 Difference]: Start difference. First operand 155 states. Second operand 146 states. [2018-11-23 12:37:47,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:47,684 INFO L93 Difference]: Finished difference Result 155 states and 197 transitions. [2018-11-23 12:37:47,684 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 197 transitions. [2018-11-23 12:37:47,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:37:47,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:37:47,685 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 155 states. [2018-11-23 12:37:47,685 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 155 states. [2018-11-23 12:37:47,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:47,689 INFO L93 Difference]: Finished difference Result 155 states and 197 transitions. [2018-11-23 12:37:47,689 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 197 transitions. [2018-11-23 12:37:47,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:37:47,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:37:47,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:37:47,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:37:47,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-23 12:37:47,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 184 transitions. [2018-11-23 12:37:47,693 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 184 transitions. Word has length 108 [2018-11-23 12:37:47,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:47,693 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 184 transitions. [2018-11-23 12:37:47,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 12:37:47,694 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 184 transitions. [2018-11-23 12:37:47,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-11-23 12:37:47,695 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:47,695 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 23, 16, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:47,695 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:47,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:47,696 INFO L82 PathProgramCache]: Analyzing trace with hash 225026463, now seen corresponding path program 2 times [2018-11-23 12:37:47,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:47,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:47,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:47,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:37:47,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:47,703 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:37:47,703 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:37:47,703 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-23 12:37:47,728 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:37:47,792 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:37:47,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:37:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:47,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:37:48,241 INFO L256 TraceCheckUtils]: 0: Hoare triple {9783#true} call ULTIMATE.init(); {9783#true} is VALID [2018-11-23 12:37:48,241 INFO L273 TraceCheckUtils]: 1: Hoare triple {9783#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9783#true} is VALID [2018-11-23 12:37:48,242 INFO L273 TraceCheckUtils]: 2: Hoare triple {9783#true} assume true; {9783#true} is VALID [2018-11-23 12:37:48,242 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9783#true} {9783#true} #106#return; {9783#true} is VALID [2018-11-23 12:37:48,242 INFO L256 TraceCheckUtils]: 4: Hoare triple {9783#true} call #t~ret5 := main(); {9783#true} is VALID [2018-11-23 12:37:48,243 INFO L273 TraceCheckUtils]: 5: Hoare triple {9783#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~min~0;~i~0 := 0;~j~0 := 0; {9803#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:48,244 INFO L273 TraceCheckUtils]: 6: Hoare triple {9803#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {9807#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:37:48,244 INFO L273 TraceCheckUtils]: 7: Hoare triple {9807#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9811#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:37:48,245 INFO L273 TraceCheckUtils]: 8: Hoare triple {9811#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9815#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:37:48,246 INFO L273 TraceCheckUtils]: 9: Hoare triple {9815#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9819#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:37:48,247 INFO L273 TraceCheckUtils]: 10: Hoare triple {9819#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9823#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-23 12:37:48,248 INFO L273 TraceCheckUtils]: 11: Hoare triple {9823#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9827#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-23 12:37:48,249 INFO L273 TraceCheckUtils]: 12: Hoare triple {9827#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9831#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-23 12:37:48,250 INFO L273 TraceCheckUtils]: 13: Hoare triple {9831#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9835#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} is VALID [2018-11-23 12:37:48,251 INFO L273 TraceCheckUtils]: 14: Hoare triple {9835#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9839#(and (<= 1500 main_~n~0) (<= main_~j~0 8))} is VALID [2018-11-23 12:37:48,252 INFO L273 TraceCheckUtils]: 15: Hoare triple {9839#(and (<= 1500 main_~n~0) (<= main_~j~0 8))} assume !(~j~0 < ~n~0); {9784#false} is VALID [2018-11-23 12:37:48,252 INFO L273 TraceCheckUtils]: 16: Hoare triple {9784#false} ~i~0 := 1 + ~i~0; {9784#false} is VALID [2018-11-23 12:37:48,252 INFO L273 TraceCheckUtils]: 17: Hoare triple {9784#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {9784#false} is VALID [2018-11-23 12:37:48,252 INFO L273 TraceCheckUtils]: 18: Hoare triple {9784#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,252 INFO L273 TraceCheckUtils]: 19: Hoare triple {9784#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,253 INFO L273 TraceCheckUtils]: 20: Hoare triple {9784#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,253 INFO L273 TraceCheckUtils]: 21: Hoare triple {9784#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,253 INFO L273 TraceCheckUtils]: 22: Hoare triple {9784#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,253 INFO L273 TraceCheckUtils]: 23: Hoare triple {9784#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,253 INFO L273 TraceCheckUtils]: 24: Hoare triple {9784#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,254 INFO L273 TraceCheckUtils]: 25: Hoare triple {9784#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,254 INFO L273 TraceCheckUtils]: 26: Hoare triple {9784#false} assume !(~j~0 < ~n~0); {9784#false} is VALID [2018-11-23 12:37:48,254 INFO L273 TraceCheckUtils]: 27: Hoare triple {9784#false} ~i~0 := 1 + ~i~0; {9784#false} is VALID [2018-11-23 12:37:48,254 INFO L273 TraceCheckUtils]: 28: Hoare triple {9784#false} assume !(~i~0 < ~m~0); {9784#false} is VALID [2018-11-23 12:37:48,254 INFO L273 TraceCheckUtils]: 29: Hoare triple {9784#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~min~0 := #t~mem1;havoc #t~mem1; {9784#false} is VALID [2018-11-23 12:37:48,255 INFO L273 TraceCheckUtils]: 30: Hoare triple {9784#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {9784#false} is VALID [2018-11-23 12:37:48,255 INFO L273 TraceCheckUtils]: 31: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:37:48,255 INFO L273 TraceCheckUtils]: 32: Hoare triple {9784#false} assume !(#t~mem2 < ~min~0);havoc #t~mem2; {9784#false} is VALID [2018-11-23 12:37:48,255 INFO L273 TraceCheckUtils]: 33: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,255 INFO L273 TraceCheckUtils]: 34: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:37:48,255 INFO L273 TraceCheckUtils]: 35: Hoare triple {9784#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:37:48,255 INFO L273 TraceCheckUtils]: 36: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,255 INFO L273 TraceCheckUtils]: 37: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:37:48,256 INFO L273 TraceCheckUtils]: 38: Hoare triple {9784#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:37:48,256 INFO L273 TraceCheckUtils]: 39: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,256 INFO L273 TraceCheckUtils]: 40: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:37:48,256 INFO L273 TraceCheckUtils]: 41: Hoare triple {9784#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:37:48,256 INFO L273 TraceCheckUtils]: 42: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,256 INFO L273 TraceCheckUtils]: 43: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:37:48,256 INFO L273 TraceCheckUtils]: 44: Hoare triple {9784#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:37:48,256 INFO L273 TraceCheckUtils]: 45: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,257 INFO L273 TraceCheckUtils]: 46: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:37:48,257 INFO L273 TraceCheckUtils]: 47: Hoare triple {9784#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:37:48,257 INFO L273 TraceCheckUtils]: 48: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,257 INFO L273 TraceCheckUtils]: 49: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:37:48,257 INFO L273 TraceCheckUtils]: 50: Hoare triple {9784#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:37:48,257 INFO L273 TraceCheckUtils]: 51: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,258 INFO L273 TraceCheckUtils]: 52: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:37:48,258 INFO L273 TraceCheckUtils]: 53: Hoare triple {9784#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:37:48,258 INFO L273 TraceCheckUtils]: 54: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,258 INFO L273 TraceCheckUtils]: 55: Hoare triple {9784#false} assume !(~j~0 < ~n~0); {9784#false} is VALID [2018-11-23 12:37:48,258 INFO L273 TraceCheckUtils]: 56: Hoare triple {9784#false} ~i~0 := 1 + ~i~0; {9784#false} is VALID [2018-11-23 12:37:48,259 INFO L273 TraceCheckUtils]: 57: Hoare triple {9784#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {9784#false} is VALID [2018-11-23 12:37:48,259 INFO L273 TraceCheckUtils]: 58: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:37:48,259 INFO L273 TraceCheckUtils]: 59: Hoare triple {9784#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:37:48,259 INFO L273 TraceCheckUtils]: 60: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,259 INFO L273 TraceCheckUtils]: 61: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:37:48,259 INFO L273 TraceCheckUtils]: 62: Hoare triple {9784#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:37:48,260 INFO L273 TraceCheckUtils]: 63: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,260 INFO L273 TraceCheckUtils]: 64: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:37:48,260 INFO L273 TraceCheckUtils]: 65: Hoare triple {9784#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:37:48,260 INFO L273 TraceCheckUtils]: 66: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,260 INFO L273 TraceCheckUtils]: 67: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:37:48,261 INFO L273 TraceCheckUtils]: 68: Hoare triple {9784#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:37:48,261 INFO L273 TraceCheckUtils]: 69: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,261 INFO L273 TraceCheckUtils]: 70: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:37:48,261 INFO L273 TraceCheckUtils]: 71: Hoare triple {9784#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:37:48,261 INFO L273 TraceCheckUtils]: 72: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,261 INFO L273 TraceCheckUtils]: 73: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:37:48,262 INFO L273 TraceCheckUtils]: 74: Hoare triple {9784#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:37:48,262 INFO L273 TraceCheckUtils]: 75: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,262 INFO L273 TraceCheckUtils]: 76: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:37:48,262 INFO L273 TraceCheckUtils]: 77: Hoare triple {9784#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:37:48,262 INFO L273 TraceCheckUtils]: 78: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,262 INFO L273 TraceCheckUtils]: 79: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:37:48,263 INFO L273 TraceCheckUtils]: 80: Hoare triple {9784#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:37:48,263 INFO L273 TraceCheckUtils]: 81: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,263 INFO L273 TraceCheckUtils]: 82: Hoare triple {9784#false} assume !(~j~0 < ~n~0); {9784#false} is VALID [2018-11-23 12:37:48,263 INFO L273 TraceCheckUtils]: 83: Hoare triple {9784#false} ~i~0 := 1 + ~i~0; {9784#false} is VALID [2018-11-23 12:37:48,263 INFO L273 TraceCheckUtils]: 84: Hoare triple {9784#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {9784#false} is VALID [2018-11-23 12:37:48,263 INFO L273 TraceCheckUtils]: 85: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:37:48,264 INFO L273 TraceCheckUtils]: 86: Hoare triple {9784#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:37:48,264 INFO L273 TraceCheckUtils]: 87: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,264 INFO L273 TraceCheckUtils]: 88: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:37:48,264 INFO L273 TraceCheckUtils]: 89: Hoare triple {9784#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:37:48,264 INFO L273 TraceCheckUtils]: 90: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,264 INFO L273 TraceCheckUtils]: 91: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:37:48,265 INFO L273 TraceCheckUtils]: 92: Hoare triple {9784#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:37:48,265 INFO L273 TraceCheckUtils]: 93: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,265 INFO L273 TraceCheckUtils]: 94: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:37:48,265 INFO L273 TraceCheckUtils]: 95: Hoare triple {9784#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:37:48,265 INFO L273 TraceCheckUtils]: 96: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,265 INFO L273 TraceCheckUtils]: 97: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:37:48,266 INFO L273 TraceCheckUtils]: 98: Hoare triple {9784#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:37:48,266 INFO L273 TraceCheckUtils]: 99: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,266 INFO L273 TraceCheckUtils]: 100: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:37:48,266 INFO L273 TraceCheckUtils]: 101: Hoare triple {9784#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:37:48,266 INFO L273 TraceCheckUtils]: 102: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,266 INFO L273 TraceCheckUtils]: 103: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:37:48,267 INFO L273 TraceCheckUtils]: 104: Hoare triple {9784#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:37:48,267 INFO L273 TraceCheckUtils]: 105: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,267 INFO L273 TraceCheckUtils]: 106: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:37:48,267 INFO L273 TraceCheckUtils]: 107: Hoare triple {9784#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {9784#false} is VALID [2018-11-23 12:37:48,267 INFO L273 TraceCheckUtils]: 108: Hoare triple {9784#false} ~j~0 := 1 + ~j~0; {9784#false} is VALID [2018-11-23 12:37:48,267 INFO L273 TraceCheckUtils]: 109: Hoare triple {9784#false} assume !(~j~0 < ~n~0); {9784#false} is VALID [2018-11-23 12:37:48,268 INFO L273 TraceCheckUtils]: 110: Hoare triple {9784#false} ~i~0 := 1 + ~i~0; {9784#false} is VALID [2018-11-23 12:37:48,268 INFO L273 TraceCheckUtils]: 111: Hoare triple {9784#false} assume !(~i~0 < ~n~0); {9784#false} is VALID [2018-11-23 12:37:48,268 INFO L273 TraceCheckUtils]: 112: Hoare triple {9784#false} ~i~0 := 0;~j~0 := 0; {9784#false} is VALID [2018-11-23 12:37:48,268 INFO L273 TraceCheckUtils]: 113: Hoare triple {9784#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {9784#false} is VALID [2018-11-23 12:37:48,268 INFO L273 TraceCheckUtils]: 114: Hoare triple {9784#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {9784#false} is VALID [2018-11-23 12:37:48,268 INFO L256 TraceCheckUtils]: 115: Hoare triple {9784#false} call __VERIFIER_assert((if #t~mem4 >= ~min~0 then 1 else 0)); {9784#false} is VALID [2018-11-23 12:37:48,269 INFO L273 TraceCheckUtils]: 116: Hoare triple {9784#false} ~cond := #in~cond; {9784#false} is VALID [2018-11-23 12:37:48,269 INFO L273 TraceCheckUtils]: 117: Hoare triple {9784#false} assume 0 == ~cond; {9784#false} is VALID [2018-11-23 12:37:48,269 INFO L273 TraceCheckUtils]: 118: Hoare triple {9784#false} assume !false; {9784#false} is VALID [2018-11-23 12:37:48,277 INFO L134 CoverageAnalysis]: Checked inductivity of 1069 backedges. 83 proven. 36 refuted. 0 times theorem prover too weak. 950 trivial. 0 not checked. [2018-11-23 12:37:48,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:37:48,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-11-23 12:37:48,304 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 119 [2018-11-23 12:37:48,304 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:37:48,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:37:48,396 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:37:48,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:37:48,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:37:48,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:37:48,397 INFO L87 Difference]: Start difference. First operand 146 states and 184 transitions. Second operand 12 states. [2018-11-23 12:37:49,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:49,674 INFO L93 Difference]: Finished difference Result 299 states and 388 transitions. [2018-11-23 12:37:49,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:37:49,674 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 119 [2018-11-23 12:37:49,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:49,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:37:49,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 147 transitions. [2018-11-23 12:37:49,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:37:49,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 147 transitions. [2018-11-23 12:37:49,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 147 transitions. [2018-11-23 12:37:49,822 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:37:49,825 INFO L225 Difference]: With dead ends: 299 [2018-11-23 12:37:49,825 INFO L226 Difference]: Without dead ends: 169 [2018-11-23 12:37:49,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:37:49,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-23 12:37:50,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 160. [2018-11-23 12:37:50,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:37:50,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand 160 states. [2018-11-23 12:37:50,149 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 160 states. [2018-11-23 12:37:50,149 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 160 states. [2018-11-23 12:37:50,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:50,153 INFO L93 Difference]: Finished difference Result 169 states and 215 transitions. [2018-11-23 12:37:50,153 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 215 transitions. [2018-11-23 12:37:50,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:37:50,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:37:50,154 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand 169 states. [2018-11-23 12:37:50,154 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 169 states. [2018-11-23 12:37:50,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:50,158 INFO L93 Difference]: Finished difference Result 169 states and 215 transitions. [2018-11-23 12:37:50,158 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 215 transitions. [2018-11-23 12:37:50,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:37:50,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:37:50,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:37:50,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:37:50,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-11-23 12:37:50,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 202 transitions. [2018-11-23 12:37:50,163 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 202 transitions. Word has length 119 [2018-11-23 12:37:50,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:50,163 INFO L480 AbstractCegarLoop]: Abstraction has 160 states and 202 transitions. [2018-11-23 12:37:50,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:37:50,163 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 202 transitions. [2018-11-23 12:37:50,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-11-23 12:37:50,164 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:50,165 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 26, 18, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:50,165 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:50,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:50,165 INFO L82 PathProgramCache]: Analyzing trace with hash 1333730318, now seen corresponding path program 3 times [2018-11-23 12:37:50,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:50,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:50,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:50,166 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:37:50,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:50,173 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:37:50,174 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:37:50,174 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-23 12:37:50,190 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:37:51,506 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 12:37:51,506 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:37:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:51,533 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:37:51,819 INFO L256 TraceCheckUtils]: 0: Hoare triple {11175#true} call ULTIMATE.init(); {11175#true} is VALID [2018-11-23 12:37:51,820 INFO L273 TraceCheckUtils]: 1: Hoare triple {11175#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11175#true} is VALID [2018-11-23 12:37:51,820 INFO L273 TraceCheckUtils]: 2: Hoare triple {11175#true} assume true; {11175#true} is VALID [2018-11-23 12:37:51,820 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11175#true} {11175#true} #106#return; {11175#true} is VALID [2018-11-23 12:37:51,820 INFO L256 TraceCheckUtils]: 4: Hoare triple {11175#true} call #t~ret5 := main(); {11175#true} is VALID [2018-11-23 12:37:51,821 INFO L273 TraceCheckUtils]: 5: Hoare triple {11175#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~min~0;~i~0 := 0;~j~0 := 0; {11195#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:51,821 INFO L273 TraceCheckUtils]: 6: Hoare triple {11195#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {11195#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:51,821 INFO L273 TraceCheckUtils]: 7: Hoare triple {11195#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11195#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:51,822 INFO L273 TraceCheckUtils]: 8: Hoare triple {11195#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11195#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:51,822 INFO L273 TraceCheckUtils]: 9: Hoare triple {11195#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11195#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:51,822 INFO L273 TraceCheckUtils]: 10: Hoare triple {11195#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11195#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:51,822 INFO L273 TraceCheckUtils]: 11: Hoare triple {11195#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11195#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:51,823 INFO L273 TraceCheckUtils]: 12: Hoare triple {11195#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11195#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:51,823 INFO L273 TraceCheckUtils]: 13: Hoare triple {11195#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11195#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:51,823 INFO L273 TraceCheckUtils]: 14: Hoare triple {11195#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11195#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:51,824 INFO L273 TraceCheckUtils]: 15: Hoare triple {11195#(<= 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11195#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:51,824 INFO L273 TraceCheckUtils]: 16: Hoare triple {11195#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {11195#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:51,824 INFO L273 TraceCheckUtils]: 17: Hoare triple {11195#(<= 1500 main_~n~0)} ~i~0 := 1 + ~i~0; {11195#(<= 1500 main_~n~0)} is VALID [2018-11-23 12:37:51,825 INFO L273 TraceCheckUtils]: 18: Hoare triple {11195#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {11235#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-23 12:37:51,826 INFO L273 TraceCheckUtils]: 19: Hoare triple {11235#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11239#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-23 12:37:51,827 INFO L273 TraceCheckUtils]: 20: Hoare triple {11239#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11243#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-23 12:37:51,829 INFO L273 TraceCheckUtils]: 21: Hoare triple {11243#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11247#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-23 12:37:51,830 INFO L273 TraceCheckUtils]: 22: Hoare triple {11247#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11251#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-23 12:37:51,831 INFO L273 TraceCheckUtils]: 23: Hoare triple {11251#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11255#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-23 12:37:51,832 INFO L273 TraceCheckUtils]: 24: Hoare triple {11255#(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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11259#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-23 12:37:51,833 INFO L273 TraceCheckUtils]: 25: Hoare triple {11259#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11263#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} is VALID [2018-11-23 12:37:51,834 INFO L273 TraceCheckUtils]: 26: Hoare triple {11263#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11267#(and (<= 1500 main_~n~0) (<= main_~j~0 8))} is VALID [2018-11-23 12:37:51,835 INFO L273 TraceCheckUtils]: 27: Hoare triple {11267#(and (<= 1500 main_~n~0) (<= main_~j~0 8))} 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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {11271#(and (<= 1500 main_~n~0) (<= main_~j~0 9))} is VALID [2018-11-23 12:37:51,836 INFO L273 TraceCheckUtils]: 28: Hoare triple {11271#(and (<= 1500 main_~n~0) (<= main_~j~0 9))} assume !(~j~0 < ~n~0); {11176#false} is VALID [2018-11-23 12:37:51,836 INFO L273 TraceCheckUtils]: 29: Hoare triple {11176#false} ~i~0 := 1 + ~i~0; {11176#false} is VALID [2018-11-23 12:37:51,836 INFO L273 TraceCheckUtils]: 30: Hoare triple {11176#false} assume !(~i~0 < ~m~0); {11176#false} is VALID [2018-11-23 12:37:51,836 INFO L273 TraceCheckUtils]: 31: Hoare triple {11176#false} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~min~0 := #t~mem1;havoc #t~mem1; {11176#false} is VALID [2018-11-23 12:37:51,836 INFO L273 TraceCheckUtils]: 32: Hoare triple {11176#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {11176#false} is VALID [2018-11-23 12:37:51,837 INFO L273 TraceCheckUtils]: 33: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,837 INFO L273 TraceCheckUtils]: 34: Hoare triple {11176#false} assume !(#t~mem2 < ~min~0);havoc #t~mem2; {11176#false} is VALID [2018-11-23 12:37:51,837 INFO L273 TraceCheckUtils]: 35: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,837 INFO L273 TraceCheckUtils]: 36: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,837 INFO L273 TraceCheckUtils]: 37: Hoare triple {11176#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:37:51,838 INFO L273 TraceCheckUtils]: 38: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,838 INFO L273 TraceCheckUtils]: 39: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,838 INFO L273 TraceCheckUtils]: 40: Hoare triple {11176#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:37:51,838 INFO L273 TraceCheckUtils]: 41: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,838 INFO L273 TraceCheckUtils]: 42: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,838 INFO L273 TraceCheckUtils]: 43: Hoare triple {11176#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:37:51,839 INFO L273 TraceCheckUtils]: 44: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,839 INFO L273 TraceCheckUtils]: 45: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,839 INFO L273 TraceCheckUtils]: 46: Hoare triple {11176#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:37:51,839 INFO L273 TraceCheckUtils]: 47: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,839 INFO L273 TraceCheckUtils]: 48: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,839 INFO L273 TraceCheckUtils]: 49: Hoare triple {11176#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:37:51,839 INFO L273 TraceCheckUtils]: 50: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,839 INFO L273 TraceCheckUtils]: 51: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,840 INFO L273 TraceCheckUtils]: 52: Hoare triple {11176#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:37:51,840 INFO L273 TraceCheckUtils]: 53: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,840 INFO L273 TraceCheckUtils]: 54: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,840 INFO L273 TraceCheckUtils]: 55: Hoare triple {11176#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:37:51,840 INFO L273 TraceCheckUtils]: 56: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,840 INFO L273 TraceCheckUtils]: 57: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,840 INFO L273 TraceCheckUtils]: 58: Hoare triple {11176#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:37:51,840 INFO L273 TraceCheckUtils]: 59: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,841 INFO L273 TraceCheckUtils]: 60: Hoare triple {11176#false} assume !(~j~0 < ~n~0); {11176#false} is VALID [2018-11-23 12:37:51,841 INFO L273 TraceCheckUtils]: 61: Hoare triple {11176#false} ~i~0 := 1 + ~i~0; {11176#false} is VALID [2018-11-23 12:37:51,841 INFO L273 TraceCheckUtils]: 62: Hoare triple {11176#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {11176#false} is VALID [2018-11-23 12:37:51,841 INFO L273 TraceCheckUtils]: 63: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,841 INFO L273 TraceCheckUtils]: 64: Hoare triple {11176#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:37:51,841 INFO L273 TraceCheckUtils]: 65: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,841 INFO L273 TraceCheckUtils]: 66: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,842 INFO L273 TraceCheckUtils]: 67: Hoare triple {11176#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:37:51,842 INFO L273 TraceCheckUtils]: 68: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,842 INFO L273 TraceCheckUtils]: 69: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,842 INFO L273 TraceCheckUtils]: 70: Hoare triple {11176#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:37:51,842 INFO L273 TraceCheckUtils]: 71: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,842 INFO L273 TraceCheckUtils]: 72: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,842 INFO L273 TraceCheckUtils]: 73: Hoare triple {11176#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:37:51,842 INFO L273 TraceCheckUtils]: 74: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,843 INFO L273 TraceCheckUtils]: 75: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,843 INFO L273 TraceCheckUtils]: 76: Hoare triple {11176#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:37:51,843 INFO L273 TraceCheckUtils]: 77: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,843 INFO L273 TraceCheckUtils]: 78: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,843 INFO L273 TraceCheckUtils]: 79: Hoare triple {11176#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:37:51,843 INFO L273 TraceCheckUtils]: 80: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,843 INFO L273 TraceCheckUtils]: 81: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,843 INFO L273 TraceCheckUtils]: 82: Hoare triple {11176#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:37:51,843 INFO L273 TraceCheckUtils]: 83: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,844 INFO L273 TraceCheckUtils]: 84: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,844 INFO L273 TraceCheckUtils]: 85: Hoare triple {11176#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:37:51,844 INFO L273 TraceCheckUtils]: 86: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,844 INFO L273 TraceCheckUtils]: 87: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,844 INFO L273 TraceCheckUtils]: 88: Hoare triple {11176#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:37:51,844 INFO L273 TraceCheckUtils]: 89: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,844 INFO L273 TraceCheckUtils]: 90: Hoare triple {11176#false} assume !(~j~0 < ~n~0); {11176#false} is VALID [2018-11-23 12:37:51,844 INFO L273 TraceCheckUtils]: 91: Hoare triple {11176#false} ~i~0 := 1 + ~i~0; {11176#false} is VALID [2018-11-23 12:37:51,845 INFO L273 TraceCheckUtils]: 92: Hoare triple {11176#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {11176#false} is VALID [2018-11-23 12:37:51,845 INFO L273 TraceCheckUtils]: 93: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,845 INFO L273 TraceCheckUtils]: 94: Hoare triple {11176#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:37:51,845 INFO L273 TraceCheckUtils]: 95: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,845 INFO L273 TraceCheckUtils]: 96: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,845 INFO L273 TraceCheckUtils]: 97: Hoare triple {11176#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:37:51,845 INFO L273 TraceCheckUtils]: 98: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,845 INFO L273 TraceCheckUtils]: 99: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,845 INFO L273 TraceCheckUtils]: 100: Hoare triple {11176#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:37:51,846 INFO L273 TraceCheckUtils]: 101: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,846 INFO L273 TraceCheckUtils]: 102: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,846 INFO L273 TraceCheckUtils]: 103: Hoare triple {11176#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:37:51,846 INFO L273 TraceCheckUtils]: 104: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,846 INFO L273 TraceCheckUtils]: 105: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,846 INFO L273 TraceCheckUtils]: 106: Hoare triple {11176#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:37:51,846 INFO L273 TraceCheckUtils]: 107: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,846 INFO L273 TraceCheckUtils]: 108: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,847 INFO L273 TraceCheckUtils]: 109: Hoare triple {11176#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:37:51,847 INFO L273 TraceCheckUtils]: 110: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,847 INFO L273 TraceCheckUtils]: 111: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,847 INFO L273 TraceCheckUtils]: 112: Hoare triple {11176#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:37:51,847 INFO L273 TraceCheckUtils]: 113: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,847 INFO L273 TraceCheckUtils]: 114: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,847 INFO L273 TraceCheckUtils]: 115: Hoare triple {11176#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:37:51,847 INFO L273 TraceCheckUtils]: 116: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,847 INFO L273 TraceCheckUtils]: 117: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,848 INFO L273 TraceCheckUtils]: 118: Hoare triple {11176#false} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {11176#false} is VALID [2018-11-23 12:37:51,848 INFO L273 TraceCheckUtils]: 119: Hoare triple {11176#false} ~j~0 := 1 + ~j~0; {11176#false} is VALID [2018-11-23 12:37:51,848 INFO L273 TraceCheckUtils]: 120: Hoare triple {11176#false} assume !(~j~0 < ~n~0); {11176#false} is VALID [2018-11-23 12:37:51,848 INFO L273 TraceCheckUtils]: 121: Hoare triple {11176#false} ~i~0 := 1 + ~i~0; {11176#false} is VALID [2018-11-23 12:37:51,848 INFO L273 TraceCheckUtils]: 122: Hoare triple {11176#false} assume !(~i~0 < ~n~0); {11176#false} is VALID [2018-11-23 12:37:51,848 INFO L273 TraceCheckUtils]: 123: Hoare triple {11176#false} ~i~0 := 0;~j~0 := 0; {11176#false} is VALID [2018-11-23 12:37:51,848 INFO L273 TraceCheckUtils]: 124: Hoare triple {11176#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {11176#false} is VALID [2018-11-23 12:37:51,848 INFO L273 TraceCheckUtils]: 125: Hoare triple {11176#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {11176#false} is VALID [2018-11-23 12:37:51,849 INFO L256 TraceCheckUtils]: 126: Hoare triple {11176#false} call __VERIFIER_assert((if #t~mem4 >= ~min~0 then 1 else 0)); {11176#false} is VALID [2018-11-23 12:37:51,849 INFO L273 TraceCheckUtils]: 127: Hoare triple {11176#false} ~cond := #in~cond; {11176#false} is VALID [2018-11-23 12:37:51,849 INFO L273 TraceCheckUtils]: 128: Hoare triple {11176#false} assume 0 == ~cond; {11176#false} is VALID [2018-11-23 12:37:51,849 INFO L273 TraceCheckUtils]: 129: Hoare triple {11176#false} assume !false; {11176#false} is VALID [2018-11-23 12:37:51,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1340 backedges. 103 proven. 45 refuted. 0 times theorem prover too weak. 1192 trivial. 0 not checked. [2018-11-23 12:37:51,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:37:51,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-11-23 12:37:51,880 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 130 [2018-11-23 12:37:51,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:37:51,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:37:51,917 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-23 12:37:51,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:37:51,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:37:51,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:37:51,919 INFO L87 Difference]: Start difference. First operand 160 states and 202 transitions. Second operand 13 states. [2018-11-23 12:37:53,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:53,482 INFO L93 Difference]: Finished difference Result 326 states and 423 transitions. [2018-11-23 12:37:53,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:37:53,482 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 130 [2018-11-23 12:37:53,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:53,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:37:53,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 156 transitions. [2018-11-23 12:37:53,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:37:53,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 156 transitions. [2018-11-23 12:37:53,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 156 transitions. [2018-11-23 12:37:53,680 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:37:53,683 INFO L225 Difference]: With dead ends: 326 [2018-11-23 12:37:53,683 INFO L226 Difference]: Without dead ends: 183 [2018-11-23 12:37:53,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:37:53,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-11-23 12:37:54,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 174. [2018-11-23 12:37:54,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:37:54,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand 174 states. [2018-11-23 12:37:54,059 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand 174 states. [2018-11-23 12:37:54,060 INFO L87 Difference]: Start difference. First operand 183 states. Second operand 174 states. [2018-11-23 12:37:54,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:54,064 INFO L93 Difference]: Finished difference Result 183 states and 233 transitions. [2018-11-23 12:37:54,064 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 233 transitions. [2018-11-23 12:37:54,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:37:54,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:37:54,065 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 183 states. [2018-11-23 12:37:54,065 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 183 states. [2018-11-23 12:37:54,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:54,069 INFO L93 Difference]: Finished difference Result 183 states and 233 transitions. [2018-11-23 12:37:54,070 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 233 transitions. [2018-11-23 12:37:54,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:37:54,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:37:54,071 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:37:54,071 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:37:54,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-23 12:37:54,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 220 transitions. [2018-11-23 12:37:54,074 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 220 transitions. Word has length 130 [2018-11-23 12:37:54,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:54,075 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 220 transitions. [2018-11-23 12:37:54,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:37:54,075 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 220 transitions. [2018-11-23 12:37:54,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-23 12:37:54,076 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:54,076 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 29, 20, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:54,077 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:54,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:54,077 INFO L82 PathProgramCache]: Analyzing trace with hash -135881921, now seen corresponding path program 4 times [2018-11-23 12:37:54,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:54,077 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:54,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:54,078 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:37:54,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:54,084 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:37:54,085 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:37:54,085 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:37:54,100 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:37:54,157 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:37:54,157 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:37:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:37:54,189 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:37:54,675 INFO L256 TraceCheckUtils]: 0: Hoare triple {12690#true} call ULTIMATE.init(); {12690#true} is VALID [2018-11-23 12:37:54,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {12690#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12690#true} is VALID [2018-11-23 12:37:54,676 INFO L273 TraceCheckUtils]: 2: Hoare triple {12690#true} assume true; {12690#true} is VALID [2018-11-23 12:37:54,676 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12690#true} {12690#true} #106#return; {12690#true} is VALID [2018-11-23 12:37:54,676 INFO L256 TraceCheckUtils]: 4: Hoare triple {12690#true} call #t~ret5 := main(); {12690#true} is VALID [2018-11-23 12:37:54,677 INFO L273 TraceCheckUtils]: 5: Hoare triple {12690#true} havoc ~i~0;havoc ~j~0;~m~0 := 1000;~n~0 := 1500;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(4 * ~n~0 * ~n~0);havoc ~min~0;~i~0 := 0;~j~0 := 0; {12690#true} is VALID [2018-11-23 12:37:54,677 INFO L273 TraceCheckUtils]: 6: Hoare triple {12690#true} assume !!(~i~0 < ~m~0);~j~0 := 0; {12690#true} is VALID [2018-11-23 12:37:54,677 INFO L273 TraceCheckUtils]: 7: Hoare triple {12690#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:37:54,677 INFO L273 TraceCheckUtils]: 8: Hoare triple {12690#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:37:54,677 INFO L273 TraceCheckUtils]: 9: Hoare triple {12690#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:37:54,678 INFO L273 TraceCheckUtils]: 10: Hoare triple {12690#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:37:54,678 INFO L273 TraceCheckUtils]: 11: Hoare triple {12690#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:37:54,678 INFO L273 TraceCheckUtils]: 12: Hoare triple {12690#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:37:54,678 INFO L273 TraceCheckUtils]: 13: Hoare triple {12690#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:37:54,678 INFO L273 TraceCheckUtils]: 14: Hoare triple {12690#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:37:54,678 INFO L273 TraceCheckUtils]: 15: Hoare triple {12690#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:37:54,678 INFO L273 TraceCheckUtils]: 16: Hoare triple {12690#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:37:54,679 INFO L273 TraceCheckUtils]: 17: Hoare triple {12690#true} assume !(~j~0 < ~n~0); {12690#true} is VALID [2018-11-23 12:37:54,679 INFO L273 TraceCheckUtils]: 18: Hoare triple {12690#true} ~i~0 := 1 + ~i~0; {12690#true} is VALID [2018-11-23 12:37:54,679 INFO L273 TraceCheckUtils]: 19: Hoare triple {12690#true} assume !!(~i~0 < ~m~0);~j~0 := 0; {12690#true} is VALID [2018-11-23 12:37:54,679 INFO L273 TraceCheckUtils]: 20: Hoare triple {12690#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:37:54,679 INFO L273 TraceCheckUtils]: 21: Hoare triple {12690#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:37:54,679 INFO L273 TraceCheckUtils]: 22: Hoare triple {12690#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:37:54,679 INFO L273 TraceCheckUtils]: 23: Hoare triple {12690#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:37:54,679 INFO L273 TraceCheckUtils]: 24: Hoare triple {12690#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:37:54,679 INFO L273 TraceCheckUtils]: 25: Hoare triple {12690#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:37:54,680 INFO L273 TraceCheckUtils]: 26: Hoare triple {12690#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:37:54,680 INFO L273 TraceCheckUtils]: 27: Hoare triple {12690#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:37:54,680 INFO L273 TraceCheckUtils]: 28: Hoare triple {12690#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:37:54,680 INFO L273 TraceCheckUtils]: 29: Hoare triple {12690#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 * (4 * ~n~0) + 4 * ~j~0, 4);havoc #t~nondet0;~j~0 := 1 + ~j~0; {12690#true} is VALID [2018-11-23 12:37:54,680 INFO L273 TraceCheckUtils]: 30: Hoare triple {12690#true} assume !(~j~0 < ~n~0); {12690#true} is VALID [2018-11-23 12:37:54,680 INFO L273 TraceCheckUtils]: 31: Hoare triple {12690#true} ~i~0 := 1 + ~i~0; {12690#true} is VALID [2018-11-23 12:37:54,680 INFO L273 TraceCheckUtils]: 32: Hoare triple {12690#true} assume !(~i~0 < ~m~0); {12690#true} is VALID [2018-11-23 12:37:54,681 INFO L273 TraceCheckUtils]: 33: Hoare triple {12690#true} ~i~0 := 0;~j~0 := 0;call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset, 4);~min~0 := #t~mem1;havoc #t~mem1; {12794#(<= main_~i~0 0)} is VALID [2018-11-23 12:37:54,681 INFO L273 TraceCheckUtils]: 34: Hoare triple {12794#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 0; {12798#(and (<= 0 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,682 INFO L273 TraceCheckUtils]: 35: Hoare triple {12798#(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 * (4 * ~n~0) + 4 * ~j~0, 4); {12798#(and (<= 0 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,682 INFO L273 TraceCheckUtils]: 36: Hoare triple {12798#(and (<= 0 main_~j~0) (<= main_~i~0 0))} assume !(#t~mem2 < ~min~0);havoc #t~mem2; {12798#(and (<= 0 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,683 INFO L273 TraceCheckUtils]: 37: Hoare triple {12798#(and (<= 0 main_~j~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {12808#(and (<= 1 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,683 INFO L273 TraceCheckUtils]: 38: Hoare triple {12808#(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 * (4 * ~n~0) + 4 * ~j~0, 4); {12808#(and (<= 1 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,684 INFO L273 TraceCheckUtils]: 39: Hoare triple {12808#(and (<= 1 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {12808#(and (<= 1 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,685 INFO L273 TraceCheckUtils]: 40: Hoare triple {12808#(and (<= 1 main_~j~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {12818#(and (<= 2 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,685 INFO L273 TraceCheckUtils]: 41: Hoare triple {12818#(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 * (4 * ~n~0) + 4 * ~j~0, 4); {12818#(and (<= 2 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,686 INFO L273 TraceCheckUtils]: 42: Hoare triple {12818#(and (<= 2 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {12818#(and (<= 2 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,687 INFO L273 TraceCheckUtils]: 43: Hoare triple {12818#(and (<= 2 main_~j~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {12828#(and (<= 3 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,688 INFO L273 TraceCheckUtils]: 44: Hoare triple {12828#(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 * (4 * ~n~0) + 4 * ~j~0, 4); {12828#(and (<= 3 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,688 INFO L273 TraceCheckUtils]: 45: Hoare triple {12828#(and (<= 3 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {12828#(and (<= 3 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,689 INFO L273 TraceCheckUtils]: 46: Hoare triple {12828#(and (<= 3 main_~j~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {12838#(and (<= 4 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,690 INFO L273 TraceCheckUtils]: 47: Hoare triple {12838#(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 * (4 * ~n~0) + 4 * ~j~0, 4); {12838#(and (<= 4 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,691 INFO L273 TraceCheckUtils]: 48: Hoare triple {12838#(and (<= 4 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {12838#(and (<= 4 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,691 INFO L273 TraceCheckUtils]: 49: Hoare triple {12838#(and (<= 4 main_~j~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {12848#(and (<= 5 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,692 INFO L273 TraceCheckUtils]: 50: Hoare triple {12848#(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 * (4 * ~n~0) + 4 * ~j~0, 4); {12848#(and (<= 5 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,693 INFO L273 TraceCheckUtils]: 51: Hoare triple {12848#(and (<= 5 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {12848#(and (<= 5 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,694 INFO L273 TraceCheckUtils]: 52: Hoare triple {12848#(and (<= 5 main_~j~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {12858#(and (<= 6 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,694 INFO L273 TraceCheckUtils]: 53: Hoare triple {12858#(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 * (4 * ~n~0) + 4 * ~j~0, 4); {12858#(and (<= 6 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,695 INFO L273 TraceCheckUtils]: 54: Hoare triple {12858#(and (<= 6 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {12858#(and (<= 6 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,696 INFO L273 TraceCheckUtils]: 55: Hoare triple {12858#(and (<= 6 main_~j~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {12868#(and (<= 7 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,697 INFO L273 TraceCheckUtils]: 56: Hoare triple {12868#(and (<= 7 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 * (4 * ~n~0) + 4 * ~j~0, 4); {12868#(and (<= 7 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,697 INFO L273 TraceCheckUtils]: 57: Hoare triple {12868#(and (<= 7 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {12868#(and (<= 7 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,698 INFO L273 TraceCheckUtils]: 58: Hoare triple {12868#(and (<= 7 main_~j~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {12878#(and (<= 8 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,699 INFO L273 TraceCheckUtils]: 59: Hoare triple {12878#(and (<= 8 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 * (4 * ~n~0) + 4 * ~j~0, 4); {12878#(and (<= 8 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,700 INFO L273 TraceCheckUtils]: 60: Hoare triple {12878#(and (<= 8 main_~j~0) (<= main_~i~0 0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {12878#(and (<= 8 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,701 INFO L273 TraceCheckUtils]: 61: Hoare triple {12878#(and (<= 8 main_~j~0) (<= main_~i~0 0))} ~j~0 := 1 + ~j~0; {12888#(and (<= 9 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-23 12:37:54,701 INFO L273 TraceCheckUtils]: 62: Hoare triple {12888#(and (<= 9 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 * (4 * ~n~0) + 4 * ~j~0, 4); {12892#(and (<= main_~i~0 0) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,702 INFO L273 TraceCheckUtils]: 63: Hoare triple {12892#(and (<= main_~i~0 0) (<= 10 main_~n~0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {12892#(and (<= main_~i~0 0) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,703 INFO L273 TraceCheckUtils]: 64: Hoare triple {12892#(and (<= main_~i~0 0) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {12892#(and (<= main_~i~0 0) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,703 INFO L273 TraceCheckUtils]: 65: Hoare triple {12892#(and (<= main_~i~0 0) (<= 10 main_~n~0))} assume !(~j~0 < ~n~0); {12892#(and (<= main_~i~0 0) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,704 INFO L273 TraceCheckUtils]: 66: Hoare triple {12892#(and (<= main_~i~0 0) (<= 10 main_~n~0))} ~i~0 := 1 + ~i~0; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,705 INFO L273 TraceCheckUtils]: 67: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume !!(~i~0 < ~n~0);~j~0 := 0; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,706 INFO L273 TraceCheckUtils]: 68: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,706 INFO L273 TraceCheckUtils]: 69: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,707 INFO L273 TraceCheckUtils]: 70: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,708 INFO L273 TraceCheckUtils]: 71: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,708 INFO L273 TraceCheckUtils]: 72: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,709 INFO L273 TraceCheckUtils]: 73: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,710 INFO L273 TraceCheckUtils]: 74: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,711 INFO L273 TraceCheckUtils]: 75: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,711 INFO L273 TraceCheckUtils]: 76: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,712 INFO L273 TraceCheckUtils]: 77: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,713 INFO L273 TraceCheckUtils]: 78: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,713 INFO L273 TraceCheckUtils]: 79: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,714 INFO L273 TraceCheckUtils]: 80: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,715 INFO L273 TraceCheckUtils]: 81: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,715 INFO L273 TraceCheckUtils]: 82: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,716 INFO L273 TraceCheckUtils]: 83: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,717 INFO L273 TraceCheckUtils]: 84: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,717 INFO L273 TraceCheckUtils]: 85: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,718 INFO L273 TraceCheckUtils]: 86: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,719 INFO L273 TraceCheckUtils]: 87: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,720 INFO L273 TraceCheckUtils]: 88: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,720 INFO L273 TraceCheckUtils]: 89: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,721 INFO L273 TraceCheckUtils]: 90: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,722 INFO L273 TraceCheckUtils]: 91: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,722 INFO L273 TraceCheckUtils]: 92: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,723 INFO L273 TraceCheckUtils]: 93: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,724 INFO L273 TraceCheckUtils]: 94: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,724 INFO L273 TraceCheckUtils]: 95: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,725 INFO L273 TraceCheckUtils]: 96: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,726 INFO L273 TraceCheckUtils]: 97: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,726 INFO L273 TraceCheckUtils]: 98: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} assume !(~j~0 < ~n~0); {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,727 INFO L273 TraceCheckUtils]: 99: Hoare triple {12905#(and (<= main_~i~0 1) (<= 10 main_~n~0))} ~i~0 := 1 + ~i~0; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,728 INFO L273 TraceCheckUtils]: 100: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume !!(~i~0 < ~n~0);~j~0 := 0; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,729 INFO L273 TraceCheckUtils]: 101: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,729 INFO L273 TraceCheckUtils]: 102: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,730 INFO L273 TraceCheckUtils]: 103: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,731 INFO L273 TraceCheckUtils]: 104: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,731 INFO L273 TraceCheckUtils]: 105: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,732 INFO L273 TraceCheckUtils]: 106: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,733 INFO L273 TraceCheckUtils]: 107: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,733 INFO L273 TraceCheckUtils]: 108: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,734 INFO L273 TraceCheckUtils]: 109: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,735 INFO L273 TraceCheckUtils]: 110: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,736 INFO L273 TraceCheckUtils]: 111: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,736 INFO L273 TraceCheckUtils]: 112: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,737 INFO L273 TraceCheckUtils]: 113: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,738 INFO L273 TraceCheckUtils]: 114: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,738 INFO L273 TraceCheckUtils]: 115: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,739 INFO L273 TraceCheckUtils]: 116: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,740 INFO L273 TraceCheckUtils]: 117: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,740 INFO L273 TraceCheckUtils]: 118: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,741 INFO L273 TraceCheckUtils]: 119: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,742 INFO L273 TraceCheckUtils]: 120: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,742 INFO L273 TraceCheckUtils]: 121: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,743 INFO L273 TraceCheckUtils]: 122: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,744 INFO L273 TraceCheckUtils]: 123: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,745 INFO L273 TraceCheckUtils]: 124: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,745 INFO L273 TraceCheckUtils]: 125: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,746 INFO L273 TraceCheckUtils]: 126: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,747 INFO L273 TraceCheckUtils]: 127: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,747 INFO L273 TraceCheckUtils]: 128: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume !!(~j~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,748 INFO L273 TraceCheckUtils]: 129: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume #t~mem2 < ~min~0;havoc #t~mem2;call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~min~0 := #t~mem3;havoc #t~mem3; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,749 INFO L273 TraceCheckUtils]: 130: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} ~j~0 := 1 + ~j~0; {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,749 INFO L273 TraceCheckUtils]: 131: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} assume !(~j~0 < ~n~0); {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,750 INFO L273 TraceCheckUtils]: 132: Hoare triple {13005#(and (<= main_~i~0 2) (<= 10 main_~n~0))} ~i~0 := 1 + ~i~0; {13105#(and (<= main_~i~0 3) (<= 10 main_~n~0))} is VALID [2018-11-23 12:37:54,751 INFO L273 TraceCheckUtils]: 133: Hoare triple {13105#(and (<= main_~i~0 3) (<= 10 main_~n~0))} assume !(~i~0 < ~n~0); {12691#false} is VALID [2018-11-23 12:37:54,751 INFO L273 TraceCheckUtils]: 134: Hoare triple {12691#false} ~i~0 := 0;~j~0 := 0; {12691#false} is VALID [2018-11-23 12:37:54,751 INFO L273 TraceCheckUtils]: 135: Hoare triple {12691#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {12691#false} is VALID [2018-11-23 12:37:54,752 INFO L273 TraceCheckUtils]: 136: Hoare triple {12691#false} assume !!(~j~0 < ~n~0);call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {12691#false} is VALID [2018-11-23 12:37:54,752 INFO L256 TraceCheckUtils]: 137: Hoare triple {12691#false} call __VERIFIER_assert((if #t~mem4 >= ~min~0 then 1 else 0)); {12691#false} is VALID [2018-11-23 12:37:54,752 INFO L273 TraceCheckUtils]: 138: Hoare triple {12691#false} ~cond := #in~cond; {12691#false} is VALID [2018-11-23 12:37:54,752 INFO L273 TraceCheckUtils]: 139: Hoare triple {12691#false} assume 0 == ~cond; {12691#false} is VALID [2018-11-23 12:37:54,752 INFO L273 TraceCheckUtils]: 140: Hoare triple {12691#false} assume !false; {12691#false} is VALID [2018-11-23 12:37:54,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1642 backedges. 117 proven. 1000 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2018-11-23 12:37:54,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:37:54,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-11-23 12:37:54,794 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 141 [2018-11-23 12:37:54,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:37:54,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 12:37:54,858 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:37:54,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 12:37:54,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 12:37:54,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:37:54,879 INFO L87 Difference]: Start difference. First operand 174 states and 220 transitions. Second operand 17 states. [2018-11-23 12:37:57,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:57,818 INFO L93 Difference]: Finished difference Result 480 states and 616 transitions. [2018-11-23 12:37:57,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 12:37:57,818 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 141 [2018-11-23 12:37:57,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:37:57,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:37:57,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 241 transitions. [2018-11-23 12:37:57,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 12:37:57,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 241 transitions. [2018-11-23 12:37:57,826 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 241 transitions. [2018-11-23 12:37:58,104 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 241 edges. 241 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:37:58,117 INFO L225 Difference]: With dead ends: 480 [2018-11-23 12:37:58,117 INFO L226 Difference]: Without dead ends: 440 [2018-11-23 12:37:58,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=263, Invalid=439, Unknown=0, NotChecked=0, Total=702 [2018-11-23 12:37:58,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-11-23 12:37:58,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 207. [2018-11-23 12:37:58,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:37:58,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 440 states. Second operand 207 states. [2018-11-23 12:37:58,726 INFO L74 IsIncluded]: Start isIncluded. First operand 440 states. Second operand 207 states. [2018-11-23 12:37:58,726 INFO L87 Difference]: Start difference. First operand 440 states. Second operand 207 states. [2018-11-23 12:37:58,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:58,741 INFO L93 Difference]: Finished difference Result 440 states and 565 transitions. [2018-11-23 12:37:58,741 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 565 transitions. [2018-11-23 12:37:58,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:37:58,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:37:58,743 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand 440 states. [2018-11-23 12:37:58,743 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 440 states. [2018-11-23 12:37:58,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:37:58,760 INFO L93 Difference]: Finished difference Result 440 states and 565 transitions. [2018-11-23 12:37:58,760 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 565 transitions. [2018-11-23 12:37:58,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:37:58,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:37:58,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:37:58,762 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:37:58,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-11-23 12:37:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 264 transitions. [2018-11-23 12:37:58,767 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 264 transitions. Word has length 141 [2018-11-23 12:37:58,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:37:58,767 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 264 transitions. [2018-11-23 12:37:58,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 12:37:58,767 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 264 transitions. [2018-11-23 12:37:58,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-23 12:37:58,769 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:37:58,769 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 39, 20, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:37:58,770 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:37:58,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:37:58,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1725028030, now seen corresponding path program 5 times [2018-11-23 12:37:58,770 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:37:58,770 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:37:58,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:58,771 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:37:58,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:37:58,778 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-23 12:37:58,778 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-23 12:37:58,778 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-23 12:37:58,800 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1