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/transpose-u_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:13:00,576 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:13:00,578 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:13:00,589 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:13:00,590 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:13:00,591 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:13:00,592 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:13:00,594 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:13:00,596 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:13:00,596 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:13:00,597 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:13:00,598 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:13:00,599 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:13:00,600 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:13:00,601 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:13:00,601 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:13:00,602 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:13:00,604 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:13:00,607 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:13:00,608 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:13:00,609 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:13:00,610 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:13:00,614 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:13:00,614 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:13:00,615 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:13:00,616 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:13:00,619 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:13:00,620 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:13:00,621 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:13:00,625 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:13:00,625 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:13:00,628 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:13:00,628 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:13:00,628 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:13:00,629 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:13:00,632 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:13:00,632 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:13:00,651 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:13:00,651 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:13:00,652 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:13:00,652 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:13:00,653 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:13:00,653 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:13:00,653 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:13:00,653 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:13:00,653 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:13:00,654 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:13:00,654 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:13:00,654 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:13:00,654 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:13:00,654 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:13:00,654 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:13:00,655 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:13:00,655 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:13:00,655 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:13:00,655 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:13:00,655 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:13:00,656 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:13:00,656 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:13:00,656 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:13:00,656 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:13:00,656 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:13:00,657 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:13:00,657 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:13:00,657 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:13:00,657 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:13:00,657 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:13:00,700 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:13:00,712 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:13:00,716 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:13:00,718 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:13:00,718 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:13:00,719 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-multidimensional/transpose-u_true-unreach-call.i [2018-11-14 17:13:00,777 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5485d1c1b/ae2eeabaf31a4f3495eed77fa4904f14/FLAGcf9f92be5 [2018-11-14 17:13:01,216 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:13:01,217 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-multidimensional/transpose-u_true-unreach-call.i [2018-11-14 17:13:01,227 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5485d1c1b/ae2eeabaf31a4f3495eed77fa4904f14/FLAGcf9f92be5 [2018-11-14 17:13:01,244 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5485d1c1b/ae2eeabaf31a4f3495eed77fa4904f14 [2018-11-14 17:13:01,254 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:13:01,255 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:13:01,257 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:13:01,257 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:13:01,260 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:13:01,262 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:13:01" (1/1) ... [2018-11-14 17:13:01,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65124975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:13:01, skipping insertion in model container [2018-11-14 17:13:01,265 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:13:01" (1/1) ... [2018-11-14 17:13:01,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:13:01,307 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:13:01,561 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:13:01,566 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:13:01,596 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:13:01,622 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:13:01,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:13:01 WrapperNode [2018-11-14 17:13:01,622 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:13:01,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:13:01,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:13:01,623 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:13:01,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:13:01" (1/1) ... [2018-11-14 17:13:01,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:13:01" (1/1) ... [2018-11-14 17:13:01,644 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:13:01" (1/1) ... [2018-11-14 17:13:01,644 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:13:01" (1/1) ... [2018-11-14 17:13:01,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:13:01" (1/1) ... [2018-11-14 17:13:01,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:13:01" (1/1) ... [2018-11-14 17:13:01,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:13:01" (1/1) ... [2018-11-14 17:13:01,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:13:01,669 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:13:01,669 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:13:01,669 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:13:01,670 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:13:01" (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:13:01,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:13:01,801 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:13:01,801 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:13:01,801 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:13:01,801 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:13:01,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:13:01,802 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:13:01,802 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:13:01,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:13:01,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:13:01,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:13:01,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:13:01,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:13:01,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:13:01,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:13:02,572 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:13:02,573 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:13:02 BoogieIcfgContainer [2018-11-14 17:13:02,573 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:13:02,574 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:13:02,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:13:02,577 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:13:02,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:13:01" (1/3) ... [2018-11-14 17:13:02,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20743e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:13:02, skipping insertion in model container [2018-11-14 17:13:02,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:13:01" (2/3) ... [2018-11-14 17:13:02,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20743e68 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:13:02, skipping insertion in model container [2018-11-14 17:13:02,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:13:02" (3/3) ... [2018-11-14 17:13:02,581 INFO L112 eAbstractionObserver]: Analyzing ICFG transpose-u_true-unreach-call.i [2018-11-14 17:13:02,590 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:13:02,597 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:13:02,615 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:13:02,648 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:13:02,649 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:13:02,649 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:13:02,649 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:13:02,649 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:13:02,649 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:13:02,649 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:13:02,650 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:13:02,650 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:13:02,670 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-11-14 17:13:02,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-14 17:13:02,677 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:13:02,678 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:13:02,680 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:13:02,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:13:02,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1357915043, now seen corresponding path program 1 times [2018-11-14 17:13:02,690 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:13:02,690 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:13:02,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:02,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:13:02,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:02,789 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:13:02,789 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:13:02,789 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:13:02,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:13:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:02,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:13:02,960 INFO L256 TraceCheckUtils]: 0: Hoare triple {41#true} call ULTIMATE.init(); {41#true} is VALID [2018-11-14 17:13:02,963 INFO L273 TraceCheckUtils]: 1: Hoare triple {41#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {41#true} is VALID [2018-11-14 17:13:02,964 INFO L273 TraceCheckUtils]: 2: Hoare triple {41#true} assume true; {41#true} is VALID [2018-11-14 17:13:02,964 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {41#true} {41#true} #105#return; {41#true} is VALID [2018-11-14 17:13:02,965 INFO L256 TraceCheckUtils]: 4: Hoare triple {41#true} call #t~ret8 := main(); {41#true} is VALID [2018-11-14 17:13:02,965 INFO L273 TraceCheckUtils]: 5: Hoare triple {41#true} havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := 1000;~m~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);~i~0 := 0; {41#true} is VALID [2018-11-14 17:13:02,968 INFO L273 TraceCheckUtils]: 6: Hoare triple {41#true} assume !true; {42#false} is VALID [2018-11-14 17:13:02,968 INFO L273 TraceCheckUtils]: 7: Hoare triple {42#false} ~i~0 := 0;~j~0 := 0; {42#false} is VALID [2018-11-14 17:13:02,968 INFO L273 TraceCheckUtils]: 8: Hoare triple {42#false} assume !true; {42#false} is VALID [2018-11-14 17:13:02,969 INFO L273 TraceCheckUtils]: 9: Hoare triple {42#false} ~i~0 := 0; {42#false} is VALID [2018-11-14 17:13:02,969 INFO L273 TraceCheckUtils]: 10: Hoare triple {42#false} assume true; {42#false} is VALID [2018-11-14 17:13:02,969 INFO L273 TraceCheckUtils]: 11: Hoare triple {42#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {42#false} is VALID [2018-11-14 17:13:02,969 INFO L273 TraceCheckUtils]: 12: Hoare triple {42#false} assume true; {42#false} is VALID [2018-11-14 17:13:02,970 INFO L273 TraceCheckUtils]: 13: Hoare triple {42#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem7 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {42#false} is VALID [2018-11-14 17:13:02,970 INFO L256 TraceCheckUtils]: 14: Hoare triple {42#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {42#false} is VALID [2018-11-14 17:13:02,971 INFO L273 TraceCheckUtils]: 15: Hoare triple {42#false} ~cond := #in~cond; {42#false} is VALID [2018-11-14 17:13:02,971 INFO L273 TraceCheckUtils]: 16: Hoare triple {42#false} assume ~cond == 0; {42#false} is VALID [2018-11-14 17:13:02,971 INFO L273 TraceCheckUtils]: 17: Hoare triple {42#false} assume !false; {42#false} is VALID [2018-11-14 17:13:02,975 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:13:03,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:13:03,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:13:03,009 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 17:13:03,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:13:03,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:13:03,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:03,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:13:03,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:13:03,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:13:03,223 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2018-11-14 17:13:03,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:03,462 INFO L93 Difference]: Finished difference Result 70 states and 95 transitions. [2018-11-14 17:13:03,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:13:03,463 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2018-11-14 17:13:03,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:13:03,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:13:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 95 transitions. [2018-11-14 17:13:03,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:13:03,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 95 transitions. [2018-11-14 17:13:03,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 95 transitions. [2018-11-14 17:13:03,807 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:03,823 INFO L225 Difference]: With dead ends: 70 [2018-11-14 17:13:03,823 INFO L226 Difference]: Without dead ends: 33 [2018-11-14 17:13:03,829 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:13:03,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-14 17:13:04,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-11-14 17:13:04,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:13:04,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 33 states. [2018-11-14 17:13:04,029 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 17:13:04,029 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 17:13:04,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:04,041 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-14 17:13:04,041 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-14 17:13:04,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:04,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:04,043 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 33 states. [2018-11-14 17:13:04,043 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 33 states. [2018-11-14 17:13:04,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:04,055 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-11-14 17:13:04,055 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-14 17:13:04,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:04,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:04,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:13:04,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:13:04,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-14 17:13:04,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-11-14 17:13:04,070 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 18 [2018-11-14 17:13:04,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:13:04,071 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-14 17:13:04,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:13:04,071 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-14 17:13:04,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 17:13:04,072 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:13:04,074 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:13:04,074 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:13:04,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:13:04,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1741814892, now seen corresponding path program 1 times [2018-11-14 17:13:04,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:13:04,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:13:04,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:04,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:13:04,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:04,090 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:13:04,090 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:13:04,090 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:13:04,111 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:13:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:04,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:04,167 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:13:04,622 INFO L256 TraceCheckUtils]: 0: Hoare triple {297#true} call ULTIMATE.init(); {297#true} is VALID [2018-11-14 17:13:04,622 INFO L273 TraceCheckUtils]: 1: Hoare triple {297#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {297#true} is VALID [2018-11-14 17:13:04,623 INFO L273 TraceCheckUtils]: 2: Hoare triple {297#true} assume true; {297#true} is VALID [2018-11-14 17:13:04,623 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {297#true} {297#true} #105#return; {297#true} is VALID [2018-11-14 17:13:04,624 INFO L256 TraceCheckUtils]: 4: Hoare triple {297#true} call #t~ret8 := main(); {297#true} is VALID [2018-11-14 17:13:04,634 INFO L273 TraceCheckUtils]: 5: Hoare triple {297#true} havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := 1000;~m~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);~i~0 := 0; {317#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:04,636 INFO L273 TraceCheckUtils]: 6: Hoare triple {317#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume true; {317#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:04,637 INFO L273 TraceCheckUtils]: 7: Hoare triple {317#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !(~i~0 < ~n~0); {298#false} is VALID [2018-11-14 17:13:04,637 INFO L273 TraceCheckUtils]: 8: Hoare triple {298#false} ~i~0 := 0;~j~0 := 0; {298#false} is VALID [2018-11-14 17:13:04,637 INFO L273 TraceCheckUtils]: 9: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 17:13:04,637 INFO L273 TraceCheckUtils]: 10: Hoare triple {298#false} assume !(~i~0 < ~n~0); {298#false} is VALID [2018-11-14 17:13:04,638 INFO L273 TraceCheckUtils]: 11: Hoare triple {298#false} ~i~0 := 0; {298#false} is VALID [2018-11-14 17:13:04,638 INFO L273 TraceCheckUtils]: 12: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 17:13:04,638 INFO L273 TraceCheckUtils]: 13: Hoare triple {298#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {298#false} is VALID [2018-11-14 17:13:04,639 INFO L273 TraceCheckUtils]: 14: Hoare triple {298#false} assume true; {298#false} is VALID [2018-11-14 17:13:04,639 INFO L273 TraceCheckUtils]: 15: Hoare triple {298#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem7 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {298#false} is VALID [2018-11-14 17:13:04,639 INFO L256 TraceCheckUtils]: 16: Hoare triple {298#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {298#false} is VALID [2018-11-14 17:13:04,639 INFO L273 TraceCheckUtils]: 17: Hoare triple {298#false} ~cond := #in~cond; {298#false} is VALID [2018-11-14 17:13:04,640 INFO L273 TraceCheckUtils]: 18: Hoare triple {298#false} assume ~cond == 0; {298#false} is VALID [2018-11-14 17:13:04,640 INFO L273 TraceCheckUtils]: 19: Hoare triple {298#false} assume !false; {298#false} is VALID [2018-11-14 17:13:04,643 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:13:04,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:13:04,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:13:04,673 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 17:13:04,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:13:04,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:13:04,717 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:13:04,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:13:04,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:13:04,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:13:04,718 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 3 states. [2018-11-14 17:13:05,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:05,166 INFO L93 Difference]: Finished difference Result 60 states and 70 transitions. [2018-11-14 17:13:05,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:13:05,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 17:13:05,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:13:05,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:13:05,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2018-11-14 17:13:05,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:13:05,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2018-11-14 17:13:05,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2018-11-14 17:13:05,373 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:05,377 INFO L225 Difference]: With dead ends: 60 [2018-11-14 17:13:05,377 INFO L226 Difference]: Without dead ends: 39 [2018-11-14 17:13:05,378 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:13:05,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-11-14 17:13:05,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2018-11-14 17:13:05,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:13:05,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 35 states. [2018-11-14 17:13:05,400 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 35 states. [2018-11-14 17:13:05,400 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 35 states. [2018-11-14 17:13:05,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:05,403 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-11-14 17:13:05,404 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-11-14 17:13:05,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:05,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:05,405 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 39 states. [2018-11-14 17:13:05,405 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 39 states. [2018-11-14 17:13:05,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:05,408 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2018-11-14 17:13:05,408 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-11-14 17:13:05,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:05,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:05,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:13:05,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:13:05,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-14 17:13:05,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-11-14 17:13:05,413 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 20 [2018-11-14 17:13:05,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:13:05,413 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-14 17:13:05,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:13:05,413 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-11-14 17:13:05,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 17:13:05,414 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:13:05,415 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:13:05,415 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:13:05,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:13:05,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1347988783, now seen corresponding path program 1 times [2018-11-14 17:13:05,416 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:13:05,416 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:13:05,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:05,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:13:05,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:05,424 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:13:05,425 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:13:05,425 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:05,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:13:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:05,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:05,476 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:13:05,618 INFO L256 TraceCheckUtils]: 0: Hoare triple {565#true} call ULTIMATE.init(); {565#true} is VALID [2018-11-14 17:13:05,618 INFO L273 TraceCheckUtils]: 1: Hoare triple {565#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {565#true} is VALID [2018-11-14 17:13:05,619 INFO L273 TraceCheckUtils]: 2: Hoare triple {565#true} assume true; {565#true} is VALID [2018-11-14 17:13:05,619 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {565#true} {565#true} #105#return; {565#true} is VALID [2018-11-14 17:13:05,620 INFO L256 TraceCheckUtils]: 4: Hoare triple {565#true} call #t~ret8 := main(); {565#true} is VALID [2018-11-14 17:13:05,625 INFO L273 TraceCheckUtils]: 5: Hoare triple {565#true} havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := 1000;~m~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);~i~0 := 0; {585#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:05,625 INFO L273 TraceCheckUtils]: 6: Hoare triple {585#(<= 1000 main_~n~0)} assume true; {585#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:05,626 INFO L273 TraceCheckUtils]: 7: Hoare triple {585#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0; {592#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:13:05,627 INFO L273 TraceCheckUtils]: 8: Hoare triple {592#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} assume true; {592#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:13:05,627 INFO L273 TraceCheckUtils]: 9: Hoare triple {592#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} assume !(~j~0 < ~n~0); {566#false} is VALID [2018-11-14 17:13:05,628 INFO L273 TraceCheckUtils]: 10: Hoare triple {566#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {566#false} is VALID [2018-11-14 17:13:05,628 INFO L273 TraceCheckUtils]: 11: Hoare triple {566#false} assume true; {566#false} is VALID [2018-11-14 17:13:05,628 INFO L273 TraceCheckUtils]: 12: Hoare triple {566#false} assume !(~i~0 < ~n~0); {566#false} is VALID [2018-11-14 17:13:05,628 INFO L273 TraceCheckUtils]: 13: Hoare triple {566#false} ~i~0 := 0;~j~0 := 0; {566#false} is VALID [2018-11-14 17:13:05,629 INFO L273 TraceCheckUtils]: 14: Hoare triple {566#false} assume true; {566#false} is VALID [2018-11-14 17:13:05,629 INFO L273 TraceCheckUtils]: 15: Hoare triple {566#false} assume !(~i~0 < ~n~0); {566#false} is VALID [2018-11-14 17:13:05,629 INFO L273 TraceCheckUtils]: 16: Hoare triple {566#false} ~i~0 := 0; {566#false} is VALID [2018-11-14 17:13:05,630 INFO L273 TraceCheckUtils]: 17: Hoare triple {566#false} assume true; {566#false} is VALID [2018-11-14 17:13:05,630 INFO L273 TraceCheckUtils]: 18: Hoare triple {566#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {566#false} is VALID [2018-11-14 17:13:05,631 INFO L273 TraceCheckUtils]: 19: Hoare triple {566#false} assume true; {566#false} is VALID [2018-11-14 17:13:05,632 INFO L273 TraceCheckUtils]: 20: Hoare triple {566#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem7 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {566#false} is VALID [2018-11-14 17:13:05,632 INFO L256 TraceCheckUtils]: 21: Hoare triple {566#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {566#false} is VALID [2018-11-14 17:13:05,632 INFO L273 TraceCheckUtils]: 22: Hoare triple {566#false} ~cond := #in~cond; {566#false} is VALID [2018-11-14 17:13:05,632 INFO L273 TraceCheckUtils]: 23: Hoare triple {566#false} assume ~cond == 0; {566#false} is VALID [2018-11-14 17:13:05,633 INFO L273 TraceCheckUtils]: 24: Hoare triple {566#false} assume !false; {566#false} is VALID [2018-11-14 17:13:05,635 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:05,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:13:05,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:13:05,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-14 17:13:05,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:13:05,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:13:05,697 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:05,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:13:05,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:13:05,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:13:05,698 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand 4 states. [2018-11-14 17:13:05,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:05,983 INFO L93 Difference]: Finished difference Result 77 states and 92 transitions. [2018-11-14 17:13:05,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:13:05,983 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-14 17:13:05,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:13:05,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:13:05,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2018-11-14 17:13:05,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:13:05,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 90 transitions. [2018-11-14 17:13:05,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 90 transitions. [2018-11-14 17:13:06,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:06,172 INFO L225 Difference]: With dead ends: 77 [2018-11-14 17:13:06,172 INFO L226 Difference]: Without dead ends: 50 [2018-11-14 17:13:06,173 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:13:06,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-14 17:13:06,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2018-11-14 17:13:06,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:13:06,207 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 41 states. [2018-11-14 17:13:06,207 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 41 states. [2018-11-14 17:13:06,207 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 41 states. [2018-11-14 17:13:06,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:06,213 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-11-14 17:13:06,213 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-11-14 17:13:06,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:06,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:06,214 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 50 states. [2018-11-14 17:13:06,215 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 50 states. [2018-11-14 17:13:06,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:06,218 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2018-11-14 17:13:06,218 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2018-11-14 17:13:06,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:06,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:06,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:13:06,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:13:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-14 17:13:06,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-11-14 17:13:06,222 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 25 [2018-11-14 17:13:06,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:13:06,223 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-14 17:13:06,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:13:06,223 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-14 17:13:06,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-14 17:13:06,224 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:13:06,224 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] [2018-11-14 17:13:06,225 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:13:06,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:13:06,225 INFO L82 PathProgramCache]: Analyzing trace with hash 791530751, now seen corresponding path program 1 times [2018-11-14 17:13:06,225 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:13:06,225 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:13:06,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:06,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:13:06,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:06,234 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:13:06,234 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:13:06,234 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:06,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:13:06,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:06,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:06,299 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:13:06,443 INFO L256 TraceCheckUtils]: 0: Hoare triple {904#true} call ULTIMATE.init(); {904#true} is VALID [2018-11-14 17:13:06,444 INFO L273 TraceCheckUtils]: 1: Hoare triple {904#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {904#true} is VALID [2018-11-14 17:13:06,445 INFO L273 TraceCheckUtils]: 2: Hoare triple {904#true} assume true; {904#true} is VALID [2018-11-14 17:13:06,445 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {904#true} {904#true} #105#return; {904#true} is VALID [2018-11-14 17:13:06,446 INFO L256 TraceCheckUtils]: 4: Hoare triple {904#true} call #t~ret8 := main(); {904#true} is VALID [2018-11-14 17:13:06,447 INFO L273 TraceCheckUtils]: 5: Hoare triple {904#true} havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := 1000;~m~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);~i~0 := 0; {924#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:06,448 INFO L273 TraceCheckUtils]: 6: Hoare triple {924#(<= 1000 main_~n~0)} assume true; {924#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:06,448 INFO L273 TraceCheckUtils]: 7: Hoare triple {924#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0; {931#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:13:06,449 INFO L273 TraceCheckUtils]: 8: Hoare triple {931#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} assume true; {931#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:13:06,450 INFO L273 TraceCheckUtils]: 9: Hoare triple {931#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2; {931#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:13:06,451 INFO L273 TraceCheckUtils]: 10: Hoare triple {931#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} #t~post1 := ~j~0;~j~0 := #t~post1 + 1;havoc #t~post1; {941#(and (<= main_~j~0 1) (<= 1000 main_~n~0))} is VALID [2018-11-14 17:13:06,452 INFO L273 TraceCheckUtils]: 11: Hoare triple {941#(and (<= main_~j~0 1) (<= 1000 main_~n~0))} assume true; {941#(and (<= main_~j~0 1) (<= 1000 main_~n~0))} is VALID [2018-11-14 17:13:06,453 INFO L273 TraceCheckUtils]: 12: Hoare triple {941#(and (<= main_~j~0 1) (<= 1000 main_~n~0))} assume !(~j~0 < ~n~0); {905#false} is VALID [2018-11-14 17:13:06,453 INFO L273 TraceCheckUtils]: 13: Hoare triple {905#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {905#false} is VALID [2018-11-14 17:13:06,454 INFO L273 TraceCheckUtils]: 14: Hoare triple {905#false} assume true; {905#false} is VALID [2018-11-14 17:13:06,454 INFO L273 TraceCheckUtils]: 15: Hoare triple {905#false} assume !(~i~0 < ~n~0); {905#false} is VALID [2018-11-14 17:13:06,454 INFO L273 TraceCheckUtils]: 16: Hoare triple {905#false} ~i~0 := 0;~j~0 := 0; {905#false} is VALID [2018-11-14 17:13:06,455 INFO L273 TraceCheckUtils]: 17: Hoare triple {905#false} assume true; {905#false} is VALID [2018-11-14 17:13:06,455 INFO L273 TraceCheckUtils]: 18: Hoare triple {905#false} assume !(~i~0 < ~n~0); {905#false} is VALID [2018-11-14 17:13:06,455 INFO L273 TraceCheckUtils]: 19: Hoare triple {905#false} ~i~0 := 0; {905#false} is VALID [2018-11-14 17:13:06,456 INFO L273 TraceCheckUtils]: 20: Hoare triple {905#false} assume true; {905#false} is VALID [2018-11-14 17:13:06,456 INFO L273 TraceCheckUtils]: 21: Hoare triple {905#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {905#false} is VALID [2018-11-14 17:13:06,456 INFO L273 TraceCheckUtils]: 22: Hoare triple {905#false} assume true; {905#false} is VALID [2018-11-14 17:13:06,457 INFO L273 TraceCheckUtils]: 23: Hoare triple {905#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem7 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {905#false} is VALID [2018-11-14 17:13:06,457 INFO L256 TraceCheckUtils]: 24: Hoare triple {905#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {905#false} is VALID [2018-11-14 17:13:06,457 INFO L273 TraceCheckUtils]: 25: Hoare triple {905#false} ~cond := #in~cond; {905#false} is VALID [2018-11-14 17:13:06,457 INFO L273 TraceCheckUtils]: 26: Hoare triple {905#false} assume ~cond == 0; {905#false} is VALID [2018-11-14 17:13:06,458 INFO L273 TraceCheckUtils]: 27: Hoare triple {905#false} assume !false; {905#false} is VALID [2018-11-14 17:13:06,459 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:13:06,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:13:06,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-11-14 17:13:06,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-14 17:13:06,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:13:06,481 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:13:06,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:06,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:13:06,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:13:06,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:13:06,524 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand 5 states. [2018-11-14 17:13:06,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:06,981 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2018-11-14 17:13:06,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:13:06,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-11-14 17:13:06,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:13:06,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:13:06,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2018-11-14 17:13:06,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:13:06,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 101 transitions. [2018-11-14 17:13:06,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 101 transitions. [2018-11-14 17:13:07,107 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:07,111 INFO L225 Difference]: With dead ends: 93 [2018-11-14 17:13:07,111 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 17:13:07,112 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 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:07,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 17:13:07,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 51. [2018-11-14 17:13:07,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:13:07,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 51 states. [2018-11-14 17:13:07,169 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 51 states. [2018-11-14 17:13:07,169 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 51 states. [2018-11-14 17:13:07,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:07,173 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-14 17:13:07,174 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-11-14 17:13:07,175 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:07,175 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:07,175 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 60 states. [2018-11-14 17:13:07,175 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 60 states. [2018-11-14 17:13:07,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:07,179 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-14 17:13:07,179 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 68 transitions. [2018-11-14 17:13:07,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:07,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:07,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:13:07,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:13:07,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-14 17:13:07,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-11-14 17:13:07,184 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 28 [2018-11-14 17:13:07,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:13:07,184 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-11-14 17:13:07,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:13:07,185 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-11-14 17:13:07,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-14 17:13:07,186 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:13:07,186 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] [2018-11-14 17:13:07,186 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:13:07,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:13:07,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1903295505, now seen corresponding path program 2 times [2018-11-14 17:13:07,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:13:07,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:13:07,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:07,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:13:07,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:07,199 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:13:07,199 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:13:07,199 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:07,223 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:13:07,238 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 17:13:07,239 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:13:07,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:07,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:13:07,388 INFO L256 TraceCheckUtils]: 0: Hoare triple {1310#true} call ULTIMATE.init(); {1310#true} is VALID [2018-11-14 17:13:07,388 INFO L273 TraceCheckUtils]: 1: Hoare triple {1310#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1310#true} is VALID [2018-11-14 17:13:07,389 INFO L273 TraceCheckUtils]: 2: Hoare triple {1310#true} assume true; {1310#true} is VALID [2018-11-14 17:13:07,389 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1310#true} {1310#true} #105#return; {1310#true} is VALID [2018-11-14 17:13:07,389 INFO L256 TraceCheckUtils]: 4: Hoare triple {1310#true} call #t~ret8 := main(); {1310#true} is VALID [2018-11-14 17:13:07,390 INFO L273 TraceCheckUtils]: 5: Hoare triple {1310#true} havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := 1000;~m~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);~i~0 := 0; {1330#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:07,391 INFO L273 TraceCheckUtils]: 6: Hoare triple {1330#(<= 1000 main_~n~0)} assume true; {1330#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:07,391 INFO L273 TraceCheckUtils]: 7: Hoare triple {1330#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0; {1330#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:07,392 INFO L273 TraceCheckUtils]: 8: Hoare triple {1330#(<= 1000 main_~n~0)} assume true; {1330#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:07,392 INFO L273 TraceCheckUtils]: 9: Hoare triple {1330#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2; {1330#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:07,394 INFO L273 TraceCheckUtils]: 10: Hoare triple {1330#(<= 1000 main_~n~0)} #t~post1 := ~j~0;~j~0 := #t~post1 + 1;havoc #t~post1; {1330#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:07,394 INFO L273 TraceCheckUtils]: 11: Hoare triple {1330#(<= 1000 main_~n~0)} assume true; {1330#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:07,395 INFO L273 TraceCheckUtils]: 12: Hoare triple {1330#(<= 1000 main_~n~0)} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2; {1330#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:07,395 INFO L273 TraceCheckUtils]: 13: Hoare triple {1330#(<= 1000 main_~n~0)} #t~post1 := ~j~0;~j~0 := #t~post1 + 1;havoc #t~post1; {1330#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:07,396 INFO L273 TraceCheckUtils]: 14: Hoare triple {1330#(<= 1000 main_~n~0)} assume true; {1330#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:07,403 INFO L273 TraceCheckUtils]: 15: Hoare triple {1330#(<= 1000 main_~n~0)} assume !(~j~0 < ~n~0); {1330#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:07,403 INFO L273 TraceCheckUtils]: 16: Hoare triple {1330#(<= 1000 main_~n~0)} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1330#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:07,407 INFO L273 TraceCheckUtils]: 17: Hoare triple {1330#(<= 1000 main_~n~0)} assume true; {1330#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:07,408 INFO L273 TraceCheckUtils]: 18: Hoare triple {1330#(<= 1000 main_~n~0)} assume !(~i~0 < ~n~0); {1330#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:07,409 INFO L273 TraceCheckUtils]: 19: Hoare triple {1330#(<= 1000 main_~n~0)} ~i~0 := 0;~j~0 := 0; {1373#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:07,409 INFO L273 TraceCheckUtils]: 20: Hoare triple {1373#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume true; {1373#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:07,411 INFO L273 TraceCheckUtils]: 21: Hoare triple {1373#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !(~i~0 < ~n~0); {1311#false} is VALID [2018-11-14 17:13:07,411 INFO L273 TraceCheckUtils]: 22: Hoare triple {1311#false} ~i~0 := 0; {1311#false} is VALID [2018-11-14 17:13:07,412 INFO L273 TraceCheckUtils]: 23: Hoare triple {1311#false} assume true; {1311#false} is VALID [2018-11-14 17:13:07,412 INFO L273 TraceCheckUtils]: 24: Hoare triple {1311#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {1311#false} is VALID [2018-11-14 17:13:07,412 INFO L273 TraceCheckUtils]: 25: Hoare triple {1311#false} assume true; {1311#false} is VALID [2018-11-14 17:13:07,413 INFO L273 TraceCheckUtils]: 26: Hoare triple {1311#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem7 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {1311#false} is VALID [2018-11-14 17:13:07,413 INFO L256 TraceCheckUtils]: 27: Hoare triple {1311#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1311#false} is VALID [2018-11-14 17:13:07,414 INFO L273 TraceCheckUtils]: 28: Hoare triple {1311#false} ~cond := #in~cond; {1311#false} is VALID [2018-11-14 17:13:07,414 INFO L273 TraceCheckUtils]: 29: Hoare triple {1311#false} assume ~cond == 0; {1311#false} is VALID [2018-11-14 17:13:07,414 INFO L273 TraceCheckUtils]: 30: Hoare triple {1311#false} assume !false; {1311#false} is VALID [2018-11-14 17:13:07,417 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-11-14 17:13:07,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:13:07,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:13:07,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-11-14 17:13:07,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:13:07,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:13:07,485 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:07,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:13:07,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:13:07,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:13:07,486 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 4 states. [2018-11-14 17:13:07,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:07,888 INFO L93 Difference]: Finished difference Result 106 states and 120 transitions. [2018-11-14 17:13:07,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:13:07,889 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-11-14 17:13:07,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:13:07,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:13:07,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2018-11-14 17:13:07,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:13:07,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 78 transitions. [2018-11-14 17:13:07,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 78 transitions. [2018-11-14 17:13:08,028 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:08,032 INFO L225 Difference]: With dead ends: 106 [2018-11-14 17:13:08,032 INFO L226 Difference]: Without dead ends: 84 [2018-11-14 17:13:08,033 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 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,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-14 17:13:08,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 53. [2018-11-14 17:13:08,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:13:08,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 53 states. [2018-11-14 17:13:08,093 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 53 states. [2018-11-14 17:13:08,094 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 53 states. [2018-11-14 17:13:08,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:08,099 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2018-11-14 17:13:08,099 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2018-11-14 17:13:08,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:08,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:08,100 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 84 states. [2018-11-14 17:13:08,100 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 84 states. [2018-11-14 17:13:08,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:08,105 INFO L93 Difference]: Finished difference Result 84 states and 95 transitions. [2018-11-14 17:13:08,105 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 95 transitions. [2018-11-14 17:13:08,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:08,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:08,106 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:13:08,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:13:08,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-14 17:13:08,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2018-11-14 17:13:08,109 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 31 [2018-11-14 17:13:08,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:13:08,109 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2018-11-14 17:13:08,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:13:08,110 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2018-11-14 17:13:08,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-14 17:13:08,111 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:13:08,111 INFO L375 BasicCegarLoop]: trace histogram [3, 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] [2018-11-14 17:13:08,111 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:13:08,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:13:08,112 INFO L82 PathProgramCache]: Analyzing trace with hash 528777144, now seen corresponding path program 1 times [2018-11-14 17:13:08,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:13:08,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:13:08,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:08,113 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:13:08,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:08,119 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:13:08,120 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:13:08,120 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:08,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:13:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:08,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:08,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:13:08,312 INFO L256 TraceCheckUtils]: 0: Hoare triple {1794#true} call ULTIMATE.init(); {1794#true} is VALID [2018-11-14 17:13:08,312 INFO L273 TraceCheckUtils]: 1: Hoare triple {1794#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1794#true} is VALID [2018-11-14 17:13:08,313 INFO L273 TraceCheckUtils]: 2: Hoare triple {1794#true} assume true; {1794#true} is VALID [2018-11-14 17:13:08,314 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1794#true} {1794#true} #105#return; {1794#true} is VALID [2018-11-14 17:13:08,314 INFO L256 TraceCheckUtils]: 4: Hoare triple {1794#true} call #t~ret8 := main(); {1794#true} is VALID [2018-11-14 17:13:08,316 INFO L273 TraceCheckUtils]: 5: Hoare triple {1794#true} havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := 1000;~m~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);~i~0 := 0; {1814#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:08,319 INFO L273 TraceCheckUtils]: 6: Hoare triple {1814#(<= 1000 main_~n~0)} assume true; {1814#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:08,321 INFO L273 TraceCheckUtils]: 7: Hoare triple {1814#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0; {1821#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:13:08,322 INFO L273 TraceCheckUtils]: 8: Hoare triple {1821#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} assume true; {1821#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:13:08,323 INFO L273 TraceCheckUtils]: 9: Hoare triple {1821#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2; {1821#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:13:08,323 INFO L273 TraceCheckUtils]: 10: Hoare triple {1821#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} #t~post1 := ~j~0;~j~0 := #t~post1 + 1;havoc #t~post1; {1831#(and (<= main_~j~0 1) (<= 1000 main_~n~0))} is VALID [2018-11-14 17:13:08,324 INFO L273 TraceCheckUtils]: 11: Hoare triple {1831#(and (<= main_~j~0 1) (<= 1000 main_~n~0))} assume true; {1831#(and (<= main_~j~0 1) (<= 1000 main_~n~0))} is VALID [2018-11-14 17:13:08,325 INFO L273 TraceCheckUtils]: 12: Hoare triple {1831#(and (<= main_~j~0 1) (<= 1000 main_~n~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2; {1831#(and (<= main_~j~0 1) (<= 1000 main_~n~0))} is VALID [2018-11-14 17:13:08,326 INFO L273 TraceCheckUtils]: 13: Hoare triple {1831#(and (<= main_~j~0 1) (<= 1000 main_~n~0))} #t~post1 := ~j~0;~j~0 := #t~post1 + 1;havoc #t~post1; {1841#(and (<= 1000 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 17:13:08,327 INFO L273 TraceCheckUtils]: 14: Hoare triple {1841#(and (<= 1000 main_~n~0) (<= main_~j~0 2))} assume true; {1841#(and (<= 1000 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 17:13:08,328 INFO L273 TraceCheckUtils]: 15: Hoare triple {1841#(and (<= 1000 main_~n~0) (<= main_~j~0 2))} assume !(~j~0 < ~n~0); {1795#false} is VALID [2018-11-14 17:13:08,328 INFO L273 TraceCheckUtils]: 16: Hoare triple {1795#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {1795#false} is VALID [2018-11-14 17:13:08,329 INFO L273 TraceCheckUtils]: 17: Hoare triple {1795#false} assume true; {1795#false} is VALID [2018-11-14 17:13:08,329 INFO L273 TraceCheckUtils]: 18: Hoare triple {1795#false} assume !(~i~0 < ~n~0); {1795#false} is VALID [2018-11-14 17:13:08,329 INFO L273 TraceCheckUtils]: 19: Hoare triple {1795#false} ~i~0 := 0;~j~0 := 0; {1795#false} is VALID [2018-11-14 17:13:08,330 INFO L273 TraceCheckUtils]: 20: Hoare triple {1795#false} assume true; {1795#false} is VALID [2018-11-14 17:13:08,330 INFO L273 TraceCheckUtils]: 21: Hoare triple {1795#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {1795#false} is VALID [2018-11-14 17:13:08,331 INFO L273 TraceCheckUtils]: 22: Hoare triple {1795#false} assume true; {1795#false} is VALID [2018-11-14 17:13:08,331 INFO L273 TraceCheckUtils]: 23: Hoare triple {1795#false} assume !!(~j~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem3, ~#C~0.base, ~#C~0.offset + ~j~0 * (~n~0 * 4) + ~i~0 * 4, 4);havoc #t~mem3;~j~0 := ~j~0 + 1; {1795#false} is VALID [2018-11-14 17:13:08,332 INFO L273 TraceCheckUtils]: 24: Hoare triple {1795#false} assume true; {1795#false} is VALID [2018-11-14 17:13:08,332 INFO L273 TraceCheckUtils]: 25: Hoare triple {1795#false} assume !!(~j~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem3, ~#C~0.base, ~#C~0.offset + ~j~0 * (~n~0 * 4) + ~i~0 * 4, 4);havoc #t~mem3;~j~0 := ~j~0 + 1; {1795#false} is VALID [2018-11-14 17:13:08,332 INFO L273 TraceCheckUtils]: 26: Hoare triple {1795#false} assume true; {1795#false} is VALID [2018-11-14 17:13:08,332 INFO L273 TraceCheckUtils]: 27: Hoare triple {1795#false} assume !(~j~0 < ~n~0); {1795#false} is VALID [2018-11-14 17:13:08,333 INFO L273 TraceCheckUtils]: 28: Hoare triple {1795#false} ~i~0 := ~i~0 + 1; {1795#false} is VALID [2018-11-14 17:13:08,333 INFO L273 TraceCheckUtils]: 29: Hoare triple {1795#false} assume true; {1795#false} is VALID [2018-11-14 17:13:08,333 INFO L273 TraceCheckUtils]: 30: Hoare triple {1795#false} assume !(~i~0 < ~n~0); {1795#false} is VALID [2018-11-14 17:13:08,334 INFO L273 TraceCheckUtils]: 31: Hoare triple {1795#false} ~i~0 := 0; {1795#false} is VALID [2018-11-14 17:13:08,334 INFO L273 TraceCheckUtils]: 32: Hoare triple {1795#false} assume true; {1795#false} is VALID [2018-11-14 17:13:08,334 INFO L273 TraceCheckUtils]: 33: Hoare triple {1795#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {1795#false} is VALID [2018-11-14 17:13:08,334 INFO L273 TraceCheckUtils]: 34: Hoare triple {1795#false} assume true; {1795#false} is VALID [2018-11-14 17:13:08,335 INFO L273 TraceCheckUtils]: 35: Hoare triple {1795#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem7 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {1795#false} is VALID [2018-11-14 17:13:08,335 INFO L256 TraceCheckUtils]: 36: Hoare triple {1795#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {1795#false} is VALID [2018-11-14 17:13:08,335 INFO L273 TraceCheckUtils]: 37: Hoare triple {1795#false} ~cond := #in~cond; {1795#false} is VALID [2018-11-14 17:13:08,335 INFO L273 TraceCheckUtils]: 38: Hoare triple {1795#false} assume ~cond == 0; {1795#false} is VALID [2018-11-14 17:13:08,336 INFO L273 TraceCheckUtils]: 39: Hoare triple {1795#false} assume !false; {1795#false} is VALID [2018-11-14 17:13:08,339 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 17:13:08,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:13:08,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-11-14 17:13:08,365 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-14 17:13:08,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:13:08,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:13:08,462 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:08,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:13:08,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:13:08,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:13:08,464 INFO L87 Difference]: Start difference. First operand 53 states and 59 transitions. Second operand 6 states. [2018-11-14 17:13:08,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:08,942 INFO L93 Difference]: Finished difference Result 112 states and 129 transitions. [2018-11-14 17:13:08,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:13:08,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-11-14 17:13:08,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:13:08,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:13:08,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2018-11-14 17:13:08,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:13:08,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 108 transitions. [2018-11-14 17:13:08,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 108 transitions. [2018-11-14 17:13:09,155 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:09,157 INFO L225 Difference]: With dead ends: 112 [2018-11-14 17:13:09,157 INFO L226 Difference]: Without dead ends: 67 [2018-11-14 17:13:09,158 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 35 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:09,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-14 17:13:09,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2018-11-14 17:13:09,255 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:13:09,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 63 states. [2018-11-14 17:13:09,255 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 63 states. [2018-11-14 17:13:09,255 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 63 states. [2018-11-14 17:13:09,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:09,259 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-11-14 17:13:09,259 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2018-11-14 17:13:09,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:09,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:09,260 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 67 states. [2018-11-14 17:13:09,260 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 67 states. [2018-11-14 17:13:09,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:09,263 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2018-11-14 17:13:09,264 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2018-11-14 17:13:09,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:09,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:09,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:13:09,265 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:13:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-11-14 17:13:09,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2018-11-14 17:13:09,268 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 40 [2018-11-14 17:13:09,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:13:09,268 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2018-11-14 17:13:09,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:13:09,268 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2018-11-14 17:13:09,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-14 17:13:09,269 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:13:09,270 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:13:09,270 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:13:09,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:13:09,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2087055600, now seen corresponding path program 2 times [2018-11-14 17:13:09,271 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:13:09,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:13:09,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:09,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:13:09,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:09,278 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:13:09,279 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:13:09,279 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:09,298 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-14 17:13:09,322 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:13:09,322 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:13:09,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:09,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:13:09,596 INFO L256 TraceCheckUtils]: 0: Hoare triple {2295#true} call ULTIMATE.init(); {2295#true} is VALID [2018-11-14 17:13:09,596 INFO L273 TraceCheckUtils]: 1: Hoare triple {2295#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2295#true} is VALID [2018-11-14 17:13:09,597 INFO L273 TraceCheckUtils]: 2: Hoare triple {2295#true} assume true; {2295#true} is VALID [2018-11-14 17:13:09,597 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2295#true} {2295#true} #105#return; {2295#true} is VALID [2018-11-14 17:13:09,598 INFO L256 TraceCheckUtils]: 4: Hoare triple {2295#true} call #t~ret8 := main(); {2295#true} is VALID [2018-11-14 17:13:09,599 INFO L273 TraceCheckUtils]: 5: Hoare triple {2295#true} havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := 1000;~m~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);~i~0 := 0; {2315#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:09,599 INFO L273 TraceCheckUtils]: 6: Hoare triple {2315#(<= 1000 main_~n~0)} assume true; {2315#(<= 1000 main_~n~0)} is VALID [2018-11-14 17:13:09,600 INFO L273 TraceCheckUtils]: 7: Hoare triple {2315#(<= 1000 main_~n~0)} assume !!(~i~0 < ~n~0);~j~0 := 0; {2322#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:13:09,600 INFO L273 TraceCheckUtils]: 8: Hoare triple {2322#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} assume true; {2322#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:13:09,601 INFO L273 TraceCheckUtils]: 9: Hoare triple {2322#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2; {2322#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} is VALID [2018-11-14 17:13:09,603 INFO L273 TraceCheckUtils]: 10: Hoare triple {2322#(and (<= 1000 main_~n~0) (<= main_~j~0 0))} #t~post1 := ~j~0;~j~0 := #t~post1 + 1;havoc #t~post1; {2332#(and (<= main_~j~0 1) (<= 1000 main_~n~0))} is VALID [2018-11-14 17:13:09,603 INFO L273 TraceCheckUtils]: 11: Hoare triple {2332#(and (<= main_~j~0 1) (<= 1000 main_~n~0))} assume true; {2332#(and (<= main_~j~0 1) (<= 1000 main_~n~0))} is VALID [2018-11-14 17:13:09,605 INFO L273 TraceCheckUtils]: 12: Hoare triple {2332#(and (<= main_~j~0 1) (<= 1000 main_~n~0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2; {2332#(and (<= main_~j~0 1) (<= 1000 main_~n~0))} is VALID [2018-11-14 17:13:09,606 INFO L273 TraceCheckUtils]: 13: Hoare triple {2332#(and (<= main_~j~0 1) (<= 1000 main_~n~0))} #t~post1 := ~j~0;~j~0 := #t~post1 + 1;havoc #t~post1; {2342#(and (<= 1000 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 17:13:09,607 INFO L273 TraceCheckUtils]: 14: Hoare triple {2342#(and (<= 1000 main_~n~0) (<= main_~j~0 2))} assume true; {2342#(and (<= 1000 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 17:13:09,608 INFO L273 TraceCheckUtils]: 15: Hoare triple {2342#(and (<= 1000 main_~n~0) (<= main_~j~0 2))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2; {2342#(and (<= 1000 main_~n~0) (<= main_~j~0 2))} is VALID [2018-11-14 17:13:09,609 INFO L273 TraceCheckUtils]: 16: Hoare triple {2342#(and (<= 1000 main_~n~0) (<= main_~j~0 2))} #t~post1 := ~j~0;~j~0 := #t~post1 + 1;havoc #t~post1; {2352#(and (<= main_~j~0 3) (<= 1000 main_~n~0))} is VALID [2018-11-14 17:13:09,610 INFO L273 TraceCheckUtils]: 17: Hoare triple {2352#(and (<= main_~j~0 3) (<= 1000 main_~n~0))} assume true; {2352#(and (<= main_~j~0 3) (<= 1000 main_~n~0))} is VALID [2018-11-14 17:13:09,611 INFO L273 TraceCheckUtils]: 18: Hoare triple {2352#(and (<= main_~j~0 3) (<= 1000 main_~n~0))} assume !(~j~0 < ~n~0); {2296#false} is VALID [2018-11-14 17:13:09,611 INFO L273 TraceCheckUtils]: 19: Hoare triple {2296#false} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2296#false} is VALID [2018-11-14 17:13:09,611 INFO L273 TraceCheckUtils]: 20: Hoare triple {2296#false} assume true; {2296#false} is VALID [2018-11-14 17:13:09,612 INFO L273 TraceCheckUtils]: 21: Hoare triple {2296#false} assume !(~i~0 < ~n~0); {2296#false} is VALID [2018-11-14 17:13:09,612 INFO L273 TraceCheckUtils]: 22: Hoare triple {2296#false} ~i~0 := 0;~j~0 := 0; {2296#false} is VALID [2018-11-14 17:13:09,612 INFO L273 TraceCheckUtils]: 23: Hoare triple {2296#false} assume true; {2296#false} is VALID [2018-11-14 17:13:09,613 INFO L273 TraceCheckUtils]: 24: Hoare triple {2296#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {2296#false} is VALID [2018-11-14 17:13:09,613 INFO L273 TraceCheckUtils]: 25: Hoare triple {2296#false} assume true; {2296#false} is VALID [2018-11-14 17:13:09,614 INFO L273 TraceCheckUtils]: 26: Hoare triple {2296#false} assume !!(~j~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem3, ~#C~0.base, ~#C~0.offset + ~j~0 * (~n~0 * 4) + ~i~0 * 4, 4);havoc #t~mem3;~j~0 := ~j~0 + 1; {2296#false} is VALID [2018-11-14 17:13:09,614 INFO L273 TraceCheckUtils]: 27: Hoare triple {2296#false} assume true; {2296#false} is VALID [2018-11-14 17:13:09,614 INFO L273 TraceCheckUtils]: 28: Hoare triple {2296#false} assume !!(~j~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem3, ~#C~0.base, ~#C~0.offset + ~j~0 * (~n~0 * 4) + ~i~0 * 4, 4);havoc #t~mem3;~j~0 := ~j~0 + 1; {2296#false} is VALID [2018-11-14 17:13:09,615 INFO L273 TraceCheckUtils]: 29: Hoare triple {2296#false} assume true; {2296#false} is VALID [2018-11-14 17:13:09,615 INFO L273 TraceCheckUtils]: 30: Hoare triple {2296#false} assume !!(~j~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem3, ~#C~0.base, ~#C~0.offset + ~j~0 * (~n~0 * 4) + ~i~0 * 4, 4);havoc #t~mem3;~j~0 := ~j~0 + 1; {2296#false} is VALID [2018-11-14 17:13:09,615 INFO L273 TraceCheckUtils]: 31: Hoare triple {2296#false} assume true; {2296#false} is VALID [2018-11-14 17:13:09,615 INFO L273 TraceCheckUtils]: 32: Hoare triple {2296#false} assume !(~j~0 < ~n~0); {2296#false} is VALID [2018-11-14 17:13:09,616 INFO L273 TraceCheckUtils]: 33: Hoare triple {2296#false} ~i~0 := ~i~0 + 1; {2296#false} is VALID [2018-11-14 17:13:09,616 INFO L273 TraceCheckUtils]: 34: Hoare triple {2296#false} assume true; {2296#false} is VALID [2018-11-14 17:13:09,616 INFO L273 TraceCheckUtils]: 35: Hoare triple {2296#false} assume !(~i~0 < ~n~0); {2296#false} is VALID [2018-11-14 17:13:09,616 INFO L273 TraceCheckUtils]: 36: Hoare triple {2296#false} ~i~0 := 0; {2296#false} is VALID [2018-11-14 17:13:09,616 INFO L273 TraceCheckUtils]: 37: Hoare triple {2296#false} assume true; {2296#false} is VALID [2018-11-14 17:13:09,617 INFO L273 TraceCheckUtils]: 38: Hoare triple {2296#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {2296#false} is VALID [2018-11-14 17:13:09,617 INFO L273 TraceCheckUtils]: 39: Hoare triple {2296#false} assume true; {2296#false} is VALID [2018-11-14 17:13:09,617 INFO L273 TraceCheckUtils]: 40: Hoare triple {2296#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem7 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {2296#false} is VALID [2018-11-14 17:13:09,617 INFO L256 TraceCheckUtils]: 41: Hoare triple {2296#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2296#false} is VALID [2018-11-14 17:13:09,618 INFO L273 TraceCheckUtils]: 42: Hoare triple {2296#false} ~cond := #in~cond; {2296#false} is VALID [2018-11-14 17:13:09,618 INFO L273 TraceCheckUtils]: 43: Hoare triple {2296#false} assume ~cond == 0; {2296#false} is VALID [2018-11-14 17:13:09,618 INFO L273 TraceCheckUtils]: 44: Hoare triple {2296#false} assume !false; {2296#false} is VALID [2018-11-14 17:13:09,622 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-14 17:13:09,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:13:09,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-11-14 17:13:09,645 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-11-14 17:13:09,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:13:09,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 17:13:09,688 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:09,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 17:13:09,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 17:13:09,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:13:09,689 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand 7 states. [2018-11-14 17:13:10,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:10,415 INFO L93 Difference]: Finished difference Result 132 states and 151 transitions. [2018-11-14 17:13:10,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 17:13:10,415 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-11-14 17:13:10,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:13:10,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:13:10,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2018-11-14 17:13:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 17:13:10,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 119 transitions. [2018-11-14 17:13:10,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 119 transitions. [2018-11-14 17:13:10,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:10,569 INFO L225 Difference]: With dead ends: 132 [2018-11-14 17:13:10,569 INFO L226 Difference]: Without dead ends: 77 [2018-11-14 17:13:10,570 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:13:10,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-14 17:13:10,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 73. [2018-11-14 17:13:10,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:13:10,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 73 states. [2018-11-14 17:13:10,625 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 73 states. [2018-11-14 17:13:10,626 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 73 states. [2018-11-14 17:13:10,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:10,629 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2018-11-14 17:13:10,630 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-11-14 17:13:10,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:10,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:10,630 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 77 states. [2018-11-14 17:13:10,631 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 77 states. [2018-11-14 17:13:10,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:10,634 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2018-11-14 17:13:10,634 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 86 transitions. [2018-11-14 17:13:10,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:10,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:10,635 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:13:10,635 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:13:10,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-11-14 17:13:10,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 81 transitions. [2018-11-14 17:13:10,638 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 81 transitions. Word has length 45 [2018-11-14 17:13:10,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:13:10,638 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 81 transitions. [2018-11-14 17:13:10,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 17:13:10,638 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 81 transitions. [2018-11-14 17:13:10,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-14 17:13:10,639 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:13:10,639 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:13:10,640 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:13:10,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:13:10,640 INFO L82 PathProgramCache]: Analyzing trace with hash 7671876, now seen corresponding path program 3 times [2018-11-14 17:13:10,640 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:13:10,640 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:13:10,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:10,641 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:13:10,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:10,650 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:13:10,650 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:13:10,650 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:10,667 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-14 17:13:10,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 17:13:10,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:13:10,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:10,715 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:13:11,293 INFO L256 TraceCheckUtils]: 0: Hoare triple {2874#true} call ULTIMATE.init(); {2874#true} is VALID [2018-11-14 17:13:11,293 INFO L273 TraceCheckUtils]: 1: Hoare triple {2874#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2874#true} is VALID [2018-11-14 17:13:11,294 INFO L273 TraceCheckUtils]: 2: Hoare triple {2874#true} assume true; {2874#true} is VALID [2018-11-14 17:13:11,294 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2874#true} {2874#true} #105#return; {2874#true} is VALID [2018-11-14 17:13:11,294 INFO L256 TraceCheckUtils]: 4: Hoare triple {2874#true} call #t~ret8 := main(); {2874#true} is VALID [2018-11-14 17:13:11,295 INFO L273 TraceCheckUtils]: 5: Hoare triple {2874#true} havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := 1000;~m~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);~i~0 := 0; {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:11,296 INFO L273 TraceCheckUtils]: 6: Hoare triple {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume true; {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:11,296 INFO L273 TraceCheckUtils]: 7: Hoare triple {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~i~0 < ~n~0);~j~0 := 0; {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:11,297 INFO L273 TraceCheckUtils]: 8: Hoare triple {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume true; {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:11,298 INFO L273 TraceCheckUtils]: 9: Hoare triple {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2; {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:11,301 INFO L273 TraceCheckUtils]: 10: Hoare triple {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} #t~post1 := ~j~0;~j~0 := #t~post1 + 1;havoc #t~post1; {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:11,302 INFO L273 TraceCheckUtils]: 11: Hoare triple {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume true; {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:11,302 INFO L273 TraceCheckUtils]: 12: Hoare triple {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2; {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:11,303 INFO L273 TraceCheckUtils]: 13: Hoare triple {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} #t~post1 := ~j~0;~j~0 := #t~post1 + 1;havoc #t~post1; {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:11,303 INFO L273 TraceCheckUtils]: 14: Hoare triple {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume true; {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:11,304 INFO L273 TraceCheckUtils]: 15: Hoare triple {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2; {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:11,305 INFO L273 TraceCheckUtils]: 16: Hoare triple {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} #t~post1 := ~j~0;~j~0 := #t~post1 + 1;havoc #t~post1; {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:11,306 INFO L273 TraceCheckUtils]: 17: Hoare triple {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume true; {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:11,306 INFO L273 TraceCheckUtils]: 18: Hoare triple {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2; {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:11,307 INFO L273 TraceCheckUtils]: 19: Hoare triple {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} #t~post1 := ~j~0;~j~0 := #t~post1 + 1;havoc #t~post1; {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:11,308 INFO L273 TraceCheckUtils]: 20: Hoare triple {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume true; {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:11,309 INFO L273 TraceCheckUtils]: 21: Hoare triple {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} assume !(~j~0 < ~n~0); {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:11,309 INFO L273 TraceCheckUtils]: 22: Hoare triple {2894#(and (<= 1000 main_~n~0) (<= main_~i~0 0))} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {2946#(and (<= 1000 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 17:13:11,310 INFO L273 TraceCheckUtils]: 23: Hoare triple {2946#(and (<= 1000 main_~n~0) (<= main_~i~0 1))} assume true; {2946#(and (<= 1000 main_~n~0) (<= main_~i~0 1))} is VALID [2018-11-14 17:13:11,311 INFO L273 TraceCheckUtils]: 24: Hoare triple {2946#(and (<= 1000 main_~n~0) (<= main_~i~0 1))} assume !(~i~0 < ~n~0); {2875#false} is VALID [2018-11-14 17:13:11,312 INFO L273 TraceCheckUtils]: 25: Hoare triple {2875#false} ~i~0 := 0;~j~0 := 0; {2875#false} is VALID [2018-11-14 17:13:11,312 INFO L273 TraceCheckUtils]: 26: Hoare triple {2875#false} assume true; {2875#false} is VALID [2018-11-14 17:13:11,312 INFO L273 TraceCheckUtils]: 27: Hoare triple {2875#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {2875#false} is VALID [2018-11-14 17:13:11,312 INFO L273 TraceCheckUtils]: 28: Hoare triple {2875#false} assume true; {2875#false} is VALID [2018-11-14 17:13:11,313 INFO L273 TraceCheckUtils]: 29: Hoare triple {2875#false} assume !!(~j~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem3, ~#C~0.base, ~#C~0.offset + ~j~0 * (~n~0 * 4) + ~i~0 * 4, 4);havoc #t~mem3;~j~0 := ~j~0 + 1; {2875#false} is VALID [2018-11-14 17:13:11,313 INFO L273 TraceCheckUtils]: 30: Hoare triple {2875#false} assume true; {2875#false} is VALID [2018-11-14 17:13:11,313 INFO L273 TraceCheckUtils]: 31: Hoare triple {2875#false} assume !!(~j~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem3, ~#C~0.base, ~#C~0.offset + ~j~0 * (~n~0 * 4) + ~i~0 * 4, 4);havoc #t~mem3;~j~0 := ~j~0 + 1; {2875#false} is VALID [2018-11-14 17:13:11,313 INFO L273 TraceCheckUtils]: 32: Hoare triple {2875#false} assume true; {2875#false} is VALID [2018-11-14 17:13:11,314 INFO L273 TraceCheckUtils]: 33: Hoare triple {2875#false} assume !!(~j~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem3, ~#C~0.base, ~#C~0.offset + ~j~0 * (~n~0 * 4) + ~i~0 * 4, 4);havoc #t~mem3;~j~0 := ~j~0 + 1; {2875#false} is VALID [2018-11-14 17:13:11,314 INFO L273 TraceCheckUtils]: 34: Hoare triple {2875#false} assume true; {2875#false} is VALID [2018-11-14 17:13:11,314 INFO L273 TraceCheckUtils]: 35: Hoare triple {2875#false} assume !!(~j~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem3, ~#C~0.base, ~#C~0.offset + ~j~0 * (~n~0 * 4) + ~i~0 * 4, 4);havoc #t~mem3;~j~0 := ~j~0 + 1; {2875#false} is VALID [2018-11-14 17:13:11,314 INFO L273 TraceCheckUtils]: 36: Hoare triple {2875#false} assume true; {2875#false} is VALID [2018-11-14 17:13:11,314 INFO L273 TraceCheckUtils]: 37: Hoare triple {2875#false} assume !(~j~0 < ~n~0); {2875#false} is VALID [2018-11-14 17:13:11,314 INFO L273 TraceCheckUtils]: 38: Hoare triple {2875#false} ~i~0 := ~i~0 + 1; {2875#false} is VALID [2018-11-14 17:13:11,315 INFO L273 TraceCheckUtils]: 39: Hoare triple {2875#false} assume true; {2875#false} is VALID [2018-11-14 17:13:11,315 INFO L273 TraceCheckUtils]: 40: Hoare triple {2875#false} assume !(~i~0 < ~n~0); {2875#false} is VALID [2018-11-14 17:13:11,315 INFO L273 TraceCheckUtils]: 41: Hoare triple {2875#false} ~i~0 := 0; {2875#false} is VALID [2018-11-14 17:13:11,315 INFO L273 TraceCheckUtils]: 42: Hoare triple {2875#false} assume true; {2875#false} is VALID [2018-11-14 17:13:11,315 INFO L273 TraceCheckUtils]: 43: Hoare triple {2875#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {2875#false} is VALID [2018-11-14 17:13:11,315 INFO L273 TraceCheckUtils]: 44: Hoare triple {2875#false} assume true; {2875#false} is VALID [2018-11-14 17:13:11,316 INFO L273 TraceCheckUtils]: 45: Hoare triple {2875#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem7 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {2875#false} is VALID [2018-11-14 17:13:11,316 INFO L256 TraceCheckUtils]: 46: Hoare triple {2875#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {2875#false} is VALID [2018-11-14 17:13:11,316 INFO L273 TraceCheckUtils]: 47: Hoare triple {2875#false} ~cond := #in~cond; {2875#false} is VALID [2018-11-14 17:13:11,316 INFO L273 TraceCheckUtils]: 48: Hoare triple {2875#false} assume ~cond == 0; {2875#false} is VALID [2018-11-14 17:13:11,317 INFO L273 TraceCheckUtils]: 49: Hoare triple {2875#false} assume !false; {2875#false} is VALID [2018-11-14 17:13:11,320 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2018-11-14 17:13:11,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:13:11,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-11-14 17:13:11,350 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-11-14 17:13:11,351 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:13:11,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:13:11,392 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:11,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:13:11,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:13:11,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:13:11,394 INFO L87 Difference]: Start difference. First operand 73 states and 81 transitions. Second operand 4 states. [2018-11-14 17:13:11,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:11,619 INFO L93 Difference]: Finished difference Result 153 states and 170 transitions. [2018-11-14 17:13:11,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:13:11,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2018-11-14 17:13:11,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:13:11,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:13:11,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2018-11-14 17:13:11,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:13:11,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 77 transitions. [2018-11-14 17:13:11,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 77 transitions. [2018-11-14 17:13:11,725 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:11,727 INFO L225 Difference]: With dead ends: 153 [2018-11-14 17:13:11,727 INFO L226 Difference]: Without dead ends: 105 [2018-11-14 17:13:11,728 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:13:11,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-14 17:13:11,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 90. [2018-11-14 17:13:11,835 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:13:11,835 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 90 states. [2018-11-14 17:13:11,835 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 90 states. [2018-11-14 17:13:11,835 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 90 states. [2018-11-14 17:13:11,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:11,843 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2018-11-14 17:13:11,843 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2018-11-14 17:13:11,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:11,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:11,844 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 105 states. [2018-11-14 17:13:11,844 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 105 states. [2018-11-14 17:13:11,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:11,848 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2018-11-14 17:13:11,848 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2018-11-14 17:13:11,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:11,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:11,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:13:11,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:13:11,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-14 17:13:11,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 99 transitions. [2018-11-14 17:13:11,852 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 99 transitions. Word has length 50 [2018-11-14 17:13:11,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:13:11,852 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 99 transitions. [2018-11-14 17:13:11,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:13:11,853 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 99 transitions. [2018-11-14 17:13:11,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-14 17:13:11,854 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:13:11,854 INFO L375 BasicCegarLoop]: trace histogram [10, 8, 8, 5, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:13:11,854 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:13:11,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:13:11,854 INFO L82 PathProgramCache]: Analyzing trace with hash 327145793, now seen corresponding path program 4 times [2018-11-14 17:13:11,855 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:13:11,855 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:13:11,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:11,856 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:13:11,856 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:11,864 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:13:11,865 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:13:11,865 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:11,877 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 17:13:11,901 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 17:13:11,901 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:13:11,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:13:11,939 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:13:12,213 INFO L256 TraceCheckUtils]: 0: Hoare triple {3573#true} call ULTIMATE.init(); {3573#true} is VALID [2018-11-14 17:13:12,214 INFO L273 TraceCheckUtils]: 1: Hoare triple {3573#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3573#true} is VALID [2018-11-14 17:13:12,214 INFO L273 TraceCheckUtils]: 2: Hoare triple {3573#true} assume true; {3573#true} is VALID [2018-11-14 17:13:12,214 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3573#true} {3573#true} #105#return; {3573#true} is VALID [2018-11-14 17:13:12,215 INFO L256 TraceCheckUtils]: 4: Hoare triple {3573#true} call #t~ret8 := main(); {3573#true} is VALID [2018-11-14 17:13:12,215 INFO L273 TraceCheckUtils]: 5: Hoare triple {3573#true} havoc ~i~0;havoc ~k~0;havoc ~j~0;~n~0 := 1000;~m~0 := 1800;call ~#A~0.base, ~#A~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);call ~#C~0.base, ~#C~0.offset := #Ultimate.alloc(~n~0 * 4 * ~n~0);~i~0 := 0; {3573#true} is VALID [2018-11-14 17:13:12,215 INFO L273 TraceCheckUtils]: 6: Hoare triple {3573#true} assume true; {3573#true} is VALID [2018-11-14 17:13:12,215 INFO L273 TraceCheckUtils]: 7: Hoare triple {3573#true} assume !!(~i~0 < ~n~0);~j~0 := 0; {3573#true} is VALID [2018-11-14 17:13:12,216 INFO L273 TraceCheckUtils]: 8: Hoare triple {3573#true} assume true; {3573#true} is VALID [2018-11-14 17:13:12,216 INFO L273 TraceCheckUtils]: 9: Hoare triple {3573#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2; {3573#true} is VALID [2018-11-14 17:13:12,216 INFO L273 TraceCheckUtils]: 10: Hoare triple {3573#true} #t~post1 := ~j~0;~j~0 := #t~post1 + 1;havoc #t~post1; {3573#true} is VALID [2018-11-14 17:13:12,216 INFO L273 TraceCheckUtils]: 11: Hoare triple {3573#true} assume true; {3573#true} is VALID [2018-11-14 17:13:12,217 INFO L273 TraceCheckUtils]: 12: Hoare triple {3573#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2; {3573#true} is VALID [2018-11-14 17:13:12,217 INFO L273 TraceCheckUtils]: 13: Hoare triple {3573#true} #t~post1 := ~j~0;~j~0 := #t~post1 + 1;havoc #t~post1; {3573#true} is VALID [2018-11-14 17:13:12,217 INFO L273 TraceCheckUtils]: 14: Hoare triple {3573#true} assume true; {3573#true} is VALID [2018-11-14 17:13:12,217 INFO L273 TraceCheckUtils]: 15: Hoare triple {3573#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2; {3573#true} is VALID [2018-11-14 17:13:12,218 INFO L273 TraceCheckUtils]: 16: Hoare triple {3573#true} #t~post1 := ~j~0;~j~0 := #t~post1 + 1;havoc #t~post1; {3573#true} is VALID [2018-11-14 17:13:12,218 INFO L273 TraceCheckUtils]: 17: Hoare triple {3573#true} assume true; {3573#true} is VALID [2018-11-14 17:13:12,218 INFO L273 TraceCheckUtils]: 18: Hoare triple {3573#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2; {3573#true} is VALID [2018-11-14 17:13:12,218 INFO L273 TraceCheckUtils]: 19: Hoare triple {3573#true} #t~post1 := ~j~0;~j~0 := #t~post1 + 1;havoc #t~post1; {3573#true} is VALID [2018-11-14 17:13:12,218 INFO L273 TraceCheckUtils]: 20: Hoare triple {3573#true} assume true; {3573#true} is VALID [2018-11-14 17:13:12,219 INFO L273 TraceCheckUtils]: 21: Hoare triple {3573#true} assume !(~j~0 < ~n~0); {3573#true} is VALID [2018-11-14 17:13:12,219 INFO L273 TraceCheckUtils]: 22: Hoare triple {3573#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3573#true} is VALID [2018-11-14 17:13:12,219 INFO L273 TraceCheckUtils]: 23: Hoare triple {3573#true} assume true; {3573#true} is VALID [2018-11-14 17:13:12,219 INFO L273 TraceCheckUtils]: 24: Hoare triple {3573#true} assume !!(~i~0 < ~n~0);~j~0 := 0; {3573#true} is VALID [2018-11-14 17:13:12,219 INFO L273 TraceCheckUtils]: 25: Hoare triple {3573#true} assume true; {3573#true} is VALID [2018-11-14 17:13:12,219 INFO L273 TraceCheckUtils]: 26: Hoare triple {3573#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2; {3573#true} is VALID [2018-11-14 17:13:12,219 INFO L273 TraceCheckUtils]: 27: Hoare triple {3573#true} #t~post1 := ~j~0;~j~0 := #t~post1 + 1;havoc #t~post1; {3573#true} is VALID [2018-11-14 17:13:12,220 INFO L273 TraceCheckUtils]: 28: Hoare triple {3573#true} assume true; {3573#true} is VALID [2018-11-14 17:13:12,220 INFO L273 TraceCheckUtils]: 29: Hoare triple {3573#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2; {3573#true} is VALID [2018-11-14 17:13:12,220 INFO L273 TraceCheckUtils]: 30: Hoare triple {3573#true} #t~post1 := ~j~0;~j~0 := #t~post1 + 1;havoc #t~post1; {3573#true} is VALID [2018-11-14 17:13:12,220 INFO L273 TraceCheckUtils]: 31: Hoare triple {3573#true} assume true; {3573#true} is VALID [2018-11-14 17:13:12,220 INFO L273 TraceCheckUtils]: 32: Hoare triple {3573#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2; {3573#true} is VALID [2018-11-14 17:13:12,221 INFO L273 TraceCheckUtils]: 33: Hoare triple {3573#true} #t~post1 := ~j~0;~j~0 := #t~post1 + 1;havoc #t~post1; {3573#true} is VALID [2018-11-14 17:13:12,221 INFO L273 TraceCheckUtils]: 34: Hoare triple {3573#true} assume true; {3573#true} is VALID [2018-11-14 17:13:12,221 INFO L273 TraceCheckUtils]: 35: Hoare triple {3573#true} assume !!(~j~0 < ~n~0);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);havoc #t~nondet2; {3573#true} is VALID [2018-11-14 17:13:12,221 INFO L273 TraceCheckUtils]: 36: Hoare triple {3573#true} #t~post1 := ~j~0;~j~0 := #t~post1 + 1;havoc #t~post1; {3573#true} is VALID [2018-11-14 17:13:12,221 INFO L273 TraceCheckUtils]: 37: Hoare triple {3573#true} assume true; {3573#true} is VALID [2018-11-14 17:13:12,222 INFO L273 TraceCheckUtils]: 38: Hoare triple {3573#true} assume !(~j~0 < ~n~0); {3573#true} is VALID [2018-11-14 17:13:12,222 INFO L273 TraceCheckUtils]: 39: Hoare triple {3573#true} #t~post0 := ~i~0;~i~0 := #t~post0 + 1;havoc #t~post0; {3573#true} is VALID [2018-11-14 17:13:12,222 INFO L273 TraceCheckUtils]: 40: Hoare triple {3573#true} assume true; {3573#true} is VALID [2018-11-14 17:13:12,222 INFO L273 TraceCheckUtils]: 41: Hoare triple {3573#true} assume !(~i~0 < ~n~0); {3573#true} is VALID [2018-11-14 17:13:12,223 INFO L273 TraceCheckUtils]: 42: Hoare triple {3573#true} ~i~0 := 0;~j~0 := 0; {3704#(<= main_~i~0 0)} is VALID [2018-11-14 17:13:12,223 INFO L273 TraceCheckUtils]: 43: Hoare triple {3704#(<= main_~i~0 0)} assume true; {3704#(<= main_~i~0 0)} is VALID [2018-11-14 17:13:12,224 INFO L273 TraceCheckUtils]: 44: Hoare triple {3704#(<= main_~i~0 0)} assume !!(~i~0 < ~n~0);~j~0 := 0; {3711#(and (<= 0 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:12,224 INFO L273 TraceCheckUtils]: 45: Hoare triple {3711#(and (<= 0 main_~j~0) (<= main_~i~0 0))} assume true; {3711#(and (<= 0 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:12,225 INFO L273 TraceCheckUtils]: 46: Hoare triple {3711#(and (<= 0 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem3, ~#C~0.base, ~#C~0.offset + ~j~0 * (~n~0 * 4) + ~i~0 * 4, 4);havoc #t~mem3;~j~0 := ~j~0 + 1; {3718#(and (<= 1 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:12,225 INFO L273 TraceCheckUtils]: 47: Hoare triple {3718#(and (<= 1 main_~j~0) (<= main_~i~0 0))} assume true; {3718#(and (<= 1 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:12,226 INFO L273 TraceCheckUtils]: 48: Hoare triple {3718#(and (<= 1 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem3, ~#C~0.base, ~#C~0.offset + ~j~0 * (~n~0 * 4) + ~i~0 * 4, 4);havoc #t~mem3;~j~0 := ~j~0 + 1; {3725#(and (<= 2 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:12,227 INFO L273 TraceCheckUtils]: 49: Hoare triple {3725#(and (<= 2 main_~j~0) (<= main_~i~0 0))} assume true; {3725#(and (<= 2 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:12,227 INFO L273 TraceCheckUtils]: 50: Hoare triple {3725#(and (<= 2 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem3, ~#C~0.base, ~#C~0.offset + ~j~0 * (~n~0 * 4) + ~i~0 * 4, 4);havoc #t~mem3;~j~0 := ~j~0 + 1; {3732#(and (<= 3 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:12,228 INFO L273 TraceCheckUtils]: 51: Hoare triple {3732#(and (<= 3 main_~j~0) (<= main_~i~0 0))} assume true; {3732#(and (<= 3 main_~j~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:12,231 INFO L273 TraceCheckUtils]: 52: Hoare triple {3732#(and (<= 3 main_~j~0) (<= main_~i~0 0))} assume !!(~j~0 < ~n~0);call #t~mem3 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call write~int(#t~mem3, ~#C~0.base, ~#C~0.offset + ~j~0 * (~n~0 * 4) + ~i~0 * 4, 4);havoc #t~mem3;~j~0 := ~j~0 + 1; {3739#(and (<= 4 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:12,232 INFO L273 TraceCheckUtils]: 53: Hoare triple {3739#(and (<= 4 main_~n~0) (<= main_~i~0 0))} assume true; {3739#(and (<= 4 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:12,232 INFO L273 TraceCheckUtils]: 54: Hoare triple {3739#(and (<= 4 main_~n~0) (<= main_~i~0 0))} assume !(~j~0 < ~n~0); {3739#(and (<= 4 main_~n~0) (<= main_~i~0 0))} is VALID [2018-11-14 17:13:12,233 INFO L273 TraceCheckUtils]: 55: Hoare triple {3739#(and (<= 4 main_~n~0) (<= main_~i~0 0))} ~i~0 := ~i~0 + 1; {3749#(and (<= main_~i~0 1) (<= 4 main_~n~0))} is VALID [2018-11-14 17:13:12,235 INFO L273 TraceCheckUtils]: 56: Hoare triple {3749#(and (<= main_~i~0 1) (<= 4 main_~n~0))} assume true; {3749#(and (<= main_~i~0 1) (<= 4 main_~n~0))} is VALID [2018-11-14 17:13:12,235 INFO L273 TraceCheckUtils]: 57: Hoare triple {3749#(and (<= main_~i~0 1) (<= 4 main_~n~0))} assume !(~i~0 < ~n~0); {3574#false} is VALID [2018-11-14 17:13:12,236 INFO L273 TraceCheckUtils]: 58: Hoare triple {3574#false} ~i~0 := 0; {3574#false} is VALID [2018-11-14 17:13:12,236 INFO L273 TraceCheckUtils]: 59: Hoare triple {3574#false} assume true; {3574#false} is VALID [2018-11-14 17:13:12,236 INFO L273 TraceCheckUtils]: 60: Hoare triple {3574#false} assume !!(~i~0 < ~n~0);~j~0 := 0; {3574#false} is VALID [2018-11-14 17:13:12,236 INFO L273 TraceCheckUtils]: 61: Hoare triple {3574#false} assume true; {3574#false} is VALID [2018-11-14 17:13:12,237 INFO L273 TraceCheckUtils]: 62: Hoare triple {3574#false} assume !!(~j~0 < ~n~0);call #t~mem6 := read~int(~#C~0.base, ~#C~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4);call #t~mem7 := read~int(~#A~0.base, ~#A~0.offset + ~i~0 * (~n~0 * 4) + ~j~0 * 4, 4); {3574#false} is VALID [2018-11-14 17:13:12,237 INFO L256 TraceCheckUtils]: 63: Hoare triple {3574#false} call __VERIFIER_assert((if #t~mem6 == #t~mem7 then 1 else 0)); {3574#false} is VALID [2018-11-14 17:13:12,237 INFO L273 TraceCheckUtils]: 64: Hoare triple {3574#false} ~cond := #in~cond; {3574#false} is VALID [2018-11-14 17:13:12,237 INFO L273 TraceCheckUtils]: 65: Hoare triple {3574#false} assume ~cond == 0; {3574#false} is VALID [2018-11-14 17:13:12,238 INFO L273 TraceCheckUtils]: 66: Hoare triple {3574#false} assume !false; {3574#false} is VALID [2018-11-14 17:13:12,245 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-11-14 17:13:12,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-11-14 17:13:12,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-11-14 17:13:12,271 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-11-14 17:13:12,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:13:12,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-14 17:13:12,400 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:12,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-14 17:13:12,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-14 17:13:12,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-14 17:13:12,401 INFO L87 Difference]: Start difference. First operand 90 states and 99 transitions. Second operand 9 states. [2018-11-14 17:13:13,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:13,606 INFO L93 Difference]: Finished difference Result 211 states and 238 transitions. [2018-11-14 17:13:13,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 17:13:13,606 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-11-14 17:13:13,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:13:13,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:13:13,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 138 transitions. [2018-11-14 17:13:13,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-14 17:13:13,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 138 transitions. [2018-11-14 17:13:13,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 138 transitions. [2018-11-14 17:13:13,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:13:13,803 INFO L225 Difference]: With dead ends: 211 [2018-11-14 17:13:13,803 INFO L226 Difference]: Without dead ends: 179 [2018-11-14 17:13:13,803 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2018-11-14 17:13:13,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-11-14 17:13:13,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 103. [2018-11-14 17:13:13,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:13:13,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand 103 states. [2018-11-14 17:13:13,939 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand 103 states. [2018-11-14 17:13:13,940 INFO L87 Difference]: Start difference. First operand 179 states. Second operand 103 states. [2018-11-14 17:13:13,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:13,947 INFO L93 Difference]: Finished difference Result 179 states and 201 transitions. [2018-11-14 17:13:13,947 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 201 transitions. [2018-11-14 17:13:13,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:13,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:13,948 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand 179 states. [2018-11-14 17:13:13,948 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 179 states. [2018-11-14 17:13:13,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:13:13,956 INFO L93 Difference]: Finished difference Result 179 states and 201 transitions. [2018-11-14 17:13:13,956 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 201 transitions. [2018-11-14 17:13:13,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:13:13,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:13:13,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:13:13,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:13:13,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-11-14 17:13:13,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2018-11-14 17:13:13,961 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 67 [2018-11-14 17:13:13,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:13:13,961 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2018-11-14 17:13:13,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-14 17:13:13,962 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2018-11-14 17:13:13,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-11-14 17:13:13,963 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:13:13,963 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 8, 8, 8, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:13:13,963 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:13:13,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:13:13,963 INFO L82 PathProgramCache]: Analyzing trace with hash 658231892, now seen corresponding path program 5 times [2018-11-14 17:13:13,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:13:13,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:13:13,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:13,965 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:13:13,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:13:13,970 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-11-14 17:13:13,970 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-11-14 17:13:13,970 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:13,989 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1