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/rev-3-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:12:55,211 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:12:55,213 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:12:55,230 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:12:55,231 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:12:55,232 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:12:55,233 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:12:55,235 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:12:55,239 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:12:55,240 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:12:55,242 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:12:55,243 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:12:55,244 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:12:55,246 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:12:55,253 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:12:55,254 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:12:55,257 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:12:55,261 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:12:55,263 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:12:55,267 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:12:55,270 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:12:55,271 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:12:55,275 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:12:55,275 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:12:55,276 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:12:55,276 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:12:55,277 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:12:55,278 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:12:55,281 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:12:55,282 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:12:55,282 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:12:55,283 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:12:55,283 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:12:55,283 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:12:55,285 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:12:55,286 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:12:55,286 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-14 17:12:55,302 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:12:55,303 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:12:55,304 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:12:55,304 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:12:55,304 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:12:55,305 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:12:55,305 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:12:55,306 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:12:55,306 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:12:55,306 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:12:55,306 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:12:55,306 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:12:55,306 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:12:55,307 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:12:55,307 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:12:55,307 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:12:55,308 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:12:55,308 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:12:55,308 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:12:55,308 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:12:55,308 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:12:55,309 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:12:55,309 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:12:55,309 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:12:55,309 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:12:55,310 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:12:55,311 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:12:55,311 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:12:55,311 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:12:55,311 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:12:55,387 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:12:55,402 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:12:55,406 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:12:55,408 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:12:55,408 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:12:55,409 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/rev-3-u_true-unreach-call.i [2018-11-14 17:12:55,469 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c16792923/83d160f81052479398727f19b6310436/FLAG42735cee6 [2018-11-14 17:12:55,914 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:12:55,915 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/rev-3-u_true-unreach-call.i [2018-11-14 17:12:55,922 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c16792923/83d160f81052479398727f19b6310436/FLAG42735cee6 [2018-11-14 17:12:55,937 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c16792923/83d160f81052479398727f19b6310436 [2018-11-14 17:12:55,947 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:12:55,949 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:12:55,950 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:12:55,950 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:12:55,954 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:12:55,955 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:12:55" (1/1) ... [2018-11-14 17:12:55,958 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37adae32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:12:55, skipping insertion in model container [2018-11-14 17:12:55,958 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:12:55" (1/1) ... [2018-11-14 17:12:55,968 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:12:55,996 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:12:56,219 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:12:56,227 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:12:56,259 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:12:56,283 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:12:56,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:12:56 WrapperNode [2018-11-14 17:12:56,283 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:12:56,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:12:56,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:12:56,284 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:12:56,296 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:12:56" (1/1) ... [2018-11-14 17:12:56,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:12:56" (1/1) ... [2018-11-14 17:12:56,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:12:56" (1/1) ... [2018-11-14 17:12:56,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:12:56" (1/1) ... [2018-11-14 17:12:56,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:12:56" (1/1) ... [2018-11-14 17:12:56,327 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:12:56" (1/1) ... [2018-11-14 17:12:56,329 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:12:56" (1/1) ... [2018-11-14 17:12:56,331 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:12:56,332 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:12:56,332 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:12:56,332 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:12:56,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:12:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:12:56,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:12:56,456 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:12:56,457 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:12:56,457 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:12:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:12:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:12:56,457 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:12:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:12:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:12:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:12:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:12:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:12:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:12:56,458 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:12:56,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:12:57,268 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:12:57,269 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:12:57 BoogieIcfgContainer [2018-11-14 17:12:57,269 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:12:57,270 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:12:57,270 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:12:57,273 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:12:57,274 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:12:55" (1/3) ... [2018-11-14 17:12:57,274 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540c598c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:12:57, skipping insertion in model container [2018-11-14 17:12:57,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:12:56" (2/3) ... [2018-11-14 17:12:57,275 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@540c598c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:12:57, skipping insertion in model container [2018-11-14 17:12:57,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:12:57" (3/3) ... [2018-11-14 17:12:57,277 INFO L112 eAbstractionObserver]: Analyzing ICFG rev-3-u_true-unreach-call.i [2018-11-14 17:12:57,287 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:12:57,295 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:12:57,312 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:12:57,342 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:12:57,343 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:12:57,343 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:12:57,344 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:12:57,344 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:12:57,344 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:12:57,344 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:12:57,345 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:12:57,345 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:12:57,363 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-11-14 17:12:57,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 17:12:57,370 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:12:57,371 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:12:57,373 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:12:57,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:12:57,380 INFO L82 PathProgramCache]: Analyzing trace with hash 1945566331, now seen corresponding path program 1 times [2018-11-14 17:12:57,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:12:57,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:12:57,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:12:57,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:12:57,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:12:57,465 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:12:57,466 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:12:57,466 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:12:57,478 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:12:57,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:12:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:12:57,539 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:12:57,717 INFO L256 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {48#true} is VALID [2018-11-14 17:12:57,720 INFO L273 TraceCheckUtils]: 1: Hoare triple {48#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {48#true} is VALID [2018-11-14 17:12:57,720 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#true} assume true; {48#true} is VALID [2018-11-14 17:12:57,721 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {48#true} {48#true} #147#return; {48#true} is VALID [2018-11-14 17:12:57,721 INFO L256 TraceCheckUtils]: 4: Hoare triple {48#true} call #t~ret4 := main(); {48#true} is VALID [2018-11-14 17:12:57,721 INFO L273 TraceCheckUtils]: 5: Hoare triple {48#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {48#true} is VALID [2018-11-14 17:12:57,722 INFO L273 TraceCheckUtils]: 6: Hoare triple {48#true} assume !true; {49#false} is VALID [2018-11-14 17:12:57,723 INFO L273 TraceCheckUtils]: 7: Hoare triple {49#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {49#false} is VALID [2018-11-14 17:12:57,723 INFO L273 TraceCheckUtils]: 8: Hoare triple {49#false} assume !true; {49#false} is VALID [2018-11-14 17:12:57,723 INFO L273 TraceCheckUtils]: 9: Hoare triple {49#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {49#false} is VALID [2018-11-14 17:12:57,723 INFO L273 TraceCheckUtils]: 10: Hoare triple {49#false} assume true; {49#false} is VALID [2018-11-14 17:12:57,724 INFO L273 TraceCheckUtils]: 11: Hoare triple {49#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {49#false} is VALID [2018-11-14 17:12:57,724 INFO L273 TraceCheckUtils]: 12: Hoare triple {49#false} assume true; {49#false} is VALID [2018-11-14 17:12:57,724 INFO L273 TraceCheckUtils]: 13: Hoare triple {49#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {49#false} is VALID [2018-11-14 17:12:57,725 INFO L273 TraceCheckUtils]: 14: Hoare triple {49#false} assume true; {49#false} is VALID [2018-11-14 17:12:57,725 INFO L273 TraceCheckUtils]: 15: Hoare triple {49#false} assume !!(~k~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (~n~0 * 4 * ~n~0) + (~n~0 - ~j~0 - 1) * (~n~0 * 4) + (~n~0 - ~k~0 - 1) * 4, 4); {49#false} is VALID [2018-11-14 17:12:57,725 INFO L256 TraceCheckUtils]: 16: Hoare triple {49#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {49#false} is VALID [2018-11-14 17:12:57,726 INFO L273 TraceCheckUtils]: 17: Hoare triple {49#false} ~cond := #in~cond; {49#false} is VALID [2018-11-14 17:12:57,726 INFO L273 TraceCheckUtils]: 18: Hoare triple {49#false} assume ~cond == 0; {49#false} is VALID [2018-11-14 17:12:57,726 INFO L273 TraceCheckUtils]: 19: Hoare triple {49#false} assume !false; {49#false} is VALID [2018-11-14 17:12:57,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:12:57,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:12:57,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:12:57,766 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-14 17:12:57,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:12:57,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:12:57,851 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:12:57,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:12:57,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:12:57,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:12:57,862 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-11-14 17:12:58,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:12:58,084 INFO L93 Difference]: Finished difference Result 84 states and 121 transitions. [2018-11-14 17:12:58,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:12:58,085 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 20 [2018-11-14 17:12:58,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:12:58,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:12:58,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 121 transitions. [2018-11-14 17:12:58,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:12:58,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 121 transitions. [2018-11-14 17:12:58,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 121 transitions. [2018-11-14 17:12:58,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:12:58,809 INFO L225 Difference]: With dead ends: 84 [2018-11-14 17:12:58,810 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 17:12:58,813 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:12:58,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 17:12:59,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-14 17:12:59,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:12:59,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-14 17:12:59,017 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 17:12:59,018 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 17:12:59,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:12:59,023 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-14 17:12:59,023 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-14 17:12:59,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:12:59,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:12:59,025 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-14 17:12:59,025 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-14 17:12:59,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:12:59,030 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-14 17:12:59,030 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-14 17:12:59,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:12:59,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:12:59,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:12:59,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:12:59,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-14 17:12:59,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-14 17:12:59,037 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 20 [2018-11-14 17:12:59,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:12:59,038 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-14 17:12:59,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:12:59,038 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-14 17:12:59,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 17:12:59,039 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:12:59,040 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:12:59,040 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:12:59,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:12:59,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1304843137, now seen corresponding path program 1 times [2018-11-14 17:12:59,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:12:59,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:12:59,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:12:59,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:12:59,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:12:59,051 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:12:59,051 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:12:59,051 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:12:59,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:12:59,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:12:59,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:12:59,125 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:12:59,335 INFO L256 TraceCheckUtils]: 0: Hoare triple {354#true} call ULTIMATE.init(); {354#true} is VALID [2018-11-14 17:12:59,335 INFO L273 TraceCheckUtils]: 1: Hoare triple {354#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {354#true} is VALID [2018-11-14 17:12:59,335 INFO L273 TraceCheckUtils]: 2: Hoare triple {354#true} assume true; {354#true} is VALID [2018-11-14 17:12:59,336 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {354#true} {354#true} #147#return; {354#true} is VALID [2018-11-14 17:12:59,336 INFO L256 TraceCheckUtils]: 4: Hoare triple {354#true} call #t~ret4 := main(); {354#true} is VALID [2018-11-14 17:12:59,353 INFO L273 TraceCheckUtils]: 5: Hoare triple {354#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {374#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:12:59,359 INFO L273 TraceCheckUtils]: 6: Hoare triple {374#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume true; {374#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:12:59,360 INFO L273 TraceCheckUtils]: 7: Hoare triple {374#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !(~i~0 < ~n~0); {355#false} is VALID [2018-11-14 17:12:59,360 INFO L273 TraceCheckUtils]: 8: Hoare triple {355#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {355#false} is VALID [2018-11-14 17:12:59,360 INFO L273 TraceCheckUtils]: 9: Hoare triple {355#false} assume true; {355#false} is VALID [2018-11-14 17:12:59,360 INFO L273 TraceCheckUtils]: 10: Hoare triple {355#false} assume !(~i~0 < ~n~0); {355#false} is VALID [2018-11-14 17:12:59,361 INFO L273 TraceCheckUtils]: 11: Hoare triple {355#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {355#false} is VALID [2018-11-14 17:12:59,361 INFO L273 TraceCheckUtils]: 12: Hoare triple {355#false} assume true; {355#false} is VALID [2018-11-14 17:12:59,361 INFO L273 TraceCheckUtils]: 13: Hoare triple {355#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {355#false} is VALID [2018-11-14 17:12:59,361 INFO L273 TraceCheckUtils]: 14: Hoare triple {355#false} assume true; {355#false} is VALID [2018-11-14 17:12:59,362 INFO L273 TraceCheckUtils]: 15: Hoare triple {355#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {355#false} is VALID [2018-11-14 17:12:59,362 INFO L273 TraceCheckUtils]: 16: Hoare triple {355#false} assume true; {355#false} is VALID [2018-11-14 17:12:59,362 INFO L273 TraceCheckUtils]: 17: Hoare triple {355#false} assume !!(~k~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (~n~0 * 4 * ~n~0) + (~n~0 - ~j~0 - 1) * (~n~0 * 4) + (~n~0 - ~k~0 - 1) * 4, 4); {355#false} is VALID [2018-11-14 17:12:59,363 INFO L256 TraceCheckUtils]: 18: Hoare triple {355#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {355#false} is VALID [2018-11-14 17:12:59,363 INFO L273 TraceCheckUtils]: 19: Hoare triple {355#false} ~cond := #in~cond; {355#false} is VALID [2018-11-14 17:12:59,363 INFO L273 TraceCheckUtils]: 20: Hoare triple {355#false} assume ~cond == 0; {355#false} is VALID [2018-11-14 17:12:59,364 INFO L273 TraceCheckUtils]: 21: Hoare triple {355#false} assume !false; {355#false} is VALID [2018-11-14 17:12:59,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:12:59,395 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:12:59,395 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:12:59,397 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 17:12:59,397 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:12:59,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:12:59,481 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-14 17:12:59,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:12:59,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:12:59,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:12:59,483 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 3 states. [2018-11-14 17:12:59,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:12:59,960 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2018-11-14 17:12:59,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:12:59,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2018-11-14 17:12:59,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:12:59,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:12:59,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-14 17:12:59,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:12:59,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-14 17:12:59,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2018-11-14 17:13:00,168 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:00,171 INFO L225 Difference]: With dead ends: 74 [2018-11-14 17:13:00,171 INFO L226 Difference]: Without dead ends: 48 [2018-11-14 17:13:00,172 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:13:00,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-14 17:13:00,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 42. [2018-11-14 17:13:00,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:13:00,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 42 states. [2018-11-14 17:13:00,189 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 42 states. [2018-11-14 17:13:00,189 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 42 states. [2018-11-14 17:13:00,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:00,193 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-11-14 17:13:00,194 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-14 17:13:00,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:00,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:00,195 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 48 states. [2018-11-14 17:13:00,195 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 48 states. [2018-11-14 17:13:00,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:00,198 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2018-11-14 17:13:00,199 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-14 17:13:00,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:00,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:00,200 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:13:00,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:13:00,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-14 17:13:00,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 50 transitions. [2018-11-14 17:13:00,203 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 50 transitions. Word has length 22 [2018-11-14 17:13:00,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:13:00,203 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 50 transitions. [2018-11-14 17:13:00,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:13:00,204 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-14 17:13:00,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 17:13:00,205 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:13:00,205 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:13:00,205 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:13:00,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:13:00,206 INFO L82 PathProgramCache]: Analyzing trace with hash -272598018, now seen corresponding path program 1 times [2018-11-14 17:13:00,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:13:00,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:13:00,207 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:00,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:13:00,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:00,214 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:13:00,215 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:13:00,215 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:13:00,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:13:00,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:00,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:00,276 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:13:00,424 INFO L256 TraceCheckUtils]: 0: Hoare triple {676#true} call ULTIMATE.init(); {676#true} is VALID [2018-11-14 17:13:00,425 INFO L273 TraceCheckUtils]: 1: Hoare triple {676#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {676#true} is VALID [2018-11-14 17:13:00,425 INFO L273 TraceCheckUtils]: 2: Hoare triple {676#true} assume true; {676#true} is VALID [2018-11-14 17:13:00,425 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {676#true} {676#true} #147#return; {676#true} is VALID [2018-11-14 17:13:00,425 INFO L256 TraceCheckUtils]: 4: Hoare triple {676#true} call #t~ret4 := main(); {676#true} is VALID [2018-11-14 17:13:00,426 INFO L273 TraceCheckUtils]: 5: Hoare triple {676#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {696#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:00,427 INFO L273 TraceCheckUtils]: 6: Hoare triple {696#(<= 1000 main_~n~0)} assume true; {696#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:00,427 INFO L273 TraceCheckUtils]: 7: Hoare triple {696#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {703#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:13:00,428 INFO L273 TraceCheckUtils]: 8: Hoare triple {703#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} assume true; {703#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:13:00,432 INFO L273 TraceCheckUtils]: 9: Hoare triple {703#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} assume !(~j~0 < ~n~0); {677#false} is VALID [2018-11-14 17:13:00,433 INFO L273 TraceCheckUtils]: 10: Hoare triple {677#false} ~i~0 := ~i~0 + 1; {677#false} is VALID [2018-11-14 17:13:00,433 INFO L273 TraceCheckUtils]: 11: Hoare triple {677#false} assume true; {677#false} is VALID [2018-11-14 17:13:00,434 INFO L273 TraceCheckUtils]: 12: Hoare triple {677#false} assume !(~i~0 < ~n~0); {677#false} is VALID [2018-11-14 17:13:00,434 INFO L273 TraceCheckUtils]: 13: Hoare triple {677#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {677#false} is VALID [2018-11-14 17:13:00,434 INFO L273 TraceCheckUtils]: 14: Hoare triple {677#false} assume true; {677#false} is VALID [2018-11-14 17:13:00,434 INFO L273 TraceCheckUtils]: 15: Hoare triple {677#false} assume !(~i~0 < ~n~0); {677#false} is VALID [2018-11-14 17:13:00,435 INFO L273 TraceCheckUtils]: 16: Hoare triple {677#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {677#false} is VALID [2018-11-14 17:13:00,435 INFO L273 TraceCheckUtils]: 17: Hoare triple {677#false} assume true; {677#false} is VALID [2018-11-14 17:13:00,435 INFO L273 TraceCheckUtils]: 18: Hoare triple {677#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {677#false} is VALID [2018-11-14 17:13:00,436 INFO L273 TraceCheckUtils]: 19: Hoare triple {677#false} assume true; {677#false} is VALID [2018-11-14 17:13:00,436 INFO L273 TraceCheckUtils]: 20: Hoare triple {677#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {677#false} is VALID [2018-11-14 17:13:00,436 INFO L273 TraceCheckUtils]: 21: Hoare triple {677#false} assume true; {677#false} is VALID [2018-11-14 17:13:00,436 INFO L273 TraceCheckUtils]: 22: Hoare triple {677#false} assume !!(~k~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (~n~0 * 4 * ~n~0) + (~n~0 - ~j~0 - 1) * (~n~0 * 4) + (~n~0 - ~k~0 - 1) * 4, 4); {677#false} is VALID [2018-11-14 17:13:00,437 INFO L256 TraceCheckUtils]: 23: Hoare triple {677#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {677#false} is VALID [2018-11-14 17:13:00,437 INFO L273 TraceCheckUtils]: 24: Hoare triple {677#false} ~cond := #in~cond; {677#false} is VALID [2018-11-14 17:13:00,437 INFO L273 TraceCheckUtils]: 25: Hoare triple {677#false} assume ~cond == 0; {677#false} is VALID [2018-11-14 17:13:00,438 INFO L273 TraceCheckUtils]: 26: Hoare triple {677#false} assume !false; {677#false} is VALID [2018-11-14 17:13:00,440 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:13:00,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:13:00,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:13:00,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-14 17:13:00,462 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:13:00,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:13:00,492 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:00,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:13:00,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:13:00,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:13:00,497 INFO L87 Difference]: Start difference. First operand 42 states and 50 transitions. Second operand 4 states. [2018-11-14 17:13:00,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:00,851 INFO L93 Difference]: Finished difference Result 98 states and 122 transitions. [2018-11-14 17:13:00,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:13:00,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-11-14 17:13:00,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:13:00,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:13:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2018-11-14 17:13:00,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:13:00,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 122 transitions. [2018-11-14 17:13:00,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 122 transitions. [2018-11-14 17:13:01,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:01,033 INFO L225 Difference]: With dead ends: 98 [2018-11-14 17:13:01,034 INFO L226 Difference]: Without dead ends: 64 [2018-11-14 17:13:01,034 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:13:01,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-11-14 17:13:01,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2018-11-14 17:13:01,095 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:13:01,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand 48 states. [2018-11-14 17:13:01,095 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 48 states. [2018-11-14 17:13:01,095 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 48 states. [2018-11-14 17:13:01,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:01,100 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2018-11-14 17:13:01,100 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2018-11-14 17:13:01,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:01,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:01,102 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 64 states. [2018-11-14 17:13:01,102 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 64 states. [2018-11-14 17:13:01,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:01,106 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2018-11-14 17:13:01,106 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2018-11-14 17:13:01,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:01,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:01,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:13:01,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:13:01,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 17:13:01,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 56 transitions. [2018-11-14 17:13:01,111 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 56 transitions. Word has length 27 [2018-11-14 17:13:01,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:13:01,111 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 56 transitions. [2018-11-14 17:13:01,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:13:01,111 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 56 transitions. [2018-11-14 17:13:01,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-14 17:13:01,113 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:13:01,113 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:13:01,113 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:13:01,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:13:01,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1346161551, now seen corresponding path program 1 times [2018-11-14 17:13:01,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:13:01,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:13:01,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:01,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:13:01,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:01,122 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:13:01,122 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:13:01,122 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:13:01,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:13:01,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:01,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:13:01,344 INFO L256 TraceCheckUtils]: 0: Hoare triple {1089#true} call ULTIMATE.init(); {1089#true} is VALID [2018-11-14 17:13:01,345 INFO L273 TraceCheckUtils]: 1: Hoare triple {1089#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1089#true} is VALID [2018-11-14 17:13:01,345 INFO L273 TraceCheckUtils]: 2: Hoare triple {1089#true} assume true; {1089#true} is VALID [2018-11-14 17:13:01,346 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1089#true} {1089#true} #147#return; {1089#true} is VALID [2018-11-14 17:13:01,346 INFO L256 TraceCheckUtils]: 4: Hoare triple {1089#true} call #t~ret4 := main(); {1089#true} is VALID [2018-11-14 17:13:01,349 INFO L273 TraceCheckUtils]: 5: Hoare triple {1089#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {1109#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:01,349 INFO L273 TraceCheckUtils]: 6: Hoare triple {1109#(<= 1000 main_~n~0)} assume true; {1109#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:01,350 INFO L273 TraceCheckUtils]: 7: Hoare triple {1109#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1109#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:01,350 INFO L273 TraceCheckUtils]: 8: Hoare triple {1109#(<= 1000 main_~n~0)} assume true; {1109#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:01,351 INFO L273 TraceCheckUtils]: 9: Hoare triple {1109#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {1122#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-14 17:13:01,351 INFO L273 TraceCheckUtils]: 10: Hoare triple {1122#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume true; {1122#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-14 17:13:01,352 INFO L273 TraceCheckUtils]: 11: Hoare triple {1122#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume !(~k~0 < ~n~0); {1090#false} is VALID [2018-11-14 17:13:01,352 INFO L273 TraceCheckUtils]: 12: Hoare triple {1090#false} ~j~0 := ~j~0 + 1; {1090#false} is VALID [2018-11-14 17:13:01,353 INFO L273 TraceCheckUtils]: 13: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-14 17:13:01,353 INFO L273 TraceCheckUtils]: 14: Hoare triple {1090#false} assume !(~j~0 < ~n~0); {1090#false} is VALID [2018-11-14 17:13:01,354 INFO L273 TraceCheckUtils]: 15: Hoare triple {1090#false} ~i~0 := ~i~0 + 1; {1090#false} is VALID [2018-11-14 17:13:01,354 INFO L273 TraceCheckUtils]: 16: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-14 17:13:01,354 INFO L273 TraceCheckUtils]: 17: Hoare triple {1090#false} assume !(~i~0 < ~n~0); {1090#false} is VALID [2018-11-14 17:13:01,355 INFO L273 TraceCheckUtils]: 18: Hoare triple {1090#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1090#false} is VALID [2018-11-14 17:13:01,355 INFO L273 TraceCheckUtils]: 19: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-14 17:13:01,355 INFO L273 TraceCheckUtils]: 20: Hoare triple {1090#false} assume !(~i~0 < ~n~0); {1090#false} is VALID [2018-11-14 17:13:01,355 INFO L273 TraceCheckUtils]: 21: Hoare triple {1090#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1090#false} is VALID [2018-11-14 17:13:01,356 INFO L273 TraceCheckUtils]: 22: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-14 17:13:01,356 INFO L273 TraceCheckUtils]: 23: Hoare triple {1090#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1090#false} is VALID [2018-11-14 17:13:01,356 INFO L273 TraceCheckUtils]: 24: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-14 17:13:01,356 INFO L273 TraceCheckUtils]: 25: Hoare triple {1090#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1090#false} is VALID [2018-11-14 17:13:01,357 INFO L273 TraceCheckUtils]: 26: Hoare triple {1090#false} assume true; {1090#false} is VALID [2018-11-14 17:13:01,357 INFO L273 TraceCheckUtils]: 27: Hoare triple {1090#false} assume !!(~k~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (~n~0 * 4 * ~n~0) + (~n~0 - ~j~0 - 1) * (~n~0 * 4) + (~n~0 - ~k~0 - 1) * 4, 4); {1090#false} is VALID [2018-11-14 17:13:01,357 INFO L256 TraceCheckUtils]: 28: Hoare triple {1090#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1090#false} is VALID [2018-11-14 17:13:01,357 INFO L273 TraceCheckUtils]: 29: Hoare triple {1090#false} ~cond := #in~cond; {1090#false} is VALID [2018-11-14 17:13:01,357 INFO L273 TraceCheckUtils]: 30: Hoare triple {1090#false} assume ~cond == 0; {1090#false} is VALID [2018-11-14 17:13:01,358 INFO L273 TraceCheckUtils]: 31: Hoare triple {1090#false} assume !false; {1090#false} is VALID [2018-11-14 17:13:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:13:01,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:13:01,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:13:01,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-14 17:13:01,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:13:01,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:13:01,427 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-14 17:13:01,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:13:01,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:13:01,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:13:01,428 INFO L87 Difference]: Start difference. First operand 48 states and 56 transitions. Second operand 4 states. [2018-11-14 17:13:01,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:01,698 INFO L93 Difference]: Finished difference Result 101 states and 122 transitions. [2018-11-14 17:13:01,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:13:01,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-14 17:13:01,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:13:01,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:13:01,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2018-11-14 17:13:01,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:13:01,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 116 transitions. [2018-11-14 17:13:01,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 116 transitions. [2018-11-14 17:13:01,907 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:01,910 INFO L225 Difference]: With dead ends: 101 [2018-11-14 17:13:01,910 INFO L226 Difference]: Without dead ends: 61 [2018-11-14 17:13:01,911 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:13:01,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-14 17:13:01,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2018-11-14 17:13:01,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:13:01,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 54 states. [2018-11-14 17:13:01,963 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 54 states. [2018-11-14 17:13:01,964 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 54 states. [2018-11-14 17:13:01,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:01,968 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2018-11-14 17:13:01,968 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2018-11-14 17:13:01,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:01,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:01,970 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 61 states. [2018-11-14 17:13:01,970 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 61 states. [2018-11-14 17:13:01,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:01,973 INFO L93 Difference]: Finished difference Result 61 states and 71 transitions. [2018-11-14 17:13:01,974 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 71 transitions. [2018-11-14 17:13:01,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:01,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:01,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:13:01,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:13:01,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-14 17:13:01,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-11-14 17:13:01,978 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 32 [2018-11-14 17:13:01,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:13:01,978 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-11-14 17:13:01,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:13:01,978 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-11-14 17:13:01,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-14 17:13:01,979 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:13:01,980 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:13:01,980 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:13:01,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:13:01,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1109010455, now seen corresponding path program 1 times [2018-11-14 17:13:01,980 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:13:01,981 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:13:01,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:01,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:13:01,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:01,988 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:13:01,988 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:13:01,988 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:13:02,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:13:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:02,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:02,045 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:13:02,185 INFO L256 TraceCheckUtils]: 0: Hoare triple {1526#true} call ULTIMATE.init(); {1526#true} is VALID [2018-11-14 17:13:02,186 INFO L273 TraceCheckUtils]: 1: Hoare triple {1526#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1526#true} is VALID [2018-11-14 17:13:02,186 INFO L273 TraceCheckUtils]: 2: Hoare triple {1526#true} assume true; {1526#true} is VALID [2018-11-14 17:13:02,187 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1526#true} {1526#true} #147#return; {1526#true} is VALID [2018-11-14 17:13:02,187 INFO L256 TraceCheckUtils]: 4: Hoare triple {1526#true} call #t~ret4 := main(); {1526#true} is VALID [2018-11-14 17:13:02,193 INFO L273 TraceCheckUtils]: 5: Hoare triple {1526#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {1546#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:02,194 INFO L273 TraceCheckUtils]: 6: Hoare triple {1546#(<= 1000 main_~n~0)} assume true; {1546#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:02,194 INFO L273 TraceCheckUtils]: 7: Hoare triple {1546#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1546#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:02,195 INFO L273 TraceCheckUtils]: 8: Hoare triple {1546#(<= 1000 main_~n~0)} assume true; {1546#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:02,196 INFO L273 TraceCheckUtils]: 9: Hoare triple {1546#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {1559#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-14 17:13:02,196 INFO L273 TraceCheckUtils]: 10: Hoare triple {1559#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume true; {1559#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-14 17:13:02,198 INFO L273 TraceCheckUtils]: 11: Hoare triple {1559#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume !!(~k~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {1566#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-14 17:13:02,199 INFO L273 TraceCheckUtils]: 12: Hoare triple {1566#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} assume true; {1566#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-14 17:13:02,200 INFO L273 TraceCheckUtils]: 13: Hoare triple {1566#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} assume !(~k~0 < ~n~0); {1527#false} is VALID [2018-11-14 17:13:02,200 INFO L273 TraceCheckUtils]: 14: Hoare triple {1527#false} ~j~0 := ~j~0 + 1; {1527#false} is VALID [2018-11-14 17:13:02,201 INFO L273 TraceCheckUtils]: 15: Hoare triple {1527#false} assume true; {1527#false} is VALID [2018-11-14 17:13:02,201 INFO L273 TraceCheckUtils]: 16: Hoare triple {1527#false} assume !(~j~0 < ~n~0); {1527#false} is VALID [2018-11-14 17:13:02,201 INFO L273 TraceCheckUtils]: 17: Hoare triple {1527#false} ~i~0 := ~i~0 + 1; {1527#false} is VALID [2018-11-14 17:13:02,202 INFO L273 TraceCheckUtils]: 18: Hoare triple {1527#false} assume true; {1527#false} is VALID [2018-11-14 17:13:02,202 INFO L273 TraceCheckUtils]: 19: Hoare triple {1527#false} assume !(~i~0 < ~n~0); {1527#false} is VALID [2018-11-14 17:13:02,202 INFO L273 TraceCheckUtils]: 20: Hoare triple {1527#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1527#false} is VALID [2018-11-14 17:13:02,203 INFO L273 TraceCheckUtils]: 21: Hoare triple {1527#false} assume true; {1527#false} is VALID [2018-11-14 17:13:02,203 INFO L273 TraceCheckUtils]: 22: Hoare triple {1527#false} assume !(~i~0 < ~n~0); {1527#false} is VALID [2018-11-14 17:13:02,204 INFO L273 TraceCheckUtils]: 23: Hoare triple {1527#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {1527#false} is VALID [2018-11-14 17:13:02,204 INFO L273 TraceCheckUtils]: 24: Hoare triple {1527#false} assume true; {1527#false} is VALID [2018-11-14 17:13:02,205 INFO L273 TraceCheckUtils]: 25: Hoare triple {1527#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {1527#false} is VALID [2018-11-14 17:13:02,205 INFO L273 TraceCheckUtils]: 26: Hoare triple {1527#false} assume true; {1527#false} is VALID [2018-11-14 17:13:02,206 INFO L273 TraceCheckUtils]: 27: Hoare triple {1527#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {1527#false} is VALID [2018-11-14 17:13:02,206 INFO L273 TraceCheckUtils]: 28: Hoare triple {1527#false} assume true; {1527#false} is VALID [2018-11-14 17:13:02,206 INFO L273 TraceCheckUtils]: 29: Hoare triple {1527#false} assume !!(~k~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (~n~0 * 4 * ~n~0) + (~n~0 - ~j~0 - 1) * (~n~0 * 4) + (~n~0 - ~k~0 - 1) * 4, 4); {1527#false} is VALID [2018-11-14 17:13:02,206 INFO L256 TraceCheckUtils]: 30: Hoare triple {1527#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {1527#false} is VALID [2018-11-14 17:13:02,207 INFO L273 TraceCheckUtils]: 31: Hoare triple {1527#false} ~cond := #in~cond; {1527#false} is VALID [2018-11-14 17:13:02,207 INFO L273 TraceCheckUtils]: 32: Hoare triple {1527#false} assume ~cond == 0; {1527#false} is VALID [2018-11-14 17:13:02,207 INFO L273 TraceCheckUtils]: 33: Hoare triple {1527#false} assume !false; {1527#false} is VALID [2018-11-14 17:13:02,210 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:13:02,237 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:13:02,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-14 17:13:02,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-14 17:13:02,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:13:02,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:13:02,286 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-14 17:13:02,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:13:02,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:13:02,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:13:02,288 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 5 states. [2018-11-14 17:13:02,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:02,885 INFO L93 Difference]: Finished difference Result 115 states and 137 transitions. [2018-11-14 17:13:02,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:13:02,885 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2018-11-14 17:13:02,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:13:02,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:13:02,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2018-11-14 17:13:02,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:13:02,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 125 transitions. [2018-11-14 17:13:02,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 125 transitions. [2018-11-14 17:13:03,060 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:03,063 INFO L225 Difference]: With dead ends: 115 [2018-11-14 17:13:03,064 INFO L226 Difference]: Without dead ends: 69 [2018-11-14 17:13:03,064 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:13:03,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-14 17:13:03,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 62. [2018-11-14 17:13:03,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:13:03,120 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 62 states. [2018-11-14 17:13:03,120 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 62 states. [2018-11-14 17:13:03,121 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 62 states. [2018-11-14 17:13:03,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:03,125 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-11-14 17:13:03,125 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-11-14 17:13:03,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:03,126 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:03,126 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 69 states. [2018-11-14 17:13:03,126 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 69 states. [2018-11-14 17:13:03,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:03,130 INFO L93 Difference]: Finished difference Result 69 states and 80 transitions. [2018-11-14 17:13:03,130 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2018-11-14 17:13:03,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:03,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:03,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:13:03,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:13:03,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-14 17:13:03,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2018-11-14 17:13:03,134 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 34 [2018-11-14 17:13:03,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:13:03,134 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2018-11-14 17:13:03,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:13:03,135 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2018-11-14 17:13:03,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 17:13:03,135 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:13:03,136 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:13:03,136 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:13:03,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:13:03,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1702704579, now seen corresponding path program 2 times [2018-11-14 17:13:03,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:13:03,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:13:03,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:03,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:13:03,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:03,144 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:13:03,144 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:13:03,144 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:13:03,160 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:13:03,184 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 17:13:03,184 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:13:03,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:03,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:13:03,316 INFO L256 TraceCheckUtils]: 0: Hoare triple {2019#true} call ULTIMATE.init(); {2019#true} is VALID [2018-11-14 17:13:03,317 INFO L273 TraceCheckUtils]: 1: Hoare triple {2019#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2019#true} is VALID [2018-11-14 17:13:03,317 INFO L273 TraceCheckUtils]: 2: Hoare triple {2019#true} assume true; {2019#true} is VALID [2018-11-14 17:13:03,318 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2019#true} {2019#true} #147#return; {2019#true} is VALID [2018-11-14 17:13:03,318 INFO L256 TraceCheckUtils]: 4: Hoare triple {2019#true} call #t~ret4 := main(); {2019#true} is VALID [2018-11-14 17:13:03,319 INFO L273 TraceCheckUtils]: 5: Hoare triple {2019#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {2039#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:03,320 INFO L273 TraceCheckUtils]: 6: Hoare triple {2039#(<= 1000 main_~n~0)} assume true; {2039#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:03,320 INFO L273 TraceCheckUtils]: 7: Hoare triple {2039#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {2039#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:03,320 INFO L273 TraceCheckUtils]: 8: Hoare triple {2039#(<= 1000 main_~n~0)} assume true; {2039#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:03,321 INFO L273 TraceCheckUtils]: 9: Hoare triple {2039#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {2039#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:03,322 INFO L273 TraceCheckUtils]: 10: Hoare triple {2039#(<= 1000 main_~n~0)} assume true; {2039#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:03,322 INFO L273 TraceCheckUtils]: 11: Hoare triple {2039#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {2039#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:03,323 INFO L273 TraceCheckUtils]: 12: Hoare triple {2039#(<= 1000 main_~n~0)} assume true; {2039#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:03,324 INFO L273 TraceCheckUtils]: 13: Hoare triple {2039#(<= 1000 main_~n~0)} assume !!(~k~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {2039#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:03,324 INFO L273 TraceCheckUtils]: 14: Hoare triple {2039#(<= 1000 main_~n~0)} assume true; {2039#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:03,325 INFO L273 TraceCheckUtils]: 15: Hoare triple {2039#(<= 1000 main_~n~0)} assume !(~k~0 < ~n~0); {2039#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:03,326 INFO L273 TraceCheckUtils]: 16: Hoare triple {2039#(<= 1000 main_~n~0)} ~j~0 := ~j~0 + 1; {2039#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:03,327 INFO L273 TraceCheckUtils]: 17: Hoare triple {2039#(<= 1000 main_~n~0)} assume true; {2039#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:03,327 INFO L273 TraceCheckUtils]: 18: Hoare triple {2039#(<= 1000 main_~n~0)} assume !(~j~0 < ~n~0); {2039#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:03,328 INFO L273 TraceCheckUtils]: 19: Hoare triple {2039#(<= 1000 main_~n~0)} ~i~0 := ~i~0 + 1; {2039#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:03,329 INFO L273 TraceCheckUtils]: 20: Hoare triple {2039#(<= 1000 main_~n~0)} assume true; {2039#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:03,329 INFO L273 TraceCheckUtils]: 21: Hoare triple {2039#(<= 1000 main_~n~0)} assume !(~i~0 < ~n~0); {2039#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:03,330 INFO L273 TraceCheckUtils]: 22: Hoare triple {2039#(<= 1000 main_~n~0)} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2091#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:03,332 INFO L273 TraceCheckUtils]: 23: Hoare triple {2091#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume true; {2091#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:03,333 INFO L273 TraceCheckUtils]: 24: Hoare triple {2091#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !(~i~0 < ~n~0); {2020#false} is VALID [2018-11-14 17:13:03,333 INFO L273 TraceCheckUtils]: 25: Hoare triple {2020#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2020#false} is VALID [2018-11-14 17:13:03,333 INFO L273 TraceCheckUtils]: 26: Hoare triple {2020#false} assume true; {2020#false} is VALID [2018-11-14 17:13:03,334 INFO L273 TraceCheckUtils]: 27: Hoare triple {2020#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {2020#false} is VALID [2018-11-14 17:13:03,334 INFO L273 TraceCheckUtils]: 28: Hoare triple {2020#false} assume true; {2020#false} is VALID [2018-11-14 17:13:03,334 INFO L273 TraceCheckUtils]: 29: Hoare triple {2020#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2020#false} is VALID [2018-11-14 17:13:03,335 INFO L273 TraceCheckUtils]: 30: Hoare triple {2020#false} assume true; {2020#false} is VALID [2018-11-14 17:13:03,335 INFO L273 TraceCheckUtils]: 31: Hoare triple {2020#false} assume !!(~k~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (~n~0 * 4 * ~n~0) + (~n~0 - ~j~0 - 1) * (~n~0 * 4) + (~n~0 - ~k~0 - 1) * 4, 4); {2020#false} is VALID [2018-11-14 17:13:03,335 INFO L256 TraceCheckUtils]: 32: Hoare triple {2020#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2020#false} is VALID [2018-11-14 17:13:03,336 INFO L273 TraceCheckUtils]: 33: Hoare triple {2020#false} ~cond := #in~cond; {2020#false} is VALID [2018-11-14 17:13:03,336 INFO L273 TraceCheckUtils]: 34: Hoare triple {2020#false} assume ~cond == 0; {2020#false} is VALID [2018-11-14 17:13:03,336 INFO L273 TraceCheckUtils]: 35: Hoare triple {2020#false} assume !false; {2020#false} is VALID [2018-11-14 17:13:03,339 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-14 17:13:03,362 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:13:03,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:13:03,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-14 17:13:03,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:13:03,364 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:13:03,415 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:03,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:13:03,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:13:03,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:13:03,417 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand 4 states. [2018-11-14 17:13:03,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:03,869 INFO L93 Difference]: Finished difference Result 131 states and 152 transitions. [2018-11-14 17:13:03,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:13:03,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-14 17:13:03,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:13:03,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:13:03,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2018-11-14 17:13:03,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:13:03,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2018-11-14 17:13:03,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 101 transitions. [2018-11-14 17:13:04,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:04,033 INFO L225 Difference]: With dead ends: 131 [2018-11-14 17:13:04,033 INFO L226 Difference]: Without dead ends: 106 [2018-11-14 17:13:04,034 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:13:04,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-11-14 17:13:04,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 64. [2018-11-14 17:13:04,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:13:04,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand 64 states. [2018-11-14 17:13:04,149 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 64 states. [2018-11-14 17:13:04,150 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 64 states. [2018-11-14 17:13:04,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:04,154 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2018-11-14 17:13:04,154 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2018-11-14 17:13:04,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:04,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:04,172 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand 106 states. [2018-11-14 17:13:04,172 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 106 states. [2018-11-14 17:13:04,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:04,178 INFO L93 Difference]: Finished difference Result 106 states and 123 transitions. [2018-11-14 17:13:04,179 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 123 transitions. [2018-11-14 17:13:04,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:04,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:04,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:13:04,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:13:04,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-14 17:13:04,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 73 transitions. [2018-11-14 17:13:04,183 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 73 transitions. Word has length 36 [2018-11-14 17:13:04,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:13:04,183 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 73 transitions. [2018-11-14 17:13:04,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:13:04,183 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2018-11-14 17:13:04,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-14 17:13:04,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:13:04,186 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:13:04,186 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:13:04,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:13:04,190 INFO L82 PathProgramCache]: Analyzing trace with hash 487964545, now seen corresponding path program 1 times [2018-11-14 17:13:04,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:13:04,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:13:04,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:04,192 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:13:04,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:04,203 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:13:04,203 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:13:04,204 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:13:04,217 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:13:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:04,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:04,257 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:13:04,389 INFO L256 TraceCheckUtils]: 0: Hoare triple {2618#true} call ULTIMATE.init(); {2618#true} is VALID [2018-11-14 17:13:04,389 INFO L273 TraceCheckUtils]: 1: Hoare triple {2618#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2618#true} is VALID [2018-11-14 17:13:04,390 INFO L273 TraceCheckUtils]: 2: Hoare triple {2618#true} assume true; {2618#true} is VALID [2018-11-14 17:13:04,390 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2618#true} {2618#true} #147#return; {2618#true} is VALID [2018-11-14 17:13:04,390 INFO L256 TraceCheckUtils]: 4: Hoare triple {2618#true} call #t~ret4 := main(); {2618#true} is VALID [2018-11-14 17:13:04,391 INFO L273 TraceCheckUtils]: 5: Hoare triple {2618#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {2638#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:04,392 INFO L273 TraceCheckUtils]: 6: Hoare triple {2638#(<= 1000 main_~n~0)} assume true; {2638#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:04,392 INFO L273 TraceCheckUtils]: 7: Hoare triple {2638#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {2638#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:04,392 INFO L273 TraceCheckUtils]: 8: Hoare triple {2638#(<= 1000 main_~n~0)} assume true; {2638#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:04,393 INFO L273 TraceCheckUtils]: 9: Hoare triple {2638#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {2651#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-14 17:13:04,394 INFO L273 TraceCheckUtils]: 10: Hoare triple {2651#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume true; {2651#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-14 17:13:04,395 INFO L273 TraceCheckUtils]: 11: Hoare triple {2651#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume !!(~k~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {2658#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-14 17:13:04,403 INFO L273 TraceCheckUtils]: 12: Hoare triple {2658#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} assume true; {2658#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-14 17:13:04,404 INFO L273 TraceCheckUtils]: 13: Hoare triple {2658#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} assume !!(~k~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {2665#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} is VALID [2018-11-14 17:13:04,404 INFO L273 TraceCheckUtils]: 14: Hoare triple {2665#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} assume true; {2665#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} is VALID [2018-11-14 17:13:04,405 INFO L273 TraceCheckUtils]: 15: Hoare triple {2665#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} assume !(~k~0 < ~n~0); {2619#false} is VALID [2018-11-14 17:13:04,405 INFO L273 TraceCheckUtils]: 16: Hoare triple {2619#false} ~j~0 := ~j~0 + 1; {2619#false} is VALID [2018-11-14 17:13:04,405 INFO L273 TraceCheckUtils]: 17: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 17:13:04,406 INFO L273 TraceCheckUtils]: 18: Hoare triple {2619#false} assume !(~j~0 < ~n~0); {2619#false} is VALID [2018-11-14 17:13:04,406 INFO L273 TraceCheckUtils]: 19: Hoare triple {2619#false} ~i~0 := ~i~0 + 1; {2619#false} is VALID [2018-11-14 17:13:04,406 INFO L273 TraceCheckUtils]: 20: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 17:13:04,406 INFO L273 TraceCheckUtils]: 21: Hoare triple {2619#false} assume !(~i~0 < ~n~0); {2619#false} is VALID [2018-11-14 17:13:04,406 INFO L273 TraceCheckUtils]: 22: Hoare triple {2619#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2619#false} is VALID [2018-11-14 17:13:04,407 INFO L273 TraceCheckUtils]: 23: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 17:13:04,407 INFO L273 TraceCheckUtils]: 24: Hoare triple {2619#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {2619#false} is VALID [2018-11-14 17:13:04,407 INFO L273 TraceCheckUtils]: 25: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 17:13:04,407 INFO L273 TraceCheckUtils]: 26: Hoare triple {2619#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2619#false} is VALID [2018-11-14 17:13:04,408 INFO L273 TraceCheckUtils]: 27: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 17:13:04,408 INFO L273 TraceCheckUtils]: 28: Hoare triple {2619#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (~n~0 * 4 * ~n~0) + (~n~0 - ~j~0 - 1) * (~n~0 * 4) + (~n~0 - ~k~0 - 1) * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~mem1;~k~0 := ~k~0 + 1; {2619#false} is VALID [2018-11-14 17:13:04,408 INFO L273 TraceCheckUtils]: 29: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 17:13:04,408 INFO L273 TraceCheckUtils]: 30: Hoare triple {2619#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (~n~0 * 4 * ~n~0) + (~n~0 - ~j~0 - 1) * (~n~0 * 4) + (~n~0 - ~k~0 - 1) * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~mem1;~k~0 := ~k~0 + 1; {2619#false} is VALID [2018-11-14 17:13:04,409 INFO L273 TraceCheckUtils]: 31: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 17:13:04,409 INFO L273 TraceCheckUtils]: 32: Hoare triple {2619#false} assume !(~k~0 < ~n~0); {2619#false} is VALID [2018-11-14 17:13:04,409 INFO L273 TraceCheckUtils]: 33: Hoare triple {2619#false} ~j~0 := ~j~0 + 1; {2619#false} is VALID [2018-11-14 17:13:04,409 INFO L273 TraceCheckUtils]: 34: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 17:13:04,410 INFO L273 TraceCheckUtils]: 35: Hoare triple {2619#false} assume !(~j~0 < ~n~0); {2619#false} is VALID [2018-11-14 17:13:04,410 INFO L273 TraceCheckUtils]: 36: Hoare triple {2619#false} ~i~0 := ~i~0 + 1; {2619#false} is VALID [2018-11-14 17:13:04,410 INFO L273 TraceCheckUtils]: 37: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 17:13:04,410 INFO L273 TraceCheckUtils]: 38: Hoare triple {2619#false} assume !(~i~0 < ~n~0); {2619#false} is VALID [2018-11-14 17:13:04,411 INFO L273 TraceCheckUtils]: 39: Hoare triple {2619#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {2619#false} is VALID [2018-11-14 17:13:04,411 INFO L273 TraceCheckUtils]: 40: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 17:13:04,411 INFO L273 TraceCheckUtils]: 41: Hoare triple {2619#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {2619#false} is VALID [2018-11-14 17:13:04,411 INFO L273 TraceCheckUtils]: 42: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 17:13:04,411 INFO L273 TraceCheckUtils]: 43: Hoare triple {2619#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {2619#false} is VALID [2018-11-14 17:13:04,412 INFO L273 TraceCheckUtils]: 44: Hoare triple {2619#false} assume true; {2619#false} is VALID [2018-11-14 17:13:04,412 INFO L273 TraceCheckUtils]: 45: Hoare triple {2619#false} assume !!(~k~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (~n~0 * 4 * ~n~0) + (~n~0 - ~j~0 - 1) * (~n~0 * 4) + (~n~0 - ~k~0 - 1) * 4, 4); {2619#false} is VALID [2018-11-14 17:13:04,412 INFO L256 TraceCheckUtils]: 46: Hoare triple {2619#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {2619#false} is VALID [2018-11-14 17:13:04,412 INFO L273 TraceCheckUtils]: 47: Hoare triple {2619#false} ~cond := #in~cond; {2619#false} is VALID [2018-11-14 17:13:04,412 INFO L273 TraceCheckUtils]: 48: Hoare triple {2619#false} assume ~cond == 0; {2619#false} is VALID [2018-11-14 17:13:04,412 INFO L273 TraceCheckUtils]: 49: Hoare triple {2619#false} assume !false; {2619#false} is VALID [2018-11-14 17:13:04,415 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2018-11-14 17:13:04,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:13:04,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-14 17:13:04,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-14 17:13:04,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:13:04,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:13:04,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:04,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:13:04,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:13:04,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:13:04,526 INFO L87 Difference]: Start difference. First operand 64 states and 73 transitions. Second operand 6 states. [2018-11-14 17:13:05,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:05,355 INFO L93 Difference]: Finished difference Result 132 states and 155 transitions. [2018-11-14 17:13:05,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:13:05,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2018-11-14 17:13:05,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:13:05,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:13:05,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2018-11-14 17:13:05,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:13:05,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 132 transitions. [2018-11-14 17:13:05,361 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 132 transitions. [2018-11-14 17:13:05,495 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:05,497 INFO L225 Difference]: With dead ends: 132 [2018-11-14 17:13:05,498 INFO L226 Difference]: Without dead ends: 76 [2018-11-14 17:13:05,499 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:13:05,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-14 17:13:05,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 72. [2018-11-14 17:13:05,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:13:05,595 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 72 states. [2018-11-14 17:13:05,595 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 72 states. [2018-11-14 17:13:05,595 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 72 states. [2018-11-14 17:13:05,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:05,598 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-14 17:13:05,598 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-11-14 17:13:05,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:05,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:05,599 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 76 states. [2018-11-14 17:13:05,599 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 76 states. [2018-11-14 17:13:05,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:05,601 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2018-11-14 17:13:05,602 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2018-11-14 17:13:05,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:05,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:05,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:13:05,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:13:05,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-14 17:13:05,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2018-11-14 17:13:05,605 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 50 [2018-11-14 17:13:05,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:13:05,605 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2018-11-14 17:13:05,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:13:05,605 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2018-11-14 17:13:05,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-14 17:13:05,606 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:13:05,606 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:13:05,606 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:13:05,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:13:05,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1369611969, now seen corresponding path program 2 times [2018-11-14 17:13:05,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:13:05,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:13:05,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:05,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:13:05,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:05,613 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:13:05,614 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:13:05,614 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:13:05,635 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:13:05,660 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:13:05,660 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:13:05,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:05,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:13:05,830 INFO L256 TraceCheckUtils]: 0: Hoare triple {3215#true} call ULTIMATE.init(); {3215#true} is VALID [2018-11-14 17:13:05,830 INFO L273 TraceCheckUtils]: 1: Hoare triple {3215#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3215#true} is VALID [2018-11-14 17:13:05,830 INFO L273 TraceCheckUtils]: 2: Hoare triple {3215#true} assume true; {3215#true} is VALID [2018-11-14 17:13:05,831 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3215#true} {3215#true} #147#return; {3215#true} is VALID [2018-11-14 17:13:05,831 INFO L256 TraceCheckUtils]: 4: Hoare triple {3215#true} call #t~ret4 := main(); {3215#true} is VALID [2018-11-14 17:13:05,832 INFO L273 TraceCheckUtils]: 5: Hoare triple {3215#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {3235#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:05,833 INFO L273 TraceCheckUtils]: 6: Hoare triple {3235#(<= 1000 main_~n~0)} assume true; {3235#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:05,833 INFO L273 TraceCheckUtils]: 7: Hoare triple {3235#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {3235#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:05,833 INFO L273 TraceCheckUtils]: 8: Hoare triple {3235#(<= 1000 main_~n~0)} assume true; {3235#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:05,834 INFO L273 TraceCheckUtils]: 9: Hoare triple {3235#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {3248#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-14 17:13:05,835 INFO L273 TraceCheckUtils]: 10: Hoare triple {3248#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume true; {3248#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} is VALID [2018-11-14 17:13:05,836 INFO L273 TraceCheckUtils]: 11: Hoare triple {3248#(and (<= 1000 main_~n~0) (<= main_~k~0 0))} assume !!(~k~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {3255#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-14 17:13:05,837 INFO L273 TraceCheckUtils]: 12: Hoare triple {3255#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} assume true; {3255#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} is VALID [2018-11-14 17:13:05,838 INFO L273 TraceCheckUtils]: 13: Hoare triple {3255#(and (<= 1000 main_~n~0) (<= main_~k~0 1))} assume !!(~k~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {3262#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} is VALID [2018-11-14 17:13:05,839 INFO L273 TraceCheckUtils]: 14: Hoare triple {3262#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} assume true; {3262#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} is VALID [2018-11-14 17:13:05,840 INFO L273 TraceCheckUtils]: 15: Hoare triple {3262#(and (<= 1000 main_~n~0) (<= main_~k~0 2))} assume !!(~k~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {3269#(and (<= 1000 main_~n~0) (<= main_~k~0 3))} is VALID [2018-11-14 17:13:05,841 INFO L273 TraceCheckUtils]: 16: Hoare triple {3269#(and (<= 1000 main_~n~0) (<= main_~k~0 3))} assume true; {3269#(and (<= 1000 main_~n~0) (<= main_~k~0 3))} is VALID [2018-11-14 17:13:05,842 INFO L273 TraceCheckUtils]: 17: Hoare triple {3269#(and (<= 1000 main_~n~0) (<= main_~k~0 3))} assume !(~k~0 < ~n~0); {3216#false} is VALID [2018-11-14 17:13:05,842 INFO L273 TraceCheckUtils]: 18: Hoare triple {3216#false} ~j~0 := ~j~0 + 1; {3216#false} is VALID [2018-11-14 17:13:05,843 INFO L273 TraceCheckUtils]: 19: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 17:13:05,843 INFO L273 TraceCheckUtils]: 20: Hoare triple {3216#false} assume !(~j~0 < ~n~0); {3216#false} is VALID [2018-11-14 17:13:05,843 INFO L273 TraceCheckUtils]: 21: Hoare triple {3216#false} ~i~0 := ~i~0 + 1; {3216#false} is VALID [2018-11-14 17:13:05,844 INFO L273 TraceCheckUtils]: 22: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 17:13:05,844 INFO L273 TraceCheckUtils]: 23: Hoare triple {3216#false} assume !(~i~0 < ~n~0); {3216#false} is VALID [2018-11-14 17:13:05,844 INFO L273 TraceCheckUtils]: 24: Hoare triple {3216#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3216#false} is VALID [2018-11-14 17:13:05,844 INFO L273 TraceCheckUtils]: 25: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 17:13:05,845 INFO L273 TraceCheckUtils]: 26: Hoare triple {3216#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {3216#false} is VALID [2018-11-14 17:13:05,845 INFO L273 TraceCheckUtils]: 27: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 17:13:05,845 INFO L273 TraceCheckUtils]: 28: Hoare triple {3216#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3216#false} is VALID [2018-11-14 17:13:05,845 INFO L273 TraceCheckUtils]: 29: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 17:13:05,845 INFO L273 TraceCheckUtils]: 30: Hoare triple {3216#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (~n~0 * 4 * ~n~0) + (~n~0 - ~j~0 - 1) * (~n~0 * 4) + (~n~0 - ~k~0 - 1) * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~mem1;~k~0 := ~k~0 + 1; {3216#false} is VALID [2018-11-14 17:13:05,846 INFO L273 TraceCheckUtils]: 31: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 17:13:05,846 INFO L273 TraceCheckUtils]: 32: Hoare triple {3216#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (~n~0 * 4 * ~n~0) + (~n~0 - ~j~0 - 1) * (~n~0 * 4) + (~n~0 - ~k~0 - 1) * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~mem1;~k~0 := ~k~0 + 1; {3216#false} is VALID [2018-11-14 17:13:05,846 INFO L273 TraceCheckUtils]: 33: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 17:13:05,846 INFO L273 TraceCheckUtils]: 34: Hoare triple {3216#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (~n~0 * 4 * ~n~0) + (~n~0 - ~j~0 - 1) * (~n~0 * 4) + (~n~0 - ~k~0 - 1) * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~mem1;~k~0 := ~k~0 + 1; {3216#false} is VALID [2018-11-14 17:13:05,847 INFO L273 TraceCheckUtils]: 35: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 17:13:05,847 INFO L273 TraceCheckUtils]: 36: Hoare triple {3216#false} assume !(~k~0 < ~n~0); {3216#false} is VALID [2018-11-14 17:13:05,847 INFO L273 TraceCheckUtils]: 37: Hoare triple {3216#false} ~j~0 := ~j~0 + 1; {3216#false} is VALID [2018-11-14 17:13:05,847 INFO L273 TraceCheckUtils]: 38: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 17:13:05,847 INFO L273 TraceCheckUtils]: 39: Hoare triple {3216#false} assume !(~j~0 < ~n~0); {3216#false} is VALID [2018-11-14 17:13:05,848 INFO L273 TraceCheckUtils]: 40: Hoare triple {3216#false} ~i~0 := ~i~0 + 1; {3216#false} is VALID [2018-11-14 17:13:05,848 INFO L273 TraceCheckUtils]: 41: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 17:13:05,848 INFO L273 TraceCheckUtils]: 42: Hoare triple {3216#false} assume !(~i~0 < ~n~0); {3216#false} is VALID [2018-11-14 17:13:05,848 INFO L273 TraceCheckUtils]: 43: Hoare triple {3216#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3216#false} is VALID [2018-11-14 17:13:05,849 INFO L273 TraceCheckUtils]: 44: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 17:13:05,849 INFO L273 TraceCheckUtils]: 45: Hoare triple {3216#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {3216#false} is VALID [2018-11-14 17:13:05,849 INFO L273 TraceCheckUtils]: 46: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 17:13:05,849 INFO L273 TraceCheckUtils]: 47: Hoare triple {3216#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3216#false} is VALID [2018-11-14 17:13:05,849 INFO L273 TraceCheckUtils]: 48: Hoare triple {3216#false} assume true; {3216#false} is VALID [2018-11-14 17:13:05,849 INFO L273 TraceCheckUtils]: 49: Hoare triple {3216#false} assume !!(~k~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (~n~0 * 4 * ~n~0) + (~n~0 - ~j~0 - 1) * (~n~0 * 4) + (~n~0 - ~k~0 - 1) * 4, 4); {3216#false} is VALID [2018-11-14 17:13:05,850 INFO L256 TraceCheckUtils]: 50: Hoare triple {3216#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3216#false} is VALID [2018-11-14 17:13:05,850 INFO L273 TraceCheckUtils]: 51: Hoare triple {3216#false} ~cond := #in~cond; {3216#false} is VALID [2018-11-14 17:13:05,850 INFO L273 TraceCheckUtils]: 52: Hoare triple {3216#false} assume ~cond == 0; {3216#false} is VALID [2018-11-14 17:13:05,850 INFO L273 TraceCheckUtils]: 53: Hoare triple {3216#false} assume !false; {3216#false} is VALID [2018-11-14 17:13:05,853 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-14 17:13:05,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:13:05,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-14 17:13:05,874 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-11-14 17:13:05,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:13:05,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:13:05,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:05,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:13:05,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:13:05,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:13:05,922 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand 7 states. [2018-11-14 17:13:06,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:06,507 INFO L93 Difference]: Finished difference Result 148 states and 173 transitions. [2018-11-14 17:13:06,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:13:06,507 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-11-14 17:13:06,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:13:06,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:13:06,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2018-11-14 17:13:06,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:13:06,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 141 transitions. [2018-11-14 17:13:06,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 141 transitions. [2018-11-14 17:13:06,744 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:06,747 INFO L225 Difference]: With dead ends: 148 [2018-11-14 17:13:06,747 INFO L226 Difference]: Without dead ends: 84 [2018-11-14 17:13:06,748 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:13:06,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-14 17:13:06,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2018-11-14 17:13:06,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:13:06,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 80 states. [2018-11-14 17:13:06,839 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 80 states. [2018-11-14 17:13:06,839 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 80 states. [2018-11-14 17:13:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:06,842 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2018-11-14 17:13:06,842 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2018-11-14 17:13:06,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:06,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:06,843 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand 84 states. [2018-11-14 17:13:06,843 INFO L87 Difference]: Start difference. First operand 80 states. Second operand 84 states. [2018-11-14 17:13:06,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:06,847 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2018-11-14 17:13:06,847 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 96 transitions. [2018-11-14 17:13:06,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:06,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:06,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:13:06,848 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:13:06,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-11-14 17:13:06,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2018-11-14 17:13:06,851 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 54 [2018-11-14 17:13:06,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:13:06,851 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2018-11-14 17:13:06,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:13:06,851 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2018-11-14 17:13:06,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-11-14 17:13:06,852 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:13:06,852 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:13:06,852 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:13:06,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:13:06,853 INFO L82 PathProgramCache]: Analyzing trace with hash 799402753, now seen corresponding path program 3 times [2018-11-14 17:13:06,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:13:06,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:13:06,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:06,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:13:06,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:06,860 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:13:06,860 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:13:06,861 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:13:06,898 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:13:06,920 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 17:13:06,920 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:13:06,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:06,955 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:13:07,258 INFO L256 TraceCheckUtils]: 0: Hoare triple {3877#true} call ULTIMATE.init(); {3877#true} is VALID [2018-11-14 17:13:07,259 INFO L273 TraceCheckUtils]: 1: Hoare triple {3877#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3877#true} is VALID [2018-11-14 17:13:07,259 INFO L273 TraceCheckUtils]: 2: Hoare triple {3877#true} assume true; {3877#true} is VALID [2018-11-14 17:13:07,259 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3877#true} {3877#true} #147#return; {3877#true} is VALID [2018-11-14 17:13:07,259 INFO L256 TraceCheckUtils]: 4: Hoare triple {3877#true} call #t~ret4 := main(); {3877#true} is VALID [2018-11-14 17:13:07,260 INFO L273 TraceCheckUtils]: 5: Hoare triple {3877#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:07,260 INFO L273 TraceCheckUtils]: 6: Hoare triple {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume true; {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:07,261 INFO L273 TraceCheckUtils]: 7: Hoare triple {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:07,262 INFO L273 TraceCheckUtils]: 8: Hoare triple {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume true; {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:07,262 INFO L273 TraceCheckUtils]: 9: Hoare triple {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);~k~0 := 0; {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:07,263 INFO L273 TraceCheckUtils]: 10: Hoare triple {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume true; {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:07,264 INFO L273 TraceCheckUtils]: 11: Hoare triple {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~k~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:07,264 INFO L273 TraceCheckUtils]: 12: Hoare triple {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume true; {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:07,265 INFO L273 TraceCheckUtils]: 13: Hoare triple {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~k~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:07,266 INFO L273 TraceCheckUtils]: 14: Hoare triple {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume true; {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:07,267 INFO L273 TraceCheckUtils]: 15: Hoare triple {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~k~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:07,270 INFO L273 TraceCheckUtils]: 16: Hoare triple {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume true; {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:07,271 INFO L273 TraceCheckUtils]: 17: Hoare triple {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~k~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:07,271 INFO L273 TraceCheckUtils]: 18: Hoare triple {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume true; {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:07,272 INFO L273 TraceCheckUtils]: 19: Hoare triple {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !(~k~0 < ~n~0); {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:07,273 INFO L273 TraceCheckUtils]: 20: Hoare triple {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} ~j~0 := ~j~0 + 1; {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:07,274 INFO L273 TraceCheckUtils]: 21: Hoare triple {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume true; {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:07,274 INFO L273 TraceCheckUtils]: 22: Hoare triple {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !(~j~0 < ~n~0); {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:07,275 INFO L273 TraceCheckUtils]: 23: Hoare triple {3897#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} ~i~0 := ~i~0 + 1; {3952#(and (<= 1000 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 17:13:07,276 INFO L273 TraceCheckUtils]: 24: Hoare triple {3952#(and (<= 1000 main_~n~0) (<= main_~i~0 1))} assume true; {3952#(and (<= 1000 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 17:13:07,277 INFO L273 TraceCheckUtils]: 25: Hoare triple {3952#(and (<= 1000 main_~n~0) (<= main_~i~0 1))} assume !(~i~0 < ~n~0); {3878#false} is VALID [2018-11-14 17:13:07,277 INFO L273 TraceCheckUtils]: 26: Hoare triple {3878#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3878#false} is VALID [2018-11-14 17:13:07,277 INFO L273 TraceCheckUtils]: 27: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 17:13:07,278 INFO L273 TraceCheckUtils]: 28: Hoare triple {3878#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {3878#false} is VALID [2018-11-14 17:13:07,278 INFO L273 TraceCheckUtils]: 29: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 17:13:07,278 INFO L273 TraceCheckUtils]: 30: Hoare triple {3878#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3878#false} is VALID [2018-11-14 17:13:07,278 INFO L273 TraceCheckUtils]: 31: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 17:13:07,279 INFO L273 TraceCheckUtils]: 32: Hoare triple {3878#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (~n~0 * 4 * ~n~0) + (~n~0 - ~j~0 - 1) * (~n~0 * 4) + (~n~0 - ~k~0 - 1) * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~mem1;~k~0 := ~k~0 + 1; {3878#false} is VALID [2018-11-14 17:13:07,279 INFO L273 TraceCheckUtils]: 33: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 17:13:07,279 INFO L273 TraceCheckUtils]: 34: Hoare triple {3878#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (~n~0 * 4 * ~n~0) + (~n~0 - ~j~0 - 1) * (~n~0 * 4) + (~n~0 - ~k~0 - 1) * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~mem1;~k~0 := ~k~0 + 1; {3878#false} is VALID [2018-11-14 17:13:07,280 INFO L273 TraceCheckUtils]: 35: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 17:13:07,280 INFO L273 TraceCheckUtils]: 36: Hoare triple {3878#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (~n~0 * 4 * ~n~0) + (~n~0 - ~j~0 - 1) * (~n~0 * 4) + (~n~0 - ~k~0 - 1) * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~mem1;~k~0 := ~k~0 + 1; {3878#false} is VALID [2018-11-14 17:13:07,281 INFO L273 TraceCheckUtils]: 37: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 17:13:07,281 INFO L273 TraceCheckUtils]: 38: Hoare triple {3878#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (~n~0 * 4 * ~n~0) + (~n~0 - ~j~0 - 1) * (~n~0 * 4) + (~n~0 - ~k~0 - 1) * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~mem1;~k~0 := ~k~0 + 1; {3878#false} is VALID [2018-11-14 17:13:07,281 INFO L273 TraceCheckUtils]: 39: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 17:13:07,282 INFO L273 TraceCheckUtils]: 40: Hoare triple {3878#false} assume !(~k~0 < ~n~0); {3878#false} is VALID [2018-11-14 17:13:07,282 INFO L273 TraceCheckUtils]: 41: Hoare triple {3878#false} ~j~0 := ~j~0 + 1; {3878#false} is VALID [2018-11-14 17:13:07,282 INFO L273 TraceCheckUtils]: 42: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 17:13:07,282 INFO L273 TraceCheckUtils]: 43: Hoare triple {3878#false} assume !(~j~0 < ~n~0); {3878#false} is VALID [2018-11-14 17:13:07,282 INFO L273 TraceCheckUtils]: 44: Hoare triple {3878#false} ~i~0 := ~i~0 + 1; {3878#false} is VALID [2018-11-14 17:13:07,282 INFO L273 TraceCheckUtils]: 45: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 17:13:07,282 INFO L273 TraceCheckUtils]: 46: Hoare triple {3878#false} assume !(~i~0 < ~n~0); {3878#false} is VALID [2018-11-14 17:13:07,283 INFO L273 TraceCheckUtils]: 47: Hoare triple {3878#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {3878#false} is VALID [2018-11-14 17:13:07,283 INFO L273 TraceCheckUtils]: 48: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 17:13:07,283 INFO L273 TraceCheckUtils]: 49: Hoare triple {3878#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {3878#false} is VALID [2018-11-14 17:13:07,283 INFO L273 TraceCheckUtils]: 50: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 17:13:07,283 INFO L273 TraceCheckUtils]: 51: Hoare triple {3878#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {3878#false} is VALID [2018-11-14 17:13:07,283 INFO L273 TraceCheckUtils]: 52: Hoare triple {3878#false} assume true; {3878#false} is VALID [2018-11-14 17:13:07,284 INFO L273 TraceCheckUtils]: 53: Hoare triple {3878#false} assume !!(~k~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (~n~0 * 4 * ~n~0) + (~n~0 - ~j~0 - 1) * (~n~0 * 4) + (~n~0 - ~k~0 - 1) * 4, 4); {3878#false} is VALID [2018-11-14 17:13:07,284 INFO L256 TraceCheckUtils]: 54: Hoare triple {3878#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {3878#false} is VALID [2018-11-14 17:13:07,284 INFO L273 TraceCheckUtils]: 55: Hoare triple {3878#false} ~cond := #in~cond; {3878#false} is VALID [2018-11-14 17:13:07,284 INFO L273 TraceCheckUtils]: 56: Hoare triple {3878#false} assume ~cond == 0; {3878#false} is VALID [2018-11-14 17:13:07,284 INFO L273 TraceCheckUtils]: 57: Hoare triple {3878#false} assume !false; {3878#false} is VALID [2018-11-14 17:13:07,287 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2018-11-14 17:13:07,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:13:07,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-14 17:13:07,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-11-14 17:13:07,307 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:13:07,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:13:07,342 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:07,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:13:07,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:13:07,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:13:07,343 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand 4 states. [2018-11-14 17:13:07,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:07,861 INFO L93 Difference]: Finished difference Result 168 states and 192 transitions. [2018-11-14 17:13:07,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:13:07,861 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-11-14 17:13:07,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:13:07,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:13:07,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2018-11-14 17:13:07,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:13:07,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 100 transitions. [2018-11-14 17:13:07,865 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 100 transitions. [2018-11-14 17:13:08,493 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:08,496 INFO L225 Difference]: With dead ends: 168 [2018-11-14 17:13:08,497 INFO L226 Difference]: Without dead ends: 114 [2018-11-14 17:13:08,497 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:13:08,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-14 17:13:08,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 98. [2018-11-14 17:13:08,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:13:08,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 98 states. [2018-11-14 17:13:08,619 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 98 states. [2018-11-14 17:13:08,619 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 98 states. [2018-11-14 17:13:08,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:08,624 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2018-11-14 17:13:08,624 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2018-11-14 17:13:08,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:08,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:08,625 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 114 states. [2018-11-14 17:13:08,625 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 114 states. [2018-11-14 17:13:08,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:08,629 INFO L93 Difference]: Finished difference Result 114 states and 129 transitions. [2018-11-14 17:13:08,629 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 129 transitions. [2018-11-14 17:13:08,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:08,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:08,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:13:08,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:13:08,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-14 17:13:08,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2018-11-14 17:13:08,633 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 58 [2018-11-14 17:13:08,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:13:08,633 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2018-11-14 17:13:08,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:13:08,634 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2018-11-14 17:13:08,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-11-14 17:13:08,634 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:13:08,635 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:13:08,635 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:13:08,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:13:08,635 INFO L82 PathProgramCache]: Analyzing trace with hash -511210103, now seen corresponding path program 4 times [2018-11-14 17:13:08,635 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:13:08,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:13:08,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:08,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:13:08,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:08,643 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:13:08,643 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:13:08,643 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:13:08,660 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:13:08,684 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:13:08,684 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:13:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:08,734 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:13:09,215 INFO L256 TraceCheckUtils]: 0: Hoare triple {4663#true} call ULTIMATE.init(); {4663#true} is VALID [2018-11-14 17:13:09,216 INFO L273 TraceCheckUtils]: 1: Hoare triple {4663#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4663#true} is VALID [2018-11-14 17:13:09,216 INFO L273 TraceCheckUtils]: 2: Hoare triple {4663#true} assume true; {4663#true} is VALID [2018-11-14 17:13:09,216 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4663#true} {4663#true} #147#return; {4663#true} is VALID [2018-11-14 17:13:09,217 INFO L256 TraceCheckUtils]: 4: Hoare triple {4663#true} call #t~ret4 := main(); {4663#true} is VALID [2018-11-14 17:13:09,217 INFO L273 TraceCheckUtils]: 5: Hoare triple {4663#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~n~0 := 1000;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);call ~#B~0.base, ~#B~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0 * ~n~0);~i~0 := 0;~j~0 := 0;~k~0 := 0; {4663#true} is VALID [2018-11-14 17:13:09,217 INFO L273 TraceCheckUtils]: 6: Hoare triple {4663#true} assume true; {4663#true} is VALID [2018-11-14 17:13:09,230 INFO L273 TraceCheckUtils]: 7: Hoare triple {4663#true} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {4689#(<= main_~j~0 0)} is VALID [2018-11-14 17:13:09,233 INFO L273 TraceCheckUtils]: 8: Hoare triple {4689#(<= main_~j~0 0)} assume true; {4689#(<= main_~j~0 0)} is VALID [2018-11-14 17:13:09,233 INFO L273 TraceCheckUtils]: 9: Hoare triple {4689#(<= main_~j~0 0)} assume !!(~j~0 < ~n~0);~k~0 := 0; {4689#(<= main_~j~0 0)} is VALID [2018-11-14 17:13:09,234 INFO L273 TraceCheckUtils]: 10: Hoare triple {4689#(<= main_~j~0 0)} assume true; {4689#(<= main_~j~0 0)} is VALID [2018-11-14 17:13:09,234 INFO L273 TraceCheckUtils]: 11: Hoare triple {4689#(<= main_~j~0 0)} assume !!(~k~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {4689#(<= main_~j~0 0)} is VALID [2018-11-14 17:13:09,234 INFO L273 TraceCheckUtils]: 12: Hoare triple {4689#(<= main_~j~0 0)} assume true; {4689#(<= main_~j~0 0)} is VALID [2018-11-14 17:13:09,235 INFO L273 TraceCheckUtils]: 13: Hoare triple {4689#(<= main_~j~0 0)} assume !!(~k~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {4689#(<= main_~j~0 0)} is VALID [2018-11-14 17:13:09,235 INFO L273 TraceCheckUtils]: 14: Hoare triple {4689#(<= main_~j~0 0)} assume true; {4689#(<= main_~j~0 0)} is VALID [2018-11-14 17:13:09,236 INFO L273 TraceCheckUtils]: 15: Hoare triple {4689#(<= main_~j~0 0)} assume !!(~k~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {4689#(<= main_~j~0 0)} is VALID [2018-11-14 17:13:09,236 INFO L273 TraceCheckUtils]: 16: Hoare triple {4689#(<= main_~j~0 0)} assume true; {4689#(<= main_~j~0 0)} is VALID [2018-11-14 17:13:09,236 INFO L273 TraceCheckUtils]: 17: Hoare triple {4689#(<= main_~j~0 0)} assume !!(~k~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {4689#(<= main_~j~0 0)} is VALID [2018-11-14 17:13:09,237 INFO L273 TraceCheckUtils]: 18: Hoare triple {4689#(<= main_~j~0 0)} assume true; {4689#(<= main_~j~0 0)} is VALID [2018-11-14 17:13:09,237 INFO L273 TraceCheckUtils]: 19: Hoare triple {4689#(<= main_~j~0 0)} assume !(~k~0 < ~n~0); {4689#(<= main_~j~0 0)} is VALID [2018-11-14 17:13:09,237 INFO L273 TraceCheckUtils]: 20: Hoare triple {4689#(<= main_~j~0 0)} ~j~0 := ~j~0 + 1; {4729#(<= main_~j~0 1)} is VALID [2018-11-14 17:13:09,239 INFO L273 TraceCheckUtils]: 21: Hoare triple {4729#(<= main_~j~0 1)} assume true; {4729#(<= main_~j~0 1)} is VALID [2018-11-14 17:13:09,240 INFO L273 TraceCheckUtils]: 22: Hoare triple {4729#(<= main_~j~0 1)} assume !(~j~0 < ~n~0); {4736#(<= main_~n~0 1)} is VALID [2018-11-14 17:13:09,240 INFO L273 TraceCheckUtils]: 23: Hoare triple {4736#(<= main_~n~0 1)} ~i~0 := ~i~0 + 1; {4736#(<= main_~n~0 1)} is VALID [2018-11-14 17:13:09,243 INFO L273 TraceCheckUtils]: 24: Hoare triple {4736#(<= main_~n~0 1)} assume true; {4736#(<= main_~n~0 1)} is VALID [2018-11-14 17:13:09,243 INFO L273 TraceCheckUtils]: 25: Hoare triple {4736#(<= main_~n~0 1)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {4736#(<= main_~n~0 1)} is VALID [2018-11-14 17:13:09,243 INFO L273 TraceCheckUtils]: 26: Hoare triple {4736#(<= main_~n~0 1)} assume true; {4736#(<= main_~n~0 1)} is VALID [2018-11-14 17:13:09,244 INFO L273 TraceCheckUtils]: 27: Hoare triple {4736#(<= main_~n~0 1)} assume !!(~j~0 < ~n~0);~k~0 := 0; {4736#(<= main_~n~0 1)} is VALID [2018-11-14 17:13:09,244 INFO L273 TraceCheckUtils]: 28: Hoare triple {4736#(<= main_~n~0 1)} assume true; {4736#(<= main_~n~0 1)} is VALID [2018-11-14 17:13:09,244 INFO L273 TraceCheckUtils]: 29: Hoare triple {4736#(<= main_~n~0 1)} assume !!(~k~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {4736#(<= main_~n~0 1)} is VALID [2018-11-14 17:13:09,245 INFO L273 TraceCheckUtils]: 30: Hoare triple {4736#(<= main_~n~0 1)} assume true; {4736#(<= main_~n~0 1)} is VALID [2018-11-14 17:13:09,245 INFO L273 TraceCheckUtils]: 31: Hoare triple {4736#(<= main_~n~0 1)} assume !!(~k~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {4736#(<= main_~n~0 1)} is VALID [2018-11-14 17:13:09,245 INFO L273 TraceCheckUtils]: 32: Hoare triple {4736#(<= main_~n~0 1)} assume true; {4736#(<= main_~n~0 1)} is VALID [2018-11-14 17:13:09,246 INFO L273 TraceCheckUtils]: 33: Hoare triple {4736#(<= main_~n~0 1)} assume !!(~k~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {4736#(<= main_~n~0 1)} is VALID [2018-11-14 17:13:09,246 INFO L273 TraceCheckUtils]: 34: Hoare triple {4736#(<= main_~n~0 1)} assume true; {4736#(<= main_~n~0 1)} is VALID [2018-11-14 17:13:09,246 INFO L273 TraceCheckUtils]: 35: Hoare triple {4736#(<= main_~n~0 1)} assume !!(~k~0 < ~n~0);assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;call write~int(#t~nondet0, ~#B~0.base, ~#B~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~nondet0;~k~0 := ~k~0 + 1; {4736#(<= main_~n~0 1)} is VALID [2018-11-14 17:13:09,247 INFO L273 TraceCheckUtils]: 36: Hoare triple {4736#(<= main_~n~0 1)} assume true; {4736#(<= main_~n~0 1)} is VALID [2018-11-14 17:13:09,247 INFO L273 TraceCheckUtils]: 37: Hoare triple {4736#(<= main_~n~0 1)} assume !(~k~0 < ~n~0); {4736#(<= main_~n~0 1)} is VALID [2018-11-14 17:13:09,247 INFO L273 TraceCheckUtils]: 38: Hoare triple {4736#(<= main_~n~0 1)} ~j~0 := ~j~0 + 1; {4736#(<= main_~n~0 1)} is VALID [2018-11-14 17:13:09,248 INFO L273 TraceCheckUtils]: 39: Hoare triple {4736#(<= main_~n~0 1)} assume true; {4736#(<= main_~n~0 1)} is VALID [2018-11-14 17:13:09,249 INFO L273 TraceCheckUtils]: 40: Hoare triple {4736#(<= main_~n~0 1)} assume !(~j~0 < ~n~0); {4736#(<= main_~n~0 1)} is VALID [2018-11-14 17:13:09,259 INFO L273 TraceCheckUtils]: 41: Hoare triple {4736#(<= main_~n~0 1)} ~i~0 := ~i~0 + 1; {4736#(<= main_~n~0 1)} is VALID [2018-11-14 17:13:09,259 INFO L273 TraceCheckUtils]: 42: Hoare triple {4736#(<= main_~n~0 1)} assume true; {4736#(<= main_~n~0 1)} is VALID [2018-11-14 17:13:09,259 INFO L273 TraceCheckUtils]: 43: Hoare triple {4736#(<= main_~n~0 1)} assume !(~i~0 < ~n~0); {4736#(<= main_~n~0 1)} is VALID [2018-11-14 17:13:09,260 INFO L273 TraceCheckUtils]: 44: Hoare triple {4736#(<= main_~n~0 1)} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {4736#(<= main_~n~0 1)} is VALID [2018-11-14 17:13:09,260 INFO L273 TraceCheckUtils]: 45: Hoare triple {4736#(<= main_~n~0 1)} assume true; {4736#(<= main_~n~0 1)} is VALID [2018-11-14 17:13:09,261 INFO L273 TraceCheckUtils]: 46: Hoare triple {4736#(<= main_~n~0 1)} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {4736#(<= main_~n~0 1)} is VALID [2018-11-14 17:13:09,261 INFO L273 TraceCheckUtils]: 47: Hoare triple {4736#(<= main_~n~0 1)} assume true; {4736#(<= main_~n~0 1)} is VALID [2018-11-14 17:13:09,262 INFO L273 TraceCheckUtils]: 48: Hoare triple {4736#(<= main_~n~0 1)} assume !!(~j~0 < ~n~0);~k~0 := 0; {4815#(and (<= 0 main_~k~0) (<= main_~n~0 1))} is VALID [2018-11-14 17:13:09,262 INFO L273 TraceCheckUtils]: 49: Hoare triple {4815#(and (<= 0 main_~k~0) (<= main_~n~0 1))} assume true; {4815#(and (<= 0 main_~k~0) (<= main_~n~0 1))} is VALID [2018-11-14 17:13:09,266 INFO L273 TraceCheckUtils]: 50: Hoare triple {4815#(and (<= 0 main_~k~0) (<= main_~n~0 1))} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (~n~0 * 4 * ~n~0) + (~n~0 - ~j~0 - 1) * (~n~0 * 4) + (~n~0 - ~k~0 - 1) * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~mem1;~k~0 := ~k~0 + 1; {4822#(and (<= main_~n~0 1) (<= 1 main_~k~0))} is VALID [2018-11-14 17:13:09,269 INFO L273 TraceCheckUtils]: 51: Hoare triple {4822#(and (<= main_~n~0 1) (<= 1 main_~k~0))} assume true; {4822#(and (<= main_~n~0 1) (<= 1 main_~k~0))} is VALID [2018-11-14 17:13:09,271 INFO L273 TraceCheckUtils]: 52: Hoare triple {4822#(and (<= main_~n~0 1) (<= 1 main_~k~0))} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (~n~0 * 4 * ~n~0) + (~n~0 - ~j~0 - 1) * (~n~0 * 4) + (~n~0 - ~k~0 - 1) * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~mem1;~k~0 := ~k~0 + 1; {4664#false} is VALID [2018-11-14 17:13:09,271 INFO L273 TraceCheckUtils]: 53: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:13:09,271 INFO L273 TraceCheckUtils]: 54: Hoare triple {4664#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (~n~0 * 4 * ~n~0) + (~n~0 - ~j~0 - 1) * (~n~0 * 4) + (~n~0 - ~k~0 - 1) * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~mem1;~k~0 := ~k~0 + 1; {4664#false} is VALID [2018-11-14 17:13:09,271 INFO L273 TraceCheckUtils]: 55: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:13:09,272 INFO L273 TraceCheckUtils]: 56: Hoare triple {4664#false} assume !!(~k~0 < ~n~0);call #t~mem1 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (~n~0 * 4 * ~n~0) + (~n~0 - ~j~0 - 1) * (~n~0 * 4) + (~n~0 - ~k~0 - 1) * 4, 4);call write~int(#t~mem1, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);havoc #t~mem1;~k~0 := ~k~0 + 1; {4664#false} is VALID [2018-11-14 17:13:09,272 INFO L273 TraceCheckUtils]: 57: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:13:09,272 INFO L273 TraceCheckUtils]: 58: Hoare triple {4664#false} assume !(~k~0 < ~n~0); {4664#false} is VALID [2018-11-14 17:13:09,272 INFO L273 TraceCheckUtils]: 59: Hoare triple {4664#false} ~j~0 := ~j~0 + 1; {4664#false} is VALID [2018-11-14 17:13:09,272 INFO L273 TraceCheckUtils]: 60: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:13:09,273 INFO L273 TraceCheckUtils]: 61: Hoare triple {4664#false} assume !(~j~0 < ~n~0); {4664#false} is VALID [2018-11-14 17:13:09,273 INFO L273 TraceCheckUtils]: 62: Hoare triple {4664#false} ~i~0 := ~i~0 + 1; {4664#false} is VALID [2018-11-14 17:13:09,273 INFO L273 TraceCheckUtils]: 63: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:13:09,273 INFO L273 TraceCheckUtils]: 64: Hoare triple {4664#false} assume !(~i~0 < ~n~0); {4664#false} is VALID [2018-11-14 17:13:09,274 INFO L273 TraceCheckUtils]: 65: Hoare triple {4664#false} ~i~0 := 0;~j~0 := 0;~k~0 := 0; {4664#false} is VALID [2018-11-14 17:13:09,274 INFO L273 TraceCheckUtils]: 66: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:13:09,274 INFO L273 TraceCheckUtils]: 67: Hoare triple {4664#false} assume !!(~i~0 < ~n~0);~j~0 := 0;~k~0 := 0; {4664#false} is VALID [2018-11-14 17:13:09,274 INFO L273 TraceCheckUtils]: 68: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:13:09,274 INFO L273 TraceCheckUtils]: 69: Hoare triple {4664#false} assume !!(~j~0 < ~n~0);~k~0 := 0; {4664#false} is VALID [2018-11-14 17:13:09,275 INFO L273 TraceCheckUtils]: 70: Hoare triple {4664#false} assume true; {4664#false} is VALID [2018-11-14 17:13:09,275 INFO L273 TraceCheckUtils]: 71: Hoare triple {4664#false} assume !!(~k~0 < ~n~0);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4 * ~n~0) + ~j~0 * (~n~0 * 4) + ~k~0 * 4, 4);call #t~mem3 := read~int(~#B~0.base, ~#B~0.offset + (~n~0 - ~i~0 - 1) * (~n~0 * 4 * ~n~0) + (~n~0 - ~j~0 - 1) * (~n~0 * 4) + (~n~0 - ~k~0 - 1) * 4, 4); {4664#false} is VALID [2018-11-14 17:13:09,275 INFO L256 TraceCheckUtils]: 72: Hoare triple {4664#false} call __VERIFIER_assert((if #t~mem2 == #t~mem3 then 1 else 0)); {4664#false} is VALID [2018-11-14 17:13:09,275 INFO L273 TraceCheckUtils]: 73: Hoare triple {4664#false} ~cond := #in~cond; {4664#false} is VALID [2018-11-14 17:13:09,276 INFO L273 TraceCheckUtils]: 74: Hoare triple {4664#false} assume ~cond == 0; {4664#false} is VALID [2018-11-14 17:13:09,276 INFO L273 TraceCheckUtils]: 75: Hoare triple {4664#false} assume !false; {4664#false} is VALID [2018-11-14 17:13:09,288 INFO L134 CoverageAnalysis]: Checked inductivity of 134 backedges. 22 proven. 61 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2018-11-14 17:13:09,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:13:09,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-14 17:13:09,317 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-11-14 17:13:09,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:13:09,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:13:09,372 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-14 17:13:09,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:13:09,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:13:09,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:13:09,373 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand 7 states. [2018-11-14 17:13:10,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:10,296 INFO L93 Difference]: Finished difference Result 322 states and 369 transitions. [2018-11-14 17:13:10,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:13:10,296 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-11-14 17:13:10,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:13:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:13:10,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2018-11-14 17:13:10,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:13:10,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 179 transitions. [2018-11-14 17:13:10,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 179 transitions. [2018-11-14 17:13:10,647 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:10,655 INFO L225 Difference]: With dead ends: 322 [2018-11-14 17:13:10,656 INFO L226 Difference]: Without dead ends: 226 [2018-11-14 17:13:10,656 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:13:10,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-11-14 17:13:11,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 170. [2018-11-14 17:13:11,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:13:11,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand 170 states. [2018-11-14 17:13:11,122 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand 170 states. [2018-11-14 17:13:11,122 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 170 states. [2018-11-14 17:13:11,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:11,130 INFO L93 Difference]: Finished difference Result 226 states and 257 transitions. [2018-11-14 17:13:11,130 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 257 transitions. [2018-11-14 17:13:11,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:11,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:11,132 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 226 states. [2018-11-14 17:13:11,132 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 226 states. [2018-11-14 17:13:11,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:11,139 INFO L93 Difference]: Finished difference Result 226 states and 257 transitions. [2018-11-14 17:13:11,139 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 257 transitions. [2018-11-14 17:13:11,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:11,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:11,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:13:11,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:13:11,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-14 17:13:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 193 transitions. [2018-11-14 17:13:11,144 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 193 transitions. Word has length 76 [2018-11-14 17:13:11,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:13:11,144 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 193 transitions. [2018-11-14 17:13:11,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:13:11,145 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 193 transitions. [2018-11-14 17:13:11,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-14 17:13:11,146 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:13:11,146 INFO L375 BasicCegarLoop]: trace histogram [20, 16, 6, 5, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:13:11,146 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:13:11,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:13:11,147 INFO L82 PathProgramCache]: Analyzing trace with hash 977785561, now seen corresponding path program 5 times [2018-11-14 17:13:11,147 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:13:11,147 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:13:11,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:11,148 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:13:11,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:11,155 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:13:11,156 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:13:11,156 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-11-14 17:13:11,187 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1