java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cc990c [2018-09-30 20:15:57,632 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-30 20:15:57,634 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-30 20:15:57,647 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-30 20:15:57,647 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-30 20:15:57,649 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-30 20:15:57,650 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-30 20:15:57,652 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-30 20:15:57,653 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-30 20:15:57,654 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-30 20:15:57,655 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-30 20:15:57,655 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-30 20:15:57,656 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-30 20:15:57,657 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-30 20:15:57,658 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-30 20:15:57,659 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-30 20:15:57,660 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-30 20:15:57,662 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-30 20:15:57,664 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-30 20:15:57,666 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-30 20:15:57,667 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-30 20:15:57,668 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-30 20:15:57,670 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-30 20:15:57,671 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-30 20:15:57,671 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-30 20:15:57,672 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-30 20:15:57,673 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-30 20:15:57,674 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-30 20:15:57,675 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-30 20:15:57,679 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-30 20:15:57,679 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-30 20:15:57,681 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-30 20:15:57,681 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-30 20:15:57,682 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-30 20:15:57,683 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-30 20:15:57,686 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-30 20:15:57,686 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/pu-bench/svcomp-Reach-32bit-Automizer_Default.epf [2018-09-30 20:15:57,717 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-30 20:15:57,717 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-30 20:15:57,718 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-09-30 20:15:57,719 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-09-30 20:15:57,719 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-09-30 20:15:57,720 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-09-30 20:15:57,720 INFO L133 SettingsManager]: * Use SBE=true [2018-09-30 20:15:57,720 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-09-30 20:15:57,720 INFO L133 SettingsManager]: * sizeof long=4 [2018-09-30 20:15:57,721 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-09-30 20:15:57,721 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-09-30 20:15:57,721 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-09-30 20:15:57,721 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-09-30 20:15:57,721 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-09-30 20:15:57,722 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-09-30 20:15:57,722 INFO L133 SettingsManager]: * sizeof long double=12 [2018-09-30 20:15:57,722 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-09-30 20:15:57,722 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-09-30 20:15:57,724 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-30 20:15:57,724 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-09-30 20:15:57,724 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-09-30 20:15:57,724 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-09-30 20:15:57,725 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-09-30 20:15:57,725 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-30 20:15:57,725 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-09-30 20:15:57,725 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-09-30 20:15:57,725 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-09-30 20:15:57,726 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-09-30 20:15:57,726 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-09-30 20:15:57,726 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-30 20:15:57,780 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-30 20:15:57,796 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-30 20:15:57,802 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-30 20:15:57,804 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-30 20:15:57,804 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-30 20:15:57,805 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl [2018-09-30 20:15:57,806 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/invert_string.i_4.bpl' [2018-09-30 20:15:57,867 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-30 20:15:57,872 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-30 20:15:57,873 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-30 20:15:57,873 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-30 20:15:57,873 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-30 20:15:57,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:15:57" (1/1) ... [2018-09-30 20:15:57,911 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:15:57" (1/1) ... [2018-09-30 20:15:57,920 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-30 20:15:57,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-30 20:15:57,921 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-30 20:15:57,921 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-30 20:15:57,933 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:15:57" (1/1) ... [2018-09-30 20:15:57,933 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:15:57" (1/1) ... [2018-09-30 20:15:57,935 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:15:57" (1/1) ... [2018-09-30 20:15:57,935 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:15:57" (1/1) ... [2018-09-30 20:15:57,940 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:15:57" (1/1) ... [2018-09-30 20:15:57,943 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:15:57" (1/1) ... [2018-09-30 20:15:57,945 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:15:57" (1/1) ... [2018-09-30 20:15:57,947 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-30 20:15:57,952 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-30 20:15:57,952 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-30 20:15:57,952 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-30 20:15:57,953 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:15:57" (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-09-30 20:15:58,030 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-30 20:15:58,030 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-30 20:15:58,334 INFO L348 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-30 20:15:58,337 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:15:58 BoogieIcfgContainer [2018-09-30 20:15:58,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-30 20:15:58,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-30 20:15:58,338 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-30 20:15:58,343 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-30 20:15:58,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 30.09 08:15:57" (1/2) ... [2018-09-30 20:15:58,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61588c40 and model type invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.09 08:15:58, skipping insertion in model container [2018-09-30 20:15:58,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.09 08:15:58" (2/2) ... [2018-09-30 20:15:58,347 INFO L112 eAbstractionObserver]: Analyzing ICFG invert_string.i_4.bpl [2018-09-30 20:15:58,359 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-09-30 20:15:58,367 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-30 20:15:58,424 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-30 20:15:58,425 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-30 20:15:58,425 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-30 20:15:58,425 INFO L383 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-09-30 20:15:58,425 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-30 20:15:58,426 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-30 20:15:58,426 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-30 20:15:58,426 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-30 20:15:58,426 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-30 20:15:58,445 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states. [2018-09-30 20:15:58,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-30 20:15:58,459 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:15:58,460 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2018-09-30 20:15:58,461 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:15:58,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:15:58,467 INFO L82 PathProgramCache]: Analyzing trace with hash 889539531, now seen corresponding path program 1 times [2018-09-30 20:15:58,469 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:15:58,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:15:58,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:15:58,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:15:58,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:15:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:15:58,731 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:15:58,733 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-30 20:15:58,734 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-09-30 20:15:58,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-30 20:15:58,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-30 20:15:58,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-30 20:15:58,758 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 4 states. [2018-09-30 20:15:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:15:58,903 INFO L93 Difference]: Finished difference Result 15 states and 18 transitions. [2018-09-30 20:15:58,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-30 20:15:58,906 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-09-30 20:15:58,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:15:58,921 INFO L225 Difference]: With dead ends: 15 [2018-09-30 20:15:58,921 INFO L226 Difference]: Without dead ends: 9 [2018-09-30 20:15:58,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 20:15:58,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-30 20:15:58,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-30 20:15:58,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-30 20:15:58,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 10 transitions. [2018-09-30 20:15:58,960 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 10 transitions. Word has length 6 [2018-09-30 20:15:58,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:15:58,961 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 10 transitions. [2018-09-30 20:15:58,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-30 20:15:58,961 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 10 transitions. [2018-09-30 20:15:58,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-30 20:15:58,962 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:15:58,962 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2018-09-30 20:15:58,962 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:15:58,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:15:58,963 INFO L82 PathProgramCache]: Analyzing trace with hash 198621957, now seen corresponding path program 1 times [2018-09-30 20:15:58,963 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:15:58,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:15:58,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:15:58,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:15:58,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:15:58,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:15:59,067 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:15:59,067 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:15:59,067 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -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-09-30 20:15:59,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:15:59,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:15:59,129 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:15:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:15:59,167 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:15:59,168 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-09-30 20:15:59,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-30 20:15:59,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-30 20:15:59,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-09-30 20:15:59,169 INFO L87 Difference]: Start difference. First operand 9 states and 10 transitions. Second operand 5 states. [2018-09-30 20:15:59,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:15:59,267 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-09-30 20:15:59,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-30 20:15:59,268 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-09-30 20:15:59,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:15:59,269 INFO L225 Difference]: With dead ends: 13 [2018-09-30 20:15:59,269 INFO L226 Difference]: Without dead ends: 11 [2018-09-30 20:15:59,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-09-30 20:15:59,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-30 20:15:59,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-30 20:15:59,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-30 20:15:59,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-09-30 20:15:59,275 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 12 transitions. Word has length 8 [2018-09-30 20:15:59,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:15:59,275 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-09-30 20:15:59,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-30 20:15:59,275 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 12 transitions. [2018-09-30 20:15:59,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-30 20:15:59,276 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:15:59,276 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-09-30 20:15:59,276 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:15:59,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:15:59,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1897191999, now seen corresponding path program 1 times [2018-09-30 20:15:59,277 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:15:59,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:15:59,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:15:59,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:15:59,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:15:59,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:15:59,559 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:15:59,559 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:15:59,559 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -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-09-30 20:15:59,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:15:59,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:15:59,611 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:15:59,880 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:15:59,880 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:15:59,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:15:59,940 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 20:15:59,990 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:00,011 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:00,011 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2018-09-30 20:16:00,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 20:16:00,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 20:16:00,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-09-30 20:16:00,013 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. Second operand 10 states. [2018-09-30 20:16:00,190 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 10 [2018-09-30 20:16:00,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:16:00,422 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-09-30 20:16:00,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-30 20:16:00,423 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2018-09-30 20:16:00,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:16:00,424 INFO L225 Difference]: With dead ends: 19 [2018-09-30 20:16:00,424 INFO L226 Difference]: Without dead ends: 13 [2018-09-30 20:16:00,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-09-30 20:16:00,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-30 20:16:00,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-30 20:16:00,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-30 20:16:00,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-09-30 20:16:00,432 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-09-30 20:16:00,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:16:00,433 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-09-30 20:16:00,433 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 20:16:00,433 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-09-30 20:16:00,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-30 20:16:00,434 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:16:00,434 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2018-09-30 20:16:00,434 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:16:00,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:16:00,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1765270407, now seen corresponding path program 2 times [2018-09-30 20:16:00,435 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:16:00,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:16:00,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:00,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:16:00,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:00,544 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:00,544 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:16:00,545 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -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-09-30 20:16:00,553 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:16:00,566 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:16:00,567 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:16:00,568 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:16:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:00,597 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:00,597 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2018-09-30 20:16:00,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-30 20:16:00,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-30 20:16:00,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-09-30 20:16:00,598 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 6 states. [2018-09-30 20:16:01,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:16:01,001 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2018-09-30 20:16:01,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-30 20:16:01,001 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2018-09-30 20:16:01,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:16:01,002 INFO L225 Difference]: With dead ends: 17 [2018-09-30 20:16:01,002 INFO L226 Difference]: Without dead ends: 15 [2018-09-30 20:16:01,002 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-09-30 20:16:01,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-30 20:16:01,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-30 20:16:01,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-30 20:16:01,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-09-30 20:16:01,013 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2018-09-30 20:16:01,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:16:01,013 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-09-30 20:16:01,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-30 20:16:01,013 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-09-30 20:16:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-30 20:16:01,014 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:16:01,014 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-09-30 20:16:01,014 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:16:01,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:16:01,015 INFO L82 PathProgramCache]: Analyzing trace with hash 87273139, now seen corresponding path program 3 times [2018-09-30 20:16:01,015 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:16:01,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:16:01,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:01,016 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:16:01,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:01,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:01,230 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:01,231 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:16:01,231 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -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-09-30 20:16:01,239 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:16:01,270 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-09-30 20:16:01,271 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:16:01,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:16:01,366 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:16:01,366 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:16:01,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:16:01,375 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 20:16:01,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-09-30 20:16:01,442 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:16:01,452 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:16:01,453 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:18 [2018-09-30 20:16:01,493 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:01,520 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:01,521 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-09-30 20:16:01,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:16:01,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:16:01,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-09-30 20:16:01,522 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 13 states. [2018-09-30 20:16:02,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:16:02,033 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-09-30 20:16:02,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 20:16:02,034 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 14 [2018-09-30 20:16:02,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:16:02,035 INFO L225 Difference]: With dead ends: 25 [2018-09-30 20:16:02,035 INFO L226 Difference]: Without dead ends: 17 [2018-09-30 20:16:02,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=61, Invalid=281, Unknown=0, NotChecked=0, Total=342 [2018-09-30 20:16:02,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-30 20:16:02,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-30 20:16:02,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-30 20:16:02,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-09-30 20:16:02,042 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2018-09-30 20:16:02,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:16:02,042 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-09-30 20:16:02,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:16:02,042 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-09-30 20:16:02,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-30 20:16:02,043 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:16:02,043 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1] [2018-09-30 20:16:02,043 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:16:02,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:16:02,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1096334355, now seen corresponding path program 4 times [2018-09-30 20:16:02,044 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:16:02,044 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:16:02,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:02,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:16:02,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:02,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:02,239 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:02,239 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:16:02,240 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -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-09-30 20:16:02,255 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:16:02,265 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:16:02,266 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:16:02,268 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:16:02,316 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:16:02,316 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:16:02,329 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:16:02,329 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 20:16:02,372 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2018-09-30 20:16:02,392 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:02,392 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-09-30 20:16:02,393 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-30 20:16:02,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-30 20:16:02,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2018-09-30 20:16:02,394 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 10 states. [2018-09-30 20:16:02,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:16:02,626 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-09-30 20:16:02,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-30 20:16:02,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2018-09-30 20:16:02,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:16:02,627 INFO L225 Difference]: With dead ends: 21 [2018-09-30 20:16:02,627 INFO L226 Difference]: Without dead ends: 19 [2018-09-30 20:16:02,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2018-09-30 20:16:02,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-30 20:16:02,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-30 20:16:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-30 20:16:02,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2018-09-30 20:16:02,634 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2018-09-30 20:16:02,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:16:02,635 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2018-09-30 20:16:02,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-30 20:16:02,635 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2018-09-30 20:16:02,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-30 20:16:02,636 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:16:02,636 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1] [2018-09-30 20:16:02,636 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:16:02,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:16:02,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1310275289, now seen corresponding path program 5 times [2018-09-30 20:16:02,637 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:16:02,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:16:02,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:02,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:16:02,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:02,864 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:02,864 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:16:02,865 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -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-09-30 20:16:02,872 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:16:02,893 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2018-09-30 20:16:02,893 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:16:02,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:16:03,089 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:16:03,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:16:03,096 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:16:03,097 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 20:16:03,125 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:03,146 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:03,146 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2018-09-30 20:16:03,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:16:03,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:16:03,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=206, Unknown=0, NotChecked=0, Total=240 [2018-09-30 20:16:03,147 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 16 states. [2018-09-30 20:16:04,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:16:04,108 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2018-09-30 20:16:04,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-30 20:16:04,108 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2018-09-30 20:16:04,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:16:04,109 INFO L225 Difference]: With dead ends: 35 [2018-09-30 20:16:04,109 INFO L226 Difference]: Without dead ends: 23 [2018-09-30 20:16:04,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=139, Invalid=731, Unknown=0, NotChecked=0, Total=870 [2018-09-30 20:16:04,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-30 20:16:04,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-30 20:16:04,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-30 20:16:04,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-09-30 20:16:04,119 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2018-09-30 20:16:04,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:16:04,119 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-09-30 20:16:04,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 20:16:04,119 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-09-30 20:16:04,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-30 20:16:04,120 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:16:04,120 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1] [2018-09-30 20:16:04,121 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:16:04,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:16:04,121 INFO L82 PathProgramCache]: Analyzing trace with hash 1731406235, now seen corresponding path program 6 times [2018-09-30 20:16:04,121 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:16:04,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:16:04,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:04,122 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:16:04,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:04,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:04,454 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:16:04,454 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -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-09-30 20:16:04,461 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:16:04,488 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2018-09-30 20:16:04,488 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:16:04,490 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:16:04,645 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:16:04,645 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:16:04,652 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:16:04,652 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 20:16:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:04,699 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:04,699 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2018-09-30 20:16:04,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-30 20:16:04,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-30 20:16:04,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2018-09-30 20:16:04,701 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 19 states. [2018-09-30 20:16:05,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:16:05,431 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-09-30 20:16:05,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-30 20:16:05,432 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 22 [2018-09-30 20:16:05,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:16:05,433 INFO L225 Difference]: With dead ends: 37 [2018-09-30 20:16:05,433 INFO L226 Difference]: Without dead ends: 25 [2018-09-30 20:16:05,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2018-09-30 20:16:05,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-30 20:16:05,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-30 20:16:05,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-30 20:16:05,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-09-30 20:16:05,444 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2018-09-30 20:16:05,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:16:05,444 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-09-30 20:16:05,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-30 20:16:05,445 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-09-30 20:16:05,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-30 20:16:05,445 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:16:05,446 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1] [2018-09-30 20:16:05,446 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:16:05,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:16:05,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1774380245, now seen corresponding path program 7 times [2018-09-30 20:16:05,446 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:16:05,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:16:05,447 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:05,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:16:05,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:05,666 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:05,666 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:16:05,667 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:16:05,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:16:05,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:05,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:16:05,720 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 20 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:05,749 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:05,749 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 8 [2018-09-30 20:16:05,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-30 20:16:05,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-30 20:16:05,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-09-30 20:16:05,753 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 9 states. [2018-09-30 20:16:06,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:16:06,137 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2018-09-30 20:16:06,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-30 20:16:06,137 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-09-30 20:16:06,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:16:06,138 INFO L225 Difference]: With dead ends: 29 [2018-09-30 20:16:06,138 INFO L226 Difference]: Without dead ends: 27 [2018-09-30 20:16:06,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-09-30 20:16:06,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-30 20:16:06,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-30 20:16:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-30 20:16:06,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-09-30 20:16:06,148 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2018-09-30 20:16:06,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:16:06,149 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-09-30 20:16:06,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-30 20:16:06,149 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-09-30 20:16:06,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-30 20:16:06,150 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:16:06,150 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 1, 1, 1, 1] [2018-09-30 20:16:06,150 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:16:06,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:16:06,151 INFO L82 PathProgramCache]: Analyzing trace with hash 77451279, now seen corresponding path program 8 times [2018-09-30 20:16:06,151 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:16:06,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:16:06,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:06,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:16:06,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:06,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:06,381 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:06,382 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:16:06,382 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:16:06,393 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:16:06,434 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:16:06,435 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:16:06,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:16:06,917 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:16:06,918 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:16:06,921 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:16:06,922 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 20:16:06,951 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:06,971 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:06,971 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2018-09-30 20:16:06,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-30 20:16:06,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-30 20:16:06,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-09-30 20:16:06,974 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 22 states. [2018-09-30 20:16:07,203 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-09-30 20:16:07,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:16:07,665 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2018-09-30 20:16:07,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:16:07,665 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2018-09-30 20:16:07,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:16:07,666 INFO L225 Difference]: With dead ends: 43 [2018-09-30 20:16:07,667 INFO L226 Difference]: Without dead ends: 29 [2018-09-30 20:16:07,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=130, Invalid=740, Unknown=0, NotChecked=0, Total=870 [2018-09-30 20:16:07,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-30 20:16:07,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-30 20:16:07,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-30 20:16:07,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2018-09-30 20:16:07,677 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2018-09-30 20:16:07,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:16:07,677 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2018-09-30 20:16:07,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-30 20:16:07,677 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2018-09-30 20:16:07,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-30 20:16:07,678 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:16:07,678 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 1, 1, 1, 1] [2018-09-30 20:16:07,678 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:16:07,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:16:07,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1980325449, now seen corresponding path program 9 times [2018-09-30 20:16:07,679 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:16:07,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:16:07,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:07,680 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:16:07,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:07,839 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 30 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:07,840 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:16:07,840 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:16:07,856 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:16:07,880 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-09-30 20:16:07,880 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:16:07,882 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:16:07,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:16:07,966 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:16:07,971 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:16:07,971 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 20:16:08,000 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-30 20:16:08,021 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:08,021 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 16 [2018-09-30 20:16:08,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-30 20:16:08,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-30 20:16:08,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2018-09-30 20:16:08,023 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 16 states. [2018-09-30 20:16:08,603 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 14 [2018-09-30 20:16:08,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:16:08,628 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-09-30 20:16:08,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-30 20:16:08,629 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 28 [2018-09-30 20:16:08,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:16:08,629 INFO L225 Difference]: With dead ends: 33 [2018-09-30 20:16:08,629 INFO L226 Difference]: Without dead ends: 31 [2018-09-30 20:16:08,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=120, Invalid=432, Unknown=0, NotChecked=0, Total=552 [2018-09-30 20:16:08,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-30 20:16:08,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-30 20:16:08,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-30 20:16:08,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2018-09-30 20:16:08,640 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2018-09-30 20:16:08,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:16:08,640 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2018-09-30 20:16:08,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-30 20:16:08,640 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-09-30 20:16:08,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-30 20:16:08,641 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:16:08,641 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 1, 1, 1, 1] [2018-09-30 20:16:08,641 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:16:08,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:16:08,642 INFO L82 PathProgramCache]: Analyzing trace with hash 422296707, now seen corresponding path program 10 times [2018-09-30 20:16:08,642 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:16:08,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:16:08,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:08,643 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:16:08,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:08,864 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:08,864 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:16:08,864 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:16:08,871 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:16:08,884 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:16:08,885 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:16:08,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:16:09,021 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:16:09,021 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:16:09,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:16:09,027 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 20:16:09,058 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2018-09-30 20:16:09,078 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:09,078 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 23 [2018-09-30 20:16:09,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-30 20:16:09,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-30 20:16:09,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=452, Unknown=0, NotChecked=0, Total=506 [2018-09-30 20:16:09,079 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 23 states. [2018-09-30 20:16:09,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:16:09,765 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-09-30 20:16:09,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-30 20:16:09,766 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 30 [2018-09-30 20:16:09,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:16:09,767 INFO L225 Difference]: With dead ends: 53 [2018-09-30 20:16:09,767 INFO L226 Difference]: Without dead ends: 35 [2018-09-30 20:16:09,769 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=137, Invalid=985, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 20:16:09,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-30 20:16:09,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-30 20:16:09,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-30 20:16:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2018-09-30 20:16:09,782 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2018-09-30 20:16:09,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:16:09,782 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2018-09-30 20:16:09,783 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-30 20:16:09,783 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2018-09-30 20:16:09,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-30 20:16:09,784 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:16:09,784 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 1, 1, 1, 1] [2018-09-30 20:16:09,784 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:16:09,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:16:09,784 INFO L82 PathProgramCache]: Analyzing trace with hash -1553862921, now seen corresponding path program 11 times [2018-09-30 20:16:09,784 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:16:09,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:16:09,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:09,785 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:16:09,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:09,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:10,187 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:10,187 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:16:10,187 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:16:10,196 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:16:10,222 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2018-09-30 20:16:10,222 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:16:10,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:16:10,665 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:16:10,666 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:16:10,670 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:16:10,671 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 20:16:10,728 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 20 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:10,749 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:10,749 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 31 [2018-09-30 20:16:10,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-30 20:16:10,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-30 20:16:10,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=888, Unknown=0, NotChecked=0, Total=992 [2018-09-30 20:16:10,751 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand 32 states. [2018-09-30 20:16:12,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:16:12,817 INFO L93 Difference]: Finished difference Result 59 states and 63 transitions. [2018-09-30 20:16:12,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-30 20:16:12,817 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 34 [2018-09-30 20:16:12,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:16:12,818 INFO L225 Difference]: With dead ends: 59 [2018-09-30 20:16:12,818 INFO L226 Difference]: Without dead ends: 39 [2018-09-30 20:16:12,820 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=313, Invalid=2549, Unknown=0, NotChecked=0, Total=2862 [2018-09-30 20:16:12,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-30 20:16:12,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-30 20:16:12,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-30 20:16:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-09-30 20:16:12,831 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2018-09-30 20:16:12,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:16:12,831 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-09-30 20:16:12,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-30 20:16:12,832 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-09-30 20:16:12,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-30 20:16:12,833 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:16:12,833 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 1, 1, 1, 1] [2018-09-30 20:16:12,833 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:16:12,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:16:12,833 INFO L82 PathProgramCache]: Analyzing trace with hash -783980693, now seen corresponding path program 12 times [2018-09-30 20:16:12,834 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:16:12,834 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:16:12,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:12,834 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:16:12,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:13,234 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:13,235 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:16:13,235 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:16:13,247 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:16:13,298 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2018-09-30 20:16:13,299 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:16:13,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:16:13,576 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:16:13,576 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:16:13,581 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:16:13,582 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 20:16:13,615 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:13,637 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:13,637 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 30 [2018-09-30 20:16:13,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-30 20:16:13,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-30 20:16:13,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=842, Unknown=0, NotChecked=0, Total=930 [2018-09-30 20:16:13,638 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 31 states. [2018-09-30 20:16:14,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:16:14,422 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2018-09-30 20:16:14,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-30 20:16:14,422 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 38 [2018-09-30 20:16:14,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:16:14,424 INFO L225 Difference]: With dead ends: 61 [2018-09-30 20:16:14,424 INFO L226 Difference]: Without dead ends: 41 [2018-09-30 20:16:14,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=187, Invalid=1535, Unknown=0, NotChecked=0, Total=1722 [2018-09-30 20:16:14,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-30 20:16:14,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-30 20:16:14,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-30 20:16:14,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-09-30 20:16:14,440 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 38 [2018-09-30 20:16:14,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:16:14,440 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-09-30 20:16:14,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-30 20:16:14,440 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-09-30 20:16:14,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-30 20:16:14,441 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:16:14,441 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 8, 1, 1, 1, 1] [2018-09-30 20:16:14,441 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:16:14,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:16:14,442 INFO L82 PathProgramCache]: Analyzing trace with hash 830172837, now seen corresponding path program 13 times [2018-09-30 20:16:14,442 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:16:14,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:16:14,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:14,443 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:16:14,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:14,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:14,660 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 72 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:14,661 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:16:14,661 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:16:14,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:16:14,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:14,694 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:16:14,703 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 72 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:14,724 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:14,724 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 12 [2018-09-30 20:16:14,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-30 20:16:14,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-30 20:16:14,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-09-30 20:16:14,725 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 13 states. [2018-09-30 20:16:14,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:16:14,851 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-09-30 20:16:14,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-30 20:16:14,851 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-09-30 20:16:14,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:16:14,852 INFO L225 Difference]: With dead ends: 45 [2018-09-30 20:16:14,852 INFO L226 Difference]: Without dead ends: 43 [2018-09-30 20:16:14,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-09-30 20:16:14,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-30 20:16:14,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-30 20:16:14,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-30 20:16:14,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2018-09-30 20:16:14,866 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2018-09-30 20:16:14,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:16:14,867 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2018-09-30 20:16:14,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-30 20:16:14,867 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2018-09-30 20:16:14,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-30 20:16:14,868 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:16:14,869 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 1, 1, 1, 1] [2018-09-30 20:16:14,869 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:16:14,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:16:14,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1067768353, now seen corresponding path program 14 times [2018-09-30 20:16:14,869 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:16:14,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:16:14,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:14,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:16:14,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:14,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:16,466 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:16,467 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:16:16,467 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:16:16,476 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:16:16,499 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:16:16,500 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:16:16,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:16:16,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:16:16,868 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:16:16,937 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:16:16,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 20:16:17,002 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 0 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:17,022 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:17,022 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 33 [2018-09-30 20:16:17,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-30 20:16:17,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-30 20:16:17,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1025, Unknown=0, NotChecked=0, Total=1122 [2018-09-30 20:16:17,023 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand 34 states. [2018-09-30 20:16:18,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:16:18,036 INFO L93 Difference]: Finished difference Result 67 states and 69 transitions. [2018-09-30 20:16:18,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 20:16:18,036 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 42 [2018-09-30 20:16:18,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:16:18,037 INFO L225 Difference]: With dead ends: 67 [2018-09-30 20:16:18,038 INFO L226 Difference]: Without dead ends: 45 [2018-09-30 20:16:18,039 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=206, Invalid=1864, Unknown=0, NotChecked=0, Total=2070 [2018-09-30 20:16:18,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-30 20:16:18,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-30 20:16:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-30 20:16:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-09-30 20:16:18,068 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 42 [2018-09-30 20:16:18,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:16:18,069 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-09-30 20:16:18,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-30 20:16:18,069 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-09-30 20:16:18,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-30 20:16:18,069 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:16:18,070 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 9, 1, 1, 1, 1] [2018-09-30 20:16:18,070 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:16:18,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:16:18,070 INFO L82 PathProgramCache]: Analyzing trace with hash 2070347801, now seen corresponding path program 15 times [2018-09-30 20:16:18,070 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:16:18,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:16:18,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:18,071 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:16:18,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:18,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:18,312 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 90 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:18,313 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:16:18,313 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:16:18,320 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:16:18,355 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-09-30 20:16:18,355 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:16:18,357 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:16:18,516 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:16:18,516 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:16:18,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:16:18,521 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 20:16:18,549 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-30 20:16:18,570 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:18,570 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2018-09-30 20:16:18,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-30 20:16:18,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-30 20:16:18,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=451, Unknown=0, NotChecked=0, Total=552 [2018-09-30 20:16:18,571 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 24 states. [2018-09-30 20:16:19,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:16:19,165 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-09-30 20:16:19,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-30 20:16:19,165 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 44 [2018-09-30 20:16:19,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:16:19,166 INFO L225 Difference]: With dead ends: 49 [2018-09-30 20:16:19,166 INFO L226 Difference]: Without dead ends: 47 [2018-09-30 20:16:19,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=228, Invalid=1032, Unknown=0, NotChecked=0, Total=1260 [2018-09-30 20:16:19,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-30 20:16:19,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-30 20:16:19,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-30 20:16:19,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2018-09-30 20:16:19,181 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 44 [2018-09-30 20:16:19,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:16:19,181 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2018-09-30 20:16:19,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-30 20:16:19,181 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2018-09-30 20:16:19,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-30 20:16:19,182 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:16:19,182 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 1, 1, 1, 1] [2018-09-30 20:16:19,183 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:16:19,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:16:19,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1034431059, now seen corresponding path program 16 times [2018-09-30 20:16:19,183 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:16:19,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:16:19,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:19,184 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:16:19,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:19,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:19,945 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:19,945 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:16:19,945 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:16:19,953 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:16:19,988 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:16:19,989 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:16:19,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:16:20,293 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:16:20,293 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:16:20,300 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:16:20,300 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 20:16:20,344 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2018-09-30 20:16:20,367 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:20,367 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13] total 35 [2018-09-30 20:16:20,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-30 20:16:20,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-30 20:16:20,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=1104, Unknown=0, NotChecked=0, Total=1190 [2018-09-30 20:16:20,368 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand 35 states. [2018-09-30 20:16:21,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:16:21,699 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2018-09-30 20:16:21,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-30 20:16:21,699 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 46 [2018-09-30 20:16:21,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:16:21,700 INFO L225 Difference]: With dead ends: 77 [2018-09-30 20:16:21,700 INFO L226 Difference]: Without dead ends: 51 [2018-09-30 20:16:21,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=205, Invalid=2245, Unknown=0, NotChecked=0, Total=2450 [2018-09-30 20:16:21,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-30 20:16:21,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-30 20:16:21,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-30 20:16:21,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-09-30 20:16:21,724 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2018-09-30 20:16:21,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:16:21,725 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-09-30 20:16:21,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-30 20:16:21,725 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-09-30 20:16:21,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-30 20:16:21,726 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:16:21,726 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 1, 1, 1, 1] [2018-09-30 20:16:21,726 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:16:21,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:16:21,726 INFO L82 PathProgramCache]: Analyzing trace with hash -2051967801, now seen corresponding path program 17 times [2018-09-30 20:16:21,726 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:16:21,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:16:21,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:21,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:16:21,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:22,217 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:22,217 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:16:22,217 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:16:22,225 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:16:22,270 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-09-30 20:16:22,271 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:16:22,273 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:16:22,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:16:22,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:16:22,939 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:16:22,939 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 20:16:22,987 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 72 proven. 192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:23,008 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:23,008 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 47 [2018-09-30 20:16:23,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-30 20:16:23,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-30 20:16:23,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=2034, Unknown=0, NotChecked=0, Total=2256 [2018-09-30 20:16:23,010 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 48 states. [2018-09-30 20:16:25,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:16:25,396 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2018-09-30 20:16:25,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-30 20:16:25,396 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 50 [2018-09-30 20:16:25,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:16:25,397 INFO L225 Difference]: With dead ends: 83 [2018-09-30 20:16:25,397 INFO L226 Difference]: Without dead ends: 55 [2018-09-30 20:16:25,399 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=567, Invalid=5439, Unknown=0, NotChecked=0, Total=6006 [2018-09-30 20:16:25,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-30 20:16:25,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-30 20:16:25,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-30 20:16:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-09-30 20:16:25,415 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2018-09-30 20:16:25,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:16:25,415 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-09-30 20:16:25,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-30 20:16:25,416 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-09-30 20:16:25,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-30 20:16:25,416 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:16:25,416 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 1, 1, 1, 1] [2018-09-30 20:16:25,417 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:16:25,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:16:25,417 INFO L82 PathProgramCache]: Analyzing trace with hash 75236667, now seen corresponding path program 18 times [2018-09-30 20:16:25,417 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:16:25,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:16:25,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:25,418 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:16:25,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:25,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:25,912 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:25,913 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:16:25,913 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:16:25,921 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:16:25,969 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-09-30 20:16:25,969 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:16:25,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:16:26,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:16:26,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:16:26,858 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:16:26,859 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 20:16:26,915 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2018-09-30 20:16:26,936 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:26,937 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 15] total 41 [2018-09-30 20:16:26,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-30 20:16:26,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-30 20:16:26,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1538, Unknown=0, NotChecked=0, Total=1640 [2018-09-30 20:16:26,938 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 41 states. [2018-09-30 20:16:28,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:16:28,394 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2018-09-30 20:16:28,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-30 20:16:28,394 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 54 [2018-09-30 20:16:28,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:16:28,395 INFO L225 Difference]: With dead ends: 89 [2018-09-30 20:16:28,395 INFO L226 Difference]: Without dead ends: 59 [2018-09-30 20:16:28,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=239, Invalid=3067, Unknown=0, NotChecked=0, Total=3306 [2018-09-30 20:16:28,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-30 20:16:28,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-30 20:16:28,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-30 20:16:28,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-09-30 20:16:28,422 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2018-09-30 20:16:28,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:16:28,422 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-09-30 20:16:28,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-30 20:16:28,422 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-09-30 20:16:28,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-30 20:16:28,423 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:16:28,423 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 1, 1, 1, 1] [2018-09-30 20:16:28,423 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:16:28,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:16:28,423 INFO L82 PathProgramCache]: Analyzing trace with hash 361552815, now seen corresponding path program 19 times [2018-09-30 20:16:28,423 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:16:28,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:16:28,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:28,424 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:16:28,424 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:29,631 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:29,631 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:16:29,631 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:16:29,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:16:29,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:29,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:16:30,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:16:30,271 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:16:30,275 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:16:30,275 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 20:16:30,325 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:30,345 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:30,346 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 45 [2018-09-30 20:16:30,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-30 20:16:30,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-30 20:16:30,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1937, Unknown=0, NotChecked=0, Total=2070 [2018-09-30 20:16:30,347 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 46 states. [2018-09-30 20:16:31,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:16:31,904 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2018-09-30 20:16:31,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-30 20:16:31,904 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 58 [2018-09-30 20:16:31,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:16:31,904 INFO L225 Difference]: With dead ends: 91 [2018-09-30 20:16:31,904 INFO L226 Difference]: Without dead ends: 61 [2018-09-30 20:16:31,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 415 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=282, Invalid=3500, Unknown=0, NotChecked=0, Total=3782 [2018-09-30 20:16:31,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-30 20:16:31,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-30 20:16:31,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-30 20:16:31,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 62 transitions. [2018-09-30 20:16:31,927 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 62 transitions. Word has length 58 [2018-09-30 20:16:31,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:16:31,928 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 62 transitions. [2018-09-30 20:16:31,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-30 20:16:31,928 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2018-09-30 20:16:31,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-30 20:16:31,928 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:16:31,928 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 13, 1, 1, 1, 1] [2018-09-30 20:16:31,928 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:16:31,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:16:31,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1210122729, now seen corresponding path program 20 times [2018-09-30 20:16:31,929 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:16:31,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:16:31,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:31,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:16:31,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:31,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 182 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:32,248 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:16:32,248 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:16:32,256 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:16:32,290 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:16:32,291 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:16:32,292 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:16:32,305 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 182 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:32,328 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:32,328 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 17 [2018-09-30 20:16:32,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-30 20:16:32,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-30 20:16:32,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-09-30 20:16:32,329 INFO L87 Difference]: Start difference. First operand 61 states and 62 transitions. Second operand 18 states. [2018-09-30 20:16:32,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:16:32,556 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2018-09-30 20:16:32,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-30 20:16:32,558 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2018-09-30 20:16:32,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:16:32,559 INFO L225 Difference]: With dead ends: 65 [2018-09-30 20:16:32,559 INFO L226 Difference]: Without dead ends: 63 [2018-09-30 20:16:32,560 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-09-30 20:16:32,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-30 20:16:32,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-30 20:16:32,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-30 20:16:32,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-09-30 20:16:32,581 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 60 [2018-09-30 20:16:32,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:16:32,582 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-09-30 20:16:32,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-30 20:16:32,582 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-09-30 20:16:32,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-30 20:16:32,582 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:16:32,582 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 1, 1, 1, 1] [2018-09-30 20:16:32,582 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:16:32,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:16:32,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1008142301, now seen corresponding path program 21 times [2018-09-30 20:16:32,583 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:16:32,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:16:32,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:32,583 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:16:32,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:33,357 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:33,357 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:16:33,357 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:16:33,365 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:16:33,431 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-09-30 20:16:33,431 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:16:33,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:16:33,991 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:16:33,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:16:33,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:16:33,996 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 20:16:34,049 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2018-09-30 20:16:34,070 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:34,070 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 17] total 47 [2018-09-30 20:16:34,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-30 20:16:34,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-30 20:16:34,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=2044, Unknown=0, NotChecked=0, Total=2162 [2018-09-30 20:16:34,072 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 47 states. [2018-09-30 20:16:35,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:16:35,934 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2018-09-30 20:16:35,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-30 20:16:35,934 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 62 [2018-09-30 20:16:35,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:16:35,935 INFO L225 Difference]: With dead ends: 101 [2018-09-30 20:16:35,935 INFO L226 Difference]: Without dead ends: 67 [2018-09-30 20:16:35,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=273, Invalid=4017, Unknown=0, NotChecked=0, Total=4290 [2018-09-30 20:16:35,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-30 20:16:35,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-30 20:16:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-30 20:16:35,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-09-30 20:16:35,964 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2018-09-30 20:16:35,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:16:35,964 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-09-30 20:16:35,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-30 20:16:35,964 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-09-30 20:16:35,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-30 20:16:35,965 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:16:35,965 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 1, 1, 1, 1] [2018-09-30 20:16:35,965 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:16:35,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:16:35,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1978312041, now seen corresponding path program 22 times [2018-09-30 20:16:35,965 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:16:35,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:16:35,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:35,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:16:35,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:37,196 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:37,196 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:16:37,196 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:16:37,204 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:16:37,232 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:16:37,232 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:16:37,234 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:16:38,005 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:16:38,005 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:16:38,009 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:16:38,010 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 20:16:38,081 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 240 trivial. 0 not checked. [2018-09-30 20:16:38,100 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:38,101 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 18] total 50 [2018-09-30 20:16:38,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-30 20:16:38,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-30 20:16:38,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=2324, Unknown=0, NotChecked=0, Total=2450 [2018-09-30 20:16:38,102 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 50 states. [2018-09-30 20:16:40,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:16:40,012 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2018-09-30 20:16:40,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-30 20:16:40,013 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 66 [2018-09-30 20:16:40,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:16:40,014 INFO L225 Difference]: With dead ends: 107 [2018-09-30 20:16:40,014 INFO L226 Difference]: Without dead ends: 71 [2018-09-30 20:16:40,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=290, Invalid=4540, Unknown=0, NotChecked=0, Total=4830 [2018-09-30 20:16:40,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-30 20:16:40,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-30 20:16:40,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-30 20:16:40,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-09-30 20:16:40,037 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 66 [2018-09-30 20:16:40,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:16:40,038 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-09-30 20:16:40,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-30 20:16:40,038 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-09-30 20:16:40,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-30 20:16:40,038 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:16:40,038 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 1, 1, 1, 1] [2018-09-30 20:16:40,038 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:16:40,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:16:40,039 INFO L82 PathProgramCache]: Analyzing trace with hash 303497995, now seen corresponding path program 23 times [2018-09-30 20:16:40,039 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:16:40,039 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:16:40,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:40,039 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:16:40,040 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:40,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:42,244 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:42,245 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:16:42,245 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:16:42,253 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:16:42,348 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 17 check-sat command(s) [2018-09-30 20:16:42,348 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:16:42,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:16:43,743 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:16:43,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:16:43,748 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:16:43,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 20:16:43,816 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 182 proven. 362 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:43,837 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:43,837 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 67 [2018-09-30 20:16:43,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-30 20:16:43,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-30 20:16:43,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=4119, Unknown=0, NotChecked=0, Total=4556 [2018-09-30 20:16:43,839 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 68 states. [2018-09-30 20:16:47,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:16:47,126 INFO L93 Difference]: Finished difference Result 113 states and 117 transitions. [2018-09-30 20:16:47,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-30 20:16:47,126 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 70 [2018-09-30 20:16:47,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:16:47,127 INFO L225 Difference]: With dead ends: 113 [2018-09-30 20:16:47,127 INFO L226 Difference]: Without dead ends: 75 [2018-09-30 20:16:47,129 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=997, Invalid=10559, Unknown=0, NotChecked=0, Total=11556 [2018-09-30 20:16:47,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-30 20:16:47,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-30 20:16:47,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-30 20:16:47,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-09-30 20:16:47,152 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 70 [2018-09-30 20:16:47,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:16:47,153 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-09-30 20:16:47,153 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-30 20:16:47,153 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-09-30 20:16:47,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-30 20:16:47,153 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:16:47,153 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 1, 1, 1, 1] [2018-09-30 20:16:47,153 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:16:47,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:16:47,154 INFO L82 PathProgramCache]: Analyzing trace with hash -177016449, now seen corresponding path program 24 times [2018-09-30 20:16:47,154 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:16:47,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:16:47,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:47,155 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:16:47,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:48,047 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:48,047 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:16:48,048 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:16:48,056 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:16:48,130 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2018-09-30 20:16:48,130 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:16:48,134 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:16:48,992 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:16:48,992 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:16:48,997 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:16:48,998 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 20:16:49,058 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 612 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:49,079 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:49,079 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 57 [2018-09-30 20:16:49,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-30 20:16:49,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-30 20:16:49,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=3137, Unknown=0, NotChecked=0, Total=3306 [2018-09-30 20:16:49,080 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 58 states. [2018-09-30 20:16:51,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:16:51,072 INFO L93 Difference]: Finished difference Result 115 states and 117 transitions. [2018-09-30 20:16:51,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-30 20:16:51,072 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 74 [2018-09-30 20:16:51,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:16:51,073 INFO L225 Difference]: With dead ends: 115 [2018-09-30 20:16:51,073 INFO L226 Difference]: Without dead ends: 77 [2018-09-30 20:16:51,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=358, Invalid=5648, Unknown=0, NotChecked=0, Total=6006 [2018-09-30 20:16:51,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-30 20:16:51,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-30 20:16:51,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-30 20:16:51,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 78 transitions. [2018-09-30 20:16:51,104 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 78 transitions. Word has length 74 [2018-09-30 20:16:51,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:16:51,104 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 78 transitions. [2018-09-30 20:16:51,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-30 20:16:51,104 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2018-09-30 20:16:51,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-30 20:16:51,105 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:16:51,105 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 17, 1, 1, 1, 1] [2018-09-30 20:16:51,105 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:16:51,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:16:51,105 INFO L82 PathProgramCache]: Analyzing trace with hash -42507335, now seen corresponding path program 25 times [2018-09-30 20:16:51,105 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:16:51,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:16:51,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:51,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:16:51,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:51,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:51,652 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 306 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:51,652 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:16:51,652 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:16:51,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:16:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:51,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:16:51,713 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 306 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:51,734 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:51,734 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20] total 21 [2018-09-30 20:16:51,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-30 20:16:51,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-30 20:16:51,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-09-30 20:16:51,735 INFO L87 Difference]: Start difference. First operand 77 states and 78 transitions. Second operand 22 states. [2018-09-30 20:16:52,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:16:52,169 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2018-09-30 20:16:52,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-30 20:16:52,170 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 76 [2018-09-30 20:16:52,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:16:52,170 INFO L225 Difference]: With dead ends: 81 [2018-09-30 20:16:52,170 INFO L226 Difference]: Without dead ends: 79 [2018-09-30 20:16:52,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-09-30 20:16:52,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-30 20:16:52,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-30 20:16:52,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-30 20:16:52,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2018-09-30 20:16:52,200 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 76 [2018-09-30 20:16:52,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:16:52,200 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2018-09-30 20:16:52,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-30 20:16:52,201 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2018-09-30 20:16:52,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-30 20:16:52,201 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:16:52,201 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 1, 1, 1, 1] [2018-09-30 20:16:52,202 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:16:52,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:16:52,202 INFO L82 PathProgramCache]: Analyzing trace with hash 2100176371, now seen corresponding path program 26 times [2018-09-30 20:16:52,202 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:16:52,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:16:52,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:52,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:16:52,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:53,453 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 684 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:53,454 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:16:53,454 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:16:53,462 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:16:53,511 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:16:53,511 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:16:53,514 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:16:54,425 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:16:54,425 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:16:54,429 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:16:54,429 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 20:16:54,493 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 684 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:54,513 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:54,513 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 60 [2018-09-30 20:16:54,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-30 20:16:54,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-30 20:16:54,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=3482, Unknown=0, NotChecked=0, Total=3660 [2018-09-30 20:16:54,514 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand 61 states. [2018-09-30 20:16:56,133 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 12 [2018-09-30 20:16:56,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:16:56,720 INFO L93 Difference]: Finished difference Result 121 states and 123 transitions. [2018-09-30 20:16:56,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-30 20:16:56,720 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 78 [2018-09-30 20:16:56,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:16:56,721 INFO L225 Difference]: With dead ends: 121 [2018-09-30 20:16:56,721 INFO L226 Difference]: Without dead ends: 81 [2018-09-30 20:16:56,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 56 SyntacticMatches, 1 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=377, Invalid=6265, Unknown=0, NotChecked=0, Total=6642 [2018-09-30 20:16:56,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-30 20:16:56,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-30 20:16:56,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-30 20:16:56,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-09-30 20:16:56,750 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 78 [2018-09-30 20:16:56,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:16:56,750 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-09-30 20:16:56,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-30 20:16:56,750 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-09-30 20:16:56,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-30 20:16:56,751 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:16:56,751 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 18, 1, 1, 1, 1] [2018-09-30 20:16:56,751 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:16:56,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:16:56,752 INFO L82 PathProgramCache]: Analyzing trace with hash 752544557, now seen corresponding path program 27 times [2018-09-30 20:16:56,752 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:16:56,752 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:16:56,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:56,753 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:16:56,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:16:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:16:57,692 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 342 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:16:57,693 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:16:57,693 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:16:57,706 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:16:57,834 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2018-09-30 20:16:57,835 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:16:57,839 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:16:59,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:16:59,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:16:59,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:16:59,449 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 20:16:59,492 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-09-30 20:16:59,513 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:16:59,513 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21] total 42 [2018-09-30 20:16:59,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-30 20:16:59,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-30 20:16:59,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1450, Unknown=0, NotChecked=0, Total=1722 [2018-09-30 20:16:59,514 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 42 states. [2018-09-30 20:17:00,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:17:00,694 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2018-09-30 20:17:00,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-30 20:17:00,695 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 80 [2018-09-30 20:17:00,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:17:00,696 INFO L225 Difference]: With dead ends: 85 [2018-09-30 20:17:00,696 INFO L226 Difference]: Without dead ends: 83 [2018-09-30 20:17:00,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 778 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=588, Invalid=3318, Unknown=0, NotChecked=0, Total=3906 [2018-09-30 20:17:00,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-30 20:17:00,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-30 20:17:00,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-30 20:17:00,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2018-09-30 20:17:00,726 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 80 [2018-09-30 20:17:00,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:17:00,726 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2018-09-30 20:17:00,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-30 20:17:00,726 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2018-09-30 20:17:00,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-30 20:17:00,727 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:17:00,727 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 1, 1, 1, 1] [2018-09-30 20:17:00,727 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:17:00,727 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:17:00,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1640865895, now seen corresponding path program 28 times [2018-09-30 20:17:00,728 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:17:00,728 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:17:00,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:17:00,728 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:17:00,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:17:00,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:17:01,739 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:17:01,739 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:17:01,739 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:17:01,748 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:17:01,777 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:17:01,777 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:17:01,780 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:17:02,968 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:17:02,968 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:17:02,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:17:02,976 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 20:17:03,043 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2018-09-30 20:17:03,063 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:17:03,063 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 22] total 62 [2018-09-30 20:17:03,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-30 20:17:03,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-30 20:17:03,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=3624, Unknown=0, NotChecked=0, Total=3782 [2018-09-30 20:17:03,065 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand 62 states. [2018-09-30 20:17:06,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:17:06,172 INFO L93 Difference]: Finished difference Result 131 states and 135 transitions. [2018-09-30 20:17:06,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-30 20:17:06,173 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 82 [2018-09-30 20:17:06,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:17:06,174 INFO L225 Difference]: With dead ends: 131 [2018-09-30 20:17:06,174 INFO L226 Difference]: Without dead ends: 87 [2018-09-30 20:17:06,176 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 331 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=358, Invalid=6952, Unknown=0, NotChecked=0, Total=7310 [2018-09-30 20:17:06,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-30 20:17:06,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-30 20:17:06,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-30 20:17:06,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-09-30 20:17:06,221 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 82 [2018-09-30 20:17:06,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:17:06,221 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-09-30 20:17:06,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-30 20:17:06,221 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-09-30 20:17:06,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-30 20:17:06,222 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:17:06,222 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 1, 1, 1, 1] [2018-09-30 20:17:06,222 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:17:06,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:17:06,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1957273381, now seen corresponding path program 29 times [2018-09-30 20:17:06,223 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:17:06,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:17:06,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:17:06,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:17:06,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:17:06,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:17:07,296 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 0 proven. 840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:17:07,296 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:17:07,296 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:17:07,305 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:17:07,443 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2018-09-30 20:17:07,443 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:17:07,447 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:17:10,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:17:10,531 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:17:10,537 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:17:10,537 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 20:17:10,613 INFO L134 CoverageAnalysis]: Checked inductivity of 840 backedges. 306 proven. 534 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:17:10,634 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:17:10,635 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 83 [2018-09-30 20:17:10,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-30 20:17:10,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-30 20:17:10,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=663, Invalid=6309, Unknown=0, NotChecked=0, Total=6972 [2018-09-30 20:17:10,636 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 84 states. [2018-09-30 20:17:15,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:17:15,524 INFO L93 Difference]: Finished difference Result 137 states and 141 transitions. [2018-09-30 20:17:15,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-30 20:17:15,525 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 86 [2018-09-30 20:17:15,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:17:15,526 INFO L225 Difference]: With dead ends: 137 [2018-09-30 20:17:15,526 INFO L226 Difference]: Without dead ends: 91 [2018-09-30 20:17:15,527 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2976 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1431, Invalid=15861, Unknown=0, NotChecked=0, Total=17292 [2018-09-30 20:17:15,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-30 20:17:15,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-30 20:17:15,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-30 20:17:15,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-09-30 20:17:15,573 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 86 [2018-09-30 20:17:15,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:17:15,574 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-09-30 20:17:15,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-30 20:17:15,574 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-09-30 20:17:15,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-30 20:17:15,574 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:17:15,574 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 21, 21, 1, 1, 1, 1] [2018-09-30 20:17:15,575 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:17:15,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:17:15,575 INFO L82 PathProgramCache]: Analyzing trace with hash -783456433, now seen corresponding path program 30 times [2018-09-30 20:17:15,575 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:17:15,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:17:15,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:17:15,576 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:17:15,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:17:15,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:17:16,745 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:17:16,745 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:17:16,745 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:17:16,753 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:17:16,860 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2018-09-30 20:17:16,860 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:17:16,864 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:17:18,355 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:17:18,356 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:17:18,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:17:18,360 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 20:17:18,435 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:17:18,456 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:17:18,456 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 69 [2018-09-30 20:17:18,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-30 20:17:18,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-30 20:17:18,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=4625, Unknown=0, NotChecked=0, Total=4830 [2018-09-30 20:17:18,457 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 70 states. [2018-09-30 20:17:21,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:17:21,108 INFO L93 Difference]: Finished difference Result 139 states and 141 transitions. [2018-09-30 20:17:21,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-30 20:17:21,109 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 90 [2018-09-30 20:17:21,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:17:21,109 INFO L225 Difference]: With dead ends: 139 [2018-09-30 20:17:21,109 INFO L226 Difference]: Without dead ends: 93 [2018-09-30 20:17:21,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 65 SyntacticMatches, 1 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 999 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=434, Invalid=8308, Unknown=0, NotChecked=0, Total=8742 [2018-09-30 20:17:21,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-30 20:17:21,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-30 20:17:21,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-30 20:17:21,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-09-30 20:17:21,160 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 90 [2018-09-30 20:17:21,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:17:21,161 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-09-30 20:17:21,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-30 20:17:21,161 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-09-30 20:17:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-30 20:17:21,161 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:17:21,161 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 21, 1, 1, 1, 1] [2018-09-30 20:17:21,162 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:17:21,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:17:21,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1017783689, now seen corresponding path program 31 times [2018-09-30 20:17:21,162 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:17:21,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:17:21,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:17:21,163 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:17:21,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:17:21,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:17:21,632 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 462 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:17:21,632 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:17:21,632 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:17:21,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:17:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:17:21,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:17:21,711 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 462 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:17:21,741 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:17:21,741 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24] total 25 [2018-09-30 20:17:21,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-30 20:17:21,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-30 20:17:21,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-09-30 20:17:21,742 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 26 states. [2018-09-30 20:17:22,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:17:22,184 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-09-30 20:17:22,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-30 20:17:22,185 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 92 [2018-09-30 20:17:22,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:17:22,186 INFO L225 Difference]: With dead ends: 97 [2018-09-30 20:17:22,186 INFO L226 Difference]: Without dead ends: 95 [2018-09-30 20:17:22,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-09-30 20:17:22,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-30 20:17:22,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-30 20:17:22,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-30 20:17:22,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2018-09-30 20:17:22,227 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 92 [2018-09-30 20:17:22,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:17:22,228 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2018-09-30 20:17:22,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-30 20:17:22,228 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2018-09-30 20:17:22,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-30 20:17:22,228 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:17:22,229 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 22, 22, 1, 1, 1, 1] [2018-09-30 20:17:22,229 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:17:22,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:17:22,229 INFO L82 PathProgramCache]: Analyzing trace with hash -1162366013, now seen corresponding path program 32 times [2018-09-30 20:17:22,229 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:17:22,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:17:22,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:17:22,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:17:22,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:17:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:17:23,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:17:23,820 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:17:23,820 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:17:23,827 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:17:23,877 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:17:23,877 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:17:23,880 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:17:25,189 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:17:25,189 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:17:25,193 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:17:25,193 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 20:17:25,270 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 1012 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:17:25,294 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:17:25,295 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 72 [2018-09-30 20:17:25,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-30 20:17:25,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-30 20:17:25,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=5042, Unknown=0, NotChecked=0, Total=5256 [2018-09-30 20:17:25,296 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand 73 states. [2018-09-30 20:17:28,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:17:28,498 INFO L93 Difference]: Finished difference Result 145 states and 147 transitions. [2018-09-30 20:17:28,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-30 20:17:28,499 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 94 [2018-09-30 20:17:28,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:17:28,500 INFO L225 Difference]: With dead ends: 145 [2018-09-30 20:17:28,500 INFO L226 Difference]: Without dead ends: 97 [2018-09-30 20:17:28,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1090 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=453, Invalid=9053, Unknown=0, NotChecked=0, Total=9506 [2018-09-30 20:17:28,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-30 20:17:28,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-30 20:17:28,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-30 20:17:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-09-30 20:17:28,543 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 94 [2018-09-30 20:17:28,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:17:28,543 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-09-30 20:17:28,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-30 20:17:28,543 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-09-30 20:17:28,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-30 20:17:28,544 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:17:28,544 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 22, 1, 1, 1, 1] [2018-09-30 20:17:28,544 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:17:28,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:17:28,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1867070211, now seen corresponding path program 33 times [2018-09-30 20:17:28,544 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:17:28,544 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:17:28,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:17:28,545 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:17:28,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:17:28,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:17:29,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 506 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:17:29,042 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:17:29,042 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:17:29,049 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:17:29,179 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 23 check-sat command(s) [2018-09-30 20:17:29,179 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:17:29,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:17:29,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:17:29,774 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:17:29,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:17:29,780 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 20:17:29,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-09-30 20:17:29,861 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:17:29,862 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 50 [2018-09-30 20:17:29,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-30 20:17:29,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-30 20:17:29,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=2076, Unknown=0, NotChecked=0, Total=2450 [2018-09-30 20:17:29,863 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 50 states. [2018-09-30 20:17:31,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:17:31,492 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2018-09-30 20:17:31,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-30 20:17:31,493 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 96 [2018-09-30 20:17:31,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:17:31,494 INFO L225 Difference]: With dead ends: 101 [2018-09-30 20:17:31,494 INFO L226 Difference]: Without dead ends: 99 [2018-09-30 20:17:31,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1126 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=800, Invalid=4750, Unknown=0, NotChecked=0, Total=5550 [2018-09-30 20:17:31,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-30 20:17:31,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-30 20:17:31,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-30 20:17:31,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-09-30 20:17:31,538 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 96 [2018-09-30 20:17:31,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:17:31,539 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-09-30 20:17:31,539 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-30 20:17:31,539 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-09-30 20:17:31,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-30 20:17:31,539 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:17:31,539 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 23, 23, 1, 1, 1, 1] [2018-09-30 20:17:31,539 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:17:31,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:17:31,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1041909303, now seen corresponding path program 34 times [2018-09-30 20:17:31,540 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:17:31,540 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:17:31,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:17:31,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:17:31,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:17:31,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:17:32,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 1104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:17:32,948 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:17:32,948 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:17:32,959 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:17:32,999 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:17:32,999 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:17:33,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:17:34,616 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:17:34,616 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:17:34,622 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:17:34,622 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 20:17:34,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2018-09-30 20:17:34,723 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:17:34,724 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 26] total 74 [2018-09-30 20:17:34,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-30 20:17:34,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-30 20:17:34,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=5212, Unknown=0, NotChecked=0, Total=5402 [2018-09-30 20:17:34,725 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 74 states. [2018-09-30 20:17:38,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:17:38,858 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-09-30 20:17:38,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-30 20:17:38,859 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 98 [2018-09-30 20:17:38,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:17:38,860 INFO L225 Difference]: With dead ends: 155 [2018-09-30 20:17:38,860 INFO L226 Difference]: Without dead ends: 103 [2018-09-30 20:17:38,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=426, Invalid=9876, Unknown=0, NotChecked=0, Total=10302 [2018-09-30 20:17:38,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-30 20:17:38,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-30 20:17:38,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-30 20:17:38,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-09-30 20:17:38,923 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 98 [2018-09-30 20:17:38,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:17:38,923 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-09-30 20:17:38,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-30 20:17:38,923 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-09-30 20:17:38,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-30 20:17:38,924 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:17:38,924 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 24, 24, 1, 1, 1, 1] [2018-09-30 20:17:38,924 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:17:38,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:17:38,925 INFO L82 PathProgramCache]: Analyzing trace with hash -2122703189, now seen corresponding path program 35 times [2018-09-30 20:17:38,925 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:17:38,925 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:17:38,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:17:38,925 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:17:38,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:17:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:17:40,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 1200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:17:40,302 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:17:40,302 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:17:40,311 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:17:40,513 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 25 check-sat command(s) [2018-09-30 20:17:40,514 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:17:40,519 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:17:43,552 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:17:43,552 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:17:43,557 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:17:43,557 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 20:17:43,645 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 462 proven. 738 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:17:43,666 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:17:43,666 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 99 [2018-09-30 20:17:43,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-30 20:17:43,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-30 20:17:43,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=937, Invalid=8963, Unknown=0, NotChecked=0, Total=9900 [2018-09-30 20:17:43,668 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 100 states. [2018-09-30 20:17:49,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:17:49,703 INFO L93 Difference]: Finished difference Result 161 states and 165 transitions. [2018-09-30 20:17:49,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-30 20:17:49,703 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 102 [2018-09-30 20:17:49,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:17:49,704 INFO L225 Difference]: With dead ends: 161 [2018-09-30 20:17:49,704 INFO L226 Difference]: Without dead ends: 107 [2018-09-30 20:17:49,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4198 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=1945, Invalid=22235, Unknown=0, NotChecked=0, Total=24180 [2018-09-30 20:17:49,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-30 20:17:49,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-09-30 20:17:49,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-30 20:17:49,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2018-09-30 20:17:49,754 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 102 [2018-09-30 20:17:49,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:17:49,754 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2018-09-30 20:17:49,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-30 20:17:49,754 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2018-09-30 20:17:49,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-30 20:17:49,755 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:17:49,755 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 25, 25, 1, 1, 1, 1] [2018-09-30 20:17:49,755 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:17:49,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:17:49,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1705231073, now seen corresponding path program 36 times [2018-09-30 20:17:49,755 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:17:49,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:17:49,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:17:49,756 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:17:49,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:17:49,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:17:51,342 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 1300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:17:51,342 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:17:51,342 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:17:51,349 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:17:51,498 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2018-09-30 20:17:51,498 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:17:51,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:17:53,126 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:17:53,126 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:17:53,131 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:17:53,132 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 20:17:53,221 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 1300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:17:53,242 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:17:53,242 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 81 [2018-09-30 20:17:53,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-30 20:17:53,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-30 20:17:53,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=6401, Unknown=0, NotChecked=0, Total=6642 [2018-09-30 20:17:53,243 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand 82 states. [2018-09-30 20:17:57,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:17:57,187 INFO L93 Difference]: Finished difference Result 163 states and 165 transitions. [2018-09-30 20:17:57,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-30 20:17:57,188 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 106 [2018-09-30 20:17:57,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:17:57,189 INFO L225 Difference]: With dead ends: 163 [2018-09-30 20:17:57,189 INFO L226 Difference]: Without dead ends: 109 [2018-09-30 20:17:57,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 77 SyntacticMatches, 1 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1387 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=510, Invalid=11480, Unknown=0, NotChecked=0, Total=11990 [2018-09-30 20:17:57,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-30 20:17:57,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-30 20:17:57,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-30 20:17:57,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2018-09-30 20:17:57,242 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 106 [2018-09-30 20:17:57,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:17:57,242 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2018-09-30 20:17:57,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-30 20:17:57,243 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2018-09-30 20:17:57,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-30 20:17:57,243 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:17:57,243 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 25, 1, 1, 1, 1] [2018-09-30 20:17:57,244 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:17:57,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:17:57,244 INFO L82 PathProgramCache]: Analyzing trace with hash 653870937, now seen corresponding path program 37 times [2018-09-30 20:17:57,244 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:17:57,244 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:17:57,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:17:57,245 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:17:57,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:17:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:17:57,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 650 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:17:57,997 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:17:57,997 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:17:58,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:17:58,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:17:58,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:17:58,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 650 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:17:58,122 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:17:58,122 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 29 [2018-09-30 20:17:58,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-30 20:17:58,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-30 20:17:58,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-09-30 20:17:58,123 INFO L87 Difference]: Start difference. First operand 109 states and 110 transitions. Second operand 30 states. [2018-09-30 20:17:58,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:17:58,945 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2018-09-30 20:17:58,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-30 20:17:58,947 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 108 [2018-09-30 20:17:58,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:17:58,948 INFO L225 Difference]: With dead ends: 113 [2018-09-30 20:17:58,948 INFO L226 Difference]: Without dead ends: 111 [2018-09-30 20:17:58,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-09-30 20:17:58,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-30 20:17:58,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-09-30 20:17:58,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-30 20:17:58,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-09-30 20:17:58,999 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 108 [2018-09-30 20:17:58,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:17:58,999 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-09-30 20:17:58,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-30 20:17:59,000 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-09-30 20:17:59,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-30 20:17:59,000 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:17:59,000 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 26, 26, 1, 1, 1, 1] [2018-09-30 20:17:59,000 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:17:59,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:17:59,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1304797587, now seen corresponding path program 38 times [2018-09-30 20:17:59,001 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:17:59,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:17:59,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:17:59,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:17:59,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:17:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:18:00,889 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:18:00,890 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:18:00,890 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:18:00,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:18:00,966 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:18:00,966 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:18:00,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:18:02,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:18:02,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:18:02,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:18:02,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 20:18:02,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:18:02,976 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:18:02,976 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 84 [2018-09-30 20:18:02,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-30 20:18:02,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-30 20:18:02,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=6890, Unknown=0, NotChecked=0, Total=7140 [2018-09-30 20:18:02,977 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 85 states. [2018-09-30 20:18:07,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:18:07,903 INFO L93 Difference]: Finished difference Result 169 states and 171 transitions. [2018-09-30 20:18:07,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-30 20:18:07,903 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 110 [2018-09-30 20:18:07,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:18:07,904 INFO L225 Difference]: With dead ends: 169 [2018-09-30 20:18:07,904 INFO L226 Difference]: Without dead ends: 113 [2018-09-30 20:18:07,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1494 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=529, Invalid=12353, Unknown=0, NotChecked=0, Total=12882 [2018-09-30 20:18:07,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-30 20:18:07,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-09-30 20:18:07,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-30 20:18:07,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 114 transitions. [2018-09-30 20:18:07,959 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 114 transitions. Word has length 110 [2018-09-30 20:18:07,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:18:07,959 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 114 transitions. [2018-09-30 20:18:07,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-30 20:18:07,959 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2018-09-30 20:18:07,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-30 20:18:07,960 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:18:07,960 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 26, 1, 1, 1, 1] [2018-09-30 20:18:07,960 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:18:07,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:18:07,960 INFO L82 PathProgramCache]: Analyzing trace with hash -738263347, now seen corresponding path program 39 times [2018-09-30 20:18:07,960 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:18:07,961 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:18:07,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:18:07,961 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:18:07,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:18:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:18:09,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 702 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:18:09,335 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:18:09,335 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:18:09,343 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:18:09,530 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 27 check-sat command(s) [2018-09-30 20:18:09,530 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:18:09,536 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:18:11,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:18:11,328 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:18:11,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:18:11,334 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 20:18:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-09-30 20:18:11,418 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:18:11,418 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29] total 58 [2018-09-30 20:18:11,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-30 20:18:11,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-30 20:18:11,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=492, Invalid=2814, Unknown=0, NotChecked=0, Total=3306 [2018-09-30 20:18:11,419 INFO L87 Difference]: Start difference. First operand 113 states and 114 transitions. Second operand 58 states. [2018-09-30 20:18:13,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:18:13,496 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2018-09-30 20:18:13,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-30 20:18:13,496 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 112 [2018-09-30 20:18:13,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:18:13,497 INFO L225 Difference]: With dead ends: 117 [2018-09-30 20:18:13,497 INFO L226 Difference]: Without dead ends: 115 [2018-09-30 20:18:13,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1538 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=1044, Invalid=6438, Unknown=0, NotChecked=0, Total=7482 [2018-09-30 20:18:13,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-30 20:18:13,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-09-30 20:18:13,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-30 20:18:13,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2018-09-30 20:18:13,560 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 112 [2018-09-30 20:18:13,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:18:13,561 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2018-09-30 20:18:13,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-30 20:18:13,561 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2018-09-30 20:18:13,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-30 20:18:13,561 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:18:13,561 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 27, 27, 1, 1, 1, 1] [2018-09-30 20:18:13,562 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:18:13,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:18:13,562 INFO L82 PathProgramCache]: Analyzing trace with hash -801420281, now seen corresponding path program 40 times [2018-09-30 20:18:13,562 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:18:13,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:18:13,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:18:13,563 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:18:13,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:18:13,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:18:15,526 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 1512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:18:15,527 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:18:15,527 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:18:15,533 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:18:15,577 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:18:15,577 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:18:15,581 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:18:17,445 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:18:17,446 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:18:17,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:18:17,450 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 20:18:17,545 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2018-09-30 20:18:17,566 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:18:17,566 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 30] total 86 [2018-09-30 20:18:17,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-30 20:18:17,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-30 20:18:17,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=7088, Unknown=0, NotChecked=0, Total=7310 [2018-09-30 20:18:17,567 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand 86 states. [2018-09-30 20:18:23,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:18:23,077 INFO L93 Difference]: Finished difference Result 179 states and 183 transitions. [2018-09-30 20:18:23,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-30 20:18:23,077 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 114 [2018-09-30 20:18:23,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:18:23,078 INFO L225 Difference]: With dead ends: 179 [2018-09-30 20:18:23,078 INFO L226 Difference]: Without dead ends: 119 [2018-09-30 20:18:23,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=494, Invalid=13312, Unknown=0, NotChecked=0, Total=13806 [2018-09-30 20:18:23,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-30 20:18:23,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-09-30 20:18:23,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-30 20:18:23,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-09-30 20:18:23,144 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2018-09-30 20:18:23,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:18:23,144 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-09-30 20:18:23,145 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-30 20:18:23,145 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-09-30 20:18:23,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-30 20:18:23,145 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:18:23,145 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 28, 28, 1, 1, 1, 1] [2018-09-30 20:18:23,146 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:18:23,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:18:23,146 INFO L82 PathProgramCache]: Analyzing trace with hash -2050868101, now seen corresponding path program 41 times [2018-09-30 20:18:23,146 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:18:23,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:18:23,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:18:23,147 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:18:23,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:18:23,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:18:25,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 0 proven. 1624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:18:25,163 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:18:25,163 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:18:25,171 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:18:25,485 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 29 check-sat command(s) [2018-09-30 20:18:25,485 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:18:25,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:18:28,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:18:28,959 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:18:28,965 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:18:28,966 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 20:18:29,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1624 backedges. 650 proven. 974 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:18:29,097 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:18:29,098 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 59] total 115 [2018-09-30 20:18:29,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-30 20:18:29,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-30 20:18:29,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1259, Invalid=12081, Unknown=0, NotChecked=0, Total=13340 [2018-09-30 20:18:29,100 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 116 states. [2018-09-30 20:18:37,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:18:37,248 INFO L93 Difference]: Finished difference Result 185 states and 189 transitions. [2018-09-30 20:18:37,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-30 20:18:37,248 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 118 [2018-09-30 20:18:37,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:18:37,249 INFO L225 Difference]: With dead ends: 185 [2018-09-30 20:18:37,249 INFO L226 Difference]: Without dead ends: 123 [2018-09-30 20:18:37,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5628 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=2539, Invalid=29681, Unknown=0, NotChecked=0, Total=32220 [2018-09-30 20:18:37,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-30 20:18:37,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-09-30 20:18:37,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-30 20:18:37,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-09-30 20:18:37,317 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 118 [2018-09-30 20:18:37,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:18:37,317 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-09-30 20:18:37,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-30 20:18:37,317 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-09-30 20:18:37,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-30 20:18:37,318 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:18:37,318 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 29, 29, 1, 1, 1, 1] [2018-09-30 20:18:37,318 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:18:37,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:18:37,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1042320657, now seen corresponding path program 42 times [2018-09-30 20:18:37,318 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:18:37,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:18:37,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:18:37,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:18:37,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:18:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:18:39,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 1740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:18:39,383 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:18:39,383 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:18:39,391 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:18:39,602 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 30 check-sat command(s) [2018-09-30 20:18:39,603 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:18:39,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:18:41,853 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:18:41,854 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:18:41,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:18:41,860 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 20:18:41,969 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 870 trivial. 0 not checked. [2018-09-30 20:18:41,990 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:18:41,991 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 32] total 92 [2018-09-30 20:18:41,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-30 20:18:41,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-30 20:18:41,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=238, Invalid=8134, Unknown=0, NotChecked=0, Total=8372 [2018-09-30 20:18:41,992 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 92 states. [2018-09-30 20:18:47,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:18:47,863 INFO L93 Difference]: Finished difference Result 191 states and 195 transitions. [2018-09-30 20:18:47,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-30 20:18:47,864 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 122 [2018-09-30 20:18:47,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:18:47,865 INFO L225 Difference]: With dead ends: 191 [2018-09-30 20:18:47,865 INFO L226 Difference]: Without dead ends: 127 [2018-09-30 20:18:47,866 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 646 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=528, Invalid=15222, Unknown=0, NotChecked=0, Total=15750 [2018-09-30 20:18:47,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-30 20:18:47,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-09-30 20:18:47,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-30 20:18:47,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2018-09-30 20:18:47,959 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 122 [2018-09-30 20:18:47,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:18:47,960 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2018-09-30 20:18:47,960 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-30 20:18:47,960 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2018-09-30 20:18:47,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-30 20:18:47,961 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:18:47,961 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 30, 30, 1, 1, 1, 1] [2018-09-30 20:18:47,961 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:18:47,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:18:47,961 INFO L82 PathProgramCache]: Analyzing trace with hash -2020085917, now seen corresponding path program 43 times [2018-09-30 20:18:47,962 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:18:47,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:18:47,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:18:47,962 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:18:47,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:18:47,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:18:50,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 1860 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:18:50,486 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:18:50,486 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:18:50,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:18:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:18:50,569 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:18:52,744 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:18:52,744 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:18:52,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:18:52,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 20:18:52,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 1860 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:18:52,880 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:18:52,880 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 63] total 96 [2018-09-30 20:18:52,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-30 20:18:52,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-30 20:18:52,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=9026, Unknown=0, NotChecked=0, Total=9312 [2018-09-30 20:18:52,882 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand 97 states. [2018-09-30 20:18:58,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:18:58,167 INFO L93 Difference]: Finished difference Result 193 states and 195 transitions. [2018-09-30 20:18:58,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-30 20:18:58,167 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 126 [2018-09-30 20:18:58,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:18:58,169 INFO L225 Difference]: With dead ends: 193 [2018-09-30 20:18:58,169 INFO L226 Difference]: Without dead ends: 129 [2018-09-30 20:18:58,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1962 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=605, Invalid=16165, Unknown=0, NotChecked=0, Total=16770 [2018-09-30 20:18:58,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-30 20:18:58,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-09-30 20:18:58,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-30 20:18:58,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-09-30 20:18:58,267 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 126 [2018-09-30 20:18:58,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:18:58,267 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-09-30 20:18:58,267 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-30 20:18:58,267 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-09-30 20:18:58,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-30 20:18:58,268 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:18:58,268 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 30, 1, 1, 1, 1] [2018-09-30 20:18:58,268 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:18:58,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:18:58,268 INFO L82 PathProgramCache]: Analyzing trace with hash 2012453021, now seen corresponding path program 44 times [2018-09-30 20:18:58,269 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:18:58,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:18:58,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:18:58,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:18:58,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:18:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:18:58,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 930 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:18:58,863 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:18:58,863 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:18:58,872 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:18:58,942 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:18:58,943 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:18:58,946 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:18:58,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1922 backedges. 930 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:18:59,008 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:18:59,009 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33] total 34 [2018-09-30 20:18:59,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-30 20:18:59,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-30 20:18:59,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-09-30 20:18:59,010 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 35 states. [2018-09-30 20:18:59,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:18:59,812 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2018-09-30 20:18:59,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-30 20:18:59,813 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 128 [2018-09-30 20:18:59,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:18:59,813 INFO L225 Difference]: With dead ends: 133 [2018-09-30 20:18:59,814 INFO L226 Difference]: Without dead ends: 131 [2018-09-30 20:18:59,814 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 960 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-09-30 20:18:59,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-30 20:18:59,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-30 20:18:59,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-30 20:18:59,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-09-30 20:18:59,886 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 128 [2018-09-30 20:18:59,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:18:59,886 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-09-30 20:18:59,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-30 20:18:59,887 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-09-30 20:18:59,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-30 20:18:59,887 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:18:59,888 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 31, 31, 1, 1, 1, 1] [2018-09-30 20:18:59,888 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:18:59,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:18:59,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1232122327, now seen corresponding path program 45 times [2018-09-30 20:18:59,888 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:18:59,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:18:59,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:18:59,889 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:18:59,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:18:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:02,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 1984 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:19:02,418 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:19:02,418 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:19:02,426 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-09-30 20:19:02,714 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 32 check-sat command(s) [2018-09-30 20:19:02,714 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:19:02,721 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:19:05,605 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:19:05,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:19:05,615 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:19:05,616 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 20:19:05,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 1984 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:19:05,749 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:19:05,749 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 65] total 99 [2018-09-30 20:19:05,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-30 20:19:05,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-30 20:19:05,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=9605, Unknown=0, NotChecked=0, Total=9900 [2018-09-30 20:19:05,750 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 100 states. [2018-09-30 20:19:11,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:11,596 INFO L93 Difference]: Finished difference Result 199 states and 201 transitions. [2018-09-30 20:19:11,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-30 20:19:11,596 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 130 [2018-09-30 20:19:11,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:11,597 INFO L225 Difference]: With dead ends: 199 [2018-09-30 20:19:11,597 INFO L226 Difference]: Without dead ends: 133 [2018-09-30 20:19:11,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2089 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=624, Invalid=17198, Unknown=0, NotChecked=0, Total=17822 [2018-09-30 20:19:11,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-30 20:19:11,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-09-30 20:19:11,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-30 20:19:11,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 134 transitions. [2018-09-30 20:19:11,676 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 134 transitions. Word has length 130 [2018-09-30 20:19:11,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:11,676 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 134 transitions. [2018-09-30 20:19:11,676 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-30 20:19:11,676 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2018-09-30 20:19:11,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-30 20:19:11,676 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:11,677 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 31, 1, 1, 1, 1] [2018-09-30 20:19:11,677 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:11,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:11,677 INFO L82 PathProgramCache]: Analyzing trace with hash -452907503, now seen corresponding path program 46 times [2018-09-30 20:19:11,677 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:11,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:11,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:11,678 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:19:11,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:12,587 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 992 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:19:12,587 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:19:12,587 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 48 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:19:12,594 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-09-30 20:19:12,646 INFO L242 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-09-30 20:19:12,646 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:19:12,650 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:19:13,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:19:13,734 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:19:13,739 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:19:13,739 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 20:19:13,821 INFO L134 CoverageAnalysis]: Checked inductivity of 2048 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 1056 trivial. 0 not checked. [2018-09-30 20:19:13,843 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:19:13,844 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34] total 68 [2018-09-30 20:19:13,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-30 20:19:13,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-30 20:19:13,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=662, Invalid=3894, Unknown=0, NotChecked=0, Total=4556 [2018-09-30 20:19:13,845 INFO L87 Difference]: Start difference. First operand 133 states and 134 transitions. Second operand 68 states. [2018-09-30 20:19:16,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:16,873 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2018-09-30 20:19:16,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-30 20:19:16,873 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 132 [2018-09-30 20:19:16,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:16,874 INFO L225 Difference]: With dead ends: 137 [2018-09-30 20:19:16,874 INFO L226 Difference]: Without dead ends: 135 [2018-09-30 20:19:16,875 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2143 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1394, Invalid=8908, Unknown=0, NotChecked=0, Total=10302 [2018-09-30 20:19:16,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-30 20:19:16,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-09-30 20:19:16,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-30 20:19:16,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-09-30 20:19:16,975 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 132 [2018-09-30 20:19:16,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:16,975 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-09-30 20:19:16,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-30 20:19:16,975 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-09-30 20:19:16,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-30 20:19:16,976 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:16,976 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 32, 32, 1, 1, 1, 1] [2018-09-30 20:19:16,976 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:16,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:16,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1452361141, now seen corresponding path program 47 times [2018-09-30 20:19:16,977 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:16,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:16,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:16,977 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:19:16,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:19,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 2112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:19:19,972 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:19:19,972 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:19:19,980 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-09-30 20:19:20,476 INFO L242 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2018-09-30 20:19:20,477 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:19:20,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:19:25,299 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:19:25,299 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:19:25,305 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:19:25,306 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:16 [2018-09-30 20:19:25,429 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 870 proven. 1242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:19:25,450 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:19:25,451 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67] total 131 [2018-09-30 20:19:25,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-30 20:19:25,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-30 20:19:25,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1629, Invalid=15663, Unknown=0, NotChecked=0, Total=17292 [2018-09-30 20:19:25,453 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 132 states. [2018-09-30 20:19:31,054 WARN L178 SmtUtils]: Spent 529.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-09-30 20:19:35,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:35,718 INFO L93 Difference]: Finished difference Result 209 states and 213 transitions. [2018-09-30 20:19:35,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-30 20:19:35,719 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 134 [2018-09-30 20:19:35,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:35,720 INFO L225 Difference]: With dead ends: 209 [2018-09-30 20:19:35,720 INFO L226 Difference]: Without dead ends: 139 [2018-09-30 20:19:35,722 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7266 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=3213, Invalid=38199, Unknown=0, NotChecked=0, Total=41412 [2018-09-30 20:19:35,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-30 20:19:35,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-09-30 20:19:35,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-30 20:19:35,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2018-09-30 20:19:35,800 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 134 [2018-09-30 20:19:35,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:35,800 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2018-09-30 20:19:35,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-30 20:19:35,800 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2018-09-30 20:19:35,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-30 20:19:35,801 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:35,801 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 33, 33, 1, 1, 1, 1] [2018-09-30 20:19:35,801 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:35,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:35,802 INFO L82 PathProgramCache]: Analyzing trace with hash 957810879, now seen corresponding path program 48 times [2018-09-30 20:19:35,802 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:35,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:35,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:35,803 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:19:35,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:38,797 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 2244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:19:38,798 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:19:38,798 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:19:38,806 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-09-30 20:19:39,112 INFO L242 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 34 check-sat command(s) [2018-09-30 20:19:39,112 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:19:39,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:19:42,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-09-30 20:19:42,165 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-09-30 20:19:42,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-09-30 20:19:42,170 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-09-30 20:19:42,291 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 2244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:19:42,312 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:19:42,312 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 69] total 105 [2018-09-30 20:19:42,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-30 20:19:42,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-30 20:19:42,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=10817, Unknown=0, NotChecked=0, Total=11130 [2018-09-30 20:19:42,313 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand 106 states. [2018-09-30 20:19:48,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:48,911 INFO L93 Difference]: Finished difference Result 211 states and 213 transitions. [2018-09-30 20:19:48,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-30 20:19:48,912 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 138 [2018-09-30 20:19:48,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:48,913 INFO L225 Difference]: With dead ends: 211 [2018-09-30 20:19:48,913 INFO L226 Difference]: Without dead ends: 141 [2018-09-30 20:19:48,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2355 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=662, Invalid=19360, Unknown=0, NotChecked=0, Total=20022 [2018-09-30 20:19:48,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-30 20:19:48,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-09-30 20:19:48,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-30 20:19:48,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-09-30 20:19:48,999 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 138 [2018-09-30 20:19:48,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:48,999 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-09-30 20:19:48,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-30 20:19:49,000 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-09-30 20:19:49,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-30 20:19:49,000 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:49,000 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 33, 1, 1, 1, 1] [2018-09-30 20:19:49,000 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:49,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:49,001 INFO L82 PathProgramCache]: Analyzing trace with hash 32287481, now seen corresponding path program 49 times [2018-09-30 20:19:49,001 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:49,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:49,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:49,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-09-30 20:19:49,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:50,283 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1122 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:19:50,284 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:19:50,284 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:19:50,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:50,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:50,367 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-09-30 20:19:50,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2312 backedges. 1122 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:19:50,428 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-09-30 20:19:50,429 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36] total 37 [2018-09-30 20:19:50,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-30 20:19:50,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-30 20:19:50,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-09-30 20:19:50,430 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 38 states. [2018-09-30 20:19:51,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-30 20:19:51,196 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2018-09-30 20:19:51,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-30 20:19:51,196 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 140 [2018-09-30 20:19:51,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-30 20:19:51,197 INFO L225 Difference]: With dead ends: 145 [2018-09-30 20:19:51,197 INFO L226 Difference]: Without dead ends: 143 [2018-09-30 20:19:51,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1155 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-09-30 20:19:51,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-30 20:19:51,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-09-30 20:19:51,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-30 20:19:51,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2018-09-30 20:19:51,284 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 140 [2018-09-30 20:19:51,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-30 20:19:51,284 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2018-09-30 20:19:51,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-30 20:19:51,284 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2018-09-30 20:19:51,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-30 20:19:51,285 INFO L367 BasicCegarLoop]: Found error trace [2018-09-30 20:19:51,285 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 34, 34, 1, 1, 1, 1] [2018-09-30 20:19:51,286 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-30 20:19:51,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-30 20:19:51,286 INFO L82 PathProgramCache]: Analyzing trace with hash 963550515, now seen corresponding path program 50 times [2018-09-30 20:19:51,286 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-09-30 20:19:51,286 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-09-30 20:19:51,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:51,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-09-30 20:19:51,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-09-30 20:19:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-30 20:19:54,285 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-30 20:19:54,285 INFO L301 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-09-30 20:19:54,285 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 52 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:19:54,292 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-09-30 20:19:54,386 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-09-30 20:19:54,386 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-09-30 20:19:54,391 INFO L273 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2018-09-30 20:19:57,239 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2018-09-30 20:19:57,439 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 52 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-09-30 20:19:57,440 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-30 20:19:57,446 WARN L206 ceAbstractionStarter]: Timeout [2018-09-30 20:19:57,446 INFO L202 PluginConnector]: Adding new model invert_string.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.09 08:19:57 BoogieIcfgContainer [2018-09-30 20:19:57,446 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-30 20:19:57,447 INFO L168 Benchmark]: Toolchain (without parser) took 239579.09 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: -717.6 MB). Peak memory consumption was 948.0 MB. Max. memory is 7.1 GB. [2018-09-30 20:19:57,448 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-09-30 20:19:57,448 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.31 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-09-30 20:19:57,448 INFO L168 Benchmark]: Boogie Preprocessor took 26.71 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-09-30 20:19:57,449 INFO L168 Benchmark]: RCFGBuilder took 385.49 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-09-30 20:19:57,449 INFO L168 Benchmark]: TraceAbstraction took 239108.15 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -738.8 MB). Peak memory consumption was 926.9 MB. Max. memory is 7.1 GB. [2018-09-30 20:19:57,451 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 47.31 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 26.71 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 385.49 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 239108.15 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -738.8 MB). Peak memory consumption was 926.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 80]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 80). Cancelled while BasicCegarLoop was analyzing trace of length 143 with TraceHistMax 35, while TraceCheckSpWp was constructing forward predicates, while PredicateComparison was comparing new predicate (quantifier-free) to 105 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. TIMEOUT Result, 239.0s OverallTime, 52 OverallIterations, 35 TraceHistogramMax, 120.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1722 SDtfs, 5023 SDslu, 73288 SDs, 0 SdLazy, 78215 SolverSat, 5532 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 52.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6567 GetRequests, 3002 SyntacticMatches, 23 SemanticMatches, 3542 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50004 ImplicationChecksByTransitivity, 152.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 51 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 4.7s SatisfiabilityAnalysisTime, 102.9s InterpolantComputationTime, 7282 NumberOfCodeBlocks, 7129 NumberOfCodeBlocksAsserted, 526 NumberOfCheckSat, 7181 ConstructedInterpolants, 0 QuantifiedInterpolants, 3846605 SizeOfPredicates, 290 NumberOfNonLiveVariables, 12240 ConjunctsInSsa, 3618 ConjunctsInUnsatCore, 101 InterpolantComputations, 1 PerfectInterpolantSequences, 18946/79144 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/invert_string.i_4.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-30_20-19-57-459.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/invert_string.i_4.bpl_svcomp-Reach-32bit-Automizer_Default.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-30_20-19-57-459.csv Completed graceful shutdown