java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/toy/nonlinear/Mult1-Safe.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 16:00:15,849 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 16:00:15,854 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 16:00:15,870 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 16:00:15,870 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 16:00:15,871 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 16:00:15,875 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 16:00:15,878 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 16:00:15,881 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 16:00:15,882 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 16:00:15,884 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 16:00:15,885 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 16:00:15,886 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 16:00:15,887 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 16:00:15,888 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 16:00:15,890 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 16:00:15,891 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 16:00:15,895 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 16:00:15,904 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 16:00:15,906 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 16:00:15,907 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 16:00:15,909 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 16:00:15,915 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 16:00:15,915 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 16:00:15,916 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 16:00:15,917 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 16:00:15,918 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 16:00:15,918 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 16:00:15,923 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 16:00:15,924 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 16:00:15,924 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 16:00:15,925 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 16:00:15,925 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 16:00:15,925 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 16:00:15,926 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 16:00:15,929 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 16:00:15,930 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2018-12-03 16:00:15,954 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 16:00:15,956 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 16:00:15,957 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 16:00:15,957 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 16:00:15,958 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 16:00:15,958 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 16:00:15,958 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 16:00:15,958 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 16:00:15,958 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 16:00:15,959 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 16:00:15,959 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 16:00:15,959 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 16:00:15,959 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 16:00:15,959 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 16:00:15,962 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 16:00:15,963 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 16:00:15,963 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 16:00:15,964 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 16:00:15,965 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 16:00:15,966 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 16:00:15,966 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 16:00:15,966 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 16:00:15,966 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 16:00:15,966 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 16:00:15,967 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 16:00:15,967 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 16:00:15,967 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 16:00:15,968 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 16:00:15,968 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 16:00:15,968 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 16:00:15,968 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 16:00:15,969 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 16:00:15,969 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 16:00:15,969 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 16:00:15,969 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 16:00:15,969 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 16:00:15,970 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 16:00:15,970 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 16:00:15,970 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 16:00:15,971 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 16:00:15,971 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 16:00:16,025 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 16:00:16,040 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 16:00:16,046 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 16:00:16,048 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 16:00:16,048 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 16:00:16,049 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/nonlinear/Mult1-Safe.bpl [2018-12-03 16:00:16,050 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/nonlinear/Mult1-Safe.bpl' [2018-12-03 16:00:16,091 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 16:00:16,093 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 16:00:16,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 16:00:16,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 16:00:16,094 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 16:00:16,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:00:16" (1/1) ... [2018-12-03 16:00:16,126 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:00:16" (1/1) ... [2018-12-03 16:00:16,134 WARN L165 Inliner]: Program contained no entry procedure! [2018-12-03 16:00:16,134 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2018-12-03 16:00:16,134 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2018-12-03 16:00:16,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 16:00:16,139 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 16:00:16,139 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 16:00:16,139 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 16:00:16,152 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:00:16" (1/1) ... [2018-12-03 16:00:16,152 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:00:16" (1/1) ... [2018-12-03 16:00:16,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:00:16" (1/1) ... [2018-12-03 16:00:16,153 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:00:16" (1/1) ... [2018-12-03 16:00:16,159 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:00:16" (1/1) ... [2018-12-03 16:00:16,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:00:16" (1/1) ... [2018-12-03 16:00:16,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:00:16" (1/1) ... [2018-12-03 16:00:16,168 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 16:00:16,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 16:00:16,169 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 16:00:16,169 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 16:00:16,170 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:00:16" (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-12-03 16:00:16,238 INFO L124 BoogieDeclarations]: Specification and implementation of procedure mult given in one single declaration [2018-12-03 16:00:16,238 INFO L130 BoogieDeclarations]: Found specification of procedure mult [2018-12-03 16:00:16,239 INFO L138 BoogieDeclarations]: Found implementation of procedure mult [2018-12-03 16:00:16,310 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-03 16:00:16,422 INFO L272 CfgBuilder]: Using library mode [2018-12-03 16:00:16,422 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 16:00:16,423 INFO L202 PluginConnector]: Adding new model Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:00:16 BoogieIcfgContainer [2018-12-03 16:00:16,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 16:00:16,424 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 16:00:16,424 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 16:00:16,427 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 16:00:16,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 04:00:16" (1/2) ... [2018-12-03 16:00:16,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3811ceec and model type Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 04:00:16, skipping insertion in model container [2018-12-03 16:00:16,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 04:00:16" (2/2) ... [2018-12-03 16:00:16,431 INFO L112 eAbstractionObserver]: Analyzing ICFG Mult1-Safe.bpl [2018-12-03 16:00:16,441 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 16:00:16,449 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 16:00:16,468 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 16:00:16,503 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 16:00:16,504 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 16:00:16,504 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 16:00:16,504 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 16:00:16,504 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 16:00:16,504 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 16:00:16,505 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 16:00:16,505 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 16:00:16,521 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 16:00:16,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 16:00:16,528 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:16,529 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 16:00:16,531 INFO L423 AbstractCegarLoop]: === Iteration 1 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 16:00:16,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:16,538 INFO L82 PathProgramCache]: Analyzing trace with hash 924708, now seen corresponding path program 1 times [2018-12-03 16:00:16,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:16,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:16,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:16,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:16,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:16,629 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 16:00:16,629 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 16:00:16,629 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG 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-12-03 16:00:16,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:16,645 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 16:00:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:16,683 INFO L193 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2018-12-03 16:00:16,684 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:16,685 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:16,685 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2018-12-03 16:00:16,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:16,700 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:16,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:16,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:16,977 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:17,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:17,095 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-12-03 16:00:17,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2018-12-03 16:00:17,095 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 16:00:17,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 16:00:17,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 16:00:17,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-03 16:00:17,114 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 5 states. [2018-12-03 16:00:17,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:17,240 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 16:00:17,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 16:00:17,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 4 [2018-12-03 16:00:17,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:17,253 INFO L225 Difference]: With dead ends: 10 [2018-12-03 16:00:17,253 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 16:00:17,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-03 16:00:17,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 16:00:17,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 16:00:17,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 16:00:17,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 16:00:17,293 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 16:00:17,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:17,294 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 16:00:17,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 16:00:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 16:00:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 16:00:17,295 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:17,295 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2018-12-03 16:00:17,295 INFO L423 AbstractCegarLoop]: === Iteration 2 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 16:00:17,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:17,296 INFO L82 PathProgramCache]: Analyzing trace with hash 28663973, now seen corresponding path program 1 times [2018-12-03 16:00:17,296 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:17,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:17,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:17,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:17,298 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:17,302 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 16:00:17,303 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 16:00:17,303 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG 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-12-03 16:00:17,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:17,318 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 16:00:17,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:17,361 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 6 with the following transitions: [2018-12-03 16:00:17,363 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [7], [9] [2018-12-03 16:00:17,396 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 16:00:17,397 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 16:00:17,500 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 16:00:17,503 INFO L272 AbstractInterpreter]: Visited 5 different actions 8 times. Merged at 3 different actions 3 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 16:00:17,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:17,544 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 16:00:17,544 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:17,544 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:17,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:17,554 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:17,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:17,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:17,728 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:18,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:18,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 16:00:18,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-12-03 16:00:18,114 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:18,115 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 16:00:18,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 16:00:18,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-03 16:00:18,116 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 8 states. [2018-12-03 16:00:18,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:18,220 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 16:00:18,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 16:00:18,221 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-03 16:00:18,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:18,221 INFO L225 Difference]: With dead ends: 9 [2018-12-03 16:00:18,221 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 16:00:18,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2018-12-03 16:00:18,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 16:00:18,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 16:00:18,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 16:00:18,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 16:00:18,226 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 16:00:18,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:18,227 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 16:00:18,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 16:00:18,227 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 16:00:18,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 16:00:18,227 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:18,228 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-12-03 16:00:18,228 INFO L423 AbstractCegarLoop]: === Iteration 3 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 16:00:18,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:18,229 INFO L82 PathProgramCache]: Analyzing trace with hash 888581188, now seen corresponding path program 2 times [2018-12-03 16:00:18,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:18,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:18,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:18,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:18,230 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:18,237 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 16:00:18,237 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 16:00:18,238 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG 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-12-03 16:00:18,246 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:18,247 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 16:00:18,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:18,270 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:18,270 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:18,270 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:18,271 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:18,281 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:18,281 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:18,288 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 16:00:18,288 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:18,290 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:18,491 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:18,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:18,658 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:18,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 16:00:18,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-12-03 16:00:18,677 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:18,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 16:00:18,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 16:00:18,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-12-03 16:00:18,678 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 10 states. [2018-12-03 16:00:19,240 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-12-03 16:00:19,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:19,433 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2018-12-03 16:00:19,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 16:00:19,433 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 6 [2018-12-03 16:00:19,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:19,434 INFO L225 Difference]: With dead ends: 12 [2018-12-03 16:00:19,434 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 16:00:19,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-12-03 16:00:19,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 16:00:19,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 16:00:19,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 16:00:19,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 16:00:19,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-12-03 16:00:19,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:19,440 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 16:00:19,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 16:00:19,440 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 16:00:19,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 16:00:19,441 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:19,441 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1] [2018-12-03 16:00:19,441 INFO L423 AbstractCegarLoop]: === Iteration 4 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 16:00:19,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:19,442 INFO L82 PathProgramCache]: Analyzing trace with hash -772033436, now seen corresponding path program 3 times [2018-12-03 16:00:19,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:19,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:19,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:19,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:19,444 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:19,451 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 16:00:19,451 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 16:00:19,452 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG 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-12-03 16:00:19,460 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:19,461 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 16:00:19,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:19,484 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:19,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:19,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:19,485 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:19,494 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:00:19,494 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:00:19,505 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:00:19,505 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:19,507 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:19,644 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:19,644 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:19,800 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:19,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 16:00:19,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2018-12-03 16:00:19,819 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:19,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-03 16:00:19,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-03 16:00:19,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-12-03 16:00:19,821 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 14 states. [2018-12-03 16:00:20,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:20,508 INFO L93 Difference]: Finished difference Result 16 states and 19 transitions. [2018-12-03 16:00:20,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 16:00:20,508 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 8 [2018-12-03 16:00:20,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:20,510 INFO L225 Difference]: With dead ends: 16 [2018-12-03 16:00:20,510 INFO L226 Difference]: Without dead ends: 13 [2018-12-03 16:00:20,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=121, Invalid=385, Unknown=0, NotChecked=0, Total=506 [2018-12-03 16:00:20,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-12-03 16:00:20,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-12-03 16:00:20,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-12-03 16:00:20,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-12-03 16:00:20,517 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 8 [2018-12-03 16:00:20,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:20,518 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-12-03 16:00:20,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-03 16:00:20,518 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-12-03 16:00:20,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 16:00:20,518 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:20,519 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1, 1] [2018-12-03 16:00:20,519 INFO L423 AbstractCegarLoop]: === Iteration 5 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 16:00:20,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:20,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1189293220, now seen corresponding path program 4 times [2018-12-03 16:00:20,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:20,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:20,521 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:20,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:20,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:20,532 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 16:00:20,532 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 16:00:20,533 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG 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-12-03 16:00:20,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:20,552 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 16:00:20,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:20,580 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:20,580 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:20,580 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:20,580 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:20,591 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:20,592 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:00:20,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:20,619 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:20,782 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:20,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:21,258 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:21,277 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 16:00:21,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2018-12-03 16:00:21,278 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:21,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-12-03 16:00:21,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-12-03 16:00:21,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=360, Unknown=0, NotChecked=0, Total=462 [2018-12-03 16:00:21,279 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 22 states. [2018-12-03 16:00:22,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:22,718 INFO L93 Difference]: Finished difference Result 24 states and 31 transitions. [2018-12-03 16:00:22,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-03 16:00:22,719 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 12 [2018-12-03 16:00:22,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:22,720 INFO L225 Difference]: With dead ends: 24 [2018-12-03 16:00:22,720 INFO L226 Difference]: Without dead ends: 21 [2018-12-03 16:00:22,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=345, Invalid=1137, Unknown=0, NotChecked=0, Total=1482 [2018-12-03 16:00:22,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-03 16:00:22,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-03 16:00:22,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-03 16:00:22,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-12-03 16:00:22,731 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 12 [2018-12-03 16:00:22,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:22,732 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-12-03 16:00:22,732 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-12-03 16:00:22,732 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-12-03 16:00:22,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 16:00:22,733 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:22,733 INFO L402 BasicCegarLoop]: trace histogram [16, 1, 1, 1, 1] [2018-12-03 16:00:22,733 INFO L423 AbstractCegarLoop]: === Iteration 6 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 16:00:22,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:22,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1373617444, now seen corresponding path program 5 times [2018-12-03 16:00:22,734 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:22,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:22,735 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:22,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:22,735 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:22,751 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 16:00:22,752 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 16:00:22,752 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 16:00:22,770 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:22,770 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 16:00:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:22,844 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:22,844 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:22,844 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:22,844 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:22,855 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 16:00:22,855 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 16:00:23,009 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-03 16:00:23,009 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:23,013 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:23,582 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:23,582 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:24,562 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:24,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 16:00:24,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 37 [2018-12-03 16:00:24,583 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:24,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-12-03 16:00:24,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-12-03 16:00:24,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=1088, Unknown=0, NotChecked=0, Total=1406 [2018-12-03 16:00:24,585 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 38 states. [2018-12-03 16:00:26,126 WARN L180 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-12-03 16:00:26,575 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-12-03 16:00:26,806 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification that was a NOOP. DAG size: 124 [2018-12-03 16:00:27,008 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-03 16:00:27,298 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 120 [2018-12-03 16:00:27,495 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-12-03 16:00:29,446 WARN L180 SmtUtils]: Spent 137.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-12-03 16:00:29,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:29,617 INFO L93 Difference]: Finished difference Result 40 states and 55 transitions. [2018-12-03 16:00:29,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-12-03 16:00:29,618 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 20 [2018-12-03 16:00:29,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:29,619 INFO L225 Difference]: With dead ends: 40 [2018-12-03 16:00:29,619 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 16:00:29,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 598 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1177, Invalid=3793, Unknown=0, NotChecked=0, Total=4970 [2018-12-03 16:00:29,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 16:00:29,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-12-03 16:00:29,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 16:00:29,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-12-03 16:00:29,646 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 20 [2018-12-03 16:00:29,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:29,646 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-12-03 16:00:29,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-12-03 16:00:29,647 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-12-03 16:00:29,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 16:00:29,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:29,648 INFO L402 BasicCegarLoop]: trace histogram [32, 1, 1, 1, 1] [2018-12-03 16:00:29,648 INFO L423 AbstractCegarLoop]: === Iteration 7 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 16:00:29,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:29,648 INFO L82 PathProgramCache]: Analyzing trace with hash -1236312540, now seen corresponding path program 6 times [2018-12-03 16:00:29,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:29,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:29,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:29,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:29,650 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:29,679 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 16:00:29,680 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 16:00:29,680 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 16:00:29,694 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:29,694 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 16:00:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:30,179 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:30,179 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:30,179 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:30,179 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:30,187 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 16:00:30,188 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 16:00:30,712 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 16:00:30,712 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 16:00:30,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:00:32,279 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:32,280 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:00:35,921 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:00:35,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 16:00:35,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 69 [2018-12-03 16:00:35,957 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:00:35,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-12-03 16:00:35,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-12-03 16:00:35,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1134, Invalid=3696, Unknown=0, NotChecked=0, Total=4830 [2018-12-03 16:00:35,962 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 70 states. [2018-12-03 16:00:39,320 WARN L180 SmtUtils]: Spent 774.00 ms on a formula simplification that was a NOOP. DAG size: 229 [2018-12-03 16:00:40,132 WARN L180 SmtUtils]: Spent 325.00 ms on a formula simplification that was a NOOP. DAG size: 219 [2018-12-03 16:00:40,738 WARN L180 SmtUtils]: Spent 425.00 ms on a formula simplification that was a NOOP. DAG size: 244 [2018-12-03 16:00:41,448 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification that was a NOOP. DAG size: 212 [2018-12-03 16:00:42,080 WARN L180 SmtUtils]: Spent 421.00 ms on a formula simplification that was a NOOP. DAG size: 239 [2018-12-03 16:00:42,958 WARN L180 SmtUtils]: Spent 486.00 ms on a formula simplification that was a NOOP. DAG size: 205 [2018-12-03 16:00:43,755 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2018-12-03 16:00:44,452 WARN L180 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2018-12-03 16:00:45,082 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2018-12-03 16:00:45,727 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2018-12-03 16:00:46,286 WARN L180 SmtUtils]: Spent 213.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2018-12-03 16:00:46,856 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2018-12-03 16:00:47,381 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2018-12-03 16:00:47,873 WARN L180 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-03 16:00:48,383 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-12-03 16:00:48,832 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2018-12-03 16:00:49,276 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-12-03 16:00:49,711 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-12-03 16:00:50,416 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-03 16:00:50,814 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-12-03 16:00:51,161 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-03 16:00:51,541 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-12-03 16:00:54,656 WARN L180 SmtUtils]: Spent 410.00 ms on a formula simplification that was a NOOP. DAG size: 238 [2018-12-03 16:00:54,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:00:54,700 INFO L93 Difference]: Finished difference Result 72 states and 103 transitions. [2018-12-03 16:00:54,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-12-03 16:00:54,701 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 36 [2018-12-03 16:00:54,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:00:54,703 INFO L225 Difference]: With dead ends: 72 [2018-12-03 16:00:54,703 INFO L226 Difference]: Without dead ends: 69 [2018-12-03 16:00:54,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2230 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=4377, Invalid=13713, Unknown=0, NotChecked=0, Total=18090 [2018-12-03 16:00:54,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-12-03 16:00:54,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-12-03 16:00:54,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-12-03 16:00:54,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-12-03 16:00:54,760 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 36 [2018-12-03 16:00:54,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:00:54,760 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-12-03 16:00:54,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-12-03 16:00:54,760 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-12-03 16:00:54,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 16:00:54,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:00:54,763 INFO L402 BasicCegarLoop]: trace histogram [64, 1, 1, 1, 1] [2018-12-03 16:00:54,763 INFO L423 AbstractCegarLoop]: === Iteration 8 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 16:00:54,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:00:54,763 INFO L82 PathProgramCache]: Analyzing trace with hash -955736028, now seen corresponding path program 7 times [2018-12-03 16:00:54,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:00:54,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:54,764 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:00:54,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:00:54,764 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:00:54,813 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 16:00:54,814 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 16:00:54,814 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 16:00:54,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:54,830 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 16:00:55,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:00:55,131 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 16:00:55,131 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 16:00:55,131 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 16:00:55,131 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 16:00:55,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:00:55,141 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 16:01:00,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 16:01:00,428 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 16:01:03,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:03,030 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 16:01:12,407 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 16:01:12,426 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 16:01:12,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 133 [2018-12-03 16:01:12,427 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 16:01:12,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-12-03 16:01:12,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-12-03 16:01:12,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4302, Invalid=13520, Unknown=0, NotChecked=0, Total=17822 [2018-12-03 16:01:12,434 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 134 states. [2018-12-03 16:01:22,517 WARN L180 SmtUtils]: Spent 2.53 s on a formula simplification that was a NOOP. DAG size: 453 [2018-12-03 16:01:25,933 WARN L180 SmtUtils]: Spent 912.00 ms on a formula simplification that was a NOOP. DAG size: 443 [2018-12-03 16:01:27,708 WARN L180 SmtUtils]: Spent 1.30 s on a formula simplification that was a NOOP. DAG size: 460 [2018-12-03 16:01:31,024 WARN L180 SmtUtils]: Spent 954.00 ms on a formula simplification that was a NOOP. DAG size: 436 [2018-12-03 16:01:32,586 WARN L180 SmtUtils]: Spent 1.15 s on a formula simplification that was a NOOP. DAG size: 456 [2018-12-03 16:01:35,724 WARN L180 SmtUtils]: Spent 892.00 ms on a formula simplification that was a NOOP. DAG size: 429 [2018-12-03 16:01:38,797 WARN L180 SmtUtils]: Spent 833.00 ms on a formula simplification that was a NOOP. DAG size: 422 [2018-12-03 16:01:41,778 WARN L180 SmtUtils]: Spent 819.00 ms on a formula simplification that was a NOOP. DAG size: 415 [2018-12-03 16:01:44,742 WARN L180 SmtUtils]: Spent 821.00 ms on a formula simplification that was a NOOP. DAG size: 408 [2018-12-03 16:01:47,645 WARN L180 SmtUtils]: Spent 775.00 ms on a formula simplification that was a NOOP. DAG size: 401 [2018-12-03 16:01:50,508 WARN L180 SmtUtils]: Spent 827.00 ms on a formula simplification that was a NOOP. DAG size: 394 [2018-12-03 16:01:53,250 WARN L180 SmtUtils]: Spent 759.00 ms on a formula simplification that was a NOOP. DAG size: 387 [2018-12-03 16:01:55,854 WARN L180 SmtUtils]: Spent 660.00 ms on a formula simplification that was a NOOP. DAG size: 380 [2018-12-03 16:01:58,452 WARN L180 SmtUtils]: Spent 674.00 ms on a formula simplification that was a NOOP. DAG size: 373 [2018-12-03 16:02:01,067 WARN L180 SmtUtils]: Spent 718.00 ms on a formula simplification that was a NOOP. DAG size: 366 [2018-12-03 16:02:03,559 WARN L180 SmtUtils]: Spent 628.00 ms on a formula simplification that was a NOOP. DAG size: 359 [2018-12-03 16:02:06,018 WARN L180 SmtUtils]: Spent 629.00 ms on a formula simplification that was a NOOP. DAG size: 352 [2018-12-03 16:02:08,420 WARN L180 SmtUtils]: Spent 611.00 ms on a formula simplification that was a NOOP. DAG size: 345 [2018-12-03 16:02:10,729 WARN L180 SmtUtils]: Spent 620.00 ms on a formula simplification that was a NOOP. DAG size: 338 [2018-12-03 16:02:12,956 WARN L180 SmtUtils]: Spent 591.00 ms on a formula simplification that was a NOOP. DAG size: 331 [2018-12-03 16:02:15,135 WARN L180 SmtUtils]: Spent 581.00 ms on a formula simplification that was a NOOP. DAG size: 324 [2018-12-03 16:02:17,253 WARN L180 SmtUtils]: Spent 511.00 ms on a formula simplification that was a NOOP. DAG size: 317 [2018-12-03 16:02:19,337 WARN L180 SmtUtils]: Spent 529.00 ms on a formula simplification that was a NOOP. DAG size: 310 [2018-12-03 16:02:21,359 WARN L180 SmtUtils]: Spent 500.00 ms on a formula simplification that was a NOOP. DAG size: 303 [2018-12-03 16:02:23,308 WARN L180 SmtUtils]: Spent 500.00 ms on a formula simplification that was a NOOP. DAG size: 296 [2018-12-03 16:02:25,175 WARN L180 SmtUtils]: Spent 446.00 ms on a formula simplification that was a NOOP. DAG size: 289 [2018-12-03 16:02:27,049 WARN L180 SmtUtils]: Spent 482.00 ms on a formula simplification that was a NOOP. DAG size: 282 [2018-12-03 16:02:28,862 WARN L180 SmtUtils]: Spent 446.00 ms on a formula simplification that was a NOOP. DAG size: 275 [2018-12-03 16:02:30,628 WARN L180 SmtUtils]: Spent 455.00 ms on a formula simplification that was a NOOP. DAG size: 268 [2018-12-03 16:02:32,303 WARN L180 SmtUtils]: Spent 420.00 ms on a formula simplification that was a NOOP. DAG size: 261 [2018-12-03 16:02:33,929 WARN L180 SmtUtils]: Spent 395.00 ms on a formula simplification that was a NOOP. DAG size: 254 [2018-12-03 16:02:35,485 WARN L180 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 247 [2018-12-03 16:02:37,041 WARN L180 SmtUtils]: Spent 390.00 ms on a formula simplification that was a NOOP. DAG size: 240 [2018-12-03 16:02:38,521 WARN L180 SmtUtils]: Spent 345.00 ms on a formula simplification that was a NOOP. DAG size: 233 [2018-12-03 16:02:39,928 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification that was a NOOP. DAG size: 226 [2018-12-03 16:02:41,293 WARN L180 SmtUtils]: Spent 320.00 ms on a formula simplification that was a NOOP. DAG size: 219 [2018-12-03 16:02:42,623 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification that was a NOOP. DAG size: 212 [2018-12-03 16:02:43,892 WARN L180 SmtUtils]: Spent 283.00 ms on a formula simplification that was a NOOP. DAG size: 205 [2018-12-03 16:02:45,094 WARN L180 SmtUtils]: Spent 255.00 ms on a formula simplification that was a NOOP. DAG size: 198 [2018-12-03 16:02:46,264 WARN L180 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 191 [2018-12-03 16:02:47,430 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification that was a NOOP. DAG size: 184 [2018-12-03 16:02:48,540 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 177 [2018-12-03 16:02:49,605 WARN L180 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 170 [2018-12-03 16:02:50,635 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification that was a NOOP. DAG size: 163 [2018-12-03 16:02:51,617 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 156 [2018-12-03 16:02:52,574 WARN L180 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 149 [2018-12-03 16:02:53,450 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 142 [2018-12-03 16:02:54,308 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 135 [2018-12-03 16:02:55,132 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2018-12-03 16:02:55,946 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2018-12-03 16:02:56,702 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 114 [2018-12-03 16:02:57,418 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2018-12-03 16:02:58,120 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-12-03 16:02:58,758 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2018-12-03 16:03:05,406 WARN L180 SmtUtils]: Spent 953.00 ms on a formula simplification that was a NOOP. DAG size: 455 [2018-12-03 16:03:05,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 16:03:05,513 INFO L93 Difference]: Finished difference Result 136 states and 199 transitions. [2018-12-03 16:03:05,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-12-03 16:03:05,513 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 68 [2018-12-03 16:03:05,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 16:03:05,516 INFO L225 Difference]: With dead ends: 136 [2018-12-03 16:03:05,517 INFO L226 Difference]: Without dead ends: 133 [2018-12-03 16:03:05,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8566 ImplicationChecksByTransitivity, 118.9s TimeCoverageRelationStatistics Valid=16921, Invalid=51985, Unknown=0, NotChecked=0, Total=68906 [2018-12-03 16:03:05,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-03 16:03:05,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-03 16:03:05,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-03 16:03:05,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-12-03 16:03:05,702 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 68 [2018-12-03 16:03:05,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 16:03:05,703 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-12-03 16:03:05,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-12-03 16:03:05,703 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-12-03 16:03:05,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-03 16:03:05,705 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 16:03:05,705 INFO L402 BasicCegarLoop]: trace histogram [128, 1, 1, 1, 1] [2018-12-03 16:03:05,706 INFO L423 AbstractCegarLoop]: === Iteration 9 === [multErr0ENSURES_VIOLATIONPOST_CONDITION]=== [2018-12-03 16:03:05,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 16:03:05,706 INFO L82 PathProgramCache]: Analyzing trace with hash 2011374628, now seen corresponding path program 8 times [2018-12-03 16:03:05,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 16:03:05,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:05,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 16:03:05,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 16:03:05,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 16:03:05,781 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 16:03:05,781 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 16:03:05,782 INFO L169 anRefinementStrategy]: Switched to traceCheck mode Z3_NO_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2018-12-03 16:03:05,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 16:03:05,808 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 16:03:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-12-03 16:03:07,873 INFO L285 seRefinementStrategy]: Strategy TaipanRefinementStrategy was unsuccessful and could not determine trace feasibility. [2018-12-03 16:03:07,873 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 16:03:08,062 WARN L228 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-12-03 16:03:08,063 INFO L202 PluginConnector]: Adding new model Mult1-Safe.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 04:03:08 BoogieIcfgContainer [2018-12-03 16:03:08,063 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 16:03:08,064 INFO L168 Benchmark]: Toolchain (without parser) took 171972.32 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.5 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 253.6 MB. Max. memory is 7.1 GB. [2018-12-03 16:03:08,068 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:03:08,068 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:03:08,069 INFO L168 Benchmark]: Boogie Preprocessor took 29.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 16:03:08,069 INFO L168 Benchmark]: RCFGBuilder took 254.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 16:03:08,070 INFO L168 Benchmark]: TraceAbstraction took 171638.93 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 232.4 MB. Max. memory is 7.1 GB. [2018-12-03 16:03:08,077 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 44.06 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.37 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 254.88 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 171638.93 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 232.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 9]: Unable to prove that procedure postcondition always holds Unable to prove that procedure postcondition always holds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L9-L10] requires b >= 0; [L15] res := 0; [L16] tmp := b; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND TRUE tmp > 0 [L20] res := res + a; [L21] tmp := tmp - 1; [L18] COND FALSE !(tmp > 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. UNKNOWN Result, 171.5s OverallTime, 9 OverallIterations, 128 TraceHistogramMax, 140.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15 SDtfs, 2931 SDslu, 9 SDs, 0 SdLazy, 6801 SolverSat, 3162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 562 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 546 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11626 ImplicationChecksByTransitivity, 149.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 8.8s SatisfiabilityAnalysisTime, 20.9s InterpolantComputationTime, 450 NumberOfCodeBlocks, 450 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 302 ConstructedInterpolants, 7 QuantifiedInterpolants, 163296 SizeOfPredicates, 23 NumberOfNonLiveVariables, 707 ConjunctsInSsa, 556 ConjunctsInUnsatCore, 16 InterpolantComputations, 2 PerfectInterpolantSequences, 0/5588 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...