java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-multidimensional/init-2-n-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-18e5b2d-m [2018-11-18 23:25:13,012 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 23:25:13,014 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 23:25:13,026 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 23:25:13,027 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 23:25:13,028 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 23:25:13,029 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 23:25:13,031 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 23:25:13,033 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 23:25:13,034 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 23:25:13,035 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 23:25:13,035 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 23:25:13,036 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 23:25:13,037 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 23:25:13,038 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 23:25:13,039 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 23:25:13,040 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 23:25:13,042 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 23:25:13,044 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 23:25:13,046 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 23:25:13,047 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 23:25:13,048 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 23:25:13,051 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 23:25:13,051 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 23:25:13,051 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 23:25:13,052 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 23:25:13,053 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 23:25:13,054 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 23:25:13,055 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 23:25:13,056 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 23:25:13,056 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 23:25:13,057 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 23:25:13,057 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 23:25:13,057 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 23:25:13,059 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 23:25:13,059 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 23:25:13,060 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-18 23:25:13,075 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 23:25:13,076 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 23:25:13,076 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-18 23:25:13,077 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-18 23:25:13,077 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 23:25:13,077 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 23:25:13,078 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 23:25:13,078 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 23:25:13,078 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 23:25:13,078 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 23:25:13,078 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 23:25:13,079 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 23:25:13,079 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-18 23:25:13,079 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-18 23:25:13,079 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-18 23:25:13,079 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 23:25:13,080 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 23:25:13,080 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 23:25:13,080 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-18 23:25:13,080 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 23:25:13,080 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 23:25:13,081 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-18 23:25:13,081 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-18 23:25:13,081 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:25:13,081 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 23:25:13,081 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-18 23:25:13,082 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-18 23:25:13,082 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 23:25:13,082 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-18 23:25:13,082 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-18 23:25:13,082 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-18 23:25:13,125 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 23:25:13,138 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 23:25:13,143 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 23:25:13,144 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 23:25:13,145 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 23:25:13,145 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/init-2-n-u_true-unreach-call.i [2018-11-18 23:25:13,208 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1277b7e46/d706c45ea85e4403b59f798e268d639c/FLAG177fe2173 [2018-11-18 23:25:13,660 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 23:25:13,660 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/init-2-n-u_true-unreach-call.i [2018-11-18 23:25:13,668 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1277b7e46/d706c45ea85e4403b59f798e268d639c/FLAG177fe2173 [2018-11-18 23:25:14,030 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1277b7e46/d706c45ea85e4403b59f798e268d639c [2018-11-18 23:25:14,039 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 23:25:14,040 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-18 23:25:14,041 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 23:25:14,041 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 23:25:14,045 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 23:25:14,047 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:25:14" (1/1) ... [2018-11-18 23:25:14,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f720dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:14, skipping insertion in model container [2018-11-18 23:25:14,050 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:25:14" (1/1) ... [2018-11-18 23:25:14,060 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 23:25:14,084 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 23:25:14,324 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:25:14,329 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 23:25:14,360 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 23:25:14,382 INFO L195 MainTranslator]: Completed translation [2018-11-18 23:25:14,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:14 WrapperNode [2018-11-18 23:25:14,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 23:25:14,384 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 23:25:14,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 23:25:14,385 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 23:25:14,399 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:14" (1/1) ... [2018-11-18 23:25:14,400 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:14" (1/1) ... [2018-11-18 23:25:14,408 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:14" (1/1) ... [2018-11-18 23:25:14,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:14" (1/1) ... [2018-11-18 23:25:14,417 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:14" (1/1) ... [2018-11-18 23:25:14,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:14" (1/1) ... [2018-11-18 23:25:14,427 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:14" (1/1) ... [2018-11-18 23:25:14,433 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 23:25:14,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 23:25:14,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 23:25:14,434 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 23:25:14,438 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:14" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-18 23:25:14,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-18 23:25:14,572 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 23:25:14,572 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-18 23:25:14,572 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-18 23:25:14,572 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-18 23:25:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-18 23:25:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-18 23:25:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-18 23:25:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 23:25:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 23:25:14,573 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 23:25:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 23:25:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-18 23:25:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 23:25:14,574 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-18 23:25:15,142 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 23:25:15,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:25:15 BoogieIcfgContainer [2018-11-18 23:25:15,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 23:25:15,144 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-18 23:25:15,144 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-18 23:25:15,147 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-18 23:25:15,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 11:25:14" (1/3) ... [2018-11-18 23:25:15,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c57c34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:25:15, skipping insertion in model container [2018-11-18 23:25:15,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:25:14" (2/3) ... [2018-11-18 23:25:15,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c57c34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 11:25:15, skipping insertion in model container [2018-11-18 23:25:15,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:25:15" (3/3) ... [2018-11-18 23:25:15,151 INFO L112 eAbstractionObserver]: Analyzing ICFG init-2-n-u_true-unreach-call.i [2018-11-18 23:25:15,159 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-18 23:25:15,166 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-18 23:25:15,182 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-18 23:25:15,214 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 23:25:15,215 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-18 23:25:15,215 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-18 23:25:15,216 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-18 23:25:15,216 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 23:25:15,217 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 23:25:15,217 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-18 23:25:15,217 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 23:25:15,218 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-18 23:25:15,242 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2018-11-18 23:25:15,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-18 23:25:15,251 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:15,252 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:25:15,254 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:15,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:15,260 INFO L82 PathProgramCache]: Analyzing trace with hash 319343225, now seen corresponding path program 1 times [2018-11-18 23:25:15,262 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:15,262 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:15,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:15,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:15,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:15,364 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:15,364 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:15,364 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-18 23:25:15,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:15,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:15,462 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:15,698 INFO L256 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2018-11-18 23:25:15,702 INFO L273 TraceCheckUtils]: 1: Hoare triple {33#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33#true} is VALID [2018-11-18 23:25:15,703 INFO L273 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2018-11-18 23:25:15,703 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #77#return; {33#true} is VALID [2018-11-18 23:25:15,703 INFO L256 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret2 := main(); {33#true} is VALID [2018-11-18 23:25:15,704 INFO L273 TraceCheckUtils]: 5: Hoare triple {33#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 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {33#true} is VALID [2018-11-18 23:25:15,718 INFO L273 TraceCheckUtils]: 6: Hoare triple {33#true} assume !true; {34#false} is VALID [2018-11-18 23:25:15,719 INFO L273 TraceCheckUtils]: 7: Hoare triple {34#false} ~i~0 := 0;~j~0 := 0; {34#false} is VALID [2018-11-18 23:25:15,719 INFO L273 TraceCheckUtils]: 8: Hoare triple {34#false} assume true; {34#false} is VALID [2018-11-18 23:25:15,720 INFO L273 TraceCheckUtils]: 9: Hoare triple {34#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {34#false} is VALID [2018-11-18 23:25:15,720 INFO L273 TraceCheckUtils]: 10: Hoare triple {34#false} assume true; {34#false} is VALID [2018-11-18 23:25:15,720 INFO L273 TraceCheckUtils]: 11: Hoare triple {34#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {34#false} is VALID [2018-11-18 23:25:15,721 INFO L256 TraceCheckUtils]: 12: Hoare triple {34#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {34#false} is VALID [2018-11-18 23:25:15,721 INFO L273 TraceCheckUtils]: 13: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2018-11-18 23:25:15,721 INFO L273 TraceCheckUtils]: 14: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2018-11-18 23:25:15,722 INFO L273 TraceCheckUtils]: 15: Hoare triple {34#false} assume !false; {34#false} is VALID [2018-11-18 23:25:15,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:25:15,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:25:15,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 23:25:15,760 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-18 23:25:15,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:15,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-18 23:25:15,864 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-18 23:25:15,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-18 23:25:15,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 23:25:15,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:25:15,875 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 2 states. [2018-11-18 23:25:16,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:16,021 INFO L93 Difference]: Finished difference Result 54 states and 71 transitions. [2018-11-18 23:25:16,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 23:25:16,021 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-18 23:25:16,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:16,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:25:16,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-18 23:25:16,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-18 23:25:16,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 71 transitions. [2018-11-18 23:25:16,040 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 71 transitions. [2018-11-18 23:25:16,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:16,328 INFO L225 Difference]: With dead ends: 54 [2018-11-18 23:25:16,328 INFO L226 Difference]: Without dead ends: 25 [2018-11-18 23:25:16,332 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 23:25:16,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-18 23:25:16,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-11-18 23:25:16,495 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:16,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2018-11-18 23:25:16,496 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-18 23:25:16,497 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-18 23:25:16,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:16,501 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-18 23:25:16,502 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-18 23:25:16,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:16,503 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:16,503 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2018-11-18 23:25:16,503 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2018-11-18 23:25:16,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:16,508 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2018-11-18 23:25:16,508 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-18 23:25:16,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:16,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:16,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:16,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:16,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-18 23:25:16,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-11-18 23:25:16,516 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 16 [2018-11-18 23:25:16,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:16,516 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-11-18 23:25:16,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-18 23:25:16,517 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-11-18 23:25:16,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-18 23:25:16,518 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:16,518 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:25:16,519 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:16,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:16,519 INFO L82 PathProgramCache]: Analyzing trace with hash -855125148, now seen corresponding path program 1 times [2018-11-18 23:25:16,520 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:16,520 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:16,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:16,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:16,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:16,530 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:16,530 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:16,530 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-18 23:25:16,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:16,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:16,597 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:16,858 INFO L256 TraceCheckUtils]: 0: Hoare triple {237#true} call ULTIMATE.init(); {237#true} is VALID [2018-11-18 23:25:16,858 INFO L273 TraceCheckUtils]: 1: Hoare triple {237#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {237#true} is VALID [2018-11-18 23:25:16,859 INFO L273 TraceCheckUtils]: 2: Hoare triple {237#true} assume true; {237#true} is VALID [2018-11-18 23:25:16,859 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {237#true} {237#true} #77#return; {237#true} is VALID [2018-11-18 23:25:16,859 INFO L256 TraceCheckUtils]: 4: Hoare triple {237#true} call #t~ret2 := main(); {237#true} is VALID [2018-11-18 23:25:16,869 INFO L273 TraceCheckUtils]: 5: Hoare triple {237#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 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {257#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:16,882 INFO L273 TraceCheckUtils]: 6: Hoare triple {257#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {257#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:16,894 INFO L273 TraceCheckUtils]: 7: Hoare triple {257#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {238#false} is VALID [2018-11-18 23:25:16,895 INFO L273 TraceCheckUtils]: 8: Hoare triple {238#false} ~i~0 := 0;~j~0 := 0; {238#false} is VALID [2018-11-18 23:25:16,895 INFO L273 TraceCheckUtils]: 9: Hoare triple {238#false} assume true; {238#false} is VALID [2018-11-18 23:25:16,895 INFO L273 TraceCheckUtils]: 10: Hoare triple {238#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {238#false} is VALID [2018-11-18 23:25:16,896 INFO L273 TraceCheckUtils]: 11: Hoare triple {238#false} assume true; {238#false} is VALID [2018-11-18 23:25:16,896 INFO L273 TraceCheckUtils]: 12: Hoare triple {238#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {238#false} is VALID [2018-11-18 23:25:16,897 INFO L256 TraceCheckUtils]: 13: Hoare triple {238#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {238#false} is VALID [2018-11-18 23:25:16,897 INFO L273 TraceCheckUtils]: 14: Hoare triple {238#false} ~cond := #in~cond; {238#false} is VALID [2018-11-18 23:25:16,898 INFO L273 TraceCheckUtils]: 15: Hoare triple {238#false} assume 0 == ~cond; {238#false} is VALID [2018-11-18 23:25:16,898 INFO L273 TraceCheckUtils]: 16: Hoare triple {238#false} assume !false; {238#false} is VALID [2018-11-18 23:25:16,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:25:16,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:25:16,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 23:25:16,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-18 23:25:16,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:16,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-18 23:25:17,122 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:17,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-18 23:25:17,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 23:25:17,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:25:17,123 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 3 states. [2018-11-18 23:25:17,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:17,488 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-18 23:25:17,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 23:25:17,488 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-18 23:25:17,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:17,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:25:17,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-18 23:25:17,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-18 23:25:17,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 50 transitions. [2018-11-18 23:25:17,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 50 transitions. [2018-11-18 23:25:17,586 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:17,588 INFO L225 Difference]: With dead ends: 44 [2018-11-18 23:25:17,588 INFO L226 Difference]: Without dead ends: 30 [2018-11-18 23:25:17,589 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 23:25:17,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-18 23:25:17,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2018-11-18 23:25:17,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:17,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 27 states. [2018-11-18 23:25:17,628 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 27 states. [2018-11-18 23:25:17,628 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 27 states. [2018-11-18 23:25:17,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:17,631 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-18 23:25:17,632 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-18 23:25:17,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:17,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:17,633 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 30 states. [2018-11-18 23:25:17,633 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 30 states. [2018-11-18 23:25:17,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:17,636 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-18 23:25:17,636 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2018-11-18 23:25:17,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:17,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:17,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:17,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 23:25:17,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-18 23:25:17,640 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2018-11-18 23:25:17,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:17,640 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-18 23:25:17,641 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-18 23:25:17,641 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-18 23:25:17,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-18 23:25:17,642 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:17,642 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:25:17,642 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:17,643 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:17,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1309373471, now seen corresponding path program 1 times [2018-11-18 23:25:17,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:17,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:17,644 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:17,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:17,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:17,652 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:17,652 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:17,652 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-18 23:25:17,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:17,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:17,698 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:17,788 INFO L256 TraceCheckUtils]: 0: Hoare triple {448#true} call ULTIMATE.init(); {448#true} is VALID [2018-11-18 23:25:17,788 INFO L273 TraceCheckUtils]: 1: Hoare triple {448#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {448#true} is VALID [2018-11-18 23:25:17,789 INFO L273 TraceCheckUtils]: 2: Hoare triple {448#true} assume true; {448#true} is VALID [2018-11-18 23:25:17,789 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {448#true} {448#true} #77#return; {448#true} is VALID [2018-11-18 23:25:17,790 INFO L256 TraceCheckUtils]: 4: Hoare triple {448#true} call #t~ret2 := main(); {448#true} is VALID [2018-11-18 23:25:17,792 INFO L273 TraceCheckUtils]: 5: Hoare triple {448#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 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {468#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:17,792 INFO L273 TraceCheckUtils]: 6: Hoare triple {468#(<= 1500 main_~n~0)} assume true; {468#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:17,794 INFO L273 TraceCheckUtils]: 7: Hoare triple {468#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {475#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:25:17,797 INFO L273 TraceCheckUtils]: 8: Hoare triple {475#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {475#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:25:17,800 INFO L273 TraceCheckUtils]: 9: Hoare triple {475#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !(~j~0 < ~n~0); {449#false} is VALID [2018-11-18 23:25:17,800 INFO L273 TraceCheckUtils]: 10: Hoare triple {449#false} ~i~0 := 1 + ~i~0; {449#false} is VALID [2018-11-18 23:25:17,801 INFO L273 TraceCheckUtils]: 11: Hoare triple {449#false} assume true; {449#false} is VALID [2018-11-18 23:25:17,801 INFO L273 TraceCheckUtils]: 12: Hoare triple {449#false} assume !(~i~0 < ~m~0); {449#false} is VALID [2018-11-18 23:25:17,801 INFO L273 TraceCheckUtils]: 13: Hoare triple {449#false} ~i~0 := 0;~j~0 := 0; {449#false} is VALID [2018-11-18 23:25:17,802 INFO L273 TraceCheckUtils]: 14: Hoare triple {449#false} assume true; {449#false} is VALID [2018-11-18 23:25:17,802 INFO L273 TraceCheckUtils]: 15: Hoare triple {449#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {449#false} is VALID [2018-11-18 23:25:17,802 INFO L273 TraceCheckUtils]: 16: Hoare triple {449#false} assume true; {449#false} is VALID [2018-11-18 23:25:17,802 INFO L273 TraceCheckUtils]: 17: Hoare triple {449#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {449#false} is VALID [2018-11-18 23:25:17,803 INFO L256 TraceCheckUtils]: 18: Hoare triple {449#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {449#false} is VALID [2018-11-18 23:25:17,803 INFO L273 TraceCheckUtils]: 19: Hoare triple {449#false} ~cond := #in~cond; {449#false} is VALID [2018-11-18 23:25:17,803 INFO L273 TraceCheckUtils]: 20: Hoare triple {449#false} assume 0 == ~cond; {449#false} is VALID [2018-11-18 23:25:17,804 INFO L273 TraceCheckUtils]: 21: Hoare triple {449#false} assume !false; {449#false} is VALID [2018-11-18 23:25:17,806 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:25:17,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 23:25:17,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 23:25:17,835 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-18 23:25:17,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:17,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:25:17,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:17,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:25:17,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:25:17,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:25:17,875 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 4 states. [2018-11-18 23:25:18,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:18,229 INFO L93 Difference]: Finished difference Result 54 states and 63 transitions. [2018-11-18 23:25:18,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:25:18,230 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-18 23:25:18,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:18,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:25:18,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-18 23:25:18,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:25:18,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 63 transitions. [2018-11-18 23:25:18,239 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 63 transitions. [2018-11-18 23:25:18,340 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:18,342 INFO L225 Difference]: With dead ends: 54 [2018-11-18 23:25:18,342 INFO L226 Difference]: Without dead ends: 35 [2018-11-18 23:25:18,343 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:25:18,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-18 23:25:18,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2018-11-18 23:25:18,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:18,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 31 states. [2018-11-18 23:25:18,388 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 31 states. [2018-11-18 23:25:18,388 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 31 states. [2018-11-18 23:25:18,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:18,392 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-18 23:25:18,392 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-18 23:25:18,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:18,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:18,393 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 35 states. [2018-11-18 23:25:18,393 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 35 states. [2018-11-18 23:25:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:18,397 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-11-18 23:25:18,397 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-18 23:25:18,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:18,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:18,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:18,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:18,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-18 23:25:18,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-11-18 23:25:18,401 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 22 [2018-11-18 23:25:18,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:18,401 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-11-18 23:25:18,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:25:18,401 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-11-18 23:25:18,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-18 23:25:18,402 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:18,403 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:25:18,403 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:18,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:18,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1855282247, now seen corresponding path program 1 times [2018-11-18 23:25:18,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:18,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:18,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:18,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:18,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:18,412 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:18,412 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:18,412 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-18 23:25:18,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:18,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:18,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:18,779 INFO L256 TraceCheckUtils]: 0: Hoare triple {706#true} call ULTIMATE.init(); {706#true} is VALID [2018-11-18 23:25:18,779 INFO L273 TraceCheckUtils]: 1: Hoare triple {706#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {706#true} is VALID [2018-11-18 23:25:18,780 INFO L273 TraceCheckUtils]: 2: Hoare triple {706#true} assume true; {706#true} is VALID [2018-11-18 23:25:18,780 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {706#true} {706#true} #77#return; {706#true} is VALID [2018-11-18 23:25:18,781 INFO L256 TraceCheckUtils]: 4: Hoare triple {706#true} call #t~ret2 := main(); {706#true} is VALID [2018-11-18 23:25:18,782 INFO L273 TraceCheckUtils]: 5: Hoare triple {706#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 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {726#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:18,783 INFO L273 TraceCheckUtils]: 6: Hoare triple {726#(<= 1500 main_~n~0)} assume true; {726#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:18,785 INFO L273 TraceCheckUtils]: 7: Hoare triple {726#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {733#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:25:18,786 INFO L273 TraceCheckUtils]: 8: Hoare triple {733#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {733#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:25:18,788 INFO L273 TraceCheckUtils]: 9: Hoare triple {733#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {740#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:25:18,789 INFO L273 TraceCheckUtils]: 10: Hoare triple {740#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {740#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:25:18,790 INFO L273 TraceCheckUtils]: 11: Hoare triple {740#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !(~j~0 < ~n~0); {707#false} is VALID [2018-11-18 23:25:18,791 INFO L273 TraceCheckUtils]: 12: Hoare triple {707#false} ~i~0 := 1 + ~i~0; {707#false} is VALID [2018-11-18 23:25:18,791 INFO L273 TraceCheckUtils]: 13: Hoare triple {707#false} assume true; {707#false} is VALID [2018-11-18 23:25:18,791 INFO L273 TraceCheckUtils]: 14: Hoare triple {707#false} assume !(~i~0 < ~m~0); {707#false} is VALID [2018-11-18 23:25:18,791 INFO L273 TraceCheckUtils]: 15: Hoare triple {707#false} ~i~0 := 0;~j~0 := 0; {707#false} is VALID [2018-11-18 23:25:18,791 INFO L273 TraceCheckUtils]: 16: Hoare triple {707#false} assume true; {707#false} is VALID [2018-11-18 23:25:18,792 INFO L273 TraceCheckUtils]: 17: Hoare triple {707#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {707#false} is VALID [2018-11-18 23:25:18,792 INFO L273 TraceCheckUtils]: 18: Hoare triple {707#false} assume true; {707#false} is VALID [2018-11-18 23:25:18,792 INFO L273 TraceCheckUtils]: 19: Hoare triple {707#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {707#false} is VALID [2018-11-18 23:25:18,793 INFO L256 TraceCheckUtils]: 20: Hoare triple {707#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {707#false} is VALID [2018-11-18 23:25:18,793 INFO L273 TraceCheckUtils]: 21: Hoare triple {707#false} ~cond := #in~cond; {707#false} is VALID [2018-11-18 23:25:18,793 INFO L273 TraceCheckUtils]: 22: Hoare triple {707#false} assume 0 == ~cond; {707#false} is VALID [2018-11-18 23:25:18,794 INFO L273 TraceCheckUtils]: 23: Hoare triple {707#false} assume !false; {707#false} is VALID [2018-11-18 23:25:18,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:25:18,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:25:18,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-18 23:25:18,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-18 23:25:18,814 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:18,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 23:25:18,842 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:18,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 23:25:18,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 23:25:18,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:25:18,843 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 5 states. [2018-11-18 23:25:19,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:19,070 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-11-18 23:25:19,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:25:19,070 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-11-18 23:25:19,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:19,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:25:19,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2018-11-18 23:25:19,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:25:19,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 70 transitions. [2018-11-18 23:25:19,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 70 transitions. [2018-11-18 23:25:19,174 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:19,177 INFO L225 Difference]: With dead ends: 64 [2018-11-18 23:25:19,177 INFO L226 Difference]: Without dead ends: 41 [2018-11-18 23:25:19,178 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:25:19,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-18 23:25:19,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-11-18 23:25:19,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:19,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 37 states. [2018-11-18 23:25:19,214 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 37 states. [2018-11-18 23:25:19,214 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 37 states. [2018-11-18 23:25:19,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:19,217 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-18 23:25:19,217 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-18 23:25:19,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:19,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:19,219 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 41 states. [2018-11-18 23:25:19,219 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 41 states. [2018-11-18 23:25:19,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:19,222 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2018-11-18 23:25:19,222 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-18 23:25:19,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:19,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:19,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:19,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:19,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-18 23:25:19,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-18 23:25:19,226 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 24 [2018-11-18 23:25:19,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:19,226 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-18 23:25:19,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 23:25:19,227 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-18 23:25:19,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-18 23:25:19,228 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:19,228 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:25:19,228 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:19,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:19,229 INFO L82 PathProgramCache]: Analyzing trace with hash -2042385619, now seen corresponding path program 2 times [2018-11-18 23:25:19,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:19,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:19,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:19,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:19,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:19,238 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:19,238 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:19,239 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-18 23:25:19,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:25:19,282 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:25:19,282 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:25:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:19,294 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:19,447 INFO L256 TraceCheckUtils]: 0: Hoare triple {1007#true} call ULTIMATE.init(); {1007#true} is VALID [2018-11-18 23:25:19,448 INFO L273 TraceCheckUtils]: 1: Hoare triple {1007#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1007#true} is VALID [2018-11-18 23:25:19,448 INFO L273 TraceCheckUtils]: 2: Hoare triple {1007#true} assume true; {1007#true} is VALID [2018-11-18 23:25:19,449 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1007#true} {1007#true} #77#return; {1007#true} is VALID [2018-11-18 23:25:19,449 INFO L256 TraceCheckUtils]: 4: Hoare triple {1007#true} call #t~ret2 := main(); {1007#true} is VALID [2018-11-18 23:25:19,450 INFO L273 TraceCheckUtils]: 5: Hoare triple {1007#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 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {1027#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:19,451 INFO L273 TraceCheckUtils]: 6: Hoare triple {1027#(<= 1500 main_~n~0)} assume true; {1027#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:19,452 INFO L273 TraceCheckUtils]: 7: Hoare triple {1027#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {1034#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:25:19,453 INFO L273 TraceCheckUtils]: 8: Hoare triple {1034#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {1034#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:25:19,456 INFO L273 TraceCheckUtils]: 9: Hoare triple {1034#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1041#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:25:19,457 INFO L273 TraceCheckUtils]: 10: Hoare triple {1041#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {1041#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:25:19,458 INFO L273 TraceCheckUtils]: 11: Hoare triple {1041#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1048#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:25:19,459 INFO L273 TraceCheckUtils]: 12: Hoare triple {1048#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {1048#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:25:19,460 INFO L273 TraceCheckUtils]: 13: Hoare triple {1048#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !(~j~0 < ~n~0); {1008#false} is VALID [2018-11-18 23:25:19,461 INFO L273 TraceCheckUtils]: 14: Hoare triple {1008#false} ~i~0 := 1 + ~i~0; {1008#false} is VALID [2018-11-18 23:25:19,461 INFO L273 TraceCheckUtils]: 15: Hoare triple {1008#false} assume true; {1008#false} is VALID [2018-11-18 23:25:19,462 INFO L273 TraceCheckUtils]: 16: Hoare triple {1008#false} assume !(~i~0 < ~m~0); {1008#false} is VALID [2018-11-18 23:25:19,462 INFO L273 TraceCheckUtils]: 17: Hoare triple {1008#false} ~i~0 := 0;~j~0 := 0; {1008#false} is VALID [2018-11-18 23:25:19,462 INFO L273 TraceCheckUtils]: 18: Hoare triple {1008#false} assume true; {1008#false} is VALID [2018-11-18 23:25:19,463 INFO L273 TraceCheckUtils]: 19: Hoare triple {1008#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {1008#false} is VALID [2018-11-18 23:25:19,463 INFO L273 TraceCheckUtils]: 20: Hoare triple {1008#false} assume true; {1008#false} is VALID [2018-11-18 23:25:19,464 INFO L273 TraceCheckUtils]: 21: Hoare triple {1008#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1008#false} is VALID [2018-11-18 23:25:19,464 INFO L256 TraceCheckUtils]: 22: Hoare triple {1008#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {1008#false} is VALID [2018-11-18 23:25:19,464 INFO L273 TraceCheckUtils]: 23: Hoare triple {1008#false} ~cond := #in~cond; {1008#false} is VALID [2018-11-18 23:25:19,465 INFO L273 TraceCheckUtils]: 24: Hoare triple {1008#false} assume 0 == ~cond; {1008#false} is VALID [2018-11-18 23:25:19,465 INFO L273 TraceCheckUtils]: 25: Hoare triple {1008#false} assume !false; {1008#false} is VALID [2018-11-18 23:25:19,466 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 23:25:19,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:25:19,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-18 23:25:19,487 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-18 23:25:19,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:19,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-18 23:25:19,579 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:19,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-18 23:25:19,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 23:25:19,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-18 23:25:19,580 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 6 states. [2018-11-18 23:25:19,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:19,881 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-11-18 23:25:19,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 23:25:19,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-18 23:25:19,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:19,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:25:19,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2018-11-18 23:25:19,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 23:25:19,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 77 transitions. [2018-11-18 23:25:19,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 77 transitions. [2018-11-18 23:25:19,976 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-18 23:25:19,979 INFO L225 Difference]: With dead ends: 76 [2018-11-18 23:25:19,979 INFO L226 Difference]: Without dead ends: 47 [2018-11-18 23:25:19,980 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 21 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-18 23:25:19,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-18 23:25:20,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2018-11-18 23:25:20,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:20,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 43 states. [2018-11-18 23:25:20,045 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 43 states. [2018-11-18 23:25:20,045 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 43 states. [2018-11-18 23:25:20,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:20,049 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-11-18 23:25:20,049 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-18 23:25:20,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:20,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:20,051 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 47 states. [2018-11-18 23:25:20,051 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 47 states. [2018-11-18 23:25:20,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:20,054 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2018-11-18 23:25:20,054 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2018-11-18 23:25:20,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:20,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:20,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:20,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:20,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-18 23:25:20,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2018-11-18 23:25:20,059 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 26 [2018-11-18 23:25:20,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:20,059 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2018-11-18 23:25:20,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-18 23:25:20,059 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2018-11-18 23:25:20,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-18 23:25:20,060 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:20,061 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:25:20,061 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:20,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:20,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1805244563, now seen corresponding path program 3 times [2018-11-18 23:25:20,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:20,062 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:20,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:20,063 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:25:20,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:20,069 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:20,069 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:20,069 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-18 23:25:20,084 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 23:25:20,102 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-18 23:25:20,102 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:25:20,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:20,117 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:20,219 INFO L256 TraceCheckUtils]: 0: Hoare triple {1354#true} call ULTIMATE.init(); {1354#true} is VALID [2018-11-18 23:25:20,220 INFO L273 TraceCheckUtils]: 1: Hoare triple {1354#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1354#true} is VALID [2018-11-18 23:25:20,220 INFO L273 TraceCheckUtils]: 2: Hoare triple {1354#true} assume true; {1354#true} is VALID [2018-11-18 23:25:20,221 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1354#true} {1354#true} #77#return; {1354#true} is VALID [2018-11-18 23:25:20,221 INFO L256 TraceCheckUtils]: 4: Hoare triple {1354#true} call #t~ret2 := main(); {1354#true} is VALID [2018-11-18 23:25:20,226 INFO L273 TraceCheckUtils]: 5: Hoare triple {1354#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 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:20,228 INFO L273 TraceCheckUtils]: 6: Hoare triple {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:20,228 INFO L273 TraceCheckUtils]: 7: Hoare triple {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0; {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:20,230 INFO L273 TraceCheckUtils]: 8: Hoare triple {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:20,231 INFO L273 TraceCheckUtils]: 9: Hoare triple {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:20,232 INFO L273 TraceCheckUtils]: 10: Hoare triple {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:20,233 INFO L273 TraceCheckUtils]: 11: Hoare triple {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:20,235 INFO L273 TraceCheckUtils]: 12: Hoare triple {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:20,236 INFO L273 TraceCheckUtils]: 13: Hoare triple {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:20,237 INFO L273 TraceCheckUtils]: 14: Hoare triple {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:20,237 INFO L273 TraceCheckUtils]: 15: Hoare triple {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:20,240 INFO L273 TraceCheckUtils]: 16: Hoare triple {1374#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~i~0 := 1 + ~i~0; {1408#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:20,242 INFO L273 TraceCheckUtils]: 17: Hoare triple {1408#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {1408#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:20,245 INFO L273 TraceCheckUtils]: 18: Hoare triple {1408#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {1355#false} is VALID [2018-11-18 23:25:20,245 INFO L273 TraceCheckUtils]: 19: Hoare triple {1355#false} ~i~0 := 0;~j~0 := 0; {1355#false} is VALID [2018-11-18 23:25:20,245 INFO L273 TraceCheckUtils]: 20: Hoare triple {1355#false} assume true; {1355#false} is VALID [2018-11-18 23:25:20,246 INFO L273 TraceCheckUtils]: 21: Hoare triple {1355#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {1355#false} is VALID [2018-11-18 23:25:20,246 INFO L273 TraceCheckUtils]: 22: Hoare triple {1355#false} assume true; {1355#false} is VALID [2018-11-18 23:25:20,246 INFO L273 TraceCheckUtils]: 23: Hoare triple {1355#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1355#false} is VALID [2018-11-18 23:25:20,247 INFO L256 TraceCheckUtils]: 24: Hoare triple {1355#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {1355#false} is VALID [2018-11-18 23:25:20,247 INFO L273 TraceCheckUtils]: 25: Hoare triple {1355#false} ~cond := #in~cond; {1355#false} is VALID [2018-11-18 23:25:20,247 INFO L273 TraceCheckUtils]: 26: Hoare triple {1355#false} assume 0 == ~cond; {1355#false} is VALID [2018-11-18 23:25:20,248 INFO L273 TraceCheckUtils]: 27: Hoare triple {1355#false} assume !false; {1355#false} is VALID [2018-11-18 23:25:20,251 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-11-18 23:25:20,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:25:20,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-18 23:25:20,282 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-18 23:25:20,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:20,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-18 23:25:20,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:20,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-18 23:25:20,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 23:25:20,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:25:20,320 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand 4 states. [2018-11-18 23:25:20,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:20,582 INFO L93 Difference]: Finished difference Result 87 states and 98 transitions. [2018-11-18 23:25:20,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-18 23:25:20,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-18 23:25:20,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:20,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:25:20,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-18 23:25:20,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 23:25:20,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2018-11-18 23:25:20,586 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2018-11-18 23:25:20,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:20,698 INFO L225 Difference]: With dead ends: 87 [2018-11-18 23:25:20,698 INFO L226 Difference]: Without dead ends: 63 [2018-11-18 23:25:20,699 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-18 23:25:20,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-11-18 23:25:20,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2018-11-18 23:25:20,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:20,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 54 states. [2018-11-18 23:25:20,786 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 54 states. [2018-11-18 23:25:20,787 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 54 states. [2018-11-18 23:25:20,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:20,790 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-11-18 23:25:20,790 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-11-18 23:25:20,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:20,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:20,792 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 63 states. [2018-11-18 23:25:20,792 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 63 states. [2018-11-18 23:25:20,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:20,795 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2018-11-18 23:25:20,795 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-11-18 23:25:20,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:20,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:20,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:20,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:20,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-18 23:25:20,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2018-11-18 23:25:20,800 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 28 [2018-11-18 23:25:20,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:20,800 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2018-11-18 23:25:20,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-18 23:25:20,800 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2018-11-18 23:25:20,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-18 23:25:20,801 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:20,802 INFO L375 BasicCegarLoop]: trace histogram [8, 6, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:25:20,802 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:20,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:20,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1067454468, now seen corresponding path program 4 times [2018-11-18 23:25:20,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:20,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:20,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:20,804 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:25:20,804 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:20,811 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:20,811 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:20,811 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-18 23:25:20,852 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 23:25:20,931 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 23:25:20,931 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:25:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:20,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:21,119 INFO L256 TraceCheckUtils]: 0: Hoare triple {1769#true} call ULTIMATE.init(); {1769#true} is VALID [2018-11-18 23:25:21,120 INFO L273 TraceCheckUtils]: 1: Hoare triple {1769#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1769#true} is VALID [2018-11-18 23:25:21,121 INFO L273 TraceCheckUtils]: 2: Hoare triple {1769#true} assume true; {1769#true} is VALID [2018-11-18 23:25:21,121 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1769#true} {1769#true} #77#return; {1769#true} is VALID [2018-11-18 23:25:21,121 INFO L256 TraceCheckUtils]: 4: Hoare triple {1769#true} call #t~ret2 := main(); {1769#true} is VALID [2018-11-18 23:25:21,123 INFO L273 TraceCheckUtils]: 5: Hoare triple {1769#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 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {1789#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:21,123 INFO L273 TraceCheckUtils]: 6: Hoare triple {1789#(<= 1500 main_~n~0)} assume true; {1789#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:21,124 INFO L273 TraceCheckUtils]: 7: Hoare triple {1789#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {1796#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:25:21,124 INFO L273 TraceCheckUtils]: 8: Hoare triple {1796#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {1796#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:25:21,125 INFO L273 TraceCheckUtils]: 9: Hoare triple {1796#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1803#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:25:21,126 INFO L273 TraceCheckUtils]: 10: Hoare triple {1803#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {1803#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:25:21,128 INFO L273 TraceCheckUtils]: 11: Hoare triple {1803#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1810#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:25:21,128 INFO L273 TraceCheckUtils]: 12: Hoare triple {1810#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {1810#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:25:21,130 INFO L273 TraceCheckUtils]: 13: Hoare triple {1810#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1817#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:25:21,131 INFO L273 TraceCheckUtils]: 14: Hoare triple {1817#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume true; {1817#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:25:21,132 INFO L273 TraceCheckUtils]: 15: Hoare triple {1817#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !(~j~0 < ~n~0); {1770#false} is VALID [2018-11-18 23:25:21,132 INFO L273 TraceCheckUtils]: 16: Hoare triple {1770#false} ~i~0 := 1 + ~i~0; {1770#false} is VALID [2018-11-18 23:25:21,133 INFO L273 TraceCheckUtils]: 17: Hoare triple {1770#false} assume true; {1770#false} is VALID [2018-11-18 23:25:21,133 INFO L273 TraceCheckUtils]: 18: Hoare triple {1770#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {1770#false} is VALID [2018-11-18 23:25:21,133 INFO L273 TraceCheckUtils]: 19: Hoare triple {1770#false} assume true; {1770#false} is VALID [2018-11-18 23:25:21,134 INFO L273 TraceCheckUtils]: 20: Hoare triple {1770#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1770#false} is VALID [2018-11-18 23:25:21,134 INFO L273 TraceCheckUtils]: 21: Hoare triple {1770#false} assume true; {1770#false} is VALID [2018-11-18 23:25:21,134 INFO L273 TraceCheckUtils]: 22: Hoare triple {1770#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1770#false} is VALID [2018-11-18 23:25:21,135 INFO L273 TraceCheckUtils]: 23: Hoare triple {1770#false} assume true; {1770#false} is VALID [2018-11-18 23:25:21,135 INFO L273 TraceCheckUtils]: 24: Hoare triple {1770#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {1770#false} is VALID [2018-11-18 23:25:21,135 INFO L273 TraceCheckUtils]: 25: Hoare triple {1770#false} assume true; {1770#false} is VALID [2018-11-18 23:25:21,135 INFO L273 TraceCheckUtils]: 26: Hoare triple {1770#false} assume !(~j~0 < ~n~0); {1770#false} is VALID [2018-11-18 23:25:21,135 INFO L273 TraceCheckUtils]: 27: Hoare triple {1770#false} ~i~0 := 1 + ~i~0; {1770#false} is VALID [2018-11-18 23:25:21,136 INFO L273 TraceCheckUtils]: 28: Hoare triple {1770#false} assume true; {1770#false} is VALID [2018-11-18 23:25:21,136 INFO L273 TraceCheckUtils]: 29: Hoare triple {1770#false} assume !(~i~0 < ~m~0); {1770#false} is VALID [2018-11-18 23:25:21,136 INFO L273 TraceCheckUtils]: 30: Hoare triple {1770#false} ~i~0 := 0;~j~0 := 0; {1770#false} is VALID [2018-11-18 23:25:21,136 INFO L273 TraceCheckUtils]: 31: Hoare triple {1770#false} assume true; {1770#false} is VALID [2018-11-18 23:25:21,136 INFO L273 TraceCheckUtils]: 32: Hoare triple {1770#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {1770#false} is VALID [2018-11-18 23:25:21,137 INFO L273 TraceCheckUtils]: 33: Hoare triple {1770#false} assume true; {1770#false} is VALID [2018-11-18 23:25:21,137 INFO L273 TraceCheckUtils]: 34: Hoare triple {1770#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {1770#false} is VALID [2018-11-18 23:25:21,137 INFO L256 TraceCheckUtils]: 35: Hoare triple {1770#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {1770#false} is VALID [2018-11-18 23:25:21,137 INFO L273 TraceCheckUtils]: 36: Hoare triple {1770#false} ~cond := #in~cond; {1770#false} is VALID [2018-11-18 23:25:21,138 INFO L273 TraceCheckUtils]: 37: Hoare triple {1770#false} assume 0 == ~cond; {1770#false} is VALID [2018-11-18 23:25:21,138 INFO L273 TraceCheckUtils]: 38: Hoare triple {1770#false} assume !false; {1770#false} is VALID [2018-11-18 23:25:21,141 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 12 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-18 23:25:21,160 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:25:21,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-18 23:25:21,161 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-11-18 23:25:21,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:21,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-18 23:25:21,194 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-18 23:25:21,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-18 23:25:21,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-18 23:25:21,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-18 23:25:21,195 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand 7 states. [2018-11-18 23:25:21,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:21,727 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2018-11-18 23:25:21,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 23:25:21,727 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-11-18 23:25:21,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:21,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 23:25:21,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2018-11-18 23:25:21,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 23:25:21,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 84 transitions. [2018-11-18 23:25:21,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 84 transitions. [2018-11-18 23:25:21,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:21,887 INFO L225 Difference]: With dead ends: 104 [2018-11-18 23:25:21,888 INFO L226 Difference]: Without dead ends: 66 [2018-11-18 23:25:21,890 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 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-18 23:25:21,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-18 23:25:22,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2018-11-18 23:25:22,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:22,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 62 states. [2018-11-18 23:25:22,017 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 62 states. [2018-11-18 23:25:22,017 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 62 states. [2018-11-18 23:25:22,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:22,022 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-18 23:25:22,022 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-11-18 23:25:22,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:22,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:22,023 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 66 states. [2018-11-18 23:25:22,023 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 66 states. [2018-11-18 23:25:22,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:22,027 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-18 23:25:22,027 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-11-18 23:25:22,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:22,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:22,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:22,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:22,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-18 23:25:22,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 69 transitions. [2018-11-18 23:25:22,031 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 69 transitions. Word has length 39 [2018-11-18 23:25:22,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:22,031 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 69 transitions. [2018-11-18 23:25:22,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-18 23:25:22,032 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 69 transitions. [2018-11-18 23:25:22,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-18 23:25:22,033 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:22,033 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:25:22,033 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:22,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:22,034 INFO L82 PathProgramCache]: Analyzing trace with hash -948372092, now seen corresponding path program 5 times [2018-11-18 23:25:22,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:22,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:22,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:22,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:25:22,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:22,042 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:22,042 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:22,042 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-18 23:25:22,059 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-18 23:25:22,181 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2018-11-18 23:25:22,181 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:25:22,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:22,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:23,069 INFO L256 TraceCheckUtils]: 0: Hoare triple {2263#true} call ULTIMATE.init(); {2263#true} is VALID [2018-11-18 23:25:23,070 INFO L273 TraceCheckUtils]: 1: Hoare triple {2263#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2263#true} is VALID [2018-11-18 23:25:23,070 INFO L273 TraceCheckUtils]: 2: Hoare triple {2263#true} assume true; {2263#true} is VALID [2018-11-18 23:25:23,071 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2263#true} {2263#true} #77#return; {2263#true} is VALID [2018-11-18 23:25:23,071 INFO L256 TraceCheckUtils]: 4: Hoare triple {2263#true} call #t~ret2 := main(); {2263#true} is VALID [2018-11-18 23:25:23,072 INFO L273 TraceCheckUtils]: 5: Hoare triple {2263#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 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {2283#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:23,072 INFO L273 TraceCheckUtils]: 6: Hoare triple {2283#(<= 1500 main_~n~0)} assume true; {2283#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:23,073 INFO L273 TraceCheckUtils]: 7: Hoare triple {2283#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {2290#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:25:23,074 INFO L273 TraceCheckUtils]: 8: Hoare triple {2290#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {2290#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:25:23,075 INFO L273 TraceCheckUtils]: 9: Hoare triple {2290#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2297#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:25:23,076 INFO L273 TraceCheckUtils]: 10: Hoare triple {2297#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {2297#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:25:23,077 INFO L273 TraceCheckUtils]: 11: Hoare triple {2297#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2304#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:25:23,078 INFO L273 TraceCheckUtils]: 12: Hoare triple {2304#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {2304#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:25:23,079 INFO L273 TraceCheckUtils]: 13: Hoare triple {2304#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2311#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:25:23,080 INFO L273 TraceCheckUtils]: 14: Hoare triple {2311#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume true; {2311#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:25:23,082 INFO L273 TraceCheckUtils]: 15: Hoare triple {2311#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2318#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:25:23,083 INFO L273 TraceCheckUtils]: 16: Hoare triple {2318#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume true; {2318#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:25:23,084 INFO L273 TraceCheckUtils]: 17: Hoare triple {2318#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !(~j~0 < ~n~0); {2264#false} is VALID [2018-11-18 23:25:23,084 INFO L273 TraceCheckUtils]: 18: Hoare triple {2264#false} ~i~0 := 1 + ~i~0; {2264#false} is VALID [2018-11-18 23:25:23,084 INFO L273 TraceCheckUtils]: 19: Hoare triple {2264#false} assume true; {2264#false} is VALID [2018-11-18 23:25:23,085 INFO L273 TraceCheckUtils]: 20: Hoare triple {2264#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2264#false} is VALID [2018-11-18 23:25:23,085 INFO L273 TraceCheckUtils]: 21: Hoare triple {2264#false} assume true; {2264#false} is VALID [2018-11-18 23:25:23,086 INFO L273 TraceCheckUtils]: 22: Hoare triple {2264#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2264#false} is VALID [2018-11-18 23:25:23,086 INFO L273 TraceCheckUtils]: 23: Hoare triple {2264#false} assume true; {2264#false} is VALID [2018-11-18 23:25:23,087 INFO L273 TraceCheckUtils]: 24: Hoare triple {2264#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2264#false} is VALID [2018-11-18 23:25:23,087 INFO L273 TraceCheckUtils]: 25: Hoare triple {2264#false} assume true; {2264#false} is VALID [2018-11-18 23:25:23,087 INFO L273 TraceCheckUtils]: 26: Hoare triple {2264#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2264#false} is VALID [2018-11-18 23:25:23,088 INFO L273 TraceCheckUtils]: 27: Hoare triple {2264#false} assume true; {2264#false} is VALID [2018-11-18 23:25:23,088 INFO L273 TraceCheckUtils]: 28: Hoare triple {2264#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2264#false} is VALID [2018-11-18 23:25:23,088 INFO L273 TraceCheckUtils]: 29: Hoare triple {2264#false} assume true; {2264#false} is VALID [2018-11-18 23:25:23,088 INFO L273 TraceCheckUtils]: 30: Hoare triple {2264#false} assume !(~j~0 < ~n~0); {2264#false} is VALID [2018-11-18 23:25:23,089 INFO L273 TraceCheckUtils]: 31: Hoare triple {2264#false} ~i~0 := 1 + ~i~0; {2264#false} is VALID [2018-11-18 23:25:23,089 INFO L273 TraceCheckUtils]: 32: Hoare triple {2264#false} assume true; {2264#false} is VALID [2018-11-18 23:25:23,089 INFO L273 TraceCheckUtils]: 33: Hoare triple {2264#false} assume !(~i~0 < ~m~0); {2264#false} is VALID [2018-11-18 23:25:23,090 INFO L273 TraceCheckUtils]: 34: Hoare triple {2264#false} ~i~0 := 0;~j~0 := 0; {2264#false} is VALID [2018-11-18 23:25:23,090 INFO L273 TraceCheckUtils]: 35: Hoare triple {2264#false} assume true; {2264#false} is VALID [2018-11-18 23:25:23,090 INFO L273 TraceCheckUtils]: 36: Hoare triple {2264#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2264#false} is VALID [2018-11-18 23:25:23,090 INFO L273 TraceCheckUtils]: 37: Hoare triple {2264#false} assume true; {2264#false} is VALID [2018-11-18 23:25:23,091 INFO L273 TraceCheckUtils]: 38: Hoare triple {2264#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {2264#false} is VALID [2018-11-18 23:25:23,091 INFO L256 TraceCheckUtils]: 39: Hoare triple {2264#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {2264#false} is VALID [2018-11-18 23:25:23,091 INFO L273 TraceCheckUtils]: 40: Hoare triple {2264#false} ~cond := #in~cond; {2264#false} is VALID [2018-11-18 23:25:23,091 INFO L273 TraceCheckUtils]: 41: Hoare triple {2264#false} assume 0 == ~cond; {2264#false} is VALID [2018-11-18 23:25:23,091 INFO L273 TraceCheckUtils]: 42: Hoare triple {2264#false} assume !false; {2264#false} is VALID [2018-11-18 23:25:23,094 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 54 proven. 20 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-11-18 23:25:23,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:25:23,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-11-18 23:25:23,124 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-11-18 23:25:23,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:23,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-18 23:25:23,164 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-18 23:25:23,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-18 23:25:23,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-18 23:25:23,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 23:25:23,165 INFO L87 Difference]: Start difference. First operand 62 states and 69 transitions. Second operand 8 states. [2018-11-18 23:25:23,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:23,748 INFO L93 Difference]: Finished difference Result 118 states and 136 transitions. [2018-11-18 23:25:23,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 23:25:23,749 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-11-18 23:25:23,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:23,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 23:25:23,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2018-11-18 23:25:23,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 23:25:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 91 transitions. [2018-11-18 23:25:23,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 91 transitions. [2018-11-18 23:25:24,059 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:24,061 INFO L225 Difference]: With dead ends: 118 [2018-11-18 23:25:24,062 INFO L226 Difference]: Without dead ends: 74 [2018-11-18 23:25:24,063 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-18 23:25:24,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-18 23:25:24,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2018-11-18 23:25:24,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:24,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 70 states. [2018-11-18 23:25:24,472 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 70 states. [2018-11-18 23:25:24,472 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 70 states. [2018-11-18 23:25:24,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:24,476 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-18 23:25:24,476 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2018-11-18 23:25:24,478 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:24,478 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:24,478 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 74 states. [2018-11-18 23:25:24,478 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 74 states. [2018-11-18 23:25:24,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:24,483 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions. [2018-11-18 23:25:24,483 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions. [2018-11-18 23:25:24,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:24,484 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:24,484 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:24,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-18 23:25:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2018-11-18 23:25:24,487 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 43 [2018-11-18 23:25:24,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:24,487 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2018-11-18 23:25:24,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-18 23:25:24,487 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2018-11-18 23:25:24,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-18 23:25:24,488 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:24,488 INFO L375 BasicCegarLoop]: trace histogram [12, 10, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:25:24,488 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:24,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:24,489 INFO L82 PathProgramCache]: Analyzing trace with hash -254276092, now seen corresponding path program 6 times [2018-11-18 23:25:24,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:24,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:24,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:24,490 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:25:24,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:24,497 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:24,497 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:24,497 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-18 23:25:24,514 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-18 23:25:24,535 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-11-18 23:25:24,536 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:25:24,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:24,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:24,782 INFO L256 TraceCheckUtils]: 0: Hoare triple {2819#true} call ULTIMATE.init(); {2819#true} is VALID [2018-11-18 23:25:24,782 INFO L273 TraceCheckUtils]: 1: Hoare triple {2819#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2819#true} is VALID [2018-11-18 23:25:24,783 INFO L273 TraceCheckUtils]: 2: Hoare triple {2819#true} assume true; {2819#true} is VALID [2018-11-18 23:25:24,783 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2819#true} {2819#true} #77#return; {2819#true} is VALID [2018-11-18 23:25:24,783 INFO L256 TraceCheckUtils]: 4: Hoare triple {2819#true} call #t~ret2 := main(); {2819#true} is VALID [2018-11-18 23:25:24,784 INFO L273 TraceCheckUtils]: 5: Hoare triple {2819#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 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,785 INFO L273 TraceCheckUtils]: 6: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,785 INFO L273 TraceCheckUtils]: 7: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,786 INFO L273 TraceCheckUtils]: 8: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,786 INFO L273 TraceCheckUtils]: 9: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,788 INFO L273 TraceCheckUtils]: 11: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,789 INFO L273 TraceCheckUtils]: 12: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,790 INFO L273 TraceCheckUtils]: 13: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,790 INFO L273 TraceCheckUtils]: 14: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,791 INFO L273 TraceCheckUtils]: 15: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,792 INFO L273 TraceCheckUtils]: 16: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,793 INFO L273 TraceCheckUtils]: 17: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,794 INFO L273 TraceCheckUtils]: 18: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume true; {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,795 INFO L273 TraceCheckUtils]: 19: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,796 INFO L273 TraceCheckUtils]: 20: Hoare triple {2839#(and (<= main_~i~0 0) (<= 1000 main_~m~0))} ~i~0 := 1 + ~i~0; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,796 INFO L273 TraceCheckUtils]: 21: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,797 INFO L273 TraceCheckUtils]: 22: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~i~0 < ~m~0);~j~0 := 0; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,798 INFO L273 TraceCheckUtils]: 23: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,799 INFO L273 TraceCheckUtils]: 24: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,799 INFO L273 TraceCheckUtils]: 25: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,800 INFO L273 TraceCheckUtils]: 26: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,801 INFO L273 TraceCheckUtils]: 27: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,802 INFO L273 TraceCheckUtils]: 28: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,803 INFO L273 TraceCheckUtils]: 29: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,804 INFO L273 TraceCheckUtils]: 30: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,804 INFO L273 TraceCheckUtils]: 31: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,805 INFO L273 TraceCheckUtils]: 32: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,806 INFO L273 TraceCheckUtils]: 33: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume true; {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,807 INFO L273 TraceCheckUtils]: 34: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} assume !(~j~0 < ~n~0); {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,808 INFO L273 TraceCheckUtils]: 35: Hoare triple {2885#(and (<= main_~i~0 1) (<= 1000 main_~m~0))} ~i~0 := 1 + ~i~0; {2931#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,808 INFO L273 TraceCheckUtils]: 36: Hoare triple {2931#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} assume true; {2931#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} is VALID [2018-11-18 23:25:24,810 INFO L273 TraceCheckUtils]: 37: Hoare triple {2931#(and (<= main_~i~0 2) (<= 1000 main_~m~0))} assume !(~i~0 < ~m~0); {2820#false} is VALID [2018-11-18 23:25:24,810 INFO L273 TraceCheckUtils]: 38: Hoare triple {2820#false} ~i~0 := 0;~j~0 := 0; {2820#false} is VALID [2018-11-18 23:25:24,811 INFO L273 TraceCheckUtils]: 39: Hoare triple {2820#false} assume true; {2820#false} is VALID [2018-11-18 23:25:24,811 INFO L273 TraceCheckUtils]: 40: Hoare triple {2820#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {2820#false} is VALID [2018-11-18 23:25:24,811 INFO L273 TraceCheckUtils]: 41: Hoare triple {2820#false} assume true; {2820#false} is VALID [2018-11-18 23:25:24,812 INFO L273 TraceCheckUtils]: 42: Hoare triple {2820#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {2820#false} is VALID [2018-11-18 23:25:24,812 INFO L256 TraceCheckUtils]: 43: Hoare triple {2820#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {2820#false} is VALID [2018-11-18 23:25:24,812 INFO L273 TraceCheckUtils]: 44: Hoare triple {2820#false} ~cond := #in~cond; {2820#false} is VALID [2018-11-18 23:25:24,813 INFO L273 TraceCheckUtils]: 45: Hoare triple {2820#false} assume 0 == ~cond; {2820#false} is VALID [2018-11-18 23:25:24,813 INFO L273 TraceCheckUtils]: 46: Hoare triple {2820#false} assume !false; {2820#false} is VALID [2018-11-18 23:25:24,818 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 0 proven. 79 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2018-11-18 23:25:24,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:25:24,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-18 23:25:24,836 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-18 23:25:24,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:24,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-18 23:25:24,866 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-18 23:25:24,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-18 23:25:24,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 23:25:24,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-18 23:25:24,868 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand 5 states. [2018-11-18 23:25:25,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:25,103 INFO L93 Difference]: Finished difference Result 130 states and 146 transitions. [2018-11-18 23:25:25,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 23:25:25,103 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-11-18 23:25:25,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:25,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:25:25,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2018-11-18 23:25:25,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 23:25:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 62 transitions. [2018-11-18 23:25:25,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 62 transitions. [2018-11-18 23:25:25,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:25,172 INFO L225 Difference]: With dead ends: 130 [2018-11-18 23:25:25,172 INFO L226 Difference]: Without dead ends: 98 [2018-11-18 23:25:25,172 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 43 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-18 23:25:25,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-11-18 23:25:25,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 85. [2018-11-18 23:25:25,272 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:25,272 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 85 states. [2018-11-18 23:25:25,272 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 85 states. [2018-11-18 23:25:25,272 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 85 states. [2018-11-18 23:25:25,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:25,278 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2018-11-18 23:25:25,278 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2018-11-18 23:25:25,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:25,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:25,279 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 98 states. [2018-11-18 23:25:25,279 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 98 states. [2018-11-18 23:25:25,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:25,283 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2018-11-18 23:25:25,283 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2018-11-18 23:25:25,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:25,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:25,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:25,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:25,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-18 23:25:25,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 94 transitions. [2018-11-18 23:25:25,287 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 94 transitions. Word has length 47 [2018-11-18 23:25:25,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:25,287 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 94 transitions. [2018-11-18 23:25:25,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-18 23:25:25,288 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 94 transitions. [2018-11-18 23:25:25,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-18 23:25:25,288 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:25,289 INFO L375 BasicCegarLoop]: trace histogram [18, 15, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:25:25,289 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:25,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:25,289 INFO L82 PathProgramCache]: Analyzing trace with hash -405897153, now seen corresponding path program 7 times [2018-11-18 23:25:25,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:25,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:25,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:25,290 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:25:25,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:25,295 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:25,295 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:25,295 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-18 23:25:25,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:25,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:25,363 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:25,699 INFO L256 TraceCheckUtils]: 0: Hoare triple {3472#true} call ULTIMATE.init(); {3472#true} is VALID [2018-11-18 23:25:25,699 INFO L273 TraceCheckUtils]: 1: Hoare triple {3472#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3472#true} is VALID [2018-11-18 23:25:25,700 INFO L273 TraceCheckUtils]: 2: Hoare triple {3472#true} assume true; {3472#true} is VALID [2018-11-18 23:25:25,700 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3472#true} {3472#true} #77#return; {3472#true} is VALID [2018-11-18 23:25:25,700 INFO L256 TraceCheckUtils]: 4: Hoare triple {3472#true} call #t~ret2 := main(); {3472#true} is VALID [2018-11-18 23:25:25,702 INFO L273 TraceCheckUtils]: 5: Hoare triple {3472#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 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {3492#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:25,702 INFO L273 TraceCheckUtils]: 6: Hoare triple {3492#(<= 1500 main_~n~0)} assume true; {3492#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:25,704 INFO L273 TraceCheckUtils]: 7: Hoare triple {3492#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {3499#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:25:25,704 INFO L273 TraceCheckUtils]: 8: Hoare triple {3499#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {3499#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:25:25,706 INFO L273 TraceCheckUtils]: 9: Hoare triple {3499#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3506#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:25:25,706 INFO L273 TraceCheckUtils]: 10: Hoare triple {3506#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {3506#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:25:25,708 INFO L273 TraceCheckUtils]: 11: Hoare triple {3506#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3513#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:25:25,708 INFO L273 TraceCheckUtils]: 12: Hoare triple {3513#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {3513#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:25:25,710 INFO L273 TraceCheckUtils]: 13: Hoare triple {3513#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3520#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:25:25,710 INFO L273 TraceCheckUtils]: 14: Hoare triple {3520#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume true; {3520#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:25:25,712 INFO L273 TraceCheckUtils]: 15: Hoare triple {3520#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3527#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:25:25,712 INFO L273 TraceCheckUtils]: 16: Hoare triple {3527#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume true; {3527#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:25:25,714 INFO L273 TraceCheckUtils]: 17: Hoare triple {3527#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3534#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-18 23:25:25,717 INFO L273 TraceCheckUtils]: 18: Hoare triple {3534#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume true; {3534#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-18 23:25:25,718 INFO L273 TraceCheckUtils]: 19: Hoare triple {3534#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume !(~j~0 < ~n~0); {3473#false} is VALID [2018-11-18 23:25:25,718 INFO L273 TraceCheckUtils]: 20: Hoare triple {3473#false} ~i~0 := 1 + ~i~0; {3473#false} is VALID [2018-11-18 23:25:25,718 INFO L273 TraceCheckUtils]: 21: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-18 23:25:25,718 INFO L273 TraceCheckUtils]: 22: Hoare triple {3473#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {3473#false} is VALID [2018-11-18 23:25:25,718 INFO L273 TraceCheckUtils]: 23: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-18 23:25:25,719 INFO L273 TraceCheckUtils]: 24: Hoare triple {3473#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3473#false} is VALID [2018-11-18 23:25:25,719 INFO L273 TraceCheckUtils]: 25: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-18 23:25:25,719 INFO L273 TraceCheckUtils]: 26: Hoare triple {3473#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3473#false} is VALID [2018-11-18 23:25:25,719 INFO L273 TraceCheckUtils]: 27: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-18 23:25:25,720 INFO L273 TraceCheckUtils]: 28: Hoare triple {3473#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3473#false} is VALID [2018-11-18 23:25:25,720 INFO L273 TraceCheckUtils]: 29: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-18 23:25:25,720 INFO L273 TraceCheckUtils]: 30: Hoare triple {3473#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3473#false} is VALID [2018-11-18 23:25:25,721 INFO L273 TraceCheckUtils]: 31: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-18 23:25:25,721 INFO L273 TraceCheckUtils]: 32: Hoare triple {3473#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3473#false} is VALID [2018-11-18 23:25:25,721 INFO L273 TraceCheckUtils]: 33: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-18 23:25:25,721 INFO L273 TraceCheckUtils]: 34: Hoare triple {3473#false} assume !(~j~0 < ~n~0); {3473#false} is VALID [2018-11-18 23:25:25,721 INFO L273 TraceCheckUtils]: 35: Hoare triple {3473#false} ~i~0 := 1 + ~i~0; {3473#false} is VALID [2018-11-18 23:25:25,722 INFO L273 TraceCheckUtils]: 36: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-18 23:25:25,722 INFO L273 TraceCheckUtils]: 37: Hoare triple {3473#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {3473#false} is VALID [2018-11-18 23:25:25,722 INFO L273 TraceCheckUtils]: 38: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-18 23:25:25,722 INFO L273 TraceCheckUtils]: 39: Hoare triple {3473#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3473#false} is VALID [2018-11-18 23:25:25,723 INFO L273 TraceCheckUtils]: 40: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-18 23:25:25,723 INFO L273 TraceCheckUtils]: 41: Hoare triple {3473#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3473#false} is VALID [2018-11-18 23:25:25,723 INFO L273 TraceCheckUtils]: 42: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-18 23:25:25,723 INFO L273 TraceCheckUtils]: 43: Hoare triple {3473#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3473#false} is VALID [2018-11-18 23:25:25,723 INFO L273 TraceCheckUtils]: 44: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-18 23:25:25,724 INFO L273 TraceCheckUtils]: 45: Hoare triple {3473#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3473#false} is VALID [2018-11-18 23:25:25,724 INFO L273 TraceCheckUtils]: 46: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-18 23:25:25,724 INFO L273 TraceCheckUtils]: 47: Hoare triple {3473#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {3473#false} is VALID [2018-11-18 23:25:25,724 INFO L273 TraceCheckUtils]: 48: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-18 23:25:25,724 INFO L273 TraceCheckUtils]: 49: Hoare triple {3473#false} assume !(~j~0 < ~n~0); {3473#false} is VALID [2018-11-18 23:25:25,725 INFO L273 TraceCheckUtils]: 50: Hoare triple {3473#false} ~i~0 := 1 + ~i~0; {3473#false} is VALID [2018-11-18 23:25:25,725 INFO L273 TraceCheckUtils]: 51: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-18 23:25:25,725 INFO L273 TraceCheckUtils]: 52: Hoare triple {3473#false} assume !(~i~0 < ~m~0); {3473#false} is VALID [2018-11-18 23:25:25,725 INFO L273 TraceCheckUtils]: 53: Hoare triple {3473#false} ~i~0 := 0;~j~0 := 0; {3473#false} is VALID [2018-11-18 23:25:25,726 INFO L273 TraceCheckUtils]: 54: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-18 23:25:25,726 INFO L273 TraceCheckUtils]: 55: Hoare triple {3473#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {3473#false} is VALID [2018-11-18 23:25:25,726 INFO L273 TraceCheckUtils]: 56: Hoare triple {3473#false} assume true; {3473#false} is VALID [2018-11-18 23:25:25,726 INFO L273 TraceCheckUtils]: 57: Hoare triple {3473#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {3473#false} is VALID [2018-11-18 23:25:25,726 INFO L256 TraceCheckUtils]: 58: Hoare triple {3473#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {3473#false} is VALID [2018-11-18 23:25:25,727 INFO L273 TraceCheckUtils]: 59: Hoare triple {3473#false} ~cond := #in~cond; {3473#false} is VALID [2018-11-18 23:25:25,727 INFO L273 TraceCheckUtils]: 60: Hoare triple {3473#false} assume 0 == ~cond; {3473#false} is VALID [2018-11-18 23:25:25,727 INFO L273 TraceCheckUtils]: 61: Hoare triple {3473#false} assume !false; {3473#false} is VALID [2018-11-18 23:25:25,731 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 150 proven. 30 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2018-11-18 23:25:25,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:25:25,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-18 23:25:25,760 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2018-11-18 23:25:25,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:25,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-18 23:25:25,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:25,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-18 23:25:25,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 23:25:25,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 23:25:25,863 INFO L87 Difference]: Start difference. First operand 85 states and 94 transitions. Second operand 9 states. [2018-11-18 23:25:26,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:26,456 INFO L93 Difference]: Finished difference Result 164 states and 187 transitions. [2018-11-18 23:25:26,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-18 23:25:26,457 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 62 [2018-11-18 23:25:26,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:26,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 23:25:26,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2018-11-18 23:25:26,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 23:25:26,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 98 transitions. [2018-11-18 23:25:26,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 98 transitions. [2018-11-18 23:25:26,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:26,585 INFO L225 Difference]: With dead ends: 164 [2018-11-18 23:25:26,585 INFO L226 Difference]: Without dead ends: 99 [2018-11-18 23:25:26,586 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-18 23:25:26,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-11-18 23:25:26,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 95. [2018-11-18 23:25:26,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:26,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand 95 states. [2018-11-18 23:25:26,749 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand 95 states. [2018-11-18 23:25:26,749 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 95 states. [2018-11-18 23:25:26,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:26,752 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2018-11-18 23:25:26,752 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2018-11-18 23:25:26,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:26,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:26,753 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand 99 states. [2018-11-18 23:25:26,753 INFO L87 Difference]: Start difference. First operand 95 states. Second operand 99 states. [2018-11-18 23:25:26,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:26,756 INFO L93 Difference]: Finished difference Result 99 states and 110 transitions. [2018-11-18 23:25:26,756 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 110 transitions. [2018-11-18 23:25:26,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:26,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:26,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:26,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:26,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-11-18 23:25:26,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 105 transitions. [2018-11-18 23:25:26,760 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 105 transitions. Word has length 62 [2018-11-18 23:25:26,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:26,760 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 105 transitions. [2018-11-18 23:25:26,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-18 23:25:26,760 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2018-11-18 23:25:26,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-11-18 23:25:26,761 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:26,761 INFO L375 BasicCegarLoop]: trace histogram [21, 18, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:25:26,762 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:26,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:26,762 INFO L82 PathProgramCache]: Analyzing trace with hash 128593317, now seen corresponding path program 8 times [2018-11-18 23:25:26,762 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:26,762 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:26,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:26,763 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 23:25:26,763 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:26,769 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:26,770 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:26,770 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-18 23:25:26,778 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 23:25:26,808 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 23:25:26,808 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:25:26,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:26,824 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:27,038 INFO L256 TraceCheckUtils]: 0: Hoare triple {4241#true} call ULTIMATE.init(); {4241#true} is VALID [2018-11-18 23:25:27,038 INFO L273 TraceCheckUtils]: 1: Hoare triple {4241#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4241#true} is VALID [2018-11-18 23:25:27,039 INFO L273 TraceCheckUtils]: 2: Hoare triple {4241#true} assume true; {4241#true} is VALID [2018-11-18 23:25:27,039 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4241#true} {4241#true} #77#return; {4241#true} is VALID [2018-11-18 23:25:27,039 INFO L256 TraceCheckUtils]: 4: Hoare triple {4241#true} call #t~ret2 := main(); {4241#true} is VALID [2018-11-18 23:25:27,040 INFO L273 TraceCheckUtils]: 5: Hoare triple {4241#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 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {4261#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:27,041 INFO L273 TraceCheckUtils]: 6: Hoare triple {4261#(<= 1500 main_~n~0)} assume true; {4261#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:27,041 INFO L273 TraceCheckUtils]: 7: Hoare triple {4261#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {4268#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:25:27,041 INFO L273 TraceCheckUtils]: 8: Hoare triple {4268#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {4268#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:25:27,049 INFO L273 TraceCheckUtils]: 9: Hoare triple {4268#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4275#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:25:27,050 INFO L273 TraceCheckUtils]: 10: Hoare triple {4275#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {4275#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:25:27,051 INFO L273 TraceCheckUtils]: 11: Hoare triple {4275#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4282#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:25:27,051 INFO L273 TraceCheckUtils]: 12: Hoare triple {4282#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {4282#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:25:27,052 INFO L273 TraceCheckUtils]: 13: Hoare triple {4282#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4289#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:25:27,052 INFO L273 TraceCheckUtils]: 14: Hoare triple {4289#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume true; {4289#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:25:27,053 INFO L273 TraceCheckUtils]: 15: Hoare triple {4289#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4296#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:25:27,053 INFO L273 TraceCheckUtils]: 16: Hoare triple {4296#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume true; {4296#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:25:27,054 INFO L273 TraceCheckUtils]: 17: Hoare triple {4296#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4303#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-18 23:25:27,055 INFO L273 TraceCheckUtils]: 18: Hoare triple {4303#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume true; {4303#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-18 23:25:27,056 INFO L273 TraceCheckUtils]: 19: Hoare triple {4303#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4310#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-18 23:25:27,057 INFO L273 TraceCheckUtils]: 20: Hoare triple {4310#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume true; {4310#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-18 23:25:27,060 INFO L273 TraceCheckUtils]: 21: Hoare triple {4310#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume !(~j~0 < ~n~0); {4242#false} is VALID [2018-11-18 23:25:27,060 INFO L273 TraceCheckUtils]: 22: Hoare triple {4242#false} ~i~0 := 1 + ~i~0; {4242#false} is VALID [2018-11-18 23:25:27,060 INFO L273 TraceCheckUtils]: 23: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-18 23:25:27,060 INFO L273 TraceCheckUtils]: 24: Hoare triple {4242#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {4242#false} is VALID [2018-11-18 23:25:27,061 INFO L273 TraceCheckUtils]: 25: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-18 23:25:27,061 INFO L273 TraceCheckUtils]: 26: Hoare triple {4242#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4242#false} is VALID [2018-11-18 23:25:27,061 INFO L273 TraceCheckUtils]: 27: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-18 23:25:27,061 INFO L273 TraceCheckUtils]: 28: Hoare triple {4242#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4242#false} is VALID [2018-11-18 23:25:27,061 INFO L273 TraceCheckUtils]: 29: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-18 23:25:27,062 INFO L273 TraceCheckUtils]: 30: Hoare triple {4242#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4242#false} is VALID [2018-11-18 23:25:27,062 INFO L273 TraceCheckUtils]: 31: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-18 23:25:27,062 INFO L273 TraceCheckUtils]: 32: Hoare triple {4242#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4242#false} is VALID [2018-11-18 23:25:27,062 INFO L273 TraceCheckUtils]: 33: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-18 23:25:27,062 INFO L273 TraceCheckUtils]: 34: Hoare triple {4242#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4242#false} is VALID [2018-11-18 23:25:27,063 INFO L273 TraceCheckUtils]: 35: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-18 23:25:27,063 INFO L273 TraceCheckUtils]: 36: Hoare triple {4242#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4242#false} is VALID [2018-11-18 23:25:27,063 INFO L273 TraceCheckUtils]: 37: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-18 23:25:27,063 INFO L273 TraceCheckUtils]: 38: Hoare triple {4242#false} assume !(~j~0 < ~n~0); {4242#false} is VALID [2018-11-18 23:25:27,063 INFO L273 TraceCheckUtils]: 39: Hoare triple {4242#false} ~i~0 := 1 + ~i~0; {4242#false} is VALID [2018-11-18 23:25:27,064 INFO L273 TraceCheckUtils]: 40: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-18 23:25:27,064 INFO L273 TraceCheckUtils]: 41: Hoare triple {4242#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {4242#false} is VALID [2018-11-18 23:25:27,064 INFO L273 TraceCheckUtils]: 42: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-18 23:25:27,064 INFO L273 TraceCheckUtils]: 43: Hoare triple {4242#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4242#false} is VALID [2018-11-18 23:25:27,064 INFO L273 TraceCheckUtils]: 44: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-18 23:25:27,065 INFO L273 TraceCheckUtils]: 45: Hoare triple {4242#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4242#false} is VALID [2018-11-18 23:25:27,065 INFO L273 TraceCheckUtils]: 46: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-18 23:25:27,065 INFO L273 TraceCheckUtils]: 47: Hoare triple {4242#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4242#false} is VALID [2018-11-18 23:25:27,065 INFO L273 TraceCheckUtils]: 48: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-18 23:25:27,065 INFO L273 TraceCheckUtils]: 49: Hoare triple {4242#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4242#false} is VALID [2018-11-18 23:25:27,066 INFO L273 TraceCheckUtils]: 50: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-18 23:25:27,066 INFO L273 TraceCheckUtils]: 51: Hoare triple {4242#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4242#false} is VALID [2018-11-18 23:25:27,066 INFO L273 TraceCheckUtils]: 52: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-18 23:25:27,066 INFO L273 TraceCheckUtils]: 53: Hoare triple {4242#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {4242#false} is VALID [2018-11-18 23:25:27,066 INFO L273 TraceCheckUtils]: 54: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-18 23:25:27,066 INFO L273 TraceCheckUtils]: 55: Hoare triple {4242#false} assume !(~j~0 < ~n~0); {4242#false} is VALID [2018-11-18 23:25:27,067 INFO L273 TraceCheckUtils]: 56: Hoare triple {4242#false} ~i~0 := 1 + ~i~0; {4242#false} is VALID [2018-11-18 23:25:27,067 INFO L273 TraceCheckUtils]: 57: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-18 23:25:27,067 INFO L273 TraceCheckUtils]: 58: Hoare triple {4242#false} assume !(~i~0 < ~m~0); {4242#false} is VALID [2018-11-18 23:25:27,067 INFO L273 TraceCheckUtils]: 59: Hoare triple {4242#false} ~i~0 := 0;~j~0 := 0; {4242#false} is VALID [2018-11-18 23:25:27,068 INFO L273 TraceCheckUtils]: 60: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-18 23:25:27,068 INFO L273 TraceCheckUtils]: 61: Hoare triple {4242#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {4242#false} is VALID [2018-11-18 23:25:27,068 INFO L273 TraceCheckUtils]: 62: Hoare triple {4242#false} assume true; {4242#false} is VALID [2018-11-18 23:25:27,068 INFO L273 TraceCheckUtils]: 63: Hoare triple {4242#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {4242#false} is VALID [2018-11-18 23:25:27,068 INFO L256 TraceCheckUtils]: 64: Hoare triple {4242#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {4242#false} is VALID [2018-11-18 23:25:27,068 INFO L273 TraceCheckUtils]: 65: Hoare triple {4242#false} ~cond := #in~cond; {4242#false} is VALID [2018-11-18 23:25:27,069 INFO L273 TraceCheckUtils]: 66: Hoare triple {4242#false} assume 0 == ~cond; {4242#false} is VALID [2018-11-18 23:25:27,069 INFO L273 TraceCheckUtils]: 67: Hoare triple {4242#false} assume !false; {4242#false} is VALID [2018-11-18 23:25:27,073 INFO L134 CoverageAnalysis]: Checked inductivity of 435 backedges. 202 proven. 42 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2018-11-18 23:25:27,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:25:27,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-11-18 23:25:27,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2018-11-18 23:25:27,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:27,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-18 23:25:27,137 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:27,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-18 23:25:27,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-18 23:25:27,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 23:25:27,138 INFO L87 Difference]: Start difference. First operand 95 states and 105 transitions. Second operand 10 states. [2018-11-18 23:25:27,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:27,735 INFO L93 Difference]: Finished difference Result 182 states and 207 transitions. [2018-11-18 23:25:27,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-18 23:25:27,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 68 [2018-11-18 23:25:27,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:27,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 23:25:27,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2018-11-18 23:25:27,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-18 23:25:27,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2018-11-18 23:25:27,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 105 transitions. [2018-11-18 23:25:27,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:27,873 INFO L225 Difference]: With dead ends: 182 [2018-11-18 23:25:27,873 INFO L226 Difference]: Without dead ends: 109 [2018-11-18 23:25:27,874 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-18 23:25:27,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-18 23:25:28,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2018-11-18 23:25:28,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:28,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 105 states. [2018-11-18 23:25:28,017 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 105 states. [2018-11-18 23:25:28,018 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 105 states. [2018-11-18 23:25:28,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:28,021 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-11-18 23:25:28,021 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2018-11-18 23:25:28,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:28,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:28,022 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 109 states. [2018-11-18 23:25:28,022 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 109 states. [2018-11-18 23:25:28,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:28,024 INFO L93 Difference]: Finished difference Result 109 states and 121 transitions. [2018-11-18 23:25:28,025 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 121 transitions. [2018-11-18 23:25:28,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:28,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:28,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:28,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:28,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-11-18 23:25:28,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2018-11-18 23:25:28,027 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 68 [2018-11-18 23:25:28,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:28,028 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2018-11-18 23:25:28,028 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-18 23:25:28,028 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2018-11-18 23:25:28,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-18 23:25:28,028 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:28,028 INFO L375 BasicCegarLoop]: trace histogram [24, 21, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:25:28,029 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:28,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:28,029 INFO L82 PathProgramCache]: Analyzing trace with hash -1432848757, now seen corresponding path program 9 times [2018-11-18 23:25:28,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:28,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:28,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:28,030 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:25:28,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:28,035 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:28,035 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:28,035 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-18 23:25:28,047 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-18 23:25:28,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-18 23:25:28,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:25:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:25:28,186 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:25:28,438 INFO L256 TraceCheckUtils]: 0: Hoare triple {5091#true} call ULTIMATE.init(); {5091#true} is VALID [2018-11-18 23:25:28,438 INFO L273 TraceCheckUtils]: 1: Hoare triple {5091#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5091#true} is VALID [2018-11-18 23:25:28,438 INFO L273 TraceCheckUtils]: 2: Hoare triple {5091#true} assume true; {5091#true} is VALID [2018-11-18 23:25:28,439 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5091#true} {5091#true} #77#return; {5091#true} is VALID [2018-11-18 23:25:28,439 INFO L256 TraceCheckUtils]: 4: Hoare triple {5091#true} call #t~ret2 := main(); {5091#true} is VALID [2018-11-18 23:25:28,440 INFO L273 TraceCheckUtils]: 5: Hoare triple {5091#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 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,440 INFO L273 TraceCheckUtils]: 6: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,440 INFO L273 TraceCheckUtils]: 7: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,441 INFO L273 TraceCheckUtils]: 8: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,441 INFO L273 TraceCheckUtils]: 9: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,441 INFO L273 TraceCheckUtils]: 10: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,446 INFO L273 TraceCheckUtils]: 11: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,447 INFO L273 TraceCheckUtils]: 12: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,447 INFO L273 TraceCheckUtils]: 13: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,448 INFO L273 TraceCheckUtils]: 14: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,448 INFO L273 TraceCheckUtils]: 15: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,453 INFO L273 TraceCheckUtils]: 16: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,454 INFO L273 TraceCheckUtils]: 17: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,454 INFO L273 TraceCheckUtils]: 18: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,459 INFO L273 TraceCheckUtils]: 19: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,459 INFO L273 TraceCheckUtils]: 20: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,459 INFO L273 TraceCheckUtils]: 21: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,460 INFO L273 TraceCheckUtils]: 22: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,460 INFO L273 TraceCheckUtils]: 23: Hoare triple {5111#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,460 INFO L273 TraceCheckUtils]: 24: Hoare triple {5111#(<= 1500 main_~n~0)} ~i~0 := 1 + ~i~0; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,461 INFO L273 TraceCheckUtils]: 25: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,461 INFO L273 TraceCheckUtils]: 26: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,461 INFO L273 TraceCheckUtils]: 27: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,462 INFO L273 TraceCheckUtils]: 28: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,462 INFO L273 TraceCheckUtils]: 29: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,463 INFO L273 TraceCheckUtils]: 30: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,463 INFO L273 TraceCheckUtils]: 31: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,464 INFO L273 TraceCheckUtils]: 32: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,465 INFO L273 TraceCheckUtils]: 33: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,465 INFO L273 TraceCheckUtils]: 34: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,466 INFO L273 TraceCheckUtils]: 35: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,466 INFO L273 TraceCheckUtils]: 36: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,467 INFO L273 TraceCheckUtils]: 37: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,467 INFO L273 TraceCheckUtils]: 38: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,468 INFO L273 TraceCheckUtils]: 39: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,468 INFO L273 TraceCheckUtils]: 40: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,469 INFO L273 TraceCheckUtils]: 41: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,470 INFO L273 TraceCheckUtils]: 42: Hoare triple {5111#(<= 1500 main_~n~0)} assume !(~j~0 < ~n~0); {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,470 INFO L273 TraceCheckUtils]: 43: Hoare triple {5111#(<= 1500 main_~n~0)} ~i~0 := 1 + ~i~0; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,471 INFO L273 TraceCheckUtils]: 44: Hoare triple {5111#(<= 1500 main_~n~0)} assume true; {5111#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:25:28,473 INFO L273 TraceCheckUtils]: 45: Hoare triple {5111#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {5232#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:25:28,473 INFO L273 TraceCheckUtils]: 46: Hoare triple {5232#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {5232#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:25:28,475 INFO L273 TraceCheckUtils]: 47: Hoare triple {5232#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5239#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:25:28,475 INFO L273 TraceCheckUtils]: 48: Hoare triple {5239#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {5239#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:25:28,476 INFO L273 TraceCheckUtils]: 49: Hoare triple {5239#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5246#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:25:28,477 INFO L273 TraceCheckUtils]: 50: Hoare triple {5246#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {5246#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:25:28,478 INFO L273 TraceCheckUtils]: 51: Hoare triple {5246#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5253#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:25:28,479 INFO L273 TraceCheckUtils]: 52: Hoare triple {5253#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume true; {5253#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:25:28,480 INFO L273 TraceCheckUtils]: 53: Hoare triple {5253#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5260#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:25:28,481 INFO L273 TraceCheckUtils]: 54: Hoare triple {5260#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume true; {5260#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:25:28,482 INFO L273 TraceCheckUtils]: 55: Hoare triple {5260#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5267#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-18 23:25:28,483 INFO L273 TraceCheckUtils]: 56: Hoare triple {5267#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume true; {5267#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-18 23:25:28,484 INFO L273 TraceCheckUtils]: 57: Hoare triple {5267#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5274#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-18 23:25:28,484 INFO L273 TraceCheckUtils]: 58: Hoare triple {5274#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume true; {5274#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-18 23:25:28,486 INFO L273 TraceCheckUtils]: 59: Hoare triple {5274#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {5281#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} is VALID [2018-11-18 23:25:28,486 INFO L273 TraceCheckUtils]: 60: Hoare triple {5281#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} assume true; {5281#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} is VALID [2018-11-18 23:25:28,487 INFO L273 TraceCheckUtils]: 61: Hoare triple {5281#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} assume !(~j~0 < ~n~0); {5092#false} is VALID [2018-11-18 23:25:28,487 INFO L273 TraceCheckUtils]: 62: Hoare triple {5092#false} ~i~0 := 1 + ~i~0; {5092#false} is VALID [2018-11-18 23:25:28,487 INFO L273 TraceCheckUtils]: 63: Hoare triple {5092#false} assume true; {5092#false} is VALID [2018-11-18 23:25:28,488 INFO L273 TraceCheckUtils]: 64: Hoare triple {5092#false} assume !(~i~0 < ~m~0); {5092#false} is VALID [2018-11-18 23:25:28,488 INFO L273 TraceCheckUtils]: 65: Hoare triple {5092#false} ~i~0 := 0;~j~0 := 0; {5092#false} is VALID [2018-11-18 23:25:28,488 INFO L273 TraceCheckUtils]: 66: Hoare triple {5092#false} assume true; {5092#false} is VALID [2018-11-18 23:25:28,489 INFO L273 TraceCheckUtils]: 67: Hoare triple {5092#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {5092#false} is VALID [2018-11-18 23:25:28,489 INFO L273 TraceCheckUtils]: 68: Hoare triple {5092#false} assume true; {5092#false} is VALID [2018-11-18 23:25:28,489 INFO L273 TraceCheckUtils]: 69: Hoare triple {5092#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {5092#false} is VALID [2018-11-18 23:25:28,490 INFO L256 TraceCheckUtils]: 70: Hoare triple {5092#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {5092#false} is VALID [2018-11-18 23:25:28,490 INFO L273 TraceCheckUtils]: 71: Hoare triple {5092#false} ~cond := #in~cond; {5092#false} is VALID [2018-11-18 23:25:28,490 INFO L273 TraceCheckUtils]: 72: Hoare triple {5092#false} assume 0 == ~cond; {5092#false} is VALID [2018-11-18 23:25:28,491 INFO L273 TraceCheckUtils]: 73: Hoare triple {5092#false} assume !false; {5092#false} is VALID [2018-11-18 23:25:28,496 INFO L134 CoverageAnalysis]: Checked inductivity of 567 backedges. 264 proven. 56 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2018-11-18 23:25:28,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:25:28,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-11-18 23:25:28,516 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-11-18 23:25:28,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:25:28,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-18 23:25:28,554 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:25:28,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-18 23:25:28,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 23:25:28,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 23:25:28,556 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand 11 states. [2018-11-18 23:25:29,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:29,151 INFO L93 Difference]: Finished difference Result 200 states and 227 transitions. [2018-11-18 23:25:29,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-18 23:25:29,152 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-11-18 23:25:29,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:25:29,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 23:25:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2018-11-18 23:25:29,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 23:25:29,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 112 transitions. [2018-11-18 23:25:29,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 112 transitions. [2018-11-18 23:25:30,049 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-18 23:25:30,053 INFO L225 Difference]: With dead ends: 200 [2018-11-18 23:25:30,053 INFO L226 Difference]: Without dead ends: 119 [2018-11-18 23:25:30,054 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-18 23:25:30,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-11-18 23:25:30,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2018-11-18 23:25:30,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:25:30,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand 115 states. [2018-11-18 23:25:30,567 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand 115 states. [2018-11-18 23:25:30,567 INFO L87 Difference]: Start difference. First operand 119 states. Second operand 115 states. [2018-11-18 23:25:30,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:30,571 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2018-11-18 23:25:30,572 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2018-11-18 23:25:30,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:30,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:30,573 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand 119 states. [2018-11-18 23:25:30,573 INFO L87 Difference]: Start difference. First operand 115 states. Second operand 119 states. [2018-11-18 23:25:30,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:25:30,576 INFO L93 Difference]: Finished difference Result 119 states and 132 transitions. [2018-11-18 23:25:30,576 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 132 transitions. [2018-11-18 23:25:30,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:25:30,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:25:30,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:25:30,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:25:30,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-11-18 23:25:30,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 127 transitions. [2018-11-18 23:25:30,581 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 127 transitions. Word has length 74 [2018-11-18 23:25:30,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:25:30,581 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 127 transitions. [2018-11-18 23:25:30,581 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-18 23:25:30,582 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 127 transitions. [2018-11-18 23:25:30,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-18 23:25:30,583 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:25:30,583 INFO L375 BasicCegarLoop]: trace histogram [27, 24, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:25:30,583 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:25:30,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:25:30,583 INFO L82 PathProgramCache]: Analyzing trace with hash -138396943, now seen corresponding path program 10 times [2018-11-18 23:25:30,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:25:30,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:25:30,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:30,585 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:25:30,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:25:30,590 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:25:30,591 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:25:30,591 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-18 23:25:30,630 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-18 23:28:39,917 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-18 23:28:39,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 23:28:39,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 23:28:39,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 23:28:40,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {6022#true} call ULTIMATE.init(); {6022#true} is VALID [2018-11-18 23:28:40,386 INFO L273 TraceCheckUtils]: 1: Hoare triple {6022#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6022#true} is VALID [2018-11-18 23:28:40,386 INFO L273 TraceCheckUtils]: 2: Hoare triple {6022#true} assume true; {6022#true} is VALID [2018-11-18 23:28:40,386 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6022#true} {6022#true} #77#return; {6022#true} is VALID [2018-11-18 23:28:40,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {6022#true} call #t~ret2 := main(); {6022#true} is VALID [2018-11-18 23:28:40,387 INFO L273 TraceCheckUtils]: 5: Hoare triple {6022#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 * ~m~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~C~0 := #t~nondet0;havoc #t~nondet0;~i~0 := 0;~j~0 := 0; {6042#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:28:40,388 INFO L273 TraceCheckUtils]: 6: Hoare triple {6042#(<= 1500 main_~n~0)} assume true; {6042#(<= 1500 main_~n~0)} is VALID [2018-11-18 23:28:40,388 INFO L273 TraceCheckUtils]: 7: Hoare triple {6042#(<= 1500 main_~n~0)} assume !!(~i~0 < ~m~0);~j~0 := 0; {6049#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:28:40,389 INFO L273 TraceCheckUtils]: 8: Hoare triple {6049#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume true; {6049#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-18 23:28:40,389 INFO L273 TraceCheckUtils]: 9: Hoare triple {6049#(and (<= 1500 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6056#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:28:40,390 INFO L273 TraceCheckUtils]: 10: Hoare triple {6056#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume true; {6056#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} is VALID [2018-11-18 23:28:40,390 INFO L273 TraceCheckUtils]: 11: Hoare triple {6056#(and (<= 1500 main_~n~0) (<= main_~j~0 1))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6063#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:28:40,391 INFO L273 TraceCheckUtils]: 12: Hoare triple {6063#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume true; {6063#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-18 23:28:40,392 INFO L273 TraceCheckUtils]: 13: Hoare triple {6063#(and (<= 1500 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6070#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:28:40,393 INFO L273 TraceCheckUtils]: 14: Hoare triple {6070#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume true; {6070#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} is VALID [2018-11-18 23:28:40,394 INFO L273 TraceCheckUtils]: 15: Hoare triple {6070#(and (<= 1500 main_~n~0) (<= main_~j~0 3))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6077#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:28:40,395 INFO L273 TraceCheckUtils]: 16: Hoare triple {6077#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume true; {6077#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} is VALID [2018-11-18 23:28:40,396 INFO L273 TraceCheckUtils]: 17: Hoare triple {6077#(and (<= 1500 main_~n~0) (<= main_~j~0 4))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6084#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-18 23:28:40,397 INFO L273 TraceCheckUtils]: 18: Hoare triple {6084#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume true; {6084#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} is VALID [2018-11-18 23:28:40,398 INFO L273 TraceCheckUtils]: 19: Hoare triple {6084#(and (<= main_~j~0 5) (<= 1500 main_~n~0))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6091#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-18 23:28:40,398 INFO L273 TraceCheckUtils]: 20: Hoare triple {6091#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume true; {6091#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} is VALID [2018-11-18 23:28:40,400 INFO L273 TraceCheckUtils]: 21: Hoare triple {6091#(and (<= 1500 main_~n~0) (<= main_~j~0 6))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6098#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} is VALID [2018-11-18 23:28:40,400 INFO L273 TraceCheckUtils]: 22: Hoare triple {6098#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} assume true; {6098#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} is VALID [2018-11-18 23:28:40,401 INFO L273 TraceCheckUtils]: 23: Hoare triple {6098#(and (<= 1500 main_~n~0) (<= main_~j~0 7))} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6105#(and (<= 1500 main_~n~0) (<= main_~j~0 8))} is VALID [2018-11-18 23:28:40,402 INFO L273 TraceCheckUtils]: 24: Hoare triple {6105#(and (<= 1500 main_~n~0) (<= main_~j~0 8))} assume true; {6105#(and (<= 1500 main_~n~0) (<= main_~j~0 8))} is VALID [2018-11-18 23:28:40,403 INFO L273 TraceCheckUtils]: 25: Hoare triple {6105#(and (<= 1500 main_~n~0) (<= main_~j~0 8))} assume !(~j~0 < ~n~0); {6023#false} is VALID [2018-11-18 23:28:40,403 INFO L273 TraceCheckUtils]: 26: Hoare triple {6023#false} ~i~0 := 1 + ~i~0; {6023#false} is VALID [2018-11-18 23:28:40,403 INFO L273 TraceCheckUtils]: 27: Hoare triple {6023#false} assume true; {6023#false} is VALID [2018-11-18 23:28:40,404 INFO L273 TraceCheckUtils]: 28: Hoare triple {6023#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {6023#false} is VALID [2018-11-18 23:28:40,404 INFO L273 TraceCheckUtils]: 29: Hoare triple {6023#false} assume true; {6023#false} is VALID [2018-11-18 23:28:40,404 INFO L273 TraceCheckUtils]: 30: Hoare triple {6023#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6023#false} is VALID [2018-11-18 23:28:40,404 INFO L273 TraceCheckUtils]: 31: Hoare triple {6023#false} assume true; {6023#false} is VALID [2018-11-18 23:28:40,405 INFO L273 TraceCheckUtils]: 32: Hoare triple {6023#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6023#false} is VALID [2018-11-18 23:28:40,405 INFO L273 TraceCheckUtils]: 33: Hoare triple {6023#false} assume true; {6023#false} is VALID [2018-11-18 23:28:40,405 INFO L273 TraceCheckUtils]: 34: Hoare triple {6023#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6023#false} is VALID [2018-11-18 23:28:40,405 INFO L273 TraceCheckUtils]: 35: Hoare triple {6023#false} assume true; {6023#false} is VALID [2018-11-18 23:28:40,406 INFO L273 TraceCheckUtils]: 36: Hoare triple {6023#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6023#false} is VALID [2018-11-18 23:28:40,406 INFO L273 TraceCheckUtils]: 37: Hoare triple {6023#false} assume true; {6023#false} is VALID [2018-11-18 23:28:40,406 INFO L273 TraceCheckUtils]: 38: Hoare triple {6023#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6023#false} is VALID [2018-11-18 23:28:40,406 INFO L273 TraceCheckUtils]: 39: Hoare triple {6023#false} assume true; {6023#false} is VALID [2018-11-18 23:28:40,406 INFO L273 TraceCheckUtils]: 40: Hoare triple {6023#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6023#false} is VALID [2018-11-18 23:28:40,407 INFO L273 TraceCheckUtils]: 41: Hoare triple {6023#false} assume true; {6023#false} is VALID [2018-11-18 23:28:40,407 INFO L273 TraceCheckUtils]: 42: Hoare triple {6023#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6023#false} is VALID [2018-11-18 23:28:40,407 INFO L273 TraceCheckUtils]: 43: Hoare triple {6023#false} assume true; {6023#false} is VALID [2018-11-18 23:28:40,407 INFO L273 TraceCheckUtils]: 44: Hoare triple {6023#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6023#false} is VALID [2018-11-18 23:28:40,407 INFO L273 TraceCheckUtils]: 45: Hoare triple {6023#false} assume true; {6023#false} is VALID [2018-11-18 23:28:40,408 INFO L273 TraceCheckUtils]: 46: Hoare triple {6023#false} assume !(~j~0 < ~n~0); {6023#false} is VALID [2018-11-18 23:28:40,408 INFO L273 TraceCheckUtils]: 47: Hoare triple {6023#false} ~i~0 := 1 + ~i~0; {6023#false} is VALID [2018-11-18 23:28:40,408 INFO L273 TraceCheckUtils]: 48: Hoare triple {6023#false} assume true; {6023#false} is VALID [2018-11-18 23:28:40,408 INFO L273 TraceCheckUtils]: 49: Hoare triple {6023#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {6023#false} is VALID [2018-11-18 23:28:40,408 INFO L273 TraceCheckUtils]: 50: Hoare triple {6023#false} assume true; {6023#false} is VALID [2018-11-18 23:28:40,409 INFO L273 TraceCheckUtils]: 51: Hoare triple {6023#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6023#false} is VALID [2018-11-18 23:28:40,409 INFO L273 TraceCheckUtils]: 52: Hoare triple {6023#false} assume true; {6023#false} is VALID [2018-11-18 23:28:40,409 INFO L273 TraceCheckUtils]: 53: Hoare triple {6023#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6023#false} is VALID [2018-11-18 23:28:40,409 INFO L273 TraceCheckUtils]: 54: Hoare triple {6023#false} assume true; {6023#false} is VALID [2018-11-18 23:28:40,409 INFO L273 TraceCheckUtils]: 55: Hoare triple {6023#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6023#false} is VALID [2018-11-18 23:28:40,410 INFO L273 TraceCheckUtils]: 56: Hoare triple {6023#false} assume true; {6023#false} is VALID [2018-11-18 23:28:40,410 INFO L273 TraceCheckUtils]: 57: Hoare triple {6023#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6023#false} is VALID [2018-11-18 23:28:40,410 INFO L273 TraceCheckUtils]: 58: Hoare triple {6023#false} assume true; {6023#false} is VALID [2018-11-18 23:28:40,410 INFO L273 TraceCheckUtils]: 59: Hoare triple {6023#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6023#false} is VALID [2018-11-18 23:28:40,410 INFO L273 TraceCheckUtils]: 60: Hoare triple {6023#false} assume true; {6023#false} is VALID [2018-11-18 23:28:40,411 INFO L273 TraceCheckUtils]: 61: Hoare triple {6023#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6023#false} is VALID [2018-11-18 23:28:40,411 INFO L273 TraceCheckUtils]: 62: Hoare triple {6023#false} assume true; {6023#false} is VALID [2018-11-18 23:28:40,411 INFO L273 TraceCheckUtils]: 63: Hoare triple {6023#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6023#false} is VALID [2018-11-18 23:28:40,411 INFO L273 TraceCheckUtils]: 64: Hoare triple {6023#false} assume true; {6023#false} is VALID [2018-11-18 23:28:40,411 INFO L273 TraceCheckUtils]: 65: Hoare triple {6023#false} assume !!(~j~0 < ~n~0);call write~int(~C~0, ~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4);~j~0 := 1 + ~j~0; {6023#false} is VALID [2018-11-18 23:28:40,412 INFO L273 TraceCheckUtils]: 66: Hoare triple {6023#false} assume true; {6023#false} is VALID [2018-11-18 23:28:40,412 INFO L273 TraceCheckUtils]: 67: Hoare triple {6023#false} assume !(~j~0 < ~n~0); {6023#false} is VALID [2018-11-18 23:28:40,412 INFO L273 TraceCheckUtils]: 68: Hoare triple {6023#false} ~i~0 := 1 + ~i~0; {6023#false} is VALID [2018-11-18 23:28:40,412 INFO L273 TraceCheckUtils]: 69: Hoare triple {6023#false} assume true; {6023#false} is VALID [2018-11-18 23:28:40,412 INFO L273 TraceCheckUtils]: 70: Hoare triple {6023#false} assume !(~i~0 < ~m~0); {6023#false} is VALID [2018-11-18 23:28:40,412 INFO L273 TraceCheckUtils]: 71: Hoare triple {6023#false} ~i~0 := 0;~j~0 := 0; {6023#false} is VALID [2018-11-18 23:28:40,413 INFO L273 TraceCheckUtils]: 72: Hoare triple {6023#false} assume true; {6023#false} is VALID [2018-11-18 23:28:40,413 INFO L273 TraceCheckUtils]: 73: Hoare triple {6023#false} assume !!(~i~0 < ~m~0);~j~0 := 0; {6023#false} is VALID [2018-11-18 23:28:40,413 INFO L273 TraceCheckUtils]: 74: Hoare triple {6023#false} assume true; {6023#false} is VALID [2018-11-18 23:28:40,413 INFO L273 TraceCheckUtils]: 75: Hoare triple {6023#false} assume !!(~j~0 < ~n~0);call #t~mem1 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (4 * ~n~0) + 4 * ~j~0, 4); {6023#false} is VALID [2018-11-18 23:28:40,413 INFO L256 TraceCheckUtils]: 76: Hoare triple {6023#false} call __VERIFIER_assert((if #t~mem1 == ~C~0 then 1 else 0)); {6023#false} is VALID [2018-11-18 23:28:40,413 INFO L273 TraceCheckUtils]: 77: Hoare triple {6023#false} ~cond := #in~cond; {6023#false} is VALID [2018-11-18 23:28:40,413 INFO L273 TraceCheckUtils]: 78: Hoare triple {6023#false} assume 0 == ~cond; {6023#false} is VALID [2018-11-18 23:28:40,414 INFO L273 TraceCheckUtils]: 79: Hoare triple {6023#false} assume !false; {6023#false} is VALID [2018-11-18 23:28:40,418 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 330 proven. 72 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2018-11-18 23:28:40,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-18 23:28:40,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-11-18 23:28:40,443 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 80 [2018-11-18 23:28:40,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-18 23:28:40,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-18 23:28:40,488 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:28:40,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-18 23:28:40,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 23:28:40,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-18 23:28:40,489 INFO L87 Difference]: Start difference. First operand 115 states and 127 transitions. Second operand 12 states. [2018-11-18 23:28:41,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:28:41,282 INFO L93 Difference]: Finished difference Result 218 states and 247 transitions. [2018-11-18 23:28:41,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-18 23:28:41,282 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 80 [2018-11-18 23:28:41,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-18 23:28:41,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 23:28:41,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 119 transitions. [2018-11-18 23:28:41,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 23:28:41,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 119 transitions. [2018-11-18 23:28:41,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 119 transitions. [2018-11-18 23:28:41,790 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-18 23:28:41,793 INFO L225 Difference]: With dead ends: 218 [2018-11-18 23:28:41,793 INFO L226 Difference]: Without dead ends: 129 [2018-11-18 23:28:41,794 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 69 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-18 23:28:41,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-18 23:28:42,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2018-11-18 23:28:42,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-18 23:28:42,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand 125 states. [2018-11-18 23:28:42,042 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 125 states. [2018-11-18 23:28:42,042 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 125 states. [2018-11-18 23:28:42,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:28:42,047 INFO L93 Difference]: Finished difference Result 129 states and 143 transitions. [2018-11-18 23:28:42,047 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 143 transitions. [2018-11-18 23:28:42,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:28:42,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:28:42,048 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 129 states. [2018-11-18 23:28:42,048 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 129 states. [2018-11-18 23:28:42,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 23:28:42,051 INFO L93 Difference]: Finished difference Result 129 states and 143 transitions. [2018-11-18 23:28:42,051 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 143 transitions. [2018-11-18 23:28:42,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-18 23:28:42,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-18 23:28:42,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-18 23:28:42,052 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-18 23:28:42,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-11-18 23:28:42,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 138 transitions. [2018-11-18 23:28:42,055 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 138 transitions. Word has length 80 [2018-11-18 23:28:42,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-18 23:28:42,055 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 138 transitions. [2018-11-18 23:28:42,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-18 23:28:42,056 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 138 transitions. [2018-11-18 23:28:42,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-11-18 23:28:42,057 INFO L367 BasicCegarLoop]: Found error trace [2018-11-18 23:28:42,057 INFO L375 BasicCegarLoop]: trace histogram [30, 27, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 23:28:42,057 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-18 23:28:42,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 23:28:42,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1216371415, now seen corresponding path program 11 times [2018-11-18 23:28:42,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 23:28:42,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 23:28:42,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:28:42,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 23:28:42,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 23:28:42,063 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-18 23:28:42,064 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-18 23:28:42,064 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-18 23:28:42,081 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1