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/20170304-DifficultPathPrograms/s3_srvr_3_alt.BV.c.cil.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:41:32,891 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:41:32,893 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:41:32,908 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:41:32,908 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:41:32,909 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:41:32,911 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:41:32,913 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:41:32,917 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:41:32,918 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:41:32,919 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:41:32,919 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:41:32,920 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:41:32,923 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:41:32,924 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:41:32,925 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:41:32,926 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:41:32,929 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:41:32,931 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:41:32,935 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:41:32,937 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:41:32,938 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:41:32,942 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:41:32,942 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:41:32,942 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:41:32,943 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:41:32,944 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:41:32,946 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:41:32,950 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:41:32,951 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:41:32,951 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:41:32,952 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:41:32,952 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:41:32,952 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:41:32,953 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:41:32,954 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:41:32,954 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 15:41:32,967 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:41:32,967 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:41:32,968 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:41:32,968 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:41:32,968 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:41:32,968 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:41:32,969 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:41:32,969 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:41:32,969 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:41:32,969 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:41:32,969 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:41:32,970 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:41:32,970 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:41:32,970 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:41:32,970 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:41:32,971 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:41:32,971 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:41:32,971 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:41:32,971 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:41:32,972 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:41:32,972 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:41:32,972 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:41:32,972 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:41:32,972 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:41:32,973 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:41:32,973 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:41:32,973 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:41:32,973 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:41:32,973 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:41:32,974 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:41:32,974 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:41:32,974 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:41:32,974 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:41:32,974 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:41:32,975 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:41:32,975 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:41:32,975 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:41:32,975 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:41:32,975 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:41:32,975 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:41:32,976 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:41:33,027 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:41:33,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:41:33,047 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:41:33,049 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:41:33,049 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:41:33,050 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3_alt.BV.c.cil.c_19.bpl [2018-12-03 15:41:33,050 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/s3_srvr_3_alt.BV.c.cil.c_19.bpl' [2018-12-03 15:41:33,140 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:41:33,142 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:41:33,142 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:41:33,143 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:41:33,143 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:41:33,161 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:33" (1/1) ... [2018-12-03 15:41:33,177 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:33" (1/1) ... [2018-12-03 15:41:33,197 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:41:33,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:41:33,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:41:33,198 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:41:33,211 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:33" (1/1) ... [2018-12-03 15:41:33,212 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:33" (1/1) ... [2018-12-03 15:41:33,223 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:33" (1/1) ... [2018-12-03 15:41:33,223 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:33" (1/1) ... [2018-12-03 15:41:33,245 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:33" (1/1) ... [2018-12-03 15:41:33,251 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:33" (1/1) ... [2018-12-03 15:41:33,256 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:33" (1/1) ... [2018-12-03 15:41:33,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:41:33,261 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:41:33,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:41:33,261 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:41:33,262 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:33" (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 15:41:33,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:41:33,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:41:33,932 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:41:33,932 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-03 15:41:33,933 INFO L202 PluginConnector]: Adding new model s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:33 BoogieIcfgContainer [2018-12-03 15:41:33,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:41:33,935 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:41:33,935 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:41:33,941 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:41:33,941 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:41:33" (1/2) ... [2018-12-03 15:41:33,942 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7187ac19 and model type s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:41:33, skipping insertion in model container [2018-12-03 15:41:33,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "s3_srvr_3_alt.BV.c.cil.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:41:33" (2/2) ... [2018-12-03 15:41:33,945 INFO L112 eAbstractionObserver]: Analyzing ICFG s3_srvr_3_alt.BV.c.cil.c_19.bpl [2018-12-03 15:41:33,956 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:41:33,965 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:41:33,983 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:41:34,027 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:41:34,027 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:41:34,028 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:41:34,028 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:41:34,028 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:41:34,028 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:41:34,029 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:41:34,029 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:41:34,049 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-12-03 15:41:34,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 15:41:34,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:34,060 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:34,065 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:34,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:34,073 INFO L82 PathProgramCache]: Analyzing trace with hash -505433715, now seen corresponding path program 1 times [2018-12-03 15:41:34,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:34,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:34,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:34,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:34,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:34,346 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 15:41:34,348 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:34,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:34,348 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:34,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:34,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:34,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:34,371 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-12-03 15:41:34,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:34,726 INFO L93 Difference]: Finished difference Result 56 states and 94 transitions. [2018-12-03 15:41:34,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:34,729 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-12-03 15:41:34,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:34,742 INFO L225 Difference]: With dead ends: 56 [2018-12-03 15:41:34,742 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 15:41:34,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:34,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 15:41:34,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 15:41:34,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 15:41:34,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 57 transitions. [2018-12-03 15:41:34,793 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 57 transitions. Word has length 15 [2018-12-03 15:41:34,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:34,793 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 57 transitions. [2018-12-03 15:41:34,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:34,793 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 57 transitions. [2018-12-03 15:41:34,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 15:41:34,797 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:34,798 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:34,798 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:34,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:34,799 INFO L82 PathProgramCache]: Analyzing trace with hash -912155261, now seen corresponding path program 1 times [2018-12-03 15:41:34,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:34,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:34,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:34,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:34,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:34,902 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:34,902 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:34,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:34,903 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:34,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:34,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:34,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:34,906 INFO L87 Difference]: Start difference. First operand 34 states and 57 transitions. Second operand 3 states. [2018-12-03 15:41:35,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:35,309 INFO L93 Difference]: Finished difference Result 83 states and 141 transitions. [2018-12-03 15:41:35,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:35,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-12-03 15:41:35,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:35,311 INFO L225 Difference]: With dead ends: 83 [2018-12-03 15:41:35,311 INFO L226 Difference]: Without dead ends: 50 [2018-12-03 15:41:35,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:35,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-12-03 15:41:35,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2018-12-03 15:41:35,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-12-03 15:41:35,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 83 transitions. [2018-12-03 15:41:35,347 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 83 transitions. Word has length 23 [2018-12-03 15:41:35,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:35,348 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 83 transitions. [2018-12-03 15:41:35,349 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:35,349 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 83 transitions. [2018-12-03 15:41:35,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:41:35,350 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:35,351 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:35,351 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:35,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:35,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1423527967, now seen corresponding path program 1 times [2018-12-03 15:41:35,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:35,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:35,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:35,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:35,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:35,454 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-03 15:41:35,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:35,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:35,457 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:35,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:35,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:35,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:35,459 INFO L87 Difference]: Start difference. First operand 50 states and 83 transitions. Second operand 3 states. [2018-12-03 15:41:35,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:35,662 INFO L93 Difference]: Finished difference Result 106 states and 177 transitions. [2018-12-03 15:41:35,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:35,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 15:41:35,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:35,665 INFO L225 Difference]: With dead ends: 106 [2018-12-03 15:41:35,665 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 15:41:35,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:35,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 15:41:35,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-12-03 15:41:35,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-12-03 15:41:35,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 92 transitions. [2018-12-03 15:41:35,691 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 92 transitions. Word has length 30 [2018-12-03 15:41:35,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:35,691 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 92 transitions. [2018-12-03 15:41:35,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:35,691 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 92 transitions. [2018-12-03 15:41:35,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-03 15:41:35,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:35,695 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:35,695 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:35,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:35,696 INFO L82 PathProgramCache]: Analyzing trace with hash 222883079, now seen corresponding path program 1 times [2018-12-03 15:41:35,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:35,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:35,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:35,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:35,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:35,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:35,783 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:41:35,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:35,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:35,783 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:35,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:35,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:35,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:35,790 INFO L87 Difference]: Start difference. First operand 57 states and 92 transitions. Second operand 3 states. [2018-12-03 15:41:36,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:36,239 INFO L93 Difference]: Finished difference Result 131 states and 214 transitions. [2018-12-03 15:41:36,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:36,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-03 15:41:36,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:36,241 INFO L225 Difference]: With dead ends: 131 [2018-12-03 15:41:36,241 INFO L226 Difference]: Without dead ends: 74 [2018-12-03 15:41:36,242 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:36,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-12-03 15:41:36,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-12-03 15:41:36,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-12-03 15:41:36,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 120 transitions. [2018-12-03 15:41:36,257 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 120 transitions. Word has length 30 [2018-12-03 15:41:36,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:36,257 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 120 transitions. [2018-12-03 15:41:36,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:36,258 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 120 transitions. [2018-12-03 15:41:36,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-03 15:41:36,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:36,259 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:36,260 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:36,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:36,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1035189277, now seen corresponding path program 1 times [2018-12-03 15:41:36,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:36,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:36,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:36,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:36,262 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:36,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:36,340 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-03 15:41:36,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:36,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:36,341 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:36,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:36,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:36,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:36,343 INFO L87 Difference]: Start difference. First operand 74 states and 120 transitions. Second operand 3 states. [2018-12-03 15:41:36,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:36,626 INFO L93 Difference]: Finished difference Result 153 states and 249 transitions. [2018-12-03 15:41:36,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:36,627 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-03 15:41:36,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:36,628 INFO L225 Difference]: With dead ends: 153 [2018-12-03 15:41:36,628 INFO L226 Difference]: Without dead ends: 80 [2018-12-03 15:41:36,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:36,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-12-03 15:41:36,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2018-12-03 15:41:36,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-12-03 15:41:36,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 125 transitions. [2018-12-03 15:41:36,647 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 125 transitions. Word has length 36 [2018-12-03 15:41:36,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:36,647 INFO L480 AbstractCegarLoop]: Abstraction has 80 states and 125 transitions. [2018-12-03 15:41:36,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:36,648 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 125 transitions. [2018-12-03 15:41:36,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-12-03 15:41:36,649 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:36,649 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:36,650 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:36,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:36,650 INFO L82 PathProgramCache]: Analyzing trace with hash -720648959, now seen corresponding path program 1 times [2018-12-03 15:41:36,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:36,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:36,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:36,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:36,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:36,733 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-12-03 15:41:36,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:41:36,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:41:36,733 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:41:36,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:41:36,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:41:36,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:36,735 INFO L87 Difference]: Start difference. First operand 80 states and 125 transitions. Second operand 3 states. [2018-12-03 15:41:36,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:41:36,942 INFO L93 Difference]: Finished difference Result 164 states and 257 transitions. [2018-12-03 15:41:36,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:41:36,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2018-12-03 15:41:36,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:41:36,944 INFO L225 Difference]: With dead ends: 164 [2018-12-03 15:41:36,944 INFO L226 Difference]: Without dead ends: 85 [2018-12-03 15:41:36,945 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:41:36,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-12-03 15:41:36,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-12-03 15:41:36,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-12-03 15:41:36,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 127 transitions. [2018-12-03 15:41:36,961 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 127 transitions. Word has length 41 [2018-12-03 15:41:36,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:41:36,961 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 127 transitions. [2018-12-03 15:41:36,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:41:36,962 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 127 transitions. [2018-12-03 15:41:36,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-03 15:41:36,963 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:41:36,964 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 15:41:36,964 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:41:36,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:41:36,964 INFO L82 PathProgramCache]: Analyzing trace with hash -2015268825, now seen corresponding path program 1 times [2018-12-03 15:41:36,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:41:36,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:36,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:36,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:41:36,966 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:41:36,978 ERROR L235 seRefinementStrategy]: Caught known exception: Unsupported non-linear arithmetic [2018-12-03 15:41:36,978 INFO L258 seRefinementStrategy]: Advancing trace checker [2018-12-03 15:41:36,978 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 15:41:37,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:41:37,008 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_NO_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: null) [2018-12-03 15:41:37,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:41:37,082 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 45 with the following transitions: [2018-12-03 15:41:37,088 INFO L205 CegarAbsIntRunner]: [0], [2], [8], [10], [16], [22], [28], [34], [40], [46], [52], [58], [62], [64], [68], [74], [76], [78], [82], [90], [92], [94] [2018-12-03 15:41:37,153 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:41:37,154 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:41:37,444 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: inappropriate decl info at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:240) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.transformula.poorman.Boogie2SmtSymbolTableTmpVars.getBoogieVar(Boogie2SmtSymbolTableTmpVars.java:112) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.getBoogieVar(NonrelationalStatementProcessor.java:581) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.visit(NonrelationalStatementProcessor.java:520) at de.uni_freiburg.informatik.ultimate.boogie.BoogieVisitor.processExpression(BoogieVisitor.java:369) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processExpression(NonrelationalStatementProcessor.java:221) at de.uni_freiburg.informatik.ultimate.boogie.BoogieTransformer.processExpression(BoogieTransformer.java:681) at de.uni_freiburg.informatik.ultimate.boogie.BoogieVisitor.processExpression(BoogieVisitor.java:391) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processExpression(NonrelationalStatementProcessor.java:221) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.handleAssumeStatement(NonrelationalStatementProcessor.java:411) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.processStatement(NonrelationalStatementProcessor.java:194) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:176) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalStatementProcessor.process(NonrelationalStatementProcessor.java:145) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:373) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.handleInternalTransition(NonrelationalPostOperator.java:364) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:127) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.nonrelational.NonrelationalPostOperator.apply(NonrelationalPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.applyInternally(CompoundDomainPostOperator.java:306) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:131) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.compound.CompoundDomainPostOperator.apply(CompoundDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainToolkit.handleStatementBySubdomain(ArrayDomainToolkit.java:159) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainToolkit.handleAssumptionBySubdomain(ArrayDomainToolkit.java:148) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainExpressionProcessor.processAssume(ArrayDomainExpressionProcessor.java:89) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainStatementProcessor.processAssume(ArrayDomainStatementProcessor.java:62) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainStatementProcessor.process(ArrayDomainStatementProcessor.java:45) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainPostOperator.handleInternalTransition(ArrayDomainPostOperator.java:120) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainPostOperator.apply(ArrayDomainPostOperator.java:70) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.domain.array.ArrayDomainPostOperator.apply(ArrayDomainPostOperator.java:1) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.lambda$17(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.mapCollection(DisjunctiveAbstractState.java:536) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.absint.DisjunctiveAbstractState.apply(DisjunctiveAbstractState.java:340) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateAbstractPost(FixpointEngine.java:249) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.calculateFixpoint(FixpointEngine.java:134) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.algorithm.FixpointEngine.run(FixpointEngine.java:105) at de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2.tool.AbstractInterpreter.runWithoutTimeoutAndResults(AbstractInterpreter.java:149) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarAbsIntRunner.generateFixpoints(CegarAbsIntRunner.java:220) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.constructInterpolantGenerator(BaseTaipanRefinementStrategy.java:379) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseTaipanRefinementStrategy.getInterpolantGenerator(BaseTaipanRefinementStrategy.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.extractInterpolants(BaseRefinementStrategy.java:380) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.handleInfeasibleCase(BaseRefinementStrategy.java:296) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:206) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-12-03 15:41:37,448 INFO L168 Benchmark]: Toolchain (without parser) took 4307.86 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 686.8 MB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -709.1 MB). Peak memory consumption was 212.3 MB. Max. memory is 7.1 GB. [2018-12-03 15:41:37,455 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 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 15:41:37,455 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.90 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 15:41:37,456 INFO L168 Benchmark]: Boogie Preprocessor took 62.54 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 15:41:37,457 INFO L168 Benchmark]: RCFGBuilder took 673.34 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-12-03 15:41:37,458 INFO L168 Benchmark]: TraceAbstraction took 3512.95 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 686.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -740.8 MB). Peak memory consumption was 180.5 MB. Max. memory is 7.1 GB. [2018-12-03 15:41:37,463 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.90 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 62.54 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 673.34 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3512.95 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 686.8 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -740.8 MB). Peak memory consumption was 180.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: inappropriate decl info de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: inappropriate decl info: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Boogie2SmtSymbolTable.getBoogieVar(Boogie2SmtSymbolTable.java:240) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...