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_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum02.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 19:22:29,756 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 19:22:29,762 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 19:22:29,781 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 19:22:29,782 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 19:22:29,783 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 19:22:29,784 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 19:22:29,786 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 19:22:29,788 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 19:22:29,789 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 19:22:29,790 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 19:22:29,790 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 19:22:29,791 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 19:22:29,792 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 19:22:29,793 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 19:22:29,794 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 19:22:29,795 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 19:22:29,797 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 19:22:29,800 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 19:22:29,802 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 19:22:29,808 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 19:22:29,810 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 19:22:29,814 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 19:22:29,814 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 19:22:29,814 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 19:22:29,817 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 19:22:29,818 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 19:22:29,819 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 19:22:29,819 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 19:22:29,823 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 19:22:29,823 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 19:22:29,825 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 19:22:29,825 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 19:22:29,826 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 19:22:29,827 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 19:22:29,827 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 19:22:29,827 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2018-12-03 19:22:29,846 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 19:22:29,847 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 19:22:29,848 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 19:22:29,848 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 19:22:29,848 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 19:22:29,848 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 19:22:29,848 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 19:22:29,849 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 19:22:29,849 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 19:22:29,849 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2018-12-03 19:22:29,849 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 19:22:29,849 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 19:22:29,849 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 19:22:29,850 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 19:22:29,850 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 19:22:29,851 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 19:22:29,853 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 19:22:29,853 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 19:22:29,853 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 19:22:29,854 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 19:22:29,854 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 19:22:29,854 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 19:22:29,854 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 19:22:29,854 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 19:22:29,854 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 19:22:29,855 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 19:22:29,855 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 19:22:29,855 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 19:22:29,855 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 19:22:29,855 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 19:22:29,856 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 19:22:29,857 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 19:22:29,858 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 19:22:29,858 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 19:22:29,858 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 19:22:29,858 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 19:22:29,858 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 19:22:29,859 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 19:22:29,859 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 19:22:29,859 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 19:22:29,907 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 19:22:29,921 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 19:22:29,925 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 19:22:29,926 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 19:22:29,927 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 19:22:29,928 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum02.i_3.bpl [2018-12-03 19:22:29,928 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/sum02.i_3.bpl' [2018-12-03 19:22:29,964 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 19:22:29,966 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 19:22:29,967 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 19:22:29,967 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 19:22:29,967 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 19:22:29,986 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:22:29" (1/1) ... [2018-12-03 19:22:29,996 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:22:29" (1/1) ... [2018-12-03 19:22:30,005 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 19:22:30,006 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 19:22:30,006 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 19:22:30,007 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 19:22:30,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:22:29" (1/1) ... [2018-12-03 19:22:30,019 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:22:29" (1/1) ... [2018-12-03 19:22:30,020 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:22:29" (1/1) ... [2018-12-03 19:22:30,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:22:29" (1/1) ... [2018-12-03 19:22:30,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:22:29" (1/1) ... [2018-12-03 19:22:30,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:22:29" (1/1) ... [2018-12-03 19:22:30,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:22:29" (1/1) ... [2018-12-03 19:22:30,029 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 19:22:30,029 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 19:22:30,030 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 19:22:30,030 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 19:22:30,031 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:22:29" (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 19:22:30,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 19:22:30,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 19:22:30,395 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 19:22:30,395 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 19:22:30,396 INFO L202 PluginConnector]: Adding new model sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:22:30 BoogieIcfgContainer [2018-12-03 19:22:30,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 19:22:30,397 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 19:22:30,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 19:22:30,406 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 19:22:30,407 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 07:22:29" (1/2) ... [2018-12-03 19:22:30,408 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@90b89a7 and model type sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:22:30, skipping insertion in model container [2018-12-03 19:22:30,409 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:22:30" (2/2) ... [2018-12-03 19:22:30,412 INFO L112 eAbstractionObserver]: Analyzing ICFG sum02.i_3.bpl [2018-12-03 19:22:30,426 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 19:22:30,437 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 19:22:30,461 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 19:22:30,508 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 19:22:30,508 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 19:22:30,508 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 19:22:30,509 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 19:22:30,509 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 19:22:30,509 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 19:22:30,509 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 19:22:30,509 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 19:22:30,525 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 19:22:30,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 19:22:30,533 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:30,534 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 19:22:30,537 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:30,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:30,545 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 19:22:30,548 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:30,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:30,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:30,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:30,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:30,642 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 19:22:30,642 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 19:22:30,642 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 19:22:30,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:30,664 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 19:22:30,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:30,727 INFO L193 CegarAbsIntRunner]: Skipping current iteration for AI because the path program does not contain any loops [2018-12-03 19:22:30,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:22:30,731 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:30,731 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 19:22:30,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:30,750 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:22:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:30,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:22:30,890 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 19:22:30,890 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:22:31,011 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 19:22:31,032 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2018-12-03 19:22:31,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2018-12-03 19:22:31,033 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 19:22:31,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 19:22:31,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 19:22:31,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 19:22:31,054 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 19:22:31,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:31,113 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 19:22:31,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 19:22:31,116 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 19:22:31,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:31,128 INFO L225 Difference]: With dead ends: 9 [2018-12-03 19:22:31,129 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 19:22:31,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-03 19:22:31,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 19:22:31,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 19:22:31,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 19:22:31,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 19:22:31,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 19:22:31,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:31,176 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 19:22:31,177 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 19:22:31,177 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 19:22:31,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 19:22:31,177 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:31,178 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 19:22:31,178 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:31,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:31,179 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 19:22:31,179 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:31,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:31,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:31,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:31,181 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:31,193 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 19:22:31,195 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 19:22:31,195 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 19:22:31,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:31,213 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 19:22:31,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:31,261 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 19:22:31,263 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 19:22:31,330 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 19:22:31,330 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 19:22:31,429 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-12-03 19:22:32,147 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 19:22:32,154 INFO L272 AbstractInterpreter]: Visited 4 different actions 28 times. Merged at 3 different actions 24 times. Widened at 2 different actions 10 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 19:22:32,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:32,191 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 19:22:32,191 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:32,192 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 19:22:32,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:32,203 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:22:32,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:32,229 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:22:32,352 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 19:22:32,353 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:22:32,500 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 19:22:32,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 19:22:32,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2018-12-03 19:22:32,529 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:22:32,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 19:22:32,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 19:22:32,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 19:22:32,532 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 6 states. [2018-12-03 19:22:32,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:22:32,627 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 19:22:32,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 19:22:32,629 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 4 [2018-12-03 19:22:32,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:22:32,630 INFO L225 Difference]: With dead ends: 8 [2018-12-03 19:22:32,630 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 19:22:32,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 19:22:32,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 19:22:32,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 19:22:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 19:22:32,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 19:22:32,636 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 19:22:32,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:22:32,636 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 19:22:32,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 19:22:32,636 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 19:22:32,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 19:22:32,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:22:32,639 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 19:22:32,640 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:22:32,640 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:22:32,640 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-03 19:22:32,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:22:32,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:32,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:22:32,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:22:32,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:22:32,651 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 19:22:32,651 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 19:22:32,651 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 19:22:32,666 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:22:32,666 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 19:22:32,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:22:32,699 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:22:32,700 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:22:32,700 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:22:32,700 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 19:22:32,711 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 19:22:32,711 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 19:22:32,771 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 19:22:32,771 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:22:32,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:22:32,879 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 19:22:32,879 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:22:35,184 WARN L180 SmtUtils]: Spent 2.18 s on a formula simplification. DAG size of input: 32 DAG size of output: 20 [2018-12-03 19:22:39,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:22:39,595 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 19:22:39,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2018-12-03 19:22:39,595 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:22:39,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 19:22:39,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 19:22:39,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=32, Unknown=2, NotChecked=0, Total=56 [2018-12-03 19:22:39,597 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 8 states. [2018-12-03 19:23:01,596 WARN L180 SmtUtils]: Spent 19.57 s on a formula simplification that was a NOOP. DAG size: 41 [2018-12-03 19:23:01,937 WARN L180 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-12-03 19:23:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:23:02,441 INFO L93 Difference]: Finished difference Result 12 states and 15 transitions. [2018-12-03 19:23:02,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 19:23:02,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 5 [2018-12-03 19:23:02,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:23:02,446 INFO L225 Difference]: With dead ends: 12 [2018-12-03 19:23:02,446 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 19:23:02,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 28.7s TimeCoverageRelationStatistics Valid=38, Invalid=49, Unknown=3, NotChecked=0, Total=90 [2018-12-03 19:23:02,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 19:23:02,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 19:23:02,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 19:23:02,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 19:23:02,452 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 5 [2018-12-03 19:23:02,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:23:02,452 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 19:23:02,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 19:23:02,453 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 19:23:02,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 19:23:02,453 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:23:02,453 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 19:23:02,454 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:23:02,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:23:02,454 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 3 times [2018-12-03 19:23:02,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:23:02,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:02,455 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:23:02,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:23:02,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:23:02,480 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 19:23:02,481 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 19:23:02,481 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 19:23:02,501 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:23:02,501 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 19:23:02,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:23:02,609 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:23:02,610 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:23:02,610 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:23:02,610 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 19:23:02,619 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 19:23:02,619 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 19:23:02,722 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 19:23:02,723 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 19:23:02,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 19:23:03,170 WARN L180 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 12 [2018-12-03 19:23:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 19:23:03,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 19:23:05,502 WARN L180 SmtUtils]: Spent 2.13 s on a formula simplification. DAG size of input: 32 DAG size of output: 20 [2018-12-03 19:23:10,861 WARN L180 SmtUtils]: Spent 4.90 s on a formula simplification that was a NOOP. DAG size: 31 [2018-12-03 19:23:27,239 WARN L180 SmtUtils]: Spent 13.83 s on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2018-12-03 19:23:41,877 WARN L180 SmtUtils]: Spent 9.61 s on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2018-12-03 19:23:43,972 WARN L854 $PredicateComparison]: unable to prove that (or (forall ((ULTIMATE.start_main_~n~6 Int)) (let ((.cse1 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse3 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296)) (.cse0 (mod ULTIMATE.start_main_~n~6 4294967296)) (.cse2 (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296))) (or (<= (mod (+ c_ULTIMATE.start_main_~i~6 6) 4294967296) .cse0) (= (mod (div (mod (* .cse0 (+ .cse0 1)) 18446744073709551616) 2) 18446744073709551616) (mod (+ .cse1 .cse2 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296) c_ULTIMATE.start_main_~sn~6 .cse3 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) 18446744073709551616)) (< .cse0 .cse1) (< .cse0 .cse3) (< .cse0 .cse2)))) (= 0 (mod (+ (mod c_ULTIMATE.start_main_~i~6 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296) c_ULTIMATE.start_main_~sn~6 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296) (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) 18446744073709551616))) is different from true [2018-12-03 19:23:43,975 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 12 refuted. 3 times theorem prover too weak. 0 trivial. 6 not checked. [2018-12-03 19:23:43,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-03 19:23:43,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2018-12-03 19:23:43,998 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 19:23:43,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-03 19:23:43,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-03 19:23:44,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=139, Unknown=4, NotChecked=26, Total=240 [2018-12-03 19:23:44,003 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 16 states. [2018-12-03 19:24:50,606 WARN L180 SmtUtils]: Spent 1.03 m on a formula simplification that was a NOOP. DAG size: 69 [2018-12-03 19:26:07,486 WARN L180 SmtUtils]: Spent 1.22 m on a formula simplification. DAG size of input: 59 DAG size of output: 59 [2018-12-03 19:26:48,114 WARN L180 SmtUtils]: Spent 34.23 s on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2018-12-03 19:26:58,750 WARN L180 SmtUtils]: Spent 4.25 s on a formula simplification that was a NOOP. DAG size: 39 [2018-12-03 19:27:04,258 WARN L180 SmtUtils]: Spent 844.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-12-03 19:27:08,306 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (mod c_ULTIMATE.start_main_~i~6 4294967296)) (.cse2 (mod c_ULTIMATE.start_main_~n~6 4294967296)) (.cse7 (mod (+ c_ULTIMATE.start_main_~i~6 1) 4294967296))) (let ((.cse3 (mod (+ c_ULTIMATE.start_main_~i~6 4) 4294967296)) (.cse6 (mod (+ c_ULTIMATE.start_main_~i~6 3) 4294967296)) (.cse10 (< .cse2 .cse7)) (.cse8 (mod (+ c_ULTIMATE.start_main_~i~6 2) 4294967296)) (.cse1 (< .cse2 .cse5)) (.cse4 (mod (div (mod (* .cse2 (+ .cse2 1)) 18446744073709551616) 2) 18446744073709551616))) (and (let ((.cse0 (mod (+ .cse5 .cse6 .cse3 c_ULTIMATE.start_main_~sn~6 .cse7 .cse8) 18446744073709551616))) (or (= 0 .cse0) .cse1 (< .cse2 .cse3) (= .cse4 .cse0) (<= (mod (+ c_ULTIMATE.start_main_~i~6 5) 4294967296) .cse2))) (let ((.cse9 (mod (+ .cse5 c_ULTIMATE.start_main_~sn~6 .cse7) 18446744073709551616))) (or (= .cse4 .cse9) (<= .cse8 .cse2) .cse1 .cse10 (= 0 .cse9))) (let ((.cse11 (mod (+ .cse5 .cse6 c_ULTIMATE.start_main_~sn~6 .cse7 .cse8) 18446744073709551616))) (or (= .cse11 .cse4) (= .cse11 0) (< .cse2 .cse6) .cse1 (<= .cse3 .cse2))) (let ((.cse12 (mod (+ .cse5 c_ULTIMATE.start_main_~sn~6 .cse7 .cse8) 18446744073709551616))) (or (<= .cse6 .cse2) (= 0 .cse12) .cse1 (= .cse4 .cse12) (< .cse2 .cse8) .cse10)) (let ((.cse13 (mod (+ .cse5 c_ULTIMATE.start_main_~sn~6) 18446744073709551616))) (or .cse1 (<= .cse7 .cse2) (= .cse4 .cse13) (= 0 .cse13)))))) is different from true [2018-12-03 19:27:08,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 19:27:08,308 INFO L93 Difference]: Finished difference Result 19 states and 25 transitions. [2018-12-03 19:27:08,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 19:27:08,309 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 9 [2018-12-03 19:27:08,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 19:27:08,310 INFO L225 Difference]: With dead ends: 19 [2018-12-03 19:27:08,310 INFO L226 Difference]: Without dead ends: 17 [2018-12-03 19:27:08,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 228.7s TimeCoverageRelationStatistics Valid=148, Invalid=231, Unknown=9, NotChecked=74, Total=462 [2018-12-03 19:27:08,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-12-03 19:27:08,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-03 19:27:08,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-03 19:27:08,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-12-03 19:27:08,317 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 9 [2018-12-03 19:27:08,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 19:27:08,317 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-12-03 19:27:08,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-03 19:27:08,318 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-12-03 19:27:08,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 19:27:08,318 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 19:27:08,318 INFO L402 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2018-12-03 19:27:08,319 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 19:27:08,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 19:27:08,319 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 4 times [2018-12-03 19:27:08,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 19:27:08,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:27:08,320 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 19:27:08,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 19:27:08,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 19:27:08,368 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 19:27:08,369 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 19:27:08,369 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 19:27:08,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:27:08,384 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 19:27:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 19:27:09,335 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 19:27:09,335 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 19:27:09,335 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 19:27:09,336 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 19:27:09,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 19:27:09,350 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 19:27:21,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2018-12-03 19:27:21,593 INFO L285 seRefinementStrategy]: Strategy TaipanRefinementStrategy was unsuccessful and could not determine trace feasibility. [2018-12-03 19:27:21,593 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 19:27:21,615 WARN L228 ceAbstractionStarter]: Unable to decide correctness. Please check the following counterexample manually. [2018-12-03 19:27:21,615 INFO L202 PluginConnector]: Adding new model sum02.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 07:27:21 BoogieIcfgContainer [2018-12-03 19:27:21,615 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 19:27:21,616 INFO L168 Benchmark]: Toolchain (without parser) took 291651.53 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 630.2 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -533.1 MB). Peak memory consumption was 97.1 MB. Max. memory is 7.1 GB. [2018-12-03 19:27:21,617 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 19:27:21,618 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 19:27:21,618 INFO L168 Benchmark]: Boogie Preprocessor took 22.61 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 19:27:21,619 INFO L168 Benchmark]: RCFGBuilder took 366.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 19:27:21,620 INFO L168 Benchmark]: TraceAbstraction took 291217.90 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 630.2 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -554.2 MB). Peak memory consumption was 76.0 MB. Max. memory is 7.1 GB. [2018-12-03 19:27:21,624 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.20 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.94 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 22.61 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 366.71 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 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 291217.90 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 630.2 MB). Free memory was 1.4 GB in the beginning and 2.0 GB in the end (delta: -554.2 MB). Peak memory consumption was 76.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 46]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: unable to decide satisfiability of path constraint. Possible FailurePath: [L14] havoc main_#res; [L15] havoc main_#t~nondet0, main_#t~post1, main_~i~6, main_~n~6, main_~sn~6, main_~nl~6, main_~gauss~6; [L16] havoc main_~i~6; [L17] main_~n~6 := main_#t~nondet0; [L18] havoc main_#t~nondet0; [L19] main_~sn~6 := 0; [L20] assume main_~n~6 % 4294967296 % 18446744073709551616 < 4294967296; [L21] main_~i~6 := 0; [L39] assume !!(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L40] main_~sn~6 := main_~sn~6 + main_~i~6 % 4294967296; [L41] main_#t~post1 := main_~i~6; [L42] main_~i~6 := main_#t~post1 + 1; [L43] havoc main_#t~post1; [L39] assume !!(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L40] main_~sn~6 := main_~sn~6 + main_~i~6 % 4294967296; [L41] main_#t~post1 := main_~i~6; [L42] main_~i~6 := main_#t~post1 + 1; [L43] havoc main_#t~post1; [L39] assume !!(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L40] main_~sn~6 := main_~sn~6 + main_~i~6 % 4294967296; [L41] main_#t~post1 := main_~i~6; [L42] main_~i~6 := main_#t~post1 + 1; [L43] havoc main_#t~post1; [L39] assume !!(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L40] main_~sn~6 := main_~sn~6 + main_~i~6 % 4294967296; [L41] main_#t~post1 := main_~i~6; [L42] main_~i~6 := main_#t~post1 + 1; [L43] havoc main_#t~post1; [L39] assume !!(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L40] main_~sn~6 := main_~sn~6 + main_~i~6 % 4294967296; [L41] main_#t~post1 := main_~i~6; [L42] main_~i~6 := main_#t~post1 + 1; [L43] havoc main_#t~post1; [L39] assume !!(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L40] main_~sn~6 := main_~sn~6 + main_~i~6 % 4294967296; [L41] main_#t~post1 := main_~i~6; [L42] main_~i~6 := main_#t~post1 + 1; [L43] havoc main_#t~post1; [L39] assume !!(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L40] main_~sn~6 := main_~sn~6 + main_~i~6 % 4294967296; [L41] main_#t~post1 := main_~i~6; [L42] main_~i~6 := main_#t~post1 + 1; [L43] havoc main_#t~post1; [L39] assume !!(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L40] main_~sn~6 := main_~sn~6 + main_~i~6 % 4294967296; [L41] main_#t~post1 := main_~i~6; [L42] main_~i~6 := main_#t~post1 + 1; [L43] havoc main_#t~post1; [L39] assume !!(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L40] main_~sn~6 := main_~sn~6 + main_~i~6 % 4294967296; [L41] main_#t~post1 := main_~i~6; [L42] main_~i~6 := main_#t~post1 + 1; [L43] havoc main_#t~post1; [L39] assume !!(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L40] main_~sn~6 := main_~sn~6 + main_~i~6 % 4294967296; [L41] main_#t~post1 := main_~i~6; [L42] main_~i~6 := main_#t~post1 + 1; [L43] havoc main_#t~post1; [L39] assume !!(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L40] main_~sn~6 := main_~sn~6 + main_~i~6 % 4294967296; [L41] main_#t~post1 := main_~i~6; [L42] main_~i~6 := main_#t~post1 + 1; [L43] havoc main_#t~post1; [L39] assume !!(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L40] main_~sn~6 := main_~sn~6 + main_~i~6 % 4294967296; [L41] main_#t~post1 := main_~i~6; [L42] main_~i~6 := main_#t~post1 + 1; [L43] havoc main_#t~post1; [L39] assume !!(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L40] main_~sn~6 := main_~sn~6 + main_~i~6 % 4294967296; [L41] main_#t~post1 := main_~i~6; [L42] main_~i~6 := main_#t~post1 + 1; [L43] havoc main_#t~post1; [L29] assume !(main_~i~6 % 4294967296 <= main_~n~6 % 4294967296); [L30] main_~nl~6 := main_~n~6 % 4294967296; [L31] main_~gauss~6 := (if main_~nl~6 * (main_~nl~6 + 1) % 18446744073709551616 < 0 && main_~nl~6 * (main_~nl~6 + 1) % 18446744073709551616 % 2 != 0 then main_~nl~6 * (main_~nl~6 + 1) % 18446744073709551616 / 2 + 1 else main_~nl~6 * (main_~nl~6 + 1) % 18446744073709551616 / 2); [L32] __VERIFIER_assert_#in~cond := (if main_~sn~6 % 18446744073709551616 == main_~gauss~6 % 18446744073709551616 || main_~sn~6 % 18446744073709551616 == 0 then 1 else 0); [L33] havoc __VERIFIER_assert_~cond; [L34] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L35] assume __VERIFIER_assert_~cond == 0; [L36] assume !false; [L46] assert false; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. UNKNOWN Result, 291.1s OverallTime, 5 OverallIterations, 13 TraceHistogramMax, 227.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12 SDtfs, 1 SDslu, 6 SDs, 0 SdLazy, 96 SolverSat, 24 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 17.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 257.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.9s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 13.3s SatisfiabilityAnalysisTime, 48.5s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 34 ConstructedInterpolants, 3 QuantifiedInterpolants, 5843 SizeOfPredicates, 27 NumberOfNonLiveVariables, 129 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 0/50 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...