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/20170319-ConjunctivePathPrograms/num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-c78c21b [2018-12-03 15:21:55,896 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 15:21:55,898 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 15:21:55,914 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 15:21:55,914 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 15:21:55,915 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 15:21:55,916 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 15:21:55,918 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 15:21:55,920 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 15:21:55,921 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 15:21:55,922 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 15:21:55,922 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 15:21:55,923 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 15:21:55,925 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 15:21:55,927 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 15:21:55,927 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 15:21:55,928 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 15:21:55,930 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 15:21:55,932 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 15:21:55,934 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 15:21:55,935 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 15:21:55,939 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 15:21:55,945 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 15:21:55,945 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 15:21:55,945 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 15:21:55,946 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 15:21:55,951 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 15:21:55,951 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 15:21:55,952 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 15:21:55,953 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 15:21:55,953 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 15:21:55,954 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 15:21:55,954 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 15:21:55,954 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 15:21:55,958 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 15:21:55,959 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 15:21:55,960 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:21:55,981 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 15:21:55,981 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 15:21:55,982 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2018-12-03 15:21:55,982 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2018-12-03 15:21:55,982 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 15:21:55,982 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 15:21:55,983 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 15:21:55,983 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 15:21:55,983 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 15:21:55,983 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 15:21:55,983 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 15:21:55,984 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2018-12-03 15:21:55,984 INFO L133 SettingsManager]: * Log string format=TERM [2018-12-03 15:21:55,984 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 15:21:55,984 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 15:21:55,985 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-03 15:21:55,985 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-03 15:21:55,985 INFO L133 SettingsManager]: * Use SBE=true [2018-12-03 15:21:55,985 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 15:21:55,986 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 15:21:55,986 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 15:21:55,986 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 15:21:55,986 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 15:21:55,986 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 15:21:55,987 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 15:21:55,987 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 15:21:55,987 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 15:21:55,987 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 15:21:55,987 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 15:21:55,988 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 15:21:55,988 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 15:21:55,988 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 15:21:55,988 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:21:55,988 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 15:21:55,988 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 15:21:55,989 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 15:21:55,989 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 15:21:55,989 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 15:21:55,989 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 15:21:55,989 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 15:21:55,990 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-12-03 15:21:56,031 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 15:21:56,044 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 15:21:56,048 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 15:21:56,049 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-12-03 15:21:56,050 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-12-03 15:21:56,051 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl [2018-12-03 15:21:56,051 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170319-ConjunctivePathPrograms/num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl' [2018-12-03 15:21:56,088 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 15:21:56,090 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-12-03 15:21:56,091 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 15:21:56,091 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 15:21:56,091 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 15:21:56,108 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:56" (1/1) ... [2018-12-03 15:21:56,118 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:56" (1/1) ... [2018-12-03 15:21:56,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 15:21:56,128 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 15:21:56,128 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 15:21:56,128 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 15:21:56,141 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:56" (1/1) ... [2018-12-03 15:21:56,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:56" (1/1) ... [2018-12-03 15:21:56,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:56" (1/1) ... [2018-12-03 15:21:56,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:56" (1/1) ... [2018-12-03 15:21:56,146 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:56" (1/1) ... [2018-12-03 15:21:56,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:56" (1/1) ... [2018-12-03 15:21:56,149 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:56" (1/1) ... [2018-12-03 15:21:56,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 15:21:56,152 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 15:21:56,152 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 15:21:56,152 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 15:21:56,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 15:21:56,228 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-12-03 15:21:56,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 15:21:56,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 15:21:56,467 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 15:21:56,468 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-03 15:21:56,468 INFO L202 PluginConnector]: Adding new model num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:21:56 BoogieIcfgContainer [2018-12-03 15:21:56,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 15:21:56,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 15:21:56,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 15:21:56,473 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 15:21:56,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 03.12 03:21:56" (1/2) ... [2018-12-03 15:21:56,475 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e0bff37 and model type num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:21:56, skipping insertion in model container [2018-12-03 15:21:56,475 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:21:56" (2/2) ... [2018-12-03 15:21:56,477 INFO L112 eAbstractionObserver]: Analyzing ICFG num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl [2018-12-03 15:21:56,488 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 15:21:56,496 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-03 15:21:56,516 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-03 15:21:56,552 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 15:21:56,552 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 15:21:56,552 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 15:21:56,552 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 15:21:56,553 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 15:21:56,553 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 15:21:56,553 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 15:21:56,553 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 15:21:56,570 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-12-03 15:21:56,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2018-12-03 15:21:56,576 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:56,577 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2018-12-03 15:21:56,580 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:56,586 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:56,587 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2018-12-03 15:21:56,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:56,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:56,649 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:56,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:56,649 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:56,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:56,819 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:21:56,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 15:21:56,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 15:21:56,822 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 15:21:56,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 15:21:56,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 15:21:56,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 15:21:56,848 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-12-03 15:21:56,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:56,922 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2018-12-03 15:21:56,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 15:21:56,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2018-12-03 15:21:56,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:56,936 INFO L225 Difference]: With dead ends: 9 [2018-12-03 15:21:56,937 INFO L226 Difference]: Without dead ends: 5 [2018-12-03 15:21:56,943 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:21:56,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2018-12-03 15:21:56,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2018-12-03 15:21:56,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-03 15:21:56,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2018-12-03 15:21:56,988 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2018-12-03 15:21:56,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:56,988 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2018-12-03 15:21:56,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 15:21:56,988 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2018-12-03 15:21:56,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-12-03 15:21:56,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:56,989 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-12-03 15:21:56,989 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:56,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:56,990 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2018-12-03 15:21:56,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:56,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:56,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:56,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:56,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:57,085 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 15:21:57,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:57,086 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:57,087 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2018-12-03 15:21:57,089 INFO L205 CegarAbsIntRunner]: [0], [5], [7], [9] [2018-12-03 15:21:57,144 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2018-12-03 15:21:57,144 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 15:21:57,442 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 15:21:57,443 INFO L272 AbstractInterpreter]: Visited 4 different actions 12 times. Merged at 3 different actions 7 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-12-03 15:21:57,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:57,461 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 15:21:57,461 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:57,461 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 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:57,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:57,480 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:57,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:57,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:57,580 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 15:21:57,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:57,847 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 15:21:57,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:57,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 15:21:57,867 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:57,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 15:21:57,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 15:21:57,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:21:57,869 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2018-12-03 15:21:57,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:57,892 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2018-12-03 15:21:57,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 15:21:57,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2018-12-03 15:21:57,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:57,894 INFO L225 Difference]: With dead ends: 8 [2018-12-03 15:21:57,894 INFO L226 Difference]: Without dead ends: 6 [2018-12-03 15:21:57,895 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 15:21:57,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2018-12-03 15:21:57,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2018-12-03 15:21:57,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-03 15:21:57,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2018-12-03 15:21:57,897 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2018-12-03 15:21:57,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:57,898 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2018-12-03 15:21:57,898 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 15:21:57,898 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2018-12-03 15:21:57,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2018-12-03 15:21:57,899 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:57,899 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2018-12-03 15:21:57,899 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:57,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:57,900 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2018-12-03 15:21:57,900 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:57,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:57,901 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:57,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:57,902 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:58,010 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 15:21:58,010 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:58,011 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:58,011 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:58,012 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:58,012 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:58,012 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 15:21:58,023 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:58,023 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:58,050 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 15:21:58,050 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:58,052 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:58,056 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 15:21:58,057 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:58,206 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 15:21:58,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:58,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-03 15:21:58,227 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:58,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 15:21:58,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 15:21:58,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:21:58,228 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2018-12-03 15:21:58,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:58,293 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2018-12-03 15:21:58,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 15:21:58,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2018-12-03 15:21:58,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:58,295 INFO L225 Difference]: With dead ends: 9 [2018-12-03 15:21:58,295 INFO L226 Difference]: Without dead ends: 7 [2018-12-03 15:21:58,295 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-03 15:21:58,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-12-03 15:21:58,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-12-03 15:21:58,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-03 15:21:58,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-12-03 15:21:58,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2018-12-03 15:21:58,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:58,299 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-12-03 15:21:58,299 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 15:21:58,299 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-12-03 15:21:58,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-12-03 15:21:58,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:58,300 INFO L402 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2018-12-03 15:21:58,302 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:58,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:58,302 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2018-12-03 15:21:58,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:58,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:58,305 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:58,305 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:58,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:58,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:58,523 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:58,524 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:58,524 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:58,524 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:58,525 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:58,525 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:58,525 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:58,536 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:21:58,536 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:21:58,586 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:21:58,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:58,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:58,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:58,597 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:58,794 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:58,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:58,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-03 15:21:58,814 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:58,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 15:21:58,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 15:21:58,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:21:58,816 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2018-12-03 15:21:58,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:58,836 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2018-12-03 15:21:58,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 15:21:58,838 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2018-12-03 15:21:58,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:58,839 INFO L225 Difference]: With dead ends: 10 [2018-12-03 15:21:58,839 INFO L226 Difference]: Without dead ends: 8 [2018-12-03 15:21:58,840 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:21:58,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2018-12-03 15:21:58,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2018-12-03 15:21:58,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-03 15:21:58,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2018-12-03 15:21:58,844 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2018-12-03 15:21:58,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:58,844 INFO L480 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2018-12-03 15:21:58,845 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 15:21:58,845 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2018-12-03 15:21:58,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-03 15:21:58,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:58,845 INFO L402 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2018-12-03 15:21:58,846 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:58,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:58,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2018-12-03 15:21:58,846 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:58,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:58,847 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:58,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:58,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:58,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:59,040 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:59,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:59,041 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:59,041 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:59,041 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:59,042 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:59,042 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 15:21:59,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:59,051 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:21:59,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:59,069 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:59,076 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:59,076 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:59,177 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:59,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:59,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2018-12-03 15:21:59,198 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:59,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 15:21:59,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 15:21:59,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:21:59,200 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2018-12-03 15:21:59,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:59,236 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-12-03 15:21:59,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 15:21:59,238 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2018-12-03 15:21:59,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:59,239 INFO L225 Difference]: With dead ends: 11 [2018-12-03 15:21:59,239 INFO L226 Difference]: Without dead ends: 9 [2018-12-03 15:21:59,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:21:59,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-12-03 15:21:59,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-03 15:21:59,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-03 15:21:59,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-12-03 15:21:59,243 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2018-12-03 15:21:59,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:59,243 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-12-03 15:21:59,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 15:21:59,244 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-12-03 15:21:59,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-03 15:21:59,244 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:59,244 INFO L402 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2018-12-03 15:21:59,244 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:59,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:59,245 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2018-12-03 15:21:59,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:59,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:59,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:21:59,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:59,246 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:59,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:21:59,373 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:59,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:59,373 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:21:59,374 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:21:59,374 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:21:59,374 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:21:59,374 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:21:59,386 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 15:21:59,387 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 15:21:59,450 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-12-03 15:21:59,450 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:21:59,453 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:21:59,470 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:59,470 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:21:59,816 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:21:59,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:21:59,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2018-12-03 15:21:59,836 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:21:59,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 15:21:59,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 15:21:59,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:21:59,837 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2018-12-03 15:21:59,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:21:59,884 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-12-03 15:21:59,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 15:21:59,884 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2018-12-03 15:21:59,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:21:59,885 INFO L225 Difference]: With dead ends: 12 [2018-12-03 15:21:59,885 INFO L226 Difference]: Without dead ends: 10 [2018-12-03 15:21:59,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:21:59,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2018-12-03 15:21:59,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2018-12-03 15:21:59,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-03 15:21:59,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2018-12-03 15:21:59,888 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2018-12-03 15:21:59,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:21:59,889 INFO L480 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2018-12-03 15:21:59,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 15:21:59,889 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2018-12-03 15:21:59,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 15:21:59,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:21:59,890 INFO L402 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2018-12-03 15:21:59,890 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:21:59,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:21:59,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2018-12-03 15:21:59,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:21:59,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:59,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:21:59,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:21:59,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:21:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:00,184 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 15:22:00,185 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:00,185 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:00,185 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:00,186 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:00,186 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:00,186 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 15:22:00,201 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-03 15:22:00,202 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-03 15:22:00,222 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-03 15:22:00,223 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 15:22:00,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:00,232 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 15:22:00,232 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:00,328 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 15:22:00,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:00,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 9 [2018-12-03 15:22:00,347 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:00,347 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 15:22:00,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 15:22:00,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:22:00,348 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2018-12-03 15:22:00,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:00,388 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-12-03 15:22:00,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 15:22:00,388 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2018-12-03 15:22:00,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:00,389 INFO L225 Difference]: With dead ends: 13 [2018-12-03 15:22:00,389 INFO L226 Difference]: Without dead ends: 11 [2018-12-03 15:22:00,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:22:00,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-12-03 15:22:00,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-12-03 15:22:00,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-12-03 15:22:00,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-12-03 15:22:00,393 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2018-12-03 15:22:00,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:00,393 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-12-03 15:22:00,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 15:22:00,393 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-12-03 15:22:00,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 15:22:00,394 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:00,394 INFO L402 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2018-12-03 15:22:00,394 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:00,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:00,395 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2018-12-03 15:22:00,395 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:00,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:00,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 15:22:00,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:00,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:00,665 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:00,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:00,666 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 15:22:00,666 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 15:22:00,666 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 15:22:00,666 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 15:22:00,667 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-03 15:22:00,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:00,677 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 15:22:00,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 15:22:00,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 15:22:00,709 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:00,713 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 15:22:00,844 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 15:22:00,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 15:22:00,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 9 [2018-12-03 15:22:00,863 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 15:22:00,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 15:22:00,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 15:22:00,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:22:00,864 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2018-12-03 15:22:00,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 15:22:00,935 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-12-03 15:22:00,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 15:22:00,936 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-12-03 15:22:00,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 15:22:00,937 INFO L225 Difference]: With dead ends: 14 [2018-12-03 15:22:00,937 INFO L226 Difference]: Without dead ends: 12 [2018-12-03 15:22:00,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 8 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-03 15:22:00,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-12-03 15:22:00,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-12-03 15:22:00,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-03 15:22:00,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-12-03 15:22:00,940 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-12-03 15:22:00,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 15:22:00,941 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-12-03 15:22:00,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 15:22:00,941 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-12-03 15:22:00,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 15:22:00,941 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 15:22:00,941 INFO L402 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2018-12-03 15:22:00,942 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-12-03 15:22:00,942 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 15:22:00,942 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2018-12-03 15:22:00,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 15:22:00,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:00,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 15:22:00,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 15:22:00,943 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 15:22:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 15:22:01,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 15:22:01,066 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 15:22:01,092 INFO L202 PluginConnector]: Adding new model num_conversion_1.i_3.bplTransformedIcfg_BEv2_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:22:01 BoogieIcfgContainer [2018-12-03 15:22:01,092 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 15:22:01,093 INFO L168 Benchmark]: Toolchain (without parser) took 5004.07 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 683.7 MB). Free memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: -669.3 MB). Peak memory consumption was 14.4 MB. Max. memory is 7.1 GB. [2018-12-03 15:22:01,095 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:22:01,096 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.81 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:22:01,096 INFO L168 Benchmark]: Boogie Preprocessor took 23.29 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:22:01,097 INFO L168 Benchmark]: RCFGBuilder took 316.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-12-03 15:22:01,098 INFO L168 Benchmark]: TraceAbstraction took 4623.33 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 683.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -690.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-12-03 15:22:01,102 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 36.81 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 23.29 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 316.59 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4623.33 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 683.7 MB). Free memory was 1.4 GB in the beginning and 2.1 GB in the end (delta: -690.5 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 46]: assertion can be violated assertion can be violated We found a FailurePath: [L14] havoc main_#res; [L15] havoc main_~bit~5, main_~c~4, main_~x~4, main_~y~4, main_~i~5; [L16] havoc main_~x~4; [L17] havoc main_~y~4; [L18] havoc main_~c~4; [L19] main_~x~4 := 37; [L20] main_~y~4 := 0; [L21] main_~c~4 := 0; VAL [main_~c~4=0, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=767, main_~c~4=1, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=767, main_~c~4=2, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=767, main_~c~4=3, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=767, main_~c~4=4, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=767, main_~c~4=5, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=767, main_~c~4=6, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=767, main_~c~4=7, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L36] assume 0 <= main_~c~4 && main_~c~4 < 8; [L37] havoc main_~i~5; [L38] havoc main_~bit~5; [L39] assume 256 + 256 <= main_~bit~5 && !(main_~bit~5 % 256 == 0); [L40] assume (0 <= main_~y~4 && main_~y~4 < 256) && main_~i~5 < -256; [L41] main_~y~4 := main_~i~5 % 256 + main_~y~4; [L42] assume 0 <= main_~c~4 && main_~c~4 < 256; [L43] main_~c~4 := main_~c~4 + 1; VAL [main_~bit~5=767, main_~c~4=8, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L28] assume !(main_~c~4 < 8) && main_~c~4 < 256; [L29] assume (((main_~y~4 < 256 && 0 <= main_~y~4) && 0 <= main_~x~4) && main_~x~4 < 256) && !(main_~x~4 == main_~y~4); [L30] __VERIFIER_assert_#in~cond := 0; [L31] havoc __VERIFIER_assert_~cond; [L32] __VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; [L33] assume __VERIFIER_assert_~cond == 0; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~5=767, main_~c~4=8, main_~i~5=-512, main_~x~4=37, main_~y~4=0] [L46] assert false; VAL [__VERIFIER_assert_#in~cond=0, __VERIFIER_assert_~cond=0, main_~bit~5=767, main_~c~4=8, main_~i~5=-512, main_~x~4=37, main_~y~4=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. UNSAFE Result, 4.5s OverallTime, 9 OverallIterations, 8 TraceHistogramMax, 0.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 0 SDslu, 33 SDs, 0 SdLazy, 77 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 57 SyntacticMatches, 20 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 112 NumberOfCodeBlocks, 112 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 128 ConstructedInterpolants, 0 QuantifiedInterpolants, 2276 SizeOfPredicates, 7 NumberOfNonLiveVariables, 490 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 22 InterpolantComputations, 1 PerfectInterpolantSequences, 0/252 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...